The present invention relates to Real-Time Transport Protocol (RTP) and more particularly to an RTP wire format for streaming media (e.g. audio-video) over a network, such as the Internet.
The following discussion assumes that the reader is familiar with the IETF RFC 1889 standard—RTP: A Transport Protocol for Real-Time Applications and with the IETF RFC 1890 standard—RTP Profile for Audio and Video Conferences with Minimal Control.
Real-time transport protocol (RTP), as defined in the RFC 1889 standard, provides end-to-end network transport functions suitable for applications transmitting real-time data, such as audio, video or simulation data, over multicast or unicast network services. These transport functions provide end-to-end delivery services for data with real-time characteristics, such as interactive audio and video. Such services include payload type identification, sequence numbering, time stamping and delivery monitoring. RTP supports data transfer to multiple destinations using multicast distribution if provided by the underlying network.
The RFC 1889 standard does not provide any mechanism to ensure timely delivery or provide other quality-of-service guarantees, but relies on lower-layer services to do so. It does not guarantee delivery or prevent out-of-order delivery, nor does it assume that the underlying network is reliable and delivers packets in sequence. The sequence numbers included in RTP allow the receiver to reconstruct the sender's packet sequence, but sequence numbers might also be used to determine the proper location of a packet, for example in video decoding, without necessarily decoding packets in sequence.
A typical application of RTP involves streaming data, where packets of Advanced Systems Format (ASF) audio-visual (AV) data is sent in RTP packets over a network from a server to a client or peer-to-peer. The ASF audio and video data can be stored together in one ASF packet. As such, an RTP packet can contain both audio and video data.
RTP, as defined the RFC 1889 standard, lacks flexibility to group multiple payloads together into a single RTP packet, and to split a payload across multiple RTP packets. Neither does the RFC 1889 standard define a format in which metadata can be delivered with each payload in an RTP packet. Another deficiency of the RFC 1889 standard is the lack of a mechanism for streaming encrypted blocks of data across a network while maintaining a block boundary of each encrypted block such that the recipient thereof can decrypt the encrypted blocks of data. In would be an advance in the art to provide such flexibility as an enhancement to RTP streaming. Consequently, there is a need for improved methods, computer-readable medium, data structures, apparatus, and computing devices that can provide such flexibility.
In one implementation, packets of Advanced Systems Format (ASF) audio-visual (AV) data are repacketized into Real-Time Transport Protocol (RTP) packets and sent over a network from a server to client or by peer-to-peer network communications in response to a request to stream the AV data. The AV data is encrypted to form encryption units. The repacketizing process includes packetizing the encryption units into the RTP packets each of which includes an RTP packet header, one or more payloads of a common data stream, and a RTP payload format (PF) header for each payload. The RTP PF header includes, for the corresponding encryption units, a boundary for the payload. The payload in the RTP packet can be one or more encryption units or a fragment of an encryption unit. After the RTP packets are sent over a network, the encryption units contained in the received RTP packets are reassembled. The reassembly process uses the payloads in the RTP packets and the respective boundary in the respective RTP PF header. The reassembled encryption units can be decrypted for rendering. Each RTP PF header can have attributes for its corresponding payload that can be used to render the payload.
In a variation on the foregoing implementation, data in a format other than ASF is used to form the RTP packets. In a still further variation on the foregoing implementation, the RTP packets are formed so as to contain payloads that are not encrypted.
In yet another implementation, a wire format is provided for streaming encrypted blocks of data protected with Windows® Media Digital Rights Management (WM DRM) across a network in RTP packets (e.g., streaming WM DRM protected content). Each RTP packet contains header data to maintain encryption block boundaries so that each encryption unit can be decrypted by the recipient thereof. Upon decryption using the WM DRM protocol, the streaming data can be rendered by the recipient.
a-3b are respective data structure layouts, in accordance with an embodiment of the present invention, for an RTP header and a corresponding payload header.
Implementations disclosed herein define wire formats for delivery of single and mixed data streams, such as Windows® media data via Real-Time Transport Protocol (RTP). The delivery can be between server and client, as well as in a peer to peer context (e.g., a Windows® Messenger™ audio-visual conference software environment).
A wire format, in various implementations, enhances the IETF RFC 1889 standard to provide greater flexibility for RTP delivery. Implementations provide a mechanism for streaming of audio data in RTP packets that are separate from video data in RTP packets. Implementations also provide a wire format in which metadata can be delivered with each payload in an RTP packet, where the metadata provides rich information that is descriptive of the payload. Still other implementations provide a mechanism for streaming encrypted blocks of data across a network while maintaining a block boundary of each encrypted block such that the recipient thereof can decrypt the encrypted blocks of data. In another implementation, a wire format provides for delivery of data that is protected with Windows® Media Digital Rights Management (WM DRM) such that the delivery thereof can be unencrypted for rendering.
Various implementations disclosed herein repackage data in a series of media packets that are included in a system layer bit stream. These data are packetized into RTP packets consistent with, yet enhancing, the RFC 1889 standard such that the system layer bit stream is mapped to RTP. In this mapping, each media packet contains one or more payloads. In some system layer bit streams, there may be mixed media packets having data such as audio data, video data, program data, JPEG Data, HTML data, MIDI data, etc. A mixed media packet is a media packet where two or more of its payloads belong to different media streams.
Various implementations apply to system layer bit streams where each media packet is a single media packet. In a single media packet, all of the payloads in the media packet belong to the same media stream. Other implementations apply to system layer bit streams where each media packet always contains only one (1) payload. In still further implementations, the size of the “payload header” in the media packet is zero—which is likely if each media packet only contains a single payload, but could also happen when there are multiple payloads where the media packet header contains information about the size of each payload.
ASF Steaming Audio-Visual (AV) data 100 is depicted in
The ASF Streaming AV data 100 as expressed in ASF packet A 106 and ASF packet B 108, in one implementation, can be packetized into a plurality of RTP packets. As seen in
Following the RTP packetization depicted in
ASF Steaming AV data 200 is depicted in
In the first alternative, following arrow 250, video data A 204 and video data B 206 are packetized into a single RTP packet alternative A 212 having an RTP header. Each of video data A 204 and video data B 206 is preceded by an RTP PF header. RTP packet alternative A 212, in accordance with the RFC 1889 standard, has an RTP header, multiple payloads, and respective RTP PF headers.
In the second alternative, also following arrow 250, video data A 204 and video data B 206, from respective ASF packets, are packetized into an RTP packet alternative B 214 having an RTP header. Video data A 204 and video data B 206 are assembled contiguously as the payload in RTP packet alternative B 214. The payload is preceded by an RTP PF header. RTP packet alternative B 214, in accordance with the RFC 1889 standard, has an RTP header, a payload, and one RTP PF header.
Following the RTP packetization depicted in
a depicts a data structure layout for fields in an RTP header. The RTP header is more fully described in the RFC 1889 standard. The timestamp field in the RTP header should be set to the presentation time of the sample contained in the RTP packet. In one implementation, the clock frequency is 1 kHz unless specified to be different through means independent of RTP.
The 8th bit from the start of the RTP header is interpreted as a marker (M) bit field. The M bit is set to zero, but will be set to one (“1”) whenever the corresponding RTP packet has payload that is not a fragment of a sample, contains the final fragment of a sample, or is one of a plurality of complete samples in the RTP packet. The M bit can be used by a receiver to detect the receipt of a complete sample for decoding and presenting. Thus, the M bit in the RTP header can be used to mark significant events in a packet stream (e.g., video sample frame boundaries).
b depicts one implementation of an RTP payload format (PF) Header or payload header. The RTP PF header has a sixteen (16) bit fixed length portion followed by a variable length portion. The fields of the RTP PF header depicted in
The S field is one (1) bit in length and is set to one (“1”) if the corresponding payload (e.g., sample, fragment of a sample, or combination of samples) is a key sample, i.e. intracoded sample or I-Frame. Otherwise it is set to zero. The S-bit in all RTP PF headers preceding fragments of the same sample must be set to the same value.
The G field is one (1) bit in length and is used to group sub-samples in a corresponding payload that make up a single sample. Windows® Media Digital Rights Management (WM DRM) encrypts content based on the “ASF Payload” boundaries. In order to allow this content to be correctly decrypted, the boundaries of the sub-samples in the payload can be communicated to the client that is to receive the payload. For instance, an encryption unit can be packetized such that it is broken into a plurality of transmission units (e.g., placed within separate packets) that are to be transmitted. Before the broken plurality of transmission units can be decrypted at a receiving client they have to be reassembled into the original encrypted form. As in other decryption methodologies and mechanisms, the client can use the boundaries to properly reconstruct the encrypted encryption units in preparation for decryption of the encrypted content. As such, each “ASF Payload” should be preceded by this RTP PF header.
The G field bit should be set to zero (“0”) to indicate that an encrypted “unit” has been fragmented. If ASF is being used, the encryption unit will be an ASF payload and the bit is set to zero (“0”) on all fragmented ASF payloads, except the last ASF payload. In this case, whether or not a sample has been fragmented does not matter. If ASF is not being used the encryption unit is a media sample, in which case the G bit is set to zero (“0”) on all fragmented media samples except the last sample. As to this latter case, the concern about whether or not an ASF payload has been fragmented is not applicable, since ASF is not used.
The L field is one (1) bit in length and is set to one (“1”) if the Length/Offset field contains a length. Otherwise it is set to zero (“0”) and the Length/Offset field contains an offset. The L-bit must be set to one (“1”) in all RTP PF headers preceding a complete (unfragmented) sample in the corresponding payload and must be set to zero in all RTP PF headers that precede a payload containing a fragmented sample.
The R field is one (1) bit in length and is set to one (“1”) if the RTP PF header contains a relative timestamp. Otherwise it is set to zero. The R-bit in all headers preceding fragments of the same sample must be set to the same value.
The T field is one (1) bit in length and is set to one (“1”) if the RTP PF header contains a decompression time. Otherwise it is set to zero. The T-bit in all RTP PF headers that precede a payload that contains a fragment of the same sample must be set to the same value.
The D field is one (1) bit in length and is set to one (“1”) if the RTP PF header contains a sample duration. Otherwise it is set to zero. The D-bit in all RTP PF headers that precede a payload containing fragments of the same sample must be set to the same value.
The X field is one (1) bit in length and is for optional or unspecified use. A transmitter of an RTP packet should set this bit to zero and a receiver thereof can ignore this bit.
The Z field is one (1) bit in length and is set to one (“1”) if the RTP PF header contains Payload Extension (P.E.) data, which can be metadata regarding the corresponding payload. Otherwise the Z field is set to zero. The Z field bit could be zero for all RTP PF headers whose M-bit is zero, but it should be set for all RTP PF headers whose M-bit is set to one (“1”) if the corresponding payload has P.E. data associated with it.
The Length/Offset field is twenty four (24) bits in length and quantifies the length or offset of a single sample that has been fragmented over multiple RTP packets. The L-bit is set to zero and the Length/Offset field contains the byte offset of the first byte of this fragment from the beginning of the corresponding payload (e.g., sample or fragment thereof). If one or more complete samples are contained in the RTP packet, the L-bit is set to one (“1”) in each RTP PF header, and the Sample Length/Offset field contains the length of the sample (including the RTP PF header).
The Relative Timestamp field is thirty-two (32) bits in length and is present only if the R-bit is set to one (“1”). It contains the relative timestamp for the corresponding sample with respect to the timestamp in the corresponding RTP header. The timescale used is the same as that used for the timestamp in the RTP header. The Relative Timestamp field is specified as a signed 32-bit number to allow for negative offsets from the timestamp of the RTP header. When the Relative Timestamp field is absent, a default relative timestamp of zero can be used.
The Decompression Time is thirty-two (32) bits in length and is present only if the T-bit is set to one (“1”). It contains the decompression time relative to the timestamp in the RTP header. The timescale used is the same as that used for the timestamp in the RTP header. This field is specified as a signed 32-bit number to allow for negative offsets from the timestamp in the RTP header.
The Duration field is thirty-two (32) bits in length and is present only if the D-bit is set to one (“1”). It contains the duration of the corresponding sample. The timescale used is the same as that used for the timestamp in the RTP header. The Duration field, in all RTP PF headers preceding fragments of the same sample, should be set to the same value. When this field is absent, the default duration is implicitly or explicitly obtained from the sample data. If this is not practical, the default is the difference between this sample's timestamp and the next sample's timestamp.
The Payload Extension (P.E.) Data Length field is sixteen (16) bits in length and is present only if the Z-bit is set to one (“1”). It contains the number of bytes of P.E. data contained after the fixed part of the RTP PF header. The P.E. data is variable in length and contain one of more attributes descriptive of the corresponding payload that it precedes. The P.E. data length field immediately follows the fixed part of the payload header and will be a number of bytes that contain the actual P.E. data. The structure of the P.E. data is communicated between the client and server (or peer to peer), such as via an SDP description. In one implementation for WM DRM protected content, there can be at least 4 bytes of DUE data representing the WM DRM payload ID associated with every sample.
While
General Network Structure
Multimedia servers/clients 402/404 have access to streaming media content in the form of different media streams. These media streams can be individual media streams (e.g., audio, video, graphical, simulation, etc.), or alternatively composite media streams including multiple such individual streams. Some media streams might be stored as files 408 in a database (e.g., ASF files) or other file storage system, while other media streams 410 might be supplied to the multimedia server 402 or client 404 on a “live” basis from other data source components through dedicated communications channels or through the Internet itself.
The media streams received from servers 402 or from clients 404 are rendered at the client 404 as a multimedia presentation, which can include media streams from one or more of the servers/clients 402/404. These different media streams can include one or more of the same or different types of media streams. For example, a multimedia presentation may include two video streams, one audio stream, and one stream of graphical images. A user interface (UI) at the client 404 can allows users various controls, such as allowing a user to either increase or decrease the speed at which the media presentation is rendered.
Exemplary Computer Environment
In the discussion below, the invention will be described in the general context of computer-executable instructions, such as program modules, being executed by one or more conventional personal computers. Generally, program modules include routines, programs, objects, components, data structures, etc. perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the invention may be practiced with other computer system configurations, including hand-held devices, multiprocessor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, and the like. In a distributed computer environment, program modules may be located in both local and remote memory storage devices. Alternatively, the invention could be implemented in hardware or a combination of hardware, software, and/or firmware. For example, one or more application specific integrated circuits (ASICs) could be programmed to carry out the invention.
As shown in
Subsequently, the client requests the corresponding AV data stream from the server/client. The server/client retrieves and transmits to the client the corresponding AV stream that the server/client had previously stored. Upon receipt, the client decodes the AV data stream, and reconstructs and decrypts encrypted broken up AV data stream samples using boundaries communicated in the corresponding RTP PF headers. The client can then perform rendering of the streamed AV data.
The flow of data in seen in
At block 508, client 404 makes a request for the A/V data stream that is transmitted to server/client 402/404 as seen at arrow 510 in
A bandwidth of the network over which RTP packets are to be transmitted is determined. This determination is used to derive a predetermined RTP packet size. Where the ASF packet size is smaller than the predetermined RTP packet size, like-kind payloads can be combined into a single RTP packet. Where the ASF packet size is bigger than the predetermined RTP packet size, ASF payloads can be fragmented for placement as a payload into a single RTP packet. Boundaries for each RTP payload are determined using the corresponding logically separate audio and video payloads of the ASF packets.
At step 516, the RTP header, RTP PF header, and respective payload are assembled for each RTP packet. As such, a plurality of RTP packets have been formed that represent a plurality of ASF packets, where the ASF packets contain the A/V data stream that was requested by client 404. The RTP packets are streamed for rendering at client 404 from server/client 402/404 via a transmission function at block 518.
An arrow 520 in
At block 528, the reconstructed ASF packets are decrypted for rendering at block 530. The RTP PF header in an RTP packet may contain Payload Extension (P.E.) data that is descriptive of the corresponding payload. The P.E. data can thus provide metadata that can be used during a rendering of the payload in the corresponding RTP packet at block 530. The blocks 522-530 are repeated for each RTP packet that is received at client 404, thereby accomplishing the streaming of the A/V data from server/client 402/404 for rendering.
The bus 648 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. The system memory includes read only memory (ROM) 650 and random access memory (RAM) 652. A cache 675 have levels L1, L2, and L3 may be included in RAM 652. A basic input/output system (BIOS) 654, containing the basic routines that help to transfer information between elements within computer 642, such as during start-up, is stored in ROM 650. Computer 642 further includes a hard disk drive 656 for reading from and writing to a hard disk (not shown) a magnetic disk drive 658 for reading from and writing to a removable magnetic disk 660, and an optical disk drive 662 for reading from or writing to a removable optical disk 664 such as a CD ROM or other optical media.
Any of the hard disk (not shown), magnetic disk drive 658, optical disk drive 662, or removable optical disk 664 can be an information medium having recorded information thereon. The information medium has a data area for recording stream data using stream packets each of which includes a packet area containing one or more data packets. By way of example, each data packet is encoded and decoded by a Codec of application programs 672 executing in processing unit 644. As such, the encoder distributes the stream data to the data packet areas in the stream packets so that the distributed stream data are recorded in the data packet areas using an encoding algorithm. Alternatively, encoding and decoding of data packets can be performed as a function of operating system 670 executing on processing unit 644.
The hard disk drive 656, magnetic disk drive 658, and optical disk drive 662 are connected to the system bus 648 by an SCSI interface 666 or some other appropriate interface. The drives and their associated computer-readable media provide nonvolatile storage of computer readable instructions, data structures, program modules and other data for computer 642. Although the exemplary environment described herein employs a hard disk, a removable magnetic disk 660 and a removable optical disk 664, it should be appreciated by those skilled in the art that other types of computer readable media which can store data that is accessible by a computer, such as magnetic cassettes, flash memory cards, digital video disks, random access memories (RAMs) read only memories (ROM), and the like, may also be used in the exemplary operating environment.
A number of program modules may be stored on the hard disk, magnetic disk 660, optical disk 664, ROM 650, or RAM 652, including an operating system 670, one or more application programs 672 (which may include the Codec), other program modules 674, and program data 676. A user may enter commands and information into computer 642 through input devices such as keyboard 678 and pointing device 680. Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and other input devices are connected to the processing unit 644 through an interface 682 that is coupled to the system bus. A monitor 684 or other type of display device is also connected to the system bus 648 via an interface, such as a video adapter 686. In addition to the monitor, personal computers typically include other peripheral output devices (not shown) such as speakers and printers.
Computer 642 operates in a networked environment using logical connections to one or more remote computers, such as a remote computer 688. The remote computer 688 may be another personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to computer 642, although only a memory storage device 690 has been illustrated in
When used in a LAN networking environment, computer 642 is connected to the local network 692 through a network interface or adapter 696. When used in a WAN networking environment, computer 642 typically includes a modem 698 or other means for establishing communications over the wide area network 694, such as the Internet. The modem 698, which may be internal or external, is connected to the system bus 648 via a serial port interface 668. In a networked environment, program modules depicted relative to the personal computer 642, or portions thereof, may be stored in the remote memory storage device. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.
Generally, the data processors of computer 642 are programmed by means of instructions stored at different times in the various computer-readable storage media of the computer. Programs and operating systems are typically distributed, for example, on floppy disks or CD-ROMs. From there, they are installed or loaded into the secondary memory of a computer. At execution, they are loaded at least partially into the computer's primary electronic memory. The invention described herein includes these and other various types of computer-readable storage media when such media contain instructions or programs for implementing the steps described below in conjunction with a microprocessor or other data processor. The invention also includes the computer itself when programmed according to the methods and techniques described below. Furthermore, certain sub-components of the computer may be programmed to perform the functions and steps described below. The invention includes such sub-components when they are programmed as described. In addition, the invention described herein includes data structures, described below, as embodied on various types of memory media.
For purposes of illustration, programs and other executable program components such as the operating system are illustrated herein as discrete blocks, although it is recognized that such programs and components reside at various times in different storage components of the computer, and are executed by the data processor(s) of the computer.
Implementations disclosed herein define a wire format that can be used in delivery of multimedia data between server and client and peer to peer via RTP. The wire format allows for greater flexibility than the currently adopted IETF RFC 1889 standards for RTP delivery. Implementations of the wire format provide for streaming of encrypted data, provide a mechanism for delivering per sample metadata via RTP, and provide for streaming of data that is protected with WM DRM.
Although the invention has been described in language specific to structural features and/or methodological acts, it is to be understood that the invention defined in the appended claims is not necessarily limited to the specific features or acts described. Rather, the specific features and acts are disclosed as exemplary forms of implementing the claimed invention.
This divisional application claims priority to commonly assigned co-pending U.S. patent application Ser. No. 10/612,851, U.S. Patent Publication No. 2005-0002525-A1, U.S. Pat. No. 7,483,532 to be issued on Jan. 27, 2009, entitled “RTP Payload Format” for James M. Alkove and Anders E. Klemets, filed on Jul. 3, 2003, which are incorporated by reference herein for all that it teaches and discloses.
Number | Name | Date | Kind |
---|---|---|---|
5224166 | Hartman, Jr. | Jun 1993 | A |
6134243 | Jones et al. | Oct 2000 | A |
6205140 | Putzolu et al. | Mar 2001 | B1 |
6278478 | Ferriere | Aug 2001 | B1 |
6456967 | Yeom | Sep 2002 | B1 |
6512778 | Jones et al. | Jan 2003 | B1 |
6654389 | Brunheroto et al. | Nov 2003 | B1 |
6700895 | Kroll | Mar 2004 | B1 |
6856997 | Lee et al. | Feb 2005 | B2 |
6918034 | Sengodan et al. | Jul 2005 | B1 |
6944296 | Liu et al. | Sep 2005 | B1 |
6965646 | Firestone | Nov 2005 | B1 |
6983049 | Wee et al. | Jan 2006 | B2 |
6993137 | Fransdonk | Jan 2006 | B2 |
7010032 | Kikuchi et al. | Mar 2006 | B1 |
7080043 | Chase, Jr. et al. | Jul 2006 | B2 |
7120250 | Candelore | Oct 2006 | B2 |
7136577 | Falco | Nov 2006 | B1 |
7136945 | Gibbs et al. | Nov 2006 | B2 |
7145919 | Krishnarajah et al. | Dec 2006 | B2 |
7174452 | Carr | Feb 2007 | B2 |
7243366 | Medvinsky et al. | Jul 2007 | B2 |
7257641 | VanBuskirk et al. | Aug 2007 | B1 |
7325139 | Ishiguro et al. | Jan 2008 | B2 |
7346160 | Michaelsen | Mar 2008 | B2 |
7536418 | Buchsbaum et al. | May 2009 | B2 |
20010052135 | Balakrishnan et al. | Dec 2001 | A1 |
20020002674 | Grimes et al. | Jan 2002 | A1 |
20020004773 | Xu et al. | Jan 2002 | A1 |
20030041257 | Wee et al. | Feb 2003 | A1 |
20030056118 | Troyansky et al. | Mar 2003 | A1 |
20030081592 | Krishnarajah et al. | May 2003 | A1 |
20030103243 | Watanabe et al. | Jun 2003 | A1 |
20030131353 | Blom et al. | Jul 2003 | A1 |
20030161473 | Fransdonk | Aug 2003 | A1 |
20040042451 | Takaku | Mar 2004 | A1 |
20040125757 | Mela et al. | Jul 2004 | A1 |
20040125791 | Hoffmann | Jul 2004 | A1 |
20040143736 | Cross et al. | Jul 2004 | A1 |
20040249759 | Higashi et al. | Dec 2004 | A1 |
20050002402 | Fairman | Jan 2005 | A1 |
20050002525 | Alkove et al. | Jan 2005 | A1 |
20050008240 | Banerji et al. | Jan 2005 | A1 |
20050069039 | Crinon | Mar 2005 | A1 |
20050099869 | Crinon et al. | May 2005 | A1 |
20050108746 | Futagami et al. | May 2005 | A1 |
20050144470 | Takashima et al. | Jun 2005 | A1 |
20050157727 | Date et al. | Jul 2005 | A1 |
20050163052 | Savage et al. | Jul 2005 | A1 |
20050169303 | Toma et al. | Aug 2005 | A1 |
20050169444 | Inon | Aug 2005 | A1 |
20050177875 | Kamperman et al. | Aug 2005 | A1 |
20050216413 | Murakami | Sep 2005 | A1 |
20050254526 | Wang et al. | Nov 2005 | A1 |
20050265555 | Pippuri | Dec 2005 | A1 |
20060104356 | Crinon | May 2006 | A1 |
20060130104 | Budagavi | Jun 2006 | A1 |
20060161635 | Lamkin et al. | Jul 2006 | A1 |
20060167985 | Albanese et al. | Jul 2006 | A1 |
20060184790 | Oliveira et al. | Aug 2006 | A1 |
20060262732 | Joutsenvirta et al. | Nov 2006 | A1 |
20060268099 | Potrebic et al. | Nov 2006 | A1 |
20060291475 | Cohen | Dec 2006 | A1 |
20070003064 | Wiseman et al. | Jan 2007 | A1 |
20070016594 | Visharam et al. | Jan 2007 | A1 |
20070016784 | Vauclair | Jan 2007 | A1 |
20070104105 | MeLampy et al. | May 2007 | A1 |
20070106814 | Son et al. | May 2007 | A1 |
20070171903 | Zeng et al. | Jul 2007 | A1 |
20070248073 | Pattavina et al. | Oct 2007 | A1 |
20070274393 | Toma et al. | Nov 2007 | A1 |
20080052751 | Cromarty et al. | Feb 2008 | A1 |
20080075168 | Toma et al. | Mar 2008 | A1 |
20080126812 | Ahmed et al. | May 2008 | A1 |
20080187284 | Ikeda et al. | Aug 2008 | A1 |
20080216116 | Pekonen et al. | Sep 2008 | A1 |
Number | Date | Country |
---|---|---|
1498479 | May 2004 | CN |
1643474 | Jul 2005 | CN |
1041823 | Oct 2000 | EP |
1041823 | Oct 2000 | EP |
1271830 | Jan 2003 | EP |
1494425 | Jan 2005 | EP |
2000287192 | Oct 2000 | JP |
2002044135 | Feb 2002 | JP |
2144736 | Jan 2000 | RU |
2159507 | Nov 2000 | RU |
WO0011849 | Mar 2000 | WO |
WO0011849 | Mar 2000 | WO |
WO0251096 | Jun 2002 | WO |
WO03028293 | Apr 2003 | WO |
WO2004023717 | Mar 2004 | WO |
WO2004030364 | Apr 2004 | WO |
WO2004097605 | Nov 2004 | WO |
Number | Date | Country | |
---|---|---|---|
20090135849 A1 | May 2009 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10612851 | Jul 2003 | US |
Child | 12360099 | US |