1. Field of the Invention
The present invention relates to systems and methods for transmitting data, and in particular to a system and method for equalizing digital data signals.
2. Description of the Related Art
Digital signal communication systems have been used in various fields, including digital TV signal transmission, both terrestrial and satellite. As the various digital signal communication systems and services evolve, there is a burgeoning demand for increased data throughput and added services. However, it is more difficult to implement improvement in old systems and new services when it is necessary to replace existing legacy hardware, such as transmitters and receivers. New systems and services are at an advantage when they can utilize existing legacy hardware. In the realm of wireless communications, this principle is further highlighted by the limited availability of electromagnetic spectrum. Thus, it is not possible (or at least not practical) to merely transmit enhanced or additional data at a new frequency.
The conventional method of increasing spectral capacity is to move to a higher-order modulation, such as from quadrature phase shift keying (QPSK) to eight phase shift keying (8PSK) or sixteen quadrature amplitude modulation (16QAM). Unfortunately, QPSK receivers cannot demodulate conventional 8PSK or 16QAM signals. As a result, legacy customers with QPSK receivers must upgrade their receivers in order to continue to receive any signals transmitted utilizing 8PSK or 16QAM modulation.
It is advantageous for systems and methods of transmitting signals to accommodate enhanced and increased data throughput without requiring additional frequency. It is also advantageous for enhanced and increased throughput signals for new receivers to be backwards compatible with legacy receivers. There is further advantage for systems and methods which allow transmission signals to be upgraded from a source separate from the legacy transmitter.
It has been proposed that a layered modulation signal, transmitting non-coherently upper as well as lower layer signals be employed to meet these needs. Such layered modulation systems allow for higher information throughput with backwards compatibility. However, even when backward compatibility is not required (such as with an entirely new system), layered modulation can still be advantageous because it requires a TWTA peak power significantly lower than that for a conventional 8PSK or 16QAM modulation formats for a given throughput.
Equalizers are widely used in communication systems, and are particularly useful when there are multipath and/or other distortion effects in the transmission channel. Equalizers can also be used to cancel “echo” in the system. However, such equalizers typically require apriori knowledge of the channel impulse response, or knowledge of a pre-determined training sequence that is transmitted in the channel. Since the training sequence is known, the channel impulse response can be determined from the training sequence and appropriately equalized. Blind equalizers, which do not have apriori knowledge of the channel impulse response or knowledge of the predetermined training sequence, are known, but such equalizers typically exhibit poor performance.
Accordingly, there is a need for systems and methods for accurately equalizing communication channels that does not require apriori knowledge of the channel impulse response or a training sequence. The present invention meets this need and provides further advantages as detailed hereafter.
To address the requirements described above, the present invention discloses a method and apparatus for equalizing digital data signals. The method comprises the steps of demodulating and decoding an input signal having input data to produce a data output, remodulating the data output to produce a training sequence including an idealized input signal, wherein the training sequence is comprised of adjacent symbols in the input data, and generating equalizer parameters from the training sequence. The apparatus comprises a demodulator for demodulating an input signal to produce a data output, a modulator, communicatively coupled to the demodulator, for remodulating the data output to produce a training sequence including an idealized input signal, wherein the training sequence is comprised of adjacent symbols in the input data, and a parameter generation module, communicatively coupled to the modulator for generating equalizer parameters from the training sequence.
Referring now to the drawings in which like reference numbers represent corresponding parts throughout:
In the following description, reference is made to the accompanying drawings which form a part hereof, and which is shown, by way of illustration, several embodiments of the present invention. It is understood that other embodiments may be utilized and structural changes may be made without departing from the scope of the present invention.
In the following description, reference is made to the accompanying drawings which form a part hereof, and which show, by way of illustration, several embodiments of the present invention. It is understood that other embodiments may be utilized and structural changes may be made without departing from the scope of the present invention.
The uplink center 104 receives program material and program control information from the control center 102, and using an uplink antenna 106 and transmitter 105, transmits the program material and program control information to the satellite 108. The satellite receives and processes this information and transmits the video programs and control information to the subscriber receiver station 110 via downlink 118 using transmitter 107. The subscriber receiving station 110 receives this information using the outdoor unit (ODU) 112, which includes a subscriber antenna and a low noise block converter (LNB).
In one embodiment, the subscriber receiving station antenna is an 18-inch slightly oval-shaped Ku-band antenna. The slight ovoid shape is due to the 22.5 degree offset feed of the LNB (low noise block converter) which is used to receive signals reflected from the subscriber antenna. The offset feed positions the LNB out of the way so it does not block any surface area of the antenna minimizing attenuation of the incoming microwave signal.
The video distribution system 100 can comprise a plurality of satellites 108 in order to provide wider terrestrial coverage, to provide additional channels, or to provide additional bandwidth per channel. In one embodiment of the invention, each satellite comprises 16 transponders to receive and transmit program material and other control data from the uplink center 104 and provide such material to the subscriber receiving stations 110. Using data compression and multiplexing techniques with respect to channel capabilities, two satellites 108 working together can receive and broadcast over 150 conventional (non-HDTV) audio and video channels via 32 transponders.
While the invention disclosed herein will be described with reference to a satellite-based video distribution system 100, the present invention may also be utilized with terrestrial-based transmission of program information, whether by broadcasting means, cable, or other means. Further, the different functions collectively allocated among the control center 102 and the uplink center 104 as described above can be reallocated as desired without departing from the intended scope of the present invention.
Although the foregoing has been described with respect to an embodiment in which the program material delivered to the subscriber 122 is video (and audio) program material such as a movie, the foregoing method can be used to deliver program material comprising purely audio information or other data.
The video channels are provided by a program source of video material 200A-200C [collectively referred to hereinafter as video source(s) 200]. The data from each video program source 200 is provided to an encoder 202A-202C [collectively referred to hereinafter as encoder(s) 202]. Each of the encoders accepts a program time stamp (PTS) from the controller 216. The PTS is a wrap-around binary time stamp that is used to assure that the video information is properly synchronized with the audio information after encoding and decoding. A PTS time stamp is sent with each I-frame of the MPEG encoded data.
In one embodiment of the present invention, each encoder 202 is a second generation Motion Picture Experts Group (MPEG-2) encoder, but other decoders implementing other coding techniques can be used as well. The data channel can be subjected to a similar compression scheme by an encoder (not shown), but such compression is usually either unnecessary, or performed by computer programs in the computer data source (for example, photographic data is typically compressed into *.TIF files or *.JPG files before transmission). After encoding by the encoders 202, the signals are converted into data packets by a packetizer 204A-204F [collectively referred to hereinafter as packetizer(s) 204] associated with each source 200.
The data packets are assembled using a reference from the system clock 214 (SCR) and from the conditional access manager 210, which provides the SCID to the packetizers 204 for use in generating the data packets. These data packets are then multiplexed into serial data and transmitted.
The data stream therefore comprises a series of packets from any one of the data sources in an order determined by the controller 216. The data stream is encrypted by the encryption module 218, modulated by the modulator 220 (typically using a QPSK modulation scheme), and provided to the transmitter 222, which broadcasts the modulated data stream on a frequency bandwidth to the satellite via the antenna 106. The receiver 500 receives these signals, and using the SCID, reassembles the packets to regenerate the program material for each of the channels.
The tuner/demodulator 504 isolates a single, digitally modulated 24 MHz transponder and converts the modulated data to a digital data stream. Further details regarding the demodulation of the received signal follow.
The digital data stream is then supplied to a forward error correction (FEC) decoder 506. This allows the IRD 500 to reassemble the data transmitted by the uplink center 104 (which applied the forward error correction to the desired signal before transmission to the subscriber receiving station 110) verifying that the correct data signal was received, and correcting errors, if any. The error-corrected data may be fed from the FEC decoder module 506 to the transport module 508 via an 8-bit parallel interface.
The transport module 508 performs many of the data processing functions performed by the IRD 500. The transport module 508 processes data received from the FEC decoder module 506 and provides the processed data to the video MPEG decoder 514 and the audio MPEG decoder 517. In one embodiment of the present invention, the transport module, video MPEG decoder and audio MPEG decoder are all implemented on integrated circuits. This design promotes both space and power efficiency, and increases the security of the functions performed within the transport module 508. The transport module 508 also provides a passage for communications between the microcontroller 510 and the video and audio MPEG decoders 514, 517. As set forth more fully hereinafter, the transport module also works with the conditional access module (CAM) 512 to determine whether the subscriber receiving station 110 is permitted to access certain program material. Data from the transport module can also be supplied to the external communication module 526.
The CAM 512 functions in association with other elements to decode an encrypted signal from the transport module 508. The CAM 512 may also be used for tracking and billing these services. In one embodiment of the present invention, the CAM 512 function as a smart card, having contacts cooperatively interacting with contacts in the IRD 500 to pass information. In order to implement the processing performed in the CAM 512, the IRD 500, and specifically the transport module 508 provides a clock signal to the CAM 512.
Video data is processed by the MPEG video decoder 514. Using the video random access memory (RAM) 536, the MPEG video decoder 514 decodes the compressed video data and sends it to an encoder or video processor 516, which converts the digital video information received from the video MPEG module 514 into an output signal usable by a display or other output device. By way of example, processor 516 may comprise a National TV Standards Committee (NTSC) or Advanced Television Systems Committee (ATSC) encoder. In one embodiment of the invention both S-Video and ordinary video (NTSC or ATSC) signals are provided. Other outputs may also be utilized and are advantageous if high definition programming is processed.
Audio data is likewise decoded by the MPEG audio decoder 517. The decoded audio data may then be sent to a digital-to-analog (D/A) converter 518. In one embodiment of the present invention, the D/A converter 518 is a dual D/A converter, one for the right and left channels. If desired, additional channels can be added for use in surround sound processing or secondary audio programs (SAPs). In one embodiment of the invention, the dual D/A converter 518 itself separates the left and right channel information, as well as any additional channel information. Other audio formats may be similarly supported, for example, multi-channel DOLBY DIGITAL AC-3.
A description of the processes performed in the encoding and decoding of video streams, particularly with respect to MPEG and JPEG encoding/decoding, can be found in Chapter 8 of “Digital Television Fundamentals,” by Michael Robin and Michel Poulin, McGraw-Hill, 1998, which is hereby incorporated by reference herein.
The microcontroller 510 receives and processes command signals from the remote control 524, an IRD 500 keyboard interface, and/or another input device. The microcontroller receives commands for performing its operations from a processor programming memory, which permanently stores such instructions for performing such commands. The processor programming memory may comprise a read-only memory (ROM) 538, an electrically erasable programmable read-only memory (EEPROM) 522 or, similar memory device. The microcontroller 510 also controls the other digital devices of the IRD 500 via address and data lines (denoted “A” and “D” respectively, in
The modem 540 connects to the customer's phone line via the PSTN port 120. It calls, e.g. the program provider, and transmits the customer's purchase information for billing purposes, and/or other information. The modem 540 is controlled by the microprocessor 510. The modem 540 can output data to other I/O port types including standard parallel and serial computer I/O ports.
The present invention also comprises a local storage unit such as the video storage device 532 for storing video and/or audio data obtained from the transport module 508. Video storage device 532 can be a hard disk drive, a read/writable compact disc or DVD, a solid state RAM, or any other storage medium. In one embodiment of the present invention, the video storage device 532 is a hard disk drive with specialized parallel read/write capability so that data may be read from the video storage device 532 and written to the device 532 at the same time. To accomplish this feat, additional buffer memory accessible by the video storage 532 or its controller may be used. Optionally, a video storage processor 530 can be used to manage the storage and retrieval of the video data from the video storage device 532. The video storage processor 530 may also comprise memory for buffering data passing into and out of the video storage device 532. Alternatively or in combination with the foregoing, a plurality of video storage devices 532 can be used. Also alternatively or in combination with the foregoing, the microcontroller 510 can also perform the operations required to store and/or retrieve video and other data in the video storage device 532.
The video processing module 516 input can be directly supplied as a video output to a viewing device such as a video or computer monitor. In addition, the video and/or audio outputs can be supplied to an RF modulator 534 to produce an RF output and/or 8 vestigial side band (VSB) suitable as an input signal to a conventional television tuner. This allows the receiver 500 to operate with televisions without a video output.
Each of the satellites 108 comprises a transponder, which accepts program information from the uplink center 104, and relays this information to the subscriber receiving station 110. Known multiplexing techniques are used so that multiple channels can be provided to the user. These multiplexing techniques include, by way of example, various statistical or other time domain multiplexing techniques and polarization multiplexing. In one embodiment of the invention, a single transponder operating at a single frequency band carries a plurality of channels identified by respective service channel identification (SCID).
Preferably, the IRD 500 also receives and stores a program guide in a memory available to the microcontroller 510. Typically, the program guide is received in one or more data packets in the data stream from the satellite 108. The program guide can be accessed and searched by the execution of suitable operation steps implemented by the microcontroller 510 and stored in the processor ROM 538. The program guide may include data to map viewer channel numbers to satellite transponders and service channel identifications (SCIDs), and also provide TV program listing information to the subscriber 122 identifying program events.
The functionality implemented in the IRD 500 depicted in
The present invention provides for the modulation of signals at different power levels and advantageously for the signals to be non-coherent from each layer. In addition, independent modulation and coding of the signals may be performed. Backwards compatibility with legacy receivers, such as a quadrature phase shift keying (QPSK) receiver is enabled and new services are provided to new receivers. A typical new receiver of the present invention uses two demodulators and one remodulator as will be described in detail hereafter.
In a typical backwards-compatible embodiment of the present invention, the legacy QPSK signal is boosted in power to a higher transmission (and reception) level. This creates a power “room” in which a new lower layer signal may operate. The legacy receiver will not be able to distinguish the new lower layer signal, from additive white Gaussian noise, and, thus, operates in the usual manner. The optimum selection of the layer power levels is based on accommodating the legacy equipment, as well as the desired new throughput and services.
The new lower layer signal is provided with a sufficient carrier to thermal noise ratio to function properly. The new lower layer signal and the boosted legacy signal are non-coherent with respect to each other. Therefore, the new lower layer signal can be implemented from a different TWTA and even from a different satellite. The new lower layer signal format is also independent of the legacy format, e.g., it may be QPSK or 8PSK, using the conventional concatenated FEC code or using a new Turbo code. The lower layer signal may even be an analog signal.
The combined layered signal is demodulated and decoded by first demodulating the upper layer to remove the upper carrier. The stabilized layered signal may then have the upper layer FEC decoded and the output upper layer symbols communicated to the upper layer transport. The upper layer symbols are also employed in a remodulator to generate an idealized upper layer signal. The idealized upper layer signal is then subtracted from the stable layered signal to reveal the lower layer signal. The lower layer signal is then demodulated and FEC decoded and communicated to the lower layer transport.
Signals, systems and methods using the present invention may be used to supplement a pre-existing transmission compatible with legacy receiving hardware in a backwards-compatible application or as part of a preplanned layered modulation architecture providing one or more additional layers at a present or at a later date.
Relative modulating frequencies cause the second layer constellation to rotate around the nodes of the first layer constellation. After the second layer CRL, this rotation is eliminated. The radius of the second layer constellation is determined by its power level. The thickness of the rings 702 is determined by the carrier to noise ratio (CNR) of the second layer. As the two layers are non-coherent, the second layer may also be used to transmit analog or digital signals.
Layered modulation applications include backwards compatible and non-backwards compatible applications. “Backwards compatible” in this sense describes systems in which legacy receivers 500 are not rendered obsolete by the additional signal layer(s). Instead, even if the legacy receivers 500 are incapable of decoding the additional signal layer(s), they are capable of receiving the layered modulated signal and decoding the original signal layer. In these applications, the pre-existing system architecture is accommodated by the architecture of the additional signal layers. “Non-backwards compatible” describes a system architecture which makes use of layered modulation, but the modulation scheme employed is such that pre-existing equipment is incapable of receiving and decoding the information on additional signal layer(s).
The pre-existing legacy IRDs 500 decode and make use of data only from the layer (or layers) they were designed to receive, unaffected by the additional layers. However, as will be described hereafter, the legacy signals may be modified to optimally implement the new layers. The present invention may be applied to existing direct satellite services which are broadcast to individual users in order to enable additional features and services with new receivers without adversely affecting legacy receivers and without requiring additional signal frequency.
In order for the subtraction to leave a clean small lower layer signal, the upper layer signal must be precisely reproduced. The modulated signal may have been distorted, for example, by traveling wave tube amplifier (TWTA) non-linearity or other non-linear or linear distortions in the transmission channel. The distortion effects are estimated from the received signal after the fact or from TWTA characteristics which may be downloaded into the IRD in AM-AM and/or AM-PM maps 1014, used to eliminate the distortion.
A subtractor 1012 then subtracts the idealized upper layer signal from the stable demodulated signal 1020. This leaves the lower-power second layer signal. The subtractor 1012 may include a buffer or delay function to retain the stable demodulated signal 1020 while the idealized upper layer signal is being constructed. The second layer signal is demodulated by the lower level demodulator 1010 and FEC decoded by decoder 1008 according to its signal format to produce the lower layer symbols, which are provided to the transport module 508.
Other equivalent methods of layer subtraction will occur to those skilled in the art and the present invention should not be limited to the examples provided here. Furthermore, those skilled in the art will understand that the present invention is not limited to two layers; additional layers may be included. Idealized upper layers are produced through remodulation from their respective layer symbols and subtracted. Subtraction may be performed on either the received combined signal or a demodulated signal. Finally, it is not necessary for all signal layers to be digital transmissions; the lowest layer may be an analog transmission.
The following analysis describes the exemplary two layer demodulation and decoding. It will be apparent to those skilled in the art that additional layers may be demodulated and decoded in a similar manner. The incoming combined signal is represented as:
where, MU is the magnitude of the upper layer QPSK signal and ML is the magnitude of the lower layer QPSK signal and ML<<MU. The signal frequencies and phase for the upper and lower layer signals are respectively ωU,θU and ωL,θL, respectively. The symbol timing misalignment between the upper and lower layers is ΔTm. The expression p(t−mT) represents the time shifted version of the pulse shaping filter p(t) 430 employed in signal modulation. QPSK symbols SUm and SLm are elements of
fU(·) and fL(·) denote the distortion function of the TWTAs for the respective signals.
Ignoring fU(·) and fL(·) and noise n(t), the following represents the output of the signal after removing the upper carrier:
Because of the magnitude difference between MU and ML, the upper layer decoder 1002 disregards the ML component of the s′UL(t).
After subtracting the upper layer from sUL(t) in the subtractor 1012, the following remains:
Any distortion effects, such as TWTA nonlinearity effects are estimated for signal subtraction. In a typical embodiment of the present invention, the upper and lower layer frequencies are substantially equal. Significant improvements in system efficiency can be obtained by using a frequency offset between layers.
Using the present invention, two-layered backward compatible modulation with QPSK doubles a current 6/7 rate capacity by adding a TWTA approximately 6.2 dB above an existing TWTA power. New QPSK signals may be transmitted from a separate transmitter, for example, from a different satellite. In addition, there is no need for linear traveling wave tube amplifiers (TWTAs) as with 16QAM. Also, no phase error penalty is imposed on higher order modulations such as 8PSK and 16QAM.
In an alternate embodiment of this backwards compatible application, a code rate of 2/3 may be used for both the upper and lower layers 1104, 1110. In this case, the CNR of the legacy QPSK signal 1102 (with a code rate of 2/3) is approximately 5.8 dB. The legacy signal 1102 is boosted by approximately 5.3 dB to approximately 11.1 dB (4.1 dB above the legacy QPSK signal 1102 with a code rate of 2/3) to form the upper QPSK layer 1104. The new lower QPSK layer 1110 has a CNR of approximately 3.8 dB. The total signal and noise of the lower layer 1110 is kept at or below approximately 5.3 dB, the tolerable noise floor 1106 of the upper QPSK layer. In this case, overall capacity is improved by 1.55 and the effective rate for legacy IRDs will be 7/9 of that before implementing the layered modulation.
In a further embodiment of a backwards compatible application of the present invention, the code rates between the upper and lower layers 1104, 1110 may be mixed. For example, the legacy QPSK signal 1102 may be boosted by approximately 5.3 dB to approximately 12.3 dB with the code rate unchanged at 6/7 to create the upper QPSK layer 1104. The new lower QPSK layer 1110 may use a code rate of 2/3 with a CNR of approximately 3.8 dB. In this case, the total capacity relative to the legacy signal 1102 is approximately 1.78. In addition, the legacy IRDs will suffer no rate decrease.
As previously discussed the present invention may also be used in “non-backward compatible” applications. In a first exemplary embodiment, two QPSK layers 1104, 1110 are used each at a code rate of 2/3. The upper QPSK layer 504 has a CNR of approximately 4.1 dB above its noise floor 1106 and the lower QPSK layer 1110 also has a CNR of approximately 4.1 dB. The total code and noise level of the lower QPSK layer 1110 is approximately 5.5 dB. The total CNR for the upper QPSK signal 1104 is approximately 9.4 dB, merely 2.4 dB above the legacy QPSK signal rate 6/7. The capacity is approximately 1.74 compared to the legacy rate 6/7.
The performance of the IRD 500 can be improved by the use of equalizers. Equalizers can be classified into two groups: those that either know or estimate channel impulse response, and those that operate without such knowledge. Information about such equalizers can be found in the paper “Adaptive Equalizer” by Qureshi, Proceedings of IEEE, Vol. 73, No. 9, September 1985, and in the textbook “Digital Communications,” by John G. Proakis, Third Edition, McGraw-Hill Book Company, 1995, in Chapters 10 and 11.
The first group includes equalizers that have apriori knowledge of the channel impulse response, and those that estimate the channel impulse response using prearranged training sequences known to both the transmitter and the receiver. The second group includes blind equalizers (which have no knowledge of the channel impulse response and do not attempt to estimate it). One type of blind equalizer is a decision feedback blind equalizer, which uses the digital output of the system to feedback to the equalizer computation. However, that type of decision-making process is very sensitive to the digital output error rate.
The “unblind” equalizer described below does not fall neatly into any of the above categories. Unlike the first category, no a priori knowledge of the transmission channel characteristics is required and prearranged training sequences are not required, thus saving valuable transmission capacity. The “unblind” equalizer has the same implementation advantages and provides performance better than a blind equalizer. However, the unblind equalizer does not require specific knowledge of the channel impulse response, nor does it need to dedicate transmission capacity to transmit training sequences. The unblind equalizer uses past received data to recover the transmission signal, and then uses the recovered transmission signal to define the equalizer format and parameters.
The unblind equalizer can also be used in combination with an adaptive equalizer to create an adaptive unblind equalizer, which can be used in applications where channel characteristics change over time.
Turning first to
In one embodiment, the equalizer parameters are generated by comparing a buffered or delayed version of the input signal with the pseudo-training sequence. This technique is illustrated in blocks 1214 and 1216 of
Signal y(t) is delayed by a time period τ approximating that of the remodulation and recoding process by buffer 1312 to produce y(t−τ). This delayed signal y(t−τ) is applied to both the parameter generation/update module 1314 and a second equalizer 1306B. The equalized y(t) signal, Ŝup(t)+Ŝlow(t), is provided to the signal canceller 1012 as well. Hence, the output of the signal canceller 1012 is
To an extent, the foregoing technique assumes that the transmission channel is, in a wide-sense, stationary, or has characteristics that vary slowly over time, at least as compared to the digital detection process of the receiver 500. The effectiveness of the foregoing technique is reduced in situations where channel variances over time are not smaller than those of the equalizer parameter update. The foregoing technique also assumes that even without equalization, the receiver can detect the transmitted digital information or a portion thereof at a certain range of data error rate. This may not be the case when this “unblind” equalization technique is combined for use with traditional training sequence equalizers or blind equalizers.
A determination may be made as to whether the unblinded pseudo-training sequence is usable to create an equalizer parameter update. For example, at any point in the system shown in
When the received data rate reaches a certain performance level, an unblinded pseudo-training sequence can be used to process the parameter update computation. The point at which there is sufficient channel performance (as measured, for example, by the BER) to generate a pseudo-training sequence varies from system to system, and largely depends upon the value of other communication system parameters.
Unblind equalizers can be used in a conventional and/or an adaptive manner. Conventionally, it is assumed that the channel 1304 characteristics are either time-invariant or slowly changing in time. In such circumstances, once the equalizer is defined, the same equalizer parameters (e.g. structure and coefficients) can be used without further change. Where the channel 1304 characteristics change significantly over time, an adaptive unblind equalizer can be utilized. In such cases, the parameter generation/update module 1314, 1604 can continually accept renewed data and continue to update the parameters of the equalizer(s).
In the case of multi-layer modulation, it can generally be assumed that the system is capable of detecting the transmitted information within certain error rates, even without equalization. In most cases, the upper layer may be demodulated with a relatively low BER. However, in general cases where the system includes only one layer of modulation, it may be difficult to adequately detect the transmitted information without equalization. In such cases, the more traditional equalizers (using training sequences or blind equalizers) can be used to improve the signal, with the unblind equalizer accepting the equalized signal and providing further performance improvements.
For example, the unblind equalizer can be used with a training sequence equalizer. A system using a training system equalizer assumes the signal channel is static during the data transmission. If the channel varies, the system has to wait until the next training sequence before the system can make any correction. The training sequence must have a length long enough to be able to adequately train the equalizer, and the training sequence must be repeated on a periodic or aperiodic basis in order to keep the equalizer updated.
Although the training sequence provides perfect knowledge of the transmitted data sequence, it consumes some of the transmitting capacity. Hence, it is not cost effective to use a long training sequence or to frequently use a training sequence.
The unblind equalizer can be used to ameliorate the weaknesses of the training sequence equalizer. This can be accomplished by using the unblind equalizer to update the training equalizer after the training sequence equalizer has established the equalizer and the communications link. An unblind equalizer can also be used without the need of any additional training sequence once the receiver is able to receive the transmitted data.
A system without a training sequence may require an equalizer to generate a sufficiently error-free signal to allow the unblind equalizer to effectively function. In this situation, a blind equalizer can be used before the unblind equalizer is employed. With the help of the blind equalizer, the system is able to receive the transmitted data. As soon as the system is able to do so, a pseudo-training sequence can be derived and the unblind equalizer can be employed. Since the unblind equalizer uses the received data as its training sequence, equalizer parameters can be more accurately determined, improving equalizer performance.
Additional improvements can be made to the architecture of the equalizer in order to avoid residual inter-symbol interference (ISI). ISI comes from symbols that have not been received and therefore its effects cannot be completely removed from an equalizer. Specifically, in a decision-feedback equalizer (DFE), residual ISI exists after equalization. With the present invention, however, ISI can be completely quantified and removed, which results in a nearly perfect equalizer for the processing of a subsequent signal.
Two pieces of information are required to construct an equalizer. The first piece of information is the channel model, such as frequency response of a filter or the multi-path characteristics of the signal propagation channel. The second piece of information is the transmitted symbols around the symbol being demodulated. The channel model and the adjacent symbols combine to determine the exact amount of distortions at the symbol time. Often, only partial information about these two pieces of information can be obtained, resulting in a suboptimal equalizer.
The present invention improves upon the unblind equalizer described above, and claimed in the co-pending and commonly-assigned Utility patent application No. 10/691,032, filed on same date herewith, by Weizheng Wang, Tung-Sheng Lin, Ernest C. Chen, and William C. Lindsey, entitled “UNBLIND EQUALIZER ARCHITECTURE FOR DIGITAL COMMUNICATION SYSTEMS,” which application claims the benefit of U.S. Provisional Patent Application No. 60/421,329, filed Oct. 25, 2002, by Weizheng Wang, Tung-Sheng Lin, Ernest C. Chen, and William C. Lindsey, entitled “INNOVATIVE UNBLIND EQUALIZER ARCHITECTURE FOR DIGITAL COMMUNICATION SYSTEMS,” both of which applications are incorporated by reference herein.
The present invention uses a signal reconstruction technique to re-create a “training” symbol sequence from the received signal. By using these essentially perfect, re-created training symbol sequences, the channel model can be constructed very accurately. The present invention further offers a technique to obtain symbols adjacent to a given symbol. Specifically, the present invention decodes the received symbols around a given symbol with quasi error-free performance, re-encodes the decoded symbols into a nearly perfect signal and compares the re-encoded signal with the received signal to determine the exact channel distortion.
The highly accurate channel characteristics derived from the unblind equalizer described above and the nearly perfect adjacent symbols derived from the present invention combine to reproduce exact channel impairments, such as inter-symbol interference, which can be subtracted from the received signal to provide a nearly perfect equalization.
In the present invention, the equalizer constructs a pseudo-training sequence from the received data to determine the exact channel model. Consequently, there is no need for a training symbol sequence to be inserted into the payload data. Therefore, the technique is backwards compatible with existing signal formats and there is no throughput reduction. Thus, the present invention improves upon the unblind equalizer by offering an equalizer that uses a nearly perfect channel model and error-free symbols.
Contrast this with a conventional DFE, where symbols that occur after the current symbol cannot be observed, resulting in performance degradation in the feed-forward section of the equalizer. In addition, symbols that occurred before the current symbol are corrupted with uncoded bit errors because they are obtained prior to error correction. The uncoded bit error rate may be as high as 10% or more for a signal encoded by some advanced coding schemes.
However, the unblind equalizer obtains a quasi error-free symbol sequence through the reconstruction of the upper-layer signal. The present invention takes this one step further and uses the reconstructed, quasi error-free symbol sequence in place of a sub-optimal feed-forward section of the equalizer. Consequently, the reconstructed, quasi error-free symbol sequence obtained from the unblind equalizer provides nearly perfect knowledge about the channel model. The signal reconstruction process of the present invention provides error-free adjacent symbols, which results in a nearly perfect linear equalizer.
There are, however, some disadvantages to the present invention. For a layer-modulated signal, the equalizer output is delayed due to the re-construction of the upper-layer signal. Since demodulation is sequential between the two layers, the scheme relies on the upper-layer signal being demodulated and decoded correctly for the reconstruction of the symbols and therefore the channel model. For applications with signal formats other than layered modulation, a similar latency exists between the time the data is received for equalization and the time the equalizer coefficients are available. Generally, the amount of latency is on the order of a transport length of the FEC code.
Both the FF transversal filter 1904 and FB transversal filter 1910 comprise transversal (convolutional) filters with coefficients determined by the estimated channel model. The FF transversal filter 1904 is a “blind” equalizer that compensates for distortion from future symbols, which are not yet available. The FB transversal filter 1910 also includes an uncoded symbol detector. Without a training sequence, channel estimation is “blind” since it lacks the full knowledge about the symbols that are used in estimating the equalizer coefficients. Furthermore, symbol decision errors in the FB transversal filter 1910 degrade the performance of the equalizer.
The nearly perfect adjacent symbols provided by the present invention and the channel model provided by the unblind equalizer described above allow exact channel impairments to be reproduced, which can then be subtracted from the received signal for nearly perfect equalization. However, since all symbols are available from the re-encoding and re-modulation process, there is no need to use a DFE structure for the proposed blanket equalizer. The channel model is also nearly perfect since it is obtained from reconstructed symbols that are essentially error-free. As a result, the equalizer performance is significantly improved over a conventional DFE.
Preferably, in
The first equalizer 1306A works on the incoming composite signal and comprises a conventional DFE with FF and FB transversal filters (except that the channel model is nearly perfect as discussed above). The second equalizer 1306B works on the extracted lower-layer signal and also comprises a conventional DFE with the FF and FB transversal filters (and a nearly perfect channel model). The third equalizer 2100 works on the delayed version of the incoming signal, i.e., the previous or reconstructed symbol sequence {Ĩk}, and comprises the equalizer of
Note that, in this structure, the first and second equalizers 1306A and 1306B are optional. The receiver design can trade equalization performance for reduced hardware complexity. Most equalization gain is provided by the third equalizer 2100.
In conclusion, higher-order modulations, such as LM, require channel equalization to minimize linear distortion effects. The present invention proposes a method to perform equalization for LM as well as conventional signal formats. Coupled with the unblind equalizer, the present invention discloses an improved equalizer with a pseudo-training sequence for LM.
Generally, the computer 2202 operates under control of an operating system 2208 stored in the memory 2206, and interfaces with the user to accept inputs and commands and to present results through a graphical user interface (GUI) module 2218A. Although the GUI module 2218A is depicted as a separate module, the instructions performing the GUI functions can be resident or distributed in the operating system 2208, the computer program 2210, or implemented with special purpose memory and processors. The computer 2202 also implements a compiler 2212 which allows an application program 2210 written in a programming language such as COBOL, C++, FORTRAN, or other language to be translated into processor 2204 readable code. After completion, the application 2210 accesses and manipulates data stored in the memory 2206 of the computer 2202 using the relationships and logic that was generated using the compiler 2212. The computer 2202 also optionally comprises an external communication device such as a modem, satellite link, Ethernet card, or other device for communicating with other computers.
In one embodiment, instructions implementing the operating system 2208, the computer program 2210, and the compiler 2212 are tangibly embodied in a computer-readable medium, e.g., data storage device 2220, which could include one or more fixed or removable data storage devices, such as a zip drive, floppy disc drive 2224, hard drive, CD-ROM drive, tape drive, etc. Further, the operating system 2208 and the computer program 2210 are comprised of instructions which, when read and executed by the computer 2202, causes the computer 2202 to perform the steps necessary to implement and/or use the present invention. Computer program 2210 and/or operating instructions may also be tangibly embodied in memory 2206 and/or data communications devices 2230, thereby making a computer program product or article of manufacture according to the invention. As such, the terms “article of manufacture,” “program storage device” and “computer program product” as used herein are intended to encompass a computer program accessible from any computer readable device or media.
Those skilled in the art will recognize many modifications may be made to this configuration without departing from the scope of the present invention. For example, those skilled in the art will recognize that any combination of the above components, or any number of different components, peripherals, and other devices, may be used with the present invention.
This concludes the description of the preferred embodiments of the present invention. The foregoing description of the preferred embodiment of the invention has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations are possible in light of the above teaching.
It is intended that the scope of the invention be limited not by this detailed description, but rather by the claims appended hereto. The above specification, examples and data provide a complete description of the manufacture and use of the composition of the invention. Since many embodiments of the invention can be made without departing from the spirit and scope of the invention, the invention resides in the claims hereinafter appended.
This application claims benefit of U.S. Provisional Patent Application No. 60/421,241, entitled “EQUALIZERS FOR LAYERED MODULATED AND OTHER SIGNALS,” filed Oct. 25, 2002, by Ernest C. Chen, Tung-Sheng Lin, Weizheng Wang, and William C. Lindsey, which application is hereby incorporated by reference herein. This application is also a continuation-in-part of the following co-pending and commonly assigned patent application(s), all of which applications are incorporated by reference herein: application Ser. No. 09/844,401, filed Apr. 27, 2001, by Ernest C. Chen, entitled “LAYERED MODULATION FOR DIGITAL SIGNALS”. Patent application No. 10,691,032 filed on same date herewith, by Weizheng Wang, Tung-Sheng Lin, Ernest C. Chen, and William C. Lindsey, entitled “UNBLIND EQUALIZER ARCHITECTURE FOR DIGITAL COMMUNICATION SYSTEMS” , which application claims the benefit of U.S. Provisional Patent Application No. 60/421,329, filed Oct. 25, 2002, by Weizheng Wang, Tung-Sheng Lin, Ernest C. Chen, and William C. Lindsey, entitled “INNOVATIVE UNBLIND EQUALIZER ARCHITECTURE FOR DIGITAL COMMUNICATION SYSTEMS”.
Number | Name | Date | Kind |
---|---|---|---|
3076180 | Havens et al. | Jan 1963 | A |
3383598 | Sanders | May 1968 | A |
3878468 | Falconer et al. | Apr 1975 | A |
3879664 | Monsen | Apr 1975 | A |
3974449 | Falconer | Aug 1976 | A |
4039961 | Ishio et al. | Aug 1977 | A |
4068186 | Sato et al. | Jan 1978 | A |
4213095 | Falconer | Jul 1980 | A |
4253184 | Gitlin et al. | Feb 1981 | A |
4283684 | Satoh | Aug 1981 | A |
4384355 | Werner | May 1983 | A |
RE31351 | Falconer | Aug 1983 | E |
4416015 | Gitlin | Nov 1983 | A |
4422175 | Bingham et al. | Dec 1983 | A |
4484337 | Leclert et al. | Nov 1984 | A |
4500984 | Shimbo et al. | Feb 1985 | A |
4519084 | Langseth | May 1985 | A |
4594725 | Desperben et al. | Jun 1986 | A |
4628507 | Otani | Dec 1986 | A |
4637017 | Assal et al. | Jan 1987 | A |
4647873 | Beckner et al. | Mar 1987 | A |
4654863 | Belfield et al. | Mar 1987 | A |
4670789 | Plume | Jun 1987 | A |
4709374 | Farrow | Nov 1987 | A |
4800573 | Cupo | Jan 1989 | A |
4829543 | Borth et al. | May 1989 | A |
4835790 | Yoshida et al. | May 1989 | A |
4847864 | Cupo | Jul 1989 | A |
4860315 | Hosoda et al. | Aug 1989 | A |
4864640 | Roza | Sep 1989 | A |
4878030 | Vincze | Oct 1989 | A |
4896369 | Adams et al. | Jan 1990 | A |
4918708 | Pottinger et al. | Apr 1990 | A |
4992747 | Myers | Feb 1991 | A |
4993047 | Moffat et al. | Feb 1991 | A |
5088110 | Bonnerot et al. | Feb 1992 | A |
5111155 | Keate et al. | May 1992 | A |
5121414 | Levine et al. | Jun 1992 | A |
5127051 | Chan et al. | Jun 1992 | A |
5199047 | Koch | Mar 1993 | A |
5206886 | Bingham | Apr 1993 | A |
5206889 | Unkrich | Apr 1993 | A |
5221908 | Katz et al. | Jun 1993 | A |
5229765 | Gardner | Jul 1993 | A |
5233632 | Baum et al. | Aug 1993 | A |
5285474 | Chow et al. | Feb 1994 | A |
5285480 | Chennakeshu et al. | Feb 1994 | A |
5317599 | Obata | May 1994 | A |
5329311 | Ward et al. | Jul 1994 | A |
5353307 | Lester et al. | Oct 1994 | A |
5430770 | Abbey | Jul 1995 | A |
5450623 | Yokoyama et al. | Sep 1995 | A |
5467197 | Hoff | Nov 1995 | A |
5493307 | Tsujimoto | Feb 1996 | A |
5513215 | Marchetto et al. | Apr 1996 | A |
5555257 | Dent | Sep 1996 | A |
5577067 | Zimmerman | Nov 1996 | A |
5577087 | Furuya | Nov 1996 | A |
5579344 | Namekata | Nov 1996 | A |
5581229 | Hunt | Dec 1996 | A |
5592481 | Wiedeman et al. | Jan 1997 | A |
5602868 | Wilson | Feb 1997 | A |
5603084 | Henry et al. | Feb 1997 | A |
5606286 | Bains | Feb 1997 | A |
5625640 | Palmer et al. | Apr 1997 | A |
5642358 | Dent | Jun 1997 | A |
5644592 | Divsalar et al. | Jul 1997 | A |
5646935 | Ishikawa et al. | Jul 1997 | A |
5648955 | Jensen et al. | Jul 1997 | A |
5649291 | Tayloe | Jul 1997 | A |
5671253 | Stewart | Sep 1997 | A |
5732113 | Schmidl et al. | Mar 1998 | A |
5790555 | Narahashi et al. | Aug 1998 | A |
5793818 | Claydon et al. | Aug 1998 | A |
5796786 | Lee | Aug 1998 | A |
5799010 | Lomp et al. | Aug 1998 | A |
5815531 | Dent | Sep 1998 | A |
5819157 | Ben-Efraim et al. | Oct 1998 | A |
5828710 | Beale | Oct 1998 | A |
5848060 | Dent | Dec 1998 | A |
5870443 | Rahnema | Feb 1999 | A |
5903546 | Ikeda et al. | May 1999 | A |
5909454 | Schmidt | Jun 1999 | A |
5940025 | Koehnke et al. | Aug 1999 | A |
5946625 | Hassan et al. | Aug 1999 | A |
5956373 | Goldston et al. | Sep 1999 | A |
5960040 | Cai et al. | Sep 1999 | A |
5963845 | Floury et al. | Oct 1999 | A |
5966048 | Thompson | Oct 1999 | A |
5966186 | Shigihara et al. | Oct 1999 | A |
5966412 | Ramaswamy | Oct 1999 | A |
5970098 | Herzberg | Oct 1999 | A |
5970156 | Hummelgaard et al. | Oct 1999 | A |
5978652 | Burr et al. | Nov 1999 | A |
5987068 | Cassia et al. | Nov 1999 | A |
5987069 | Furukawa et al. | Nov 1999 | A |
5995495 | Sampson | Nov 1999 | A |
5995536 | Arkhipkin et al. | Nov 1999 | A |
5995832 | Mallinckrodt | Nov 1999 | A |
5999793 | Ben-Efraim et al. | Dec 1999 | A |
6002713 | Goldstein et al. | Dec 1999 | A |
6008692 | Escartin | Dec 1999 | A |
6018556 | Janesch et al. | Jan 2000 | A |
6021159 | Nakagawa | Feb 2000 | A |
6028894 | Oishi et al. | Feb 2000 | A |
6032026 | Seki et al. | Feb 2000 | A |
6034952 | Dohi et al. | Mar 2000 | A |
6047162 | Lazaris-Brunner et al. | Apr 2000 | A |
6049566 | Saunders et al. | Apr 2000 | A |
6052586 | Karabinis | Apr 2000 | A |
6055278 | Ho et al. | Apr 2000 | A |
6061393 | Tsui et al. | May 2000 | A |
6075781 | Ohlson et al. | Jun 2000 | A |
6075808 | Tsujimoto | Jun 2000 | A |
6078645 | Cai et al. | Jun 2000 | A |
6084919 | Kleider et al. | Jul 2000 | A |
6104747 | Jalloul et al. | Aug 2000 | A |
6108374 | Balachandran et al. | Aug 2000 | A |
6125148 | Frodigh et al. | Sep 2000 | A |
6128357 | Lu et al. | Oct 2000 | A |
6131013 | Bergstrom et al. | Oct 2000 | A |
6140809 | Doi | Oct 2000 | A |
6141534 | Snell et al. | Oct 2000 | A |
6144708 | Maruyama | Nov 2000 | A |
6166601 | Shalom et al. | Dec 2000 | A |
6172970 | Ling et al. | Jan 2001 | B1 |
6177836 | Young et al. | Jan 2001 | B1 |
6178158 | Suzuki et al. | Jan 2001 | B1 |
6188717 | Kaiser et al. | Feb 2001 | B1 |
6212360 | Fleming et al. | Apr 2001 | B1 |
6219095 | Zhang et al. | Apr 2001 | B1 |
6249180 | Maalej et al. | Jun 2001 | B1 |
6266534 | Raith et al. | Jul 2001 | B1 |
6272679 | Norin | Aug 2001 | B1 |
6275678 | Bethscheider et al. | Aug 2001 | B1 |
6297691 | Anderson et al. | Oct 2001 | B1 |
6304594 | Salinder | Oct 2001 | B1 |
6307435 | Nguyen et al. | Oct 2001 | B1 |
6313885 | Patel et al. | Nov 2001 | B1 |
6314441 | Raghunath | Nov 2001 | B1 |
6320919 | Khayrallah et al. | Nov 2001 | B1 |
6325332 | Cellier et al. | Dec 2001 | B1 |
6330336 | Kasama | Dec 2001 | B1 |
6333924 | Porcelli et al. | Dec 2001 | B1 |
6366309 | Siegle | Apr 2002 | B1 |
6369648 | Kirkman | Apr 2002 | B1 |
6377116 | Mattsson et al. | Apr 2002 | B1 |
6389002 | Schilling | May 2002 | B1 |
6404819 | Gehlot | Jun 2002 | B1 |
6411659 | Liu et al. | Jun 2002 | B1 |
6411797 | Estinto | Jun 2002 | B1 |
6426822 | Winter et al. | Jul 2002 | B1 |
6429740 | Nguyen et al. | Aug 2002 | B1 |
6433835 | Hartson et al. | Aug 2002 | B1 |
6477398 | Mills | Nov 2002 | B1 |
6501804 | Rudolph et al. | Dec 2002 | B1 |
6515713 | Nam | Feb 2003 | B1 |
6522683 | Smee et al. | Feb 2003 | B1 |
6535497 | Raith | Mar 2003 | B1 |
6535801 | Geier et al. | Mar 2003 | B1 |
6539050 | Lee et al. | Mar 2003 | B1 |
6556639 | Goldston et al. | Apr 2003 | B1 |
6574235 | Arslan et al. | Jun 2003 | B1 |
6574794 | Sarraf | Jun 2003 | B1 |
6577353 | Welles et al. | Jun 2003 | B1 |
6597750 | Knutson et al. | Jul 2003 | B1 |
6657978 | Millman | Dec 2003 | B1 |
6661761 | Hayami et al. | Dec 2003 | B2 |
6671338 | Gamal et al. | Dec 2003 | B1 |
6678336 | Katoh et al. | Jan 2004 | B1 |
6718184 | Aiken et al. | Apr 2004 | B1 |
6721300 | Akiba et al. | Apr 2004 | B1 |
6731622 | Frank et al. | May 2004 | B1 |
6731698 | Yoshie | May 2004 | B1 |
6731700 | Yakhnich et al. | May 2004 | B1 |
6741662 | Francos et al. | May 2004 | B1 |
6745050 | Forsythe et al. | Jun 2004 | B1 |
6754872 | Zhang et al. | Jun 2004 | B2 |
6775521 | Chen | Aug 2004 | B1 |
6788917 | Refai et al. | Sep 2004 | B1 |
6803814 | Krupezevic et al. | Oct 2004 | B1 |
6809587 | Ghannouchi et al. | Oct 2004 | B2 |
6891897 | Bevan et al. | May 2005 | B1 |
6892068 | Karabinis et al. | May 2005 | B2 |
6922436 | Porat et al. | Jul 2005 | B1 |
6934314 | Harles et al. | Aug 2005 | B2 |
6947741 | Beech et al. | Sep 2005 | B2 |
6956841 | Stahle et al. | Oct 2005 | B1 |
6970496 | Ben-Bassat et al. | Nov 2005 | B1 |
6990627 | Uesugi et al. | Jan 2006 | B2 |
6999510 | Batruni | Feb 2006 | B2 |
7041406 | Schuler et al. | May 2006 | B2 |
7054384 | Ma et al. | May 2006 | B1 |
7073116 | Settle et al. | Jul 2006 | B1 |
7079585 | Settle et al. | Jul 2006 | B1 |
7154958 | Dabak et al. | Dec 2006 | B2 |
7161931 | Li et al. | Jan 2007 | B1 |
7209524 | Chen | Apr 2007 | B2 |
7230992 | Walker et al. | Jun 2007 | B2 |
7239876 | Johnson et al. | Jul 2007 | B2 |
7251291 | Dubuc et al. | Jul 2007 | B1 |
7263119 | Hsu et al. | Aug 2007 | B1 |
7616706 | Koslov | Nov 2009 | B2 |
20010012322 | Nagaoka et al. | Aug 2001 | A1 |
20010016926 | Riggle | Aug 2001 | A1 |
20010024479 | Samarasooriya | Sep 2001 | A1 |
20020006795 | Norin et al. | Jan 2002 | A1 |
20020009141 | Yamaguchi et al. | Jan 2002 | A1 |
20020010001 | Dahlman et al. | Jan 2002 | A1 |
20020051435 | Giallorenzi et al. | May 2002 | A1 |
20020051581 | Takeuchi et al. | May 2002 | A1 |
20020064173 | Watanabe | May 2002 | A1 |
20020067744 | Fujii et al. | Jun 2002 | A1 |
20020071506 | Lindquist et al. | Jun 2002 | A1 |
20020126780 | Oshima et al. | Sep 2002 | A1 |
20020136327 | El-Gamal et al. | Sep 2002 | A1 |
20020154705 | Walton et al. | Oct 2002 | A1 |
20020158619 | Chen | Oct 2002 | A1 |
20020176516 | Jeske et al. | Nov 2002 | A1 |
20020186761 | Corbaton et al. | Dec 2002 | A1 |
20030002471 | Crawford et al. | Jan 2003 | A1 |
20030043941 | Johnson et al. | Mar 2003 | A1 |
20030138037 | Kaku et al. | Jul 2003 | A1 |
20030138040 | Rouphael et al. | Jul 2003 | A1 |
20030171102 | Yang | Sep 2003 | A1 |
20030185310 | Ketchum et al. | Oct 2003 | A1 |
20030194022 | Hammons et al. | Oct 2003 | A1 |
20040013084 | Thomas et al. | Jan 2004 | A1 |
20040091059 | Chen | May 2004 | A1 |
20040110467 | Wang | Jun 2004 | A1 |
20040137863 | Walton et al. | Jul 2004 | A1 |
20040146014 | Hammons et al. | Jul 2004 | A1 |
20040146296 | Gerszberg et al. | Jul 2004 | A1 |
20040196935 | Nieto | Oct 2004 | A1 |
20050008100 | Chen | Jan 2005 | A1 |
20050037724 | Walley et al. | Feb 2005 | A1 |
20060013333 | Chen | Jan 2006 | A1 |
20060022747 | Chen et al. | Feb 2006 | A1 |
20060045191 | Vasanth et al. | Mar 2006 | A1 |
20060056541 | Chen et al. | Mar 2006 | A1 |
20070011716 | Koslov et al. | Jan 2007 | A1 |
20070121718 | Wang et al. | May 2007 | A1 |
20070297533 | Chitrapu et al. | Dec 2007 | A1 |
Number | Date | Country |
---|---|---|
2442400 | Nov 2002 | CA |
2502924 | May 2004 | CA |
3642213 | Dec 1986 | DE |
0115218 | Aug 1984 | EP |
0222076 | Aug 1986 | EP |
0238822 | Sep 1987 | EP |
0356096 | Feb 1990 | EP |
0356096 | Feb 1990 | EP |
0491668 | Jun 1992 | EP |
0874474 | Oct 1998 | EP |
0929164 | Jul 1999 | EP |
1011245 | Jun 2000 | EP |
1054537 | Nov 2000 | EP |
1065854 | Jan 2001 | EP |
1081903 | Mar 2001 | EP |
1335512 | Aug 2003 | EP |
2696295 | Apr 1994 | FR |
2-005631 | Jan 1990 | JP |
2-95033 | Apr 1990 | JP |
03139027 | Jun 1991 | JP |
5-41683 | Feb 1993 | JP |
5-114878 | May 1993 | JP |
5-252084 | Sep 1993 | JP |
07-038615 | Feb 1995 | JP |
2001069112 | Mar 2001 | JP |
2001-244832 | Sep 2001 | JP |
2002118611 | Apr 2002 | JP |
10-2001-0019997 | Mar 2001 | KR |
2001 0019997 | Mar 2001 | KR |
318983 | Nov 1997 | TW |
362333 | Jun 1999 | TW |
391107 | May 2000 | TW |
435009 | May 2001 | TW |
451569 | Aug 2001 | TW |
462168 | Nov 2001 | TW |
499800 | Aug 2002 | TW |
502506 | Sep 2002 | TW |
9836467 | Aug 1998 | WO |
WO 9900957 | Jan 1999 | WO |
WO 9920001 | Apr 1999 | WO |
WO 9923718 | May 1999 | WO |
WO 9933203 | Jul 1999 | WO |
WO 0079753 | Dec 2000 | WO |
0113532 | Feb 2001 | WO |
WO 0113532 | Feb 2001 | WO |
WO 0139455 | May 2001 | WO |
WO 0139456 | May 2001 | WO |
WO 0180471 | Oct 2001 | WO |
WO 02073817 | Sep 2002 | WO |
WO 03105375 | Dec 2003 | WO |
WO 2005074171 | Aug 2005 | WO |
WO 2005086444 | Sep 2005 | WO |
Number | Date | Country | |
---|---|---|---|
20090175327 A1 | Jul 2009 | US |
Number | Date | Country | |
---|---|---|---|
60421241 | Oct 2002 | US | |
60421329 | Oct 2002 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11656662 | Jan 2007 | US |
Child | 12404253 | US | |
Parent | 10691133 | Oct 2003 | US |
Child | 11656662 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09844401 | Apr 2001 | US |
Child | 10691133 | US |