Patent Grant
8170154
1. Technical Field of the Invention
The present invention relates to communications systems, all of which are inherently limited in their capacity (or rate) of information transfer by channel impairments. More specifically, the present invention relates to information transfer between a plurality of Cable Modems (alternatively referred to as “CM”) and a Cable Termination System (alternatively referred to as “CMTS” or “headend”).
2. Description of Related Art
Communication systems are subjected to impairments, generally of a brief or transitory duration. One example of such impairment is often referred to by the generic term “noise”. Noise sometimes emanates for example, from within electrical components themselves, such as amplifiers and even passive resistors. Another example of such impairment is referred to as “interference”, which is usually taken to be some unwanted manmade emission, from another communications system such as radio or from switching circuits in a home or automobile for example. “Distortion” is a yet another example of such impairment, and includes linear distortion in the channel, such as pass-band ripple or non-flat group delay for example, and nonlinear distortion, such as compression in an overdriven amplifier for example. It is contemplated that there are many other types of impairments that may also adversely affect communications in a channel.
Often, such impairments may by dynamic in nature. In many cases, the impairment may be at one level of severity most of the time. In this instance, the communications system may be designed or optimized in some fashion to operate at that specific level of impairment. Occasionally, however, one or more of impairments may become so severe as to preclude the operation of such communications system optimized for the more ordinary level of impairments.
Previously, when a large interference or burst of noise occasionally impinges upon the receiver (a CM for example), it is known to simply blank out the received signal to mitigate such large out-of-the ordinary bursts of received power. Often, analog processing means are used, almost at, if not right at, the receiver input. This may be done especially to protect CM's or other sensitive receiver front-ends from damage. While this technique may provide some benefit in circumstances where the noise or interference power dwarfs the signal-of-interest power, it does not protect against the many other impairments that have power more on the order of the signal-of-interest power (or even much less). Thus blanking does not, by itself, provide the receiver with a means to improve its overall performance in the presence of the lost information, i.e., the information content concurrent with the large noise burst.
One known technique, a forward error correction technique (alternatively referred to as “FEC”) has been applied, even unknowingly, to solve this problem. FEC techniques incorporate soft-decision decoding, such as is common with convolutional error correction codes and the Viterbi decoding algorithm. In such correction techniques, as the error power in the received signal increases, such increase is passed directly into the decision process.
Such encoding and decoding techniques have been in common practice for years, and are widely applied without thought to temporary fidelity changes in the channel. Fortunately, in the event of a change in the channel fidelity, the soft-decision decoding takes into consideration the larger error power in making signal decisions. However, unfortunately, often with a change in channel conditions, there is duration of multiple symbol intervals (in a digital communications system example) where the degradation persists. During this time some symbols may be so severely erred that they actually appear close to another possible (but wrong or incorrect) symbol. In such event, the soft-decision decoder actually “thinks” it has received a low error power, and may rate the wrong signal with a high confidence. This becomes much more likely as the constellation density (of a QAM constellation for example) is increased for high rate communications.
Additional techniques, such as a Time Division Multiple Access technique (alternatively referred to as “TDMA”) have been applied to solve this problem. In this technique, one or more carrier frequencies are shared among a plurality of CMs. Known standards, DOCSIS 1.0 and 1.1 for example, each of which are incorporated herein in their entirety, define the physical layer, and additional layers, in which a plurality of CMs transmit data upstream to and receive data downstream from the CMTS or headend. In this technique, each upstream carrier frequency or channel assignment is general shared by a plurality of CMs, each being granted time slots wherein they may use the channel. These grants are allocated and made known to the CMs via the downstream broadcast transmissions. Some of the grants only enable a single CM to transmit, while other time slot grants are in contention mode. That is some, or all, of the CMs may attempt to use the grant. However, if more than one CM attempts to use a grant in the contention mode, all the CMs will likely be unsuccessful in channel use.
Yet another technique, such as direct-sequence spread-spectrum modulation technique discussed by J. Young and J. Lehnert, in their paper titled “Analysis of DFT-Based Frequency Excision Algorithms for Direct-Sequence Spread-Spectrum Communications,” IEEE Trans. Comm., vol. 46, pp. 1076-1087, August 1998, the complete subject matter of which is incorporated herein by reference in its entirety, has also been applied to solve this problem. In this technique, frequency excision is used to eliminate narrow-band energy, thus enhancing the capacity of direct-sequence spread-spectrum modulation to reject narrow-band interference. However, this disclosed technique focuses on particular waveforms having energy concentrated about a narrow band.
Yet still another technique, such as such as Code-Division Multiple Access technique (alternatively referred to as “CDMA”) discussed by M. Lops, G. Ricci and A. Tulino, in their paper titled “Narrow-Band-Interference Suppression in Multiuser CDMA Systems,” IEEE Trans. Comm., vol. 46, pp. 1163-1175, September 1998, the complete subject matter of which is incorporated herein by reference in its entirety, has also been applied to solve this problem. In this technique, a decision is made regarding the bit(s) transmitted by each user over a communication system. This decision is based on the projection of the observables on to the orthogonal complement to the subspace spanned by the other users' signatures and the narrow-band interference. The disclosed technique recognizes that the blanking and iterative processing may be performed with an orthogonal basis set decomposition of the frequency domain.
Further limitations and disadvantages of conventional and traditional approaches will become apparent to one of skill in the art, through comparison of such systems with the present invention as set forth in the remainder of the present application with reference to the drawings.
These and other advantages and novel features of the present invention, as well as details of an illustrated embodiment thereof, will be more fully understood from the following description and drawings in which a system for mitigating impairment in a communication system constructed according to the present invention is described. The system includes a delay block, a signal level block, a moving average window block, an impulse noise detection block, and a combiner. The delay block is operable to receive and delay each chip of a plurality of chips in a spreading interval. This spreading interval may have a duration of 128 chips, such as in an SCDMA system. However, the system may operate according with other spread spectrum or CDMA systems as well. Further, the system may operate across different spreading sequences whose boundaries are affected by an impairment.
The signal level block is operable to determine a signal level of each chip of the plurality of chips in the spreading interval. The moving average window block communicatively couples the signal level block and is operable to determine a composite signal level for a chip window corresponding to the chip. The impulse noise detection block communicatively couples to the signal level block and to the moving average window block. The impulse noise detection block is operable to receive the signal level of each chip of the plurality of chips and spreading interval, to receive the composite signal level corresponding to each chip of the plurality of chips, and to produce an erasure indication for each chip of the plurality of chips of the corresponding chip window. One purpose of the impulse noise detection block is to determine which chips of the plurality of chips in the spreading interval are impacted by impulse noise and resultantly are not indicative of the value of a spread symbol. After making this/these determination(s), the impulse noise detection block generates corresponding erasure indication(s). The combiner communicatively couples to the delay block and to the impulse noise detection block and is operable to erase chips of the plurality of chips of the spreading interval based upon the erasure indication.
The erased and kept chips are then passed to a despreader that despreads the chips across the spreading interval to produce a symbol for the spreading interval. Alternately, the chips may be covered with a corresponding orthogonal code prior to being received by the system and then linearly combined after the chip erasure/keeping operations of the system have been completed.
In determining the signal level of the chip, the signal level block may magnitude-square a measured level of each chip. In one embodiment, the impulse noise detection block is operable to, for each chip of the plurality of chips: (1) compare the signal level of the chip to a first threshold to produce a first comparison result; (2) compare the composite signal level corresponding to the chip to a second threshold to produce a second comparison result; and (3) produce the erasure indication based upon the first comparison result and the second comparison result In various embodiments, the first and second comparison result may be either separately used to indicate an erasure or combined to indicate an erasure.
The moving average window block operates to receive the signal level of each chip, e.g., receiving the magnitude-square of the measured level of each chip. The moving average window block sums the signal level of the plurality of chips in the chip window to produce a signal level summation result. The moving average window block then averages the signal level summation result across the chip window to produce a composite signal level of the plurality of chips of the corresponding chip window. With this embodiment, the impulse noise detection block may be operable to compare the composite signal level of the plurality of chips of the corresponding chip window to a third threshold to produce a third comparison result and to determine a fourth comparison result based upon third comparison results of adjacent chips. Further, with this embodiment, the impulse noise detection block is operable to produce the erasure indication based upon the fourth comparison result An additional operation includes producing the erasure indication by considering first comparison results and second comparison results of neighboring chips. These particular comparison results consider where the edge of the impulse noise impairment in the spreading interval occurs.
Still another embodiment includes a method of operation. In addition, other aspects, advantages, and novel features of the invention will become apparent from the following detailed description of the invention when considered in conjunction with the accompanying drawings.
The following description is made with reference to the appended figures.
According to one embodiment of the present invention, impairment, burst noise, or other distortion-inducing mechanism of a duration of one up to several chips (6 chips for example) is detected. Means are provided to correct symbol decisions even in the presence of such impacted or distorted chips. More specifically, one embodiment of the present invention relates to means for detecting at least one and up to several chip(s) with increased impairment, distortion, or noise as provided below. In the embodiments provided below, it is contemplated that a chip plays the roll of a symbol, although other embodiments are also contemplated as discussed.
One embodiment of the present invention relates to a spreading technique to transmit symbols at the same time on the same frequency. More specifically, one embodiment of the present invention relates to a Synchronous Code Division Multiple Access technique for communication (alternatively referred to as “SCDMA”). More specifically, this invention relates to SCDMA communications used, in one embodiment, with a DOCSIS 2.0 physical layer standard (alternatively referred to as the “DOCSIS standard”), which is incorporated herein by reference in its entirety. The DOCSIS standard defines the physical layers in which pluralities of CMs transmit data upstream to and receive data downstream from the CMTS or headend.
In one embodiment of the present invention using SCDMA, about 128 spreading codes are available for modulating each upstream-transmitted symbol. In this embodiment, up to 128 symbols may be transmitted simultaneously, each symbol using its own spreading code. Each spreading code consists of a sequence of +1 or −1 valued chips, such that there are 128 such chips in each spreading code. In this embodiment, the symbol amplitude and angle are modulated using a vector, applying the vector or its additive inverse (i.e., 180 degree rotation) to the symbol.
In one embodiment, the spreading codes are orthogonal if perfectly time-aligned, and thus the 128 symbols will not interfere with each other, even though they are transmitted at the same time on the same channel. For example, two waveforms are orthogonal to each other if, after multiplying them by each other and integrating, the result of the integration is zero. In the SCDMA used with one embodiment of the present invention, at least one but up to 128 spreading codes may be used at one time. These spreading codes may be allocated to one CM, such that that CM is granted all the spreading codes (128 for example), up to the spreading codes be allocated to 64 different CMs, such that two spreading codes are granted to each CM. QAM symbols of two bits per symbol and more are spread with the assigned codes, one spreading code per QAM symbol, although other arrangements are contemplated.
In one embodiment using SCDMA, the spreading codes are cyclical shifts of one 127-chip spreading code, except for one additional chip. Thus, in this embodiment, the spreading codes are nearly cyclical shifts of one another.
For SCDMA to work efficiently, all the spreading codes should be synchronized as they arrive at the receiver. Timing misalignments result in inter code interference (alternatively referred to as “ICI”), which may degrade performance.
Various channel impairments also degrade performance, and special receiver techniques may be employed to limit or mitigate the degradation caused by such channel performance.
The first communication node 101 comprises a transmitter 105, a receiver 103, and a processor 106. The processor 106 may comprise, for example, a microprocessor. The first communication node 101 communicates with or is communicatively coupled to a user 100 (e.g., a computer) via communication link 110, and to the channel 109 via communication links 107 and 108. Of course, communication links 107 and 108 may be combined into a single communication link.
Similarly, the second communication node 111 comprises a transmitter 115, a receiver 114, and a processor 118. The processor 118, like processor 106, may comprise, for example, a microprocessor. The second communication node 111 likewise is communicatively coupled to the at least one channel 109 via communication links 112 and 113. Again, like communication links 107 and 108, the communication links 112 and 113 may also be combined into a single communication link. The communication node 111 may also be communicatively coupled to a user 120 (again a computer, for example) via communication link 121. In the case when communication node 111 is a headend, for example, user 120 may not be present.
During operation of the illustrated embodiment of
The receiver 114 of the second communication node 111 receives, via communication link 113, the information from the at least one channel 109 and transforms it into a form usable by the user 120. Finally, the information is communicated from the second communication node 111 to the user 120 via the communication link 121.
Communication of information from user 120 to user 100 may also be achieved in a similar manner. In either case, the information transmitted/received may also be processed using the processors 106/118.
A delay 208 between the input error power estimates of the window 205 and the corresponding channel fidelity metric is known for a given fidelity processor, and is provided back (made known) to a remainder of the system. The system uses the evolving fidelity metric in its processing, which may be aided by soft decisions designated 211. Soft decisions comprise, for example, erasure decoding or standard soft decision decoding, such as Viterbi decoding. In any case, the receiver outputs an estimate of the transmitted signal (reference numeral 213).
While
Specifically, the stored information about the fidelity metrics may be used in transmit waveform optimization for example. In other words, the information may be used to determine a waveform that best suits the communication channel given what has been learned about the channel over time, as reflected in the stored fidelity metrics. The stored information about the fidelity metrics may also (or alternatively) be used in selecting receiver algorithms that are robust given the limitations of the channel, again as reflected in the stored fidelity metrics. Additional detail regarding use of catalogued channel fidelity metric information for future communications is provided below.
In one embodiment of the present invention, the methods discussed above with respect to
The error power estimates provided previously with respect to
In an embodiment where the communication system (similar to the system of
The length of sliding window 205 of
Many forms are contemplated for processing the sequence of error power estimates in the fidelity processor 207 of
In its most simple form, the fidelity processor 207 may simply compare each error power estimate against a threshold, and output a binary channel fidelity estimate—i.e., “channel OK,” and “channel degraded.” While the window in this case consists of a single sample (or a single symbol in the digital communications example), the use of the catalogue of this information, and the beneficial use of this metric in subsequent receiver processing, may be employed in one embodiment of the present invention (such as shown in
Next, the error power of the symbols is calculated using, for example, the square of the distance between the received signal and the nearest constellation point in the digital system's signaling alphabet, also as provided previously and as illustrated by block 505A. The sum of the error power of all the symbols is then compared to a threshold of error power as illustrated by block 507A. This is performed, for example, in the fidelity processor. If it is determined that the error power is greater than the threshold, it is assumed that the channel is degraded, and all the symbols are erased as illustrated by block 509A. If instead it is determined that the calculated error power of the symbols is not above the threshold (i.e., less than the threshold), it is assumed that the channel is OK, and the symbols are kept as illustrated by block 511A. In either case, the decision is communicated to the decoder as illustrated by block 513A. In other words, if the symbol is kept as illustrated by block 511A, the symbol is simply communicated to the decoder as illustrated by block 513A, whereas if the symbol is erased as illustrated by block 509A, an indication that the symbol has been erased is communicated to the decoder as illustrated by block 513A. This process is repeated for each set of symbols received.
While the method illustrated in
For example, with SCDMA, after hard decisions are made in an iterative process or manner, these hard decisions may be remodulated and the error power calculated for each chip in the spreading interval.
Next, the error power of the chips is calculated as illustrated by block 505B. It is contemplated that blocks 503B and 505B calculate the error power of a chip using the remodulated ensemble set of symbol hard decisions (i.e., the closest constellation point for each of the demodulated spread symbols). The error power of each chip is then compared to a threshold of error power as illustrated by block 507B. If it is determined that the error power is greater than the threshold, it is assumed that the channel is degraded, and the chip is erased as illustrated by block 509B. If instead it is determined that the calculated error power of the chip is not above the threshold, it is assumed that the channel is OK, and the chip is kept as illustrated by block 511B. In either case, the decision is communicated to the decoder as illustrated by block 513B or repeated for multiple iterations. Moreover, the methods provided previously may be employed using different means for calculating the error power and different processing may be used to determine whether or not the channel is OK or whether particular symbol(s) (chips or other waveforms) should be erased or kept. In addition, the method may be employed in connection with analog communications, using samples rather than symbols. As mentioned above with respect to
Similarly, as provided previously with respect to
A Reed-Solomon decoder may accommodate twice as many erased symbols as it can correct erred symbols, so finding instances of degraded channel fidelity, which often lead to erred Reed-Solomon symbols benefits the decoder, and marking these as erasures, greatly benefits the decoder. If nearly all of the Reed-Solomon symbol errors are attributable to the degraded channel, and if the degraded channel is fairly accurately detected (in the fidelity processor for example), then almost twice as many instances of the degraded condition may be tolerated.
Other examples of fidelity processor include summing the error power estimates in the sliding window, and providing these (or a scaled version such as an average) as the channel fidelity estimate. Alternately, this sum or average may itself be quantized into a binary decision, or a finite number of levels (such as “channel pristine,” “channel OK,” and “channel degraded” in one example), or even compressed, via a square root operation, for example. If a dominant channel impairment is expected to persist for a duration of many symbols, then summing the error power estimates for at least several symbols increases the accuracy of the channel fidelity metric, especially during the “middle” of the impairment condition.
However, determining the precise moment when the degraded condition “turned on” and “turned off” may be difficult if a long window for summing is used, without modification. One approach is to increase the time-domain precision of the fidelity processor, is to compute the average error power during a window, and apply two thresholds, one on the average, and one on individual samples of the error power estimates. The “channel degraded” assignment is only outputted at times corresponding to samples, where the average error power in the window exceeded threshold #1, AND either (a) the sample was between two samples which exceeded threshold #2, or (b) the sample was the only sample in the window which exceeded threshold #2.
Once again, a particular example may be to employ the summing of the noise power estimates within the window, as provided previously, and this result compared with a threshold. This binary channel fidelity metric is then associated with the middle sample of the window (i.e., where the delay corresponds to half the window duration). With Reed-Solomon FEC, as provided previously, the “channel degraded” associated with any bits in a Reed-Solomon symbol result in that symbol being marked for erasure in the decoding process. The method described above may again be applied to enhance the time-domain precision of the channel fidelity metric.
Specifically, 7-tap delay line 609 captures 7 consecutive error power estimates at a time, and computes an average error power using the 7 captured estimates. In addition, the highest (maximum) error power of the first 4 captured estimates is determined (i.e., estimates 1 through 4), and the highest (maximum) error power of the last 4 captured estimates (i.e., estimates 4 through 7) is likewise determined. Next, a determination is made whether the average error power calculated is greater than a first threshold, and whether both maximum error powers are greater than a second threshold. If any one is not above its respective threshold, a “channel OK” indication is sent to the receiver 601. If all three are above or greater than their respective thresholds, then a “channel degraded” indication is sent to the receiver 601. This indication may be a simple 1 bit channel fidelity metric (e.g., a “1” for channel OK and a “0” for channel degraded for example). In a digital communications example, the fidelity processor 611 generates a 1-bit channel fidelity metric over time for QAM constellations, for example.
The receiver 601 receives the channel fidelity metric as illustrated by reference numeral 613 and is aware of the 4 sample or symbol delay as illustrated by reference numeral 615. Processing block 617, knowing the channel fidelity metric and the particular sample or symbol being considered from the known delay, either erases the particular sample or symbol being considered (corresponding to a “channel degraded” fidelity metric), or keeps the particular sample or symbol being considered (corresponding to a “channel OK” fidelity metric). This process is repeated so that the error power estimate corresponding to each sample or symbol is considered by the fidelity processor 611. In the embodiment illustrated in
A decoder 619, such as, for example, a Reed-Solomon Decoder, decodes the samples or symbols with erasures, as determined by the fidelity processor 611. Many different types of algorithms may be used in the fidelity processor to generate fidelity metrics. Decoded data, an estimate of the transmitted signal for example, is outputted at output 621 of the receiver 610. It is contemplated that the functionality of processing block 617 may be part of the decoder 619. It is also contemplated that means other than as shown in, or specifically discussed with respect to
In addition, while
Next, the error power of a sequence of symbols is captured as illustrated in block 707, and an average power of the captured sequence is calculated as illustrated in block 709. In addition, a maximum error power from a first portion of the captured sequence is determined as illustrated in block 711, and a maximum error power from a second portion of the sequence is likewise determined as illustrated in block 713.
The first and second portions of the sequence each include a common symbol that is the “middle” symbol of the whole sequence (i.e., the last symbol of the first portion and the first symbol of the second portion for example). In other words, for a sequence of length n, an odd number, the middle symbol may be defined by 1+(n−1)/2. It is this number that defines the symbol that is being considered as well as the symbol delay for decoding purposes. Again, as provided previously with respect to
The average error power of the sequence is then compared to a first threshold as illustrated in block 715. If the average is not above the first threshold, the common symbol is kept as illustrated in block 717; otherwise, the maximum error power of the first portion of the sequence is compared to a second threshold as illustrated in block 719. If that first maximum is not above the second threshold as illustrated in block 719, the common symbol is kept as illustrated in block 717; otherwise, the maximum error power of the second portion of the sequence is compared to the second threshold as illustrated in block 721. If that second maximum is not above the first threshold, the common symbol is kept; otherwise, the common symbol is erased. In any case, the decision of whether to erase or keep the common symbol is communicated to the decoder as illustrated in block 725. The process is then repeated, so that each symbol received is at some point considered (i.e., each received symbol is the common symbol for one iteration of the process).
For a 16 QAM constellation example having a constellation RMS power of 3.162 (i.e., the square root of 10) and, for example, a 7-symbol sequence, the first threshold may be 0, and the second threshold may be 0.64, for example. Of course, the second threshold may be set to 0, such that just the average error power of the whole sequence is used.
While the decisions made by blocks 715, 719, and 721 of
Another specific example illustrating applying the channel fidelity metric to enhance the receiver processing follows with the summing of the error power over a sliding window. Especially with high density constellations, and with an impairment of low power or one such as gain compression, where the impairment likely does not cause the received, distorted signal to fall outside the normal signaling constellation, the fidelity processor may determine the presence of the impairment, but a significant fraction of the error power estimates may be rather small (since the received signal falls close to one of the many wrong symbols). In such instances, even using convolutional coding FEC and traditional Viterbi decoding, the branch metrics in the decoding process are not the most accurate reflection of the state of the channel fidelity when they are simply the error power estimates or log of error power estimates (for each symbol) from the slicer. Knowing that a degraded channel condition existed even when a signal was received “close” to a constellation point may be very beneficially used in the decoding, especially when “channel interleaving” is performed prior to the decoding, thus dispersing the impacted symbols.
Once such branch metrics are created as illustrated in block 907, the branch metrics are modified based on the channel fidelity estimate as illustrated in block 909. For example, the branch metric may be set to a low probability value if the channel fidelity is determined to be poor. Finally, decoding (e.g., Viterbi) is performed using the modified branch metric as illustrated in block 911. This overall process may then be repeated.
As mentioned above, various embodiments of the present invention provide for a fidelity processor that examines a sliding window of error power estimates to yield a channel fidelity metric. While specific fidelity processing examples have been discussed above, still other types of fidelity processing may be employed in connection with the various embodiments of the present invention. For example, median filters or other ranking devices may be used. In a median filter, the middle ranked value within a window is output. Once again, as above, this value could be output “as is,” or quantized with various thresholds, perhaps into a single binary output.
Other forms of nonlinear filtering may also serve as useful fidelity processors. For example, the error power estimates may be quantized to a binary level with a threshold, i.e., “1” for greater than threshold and “0” for less than threshold, and these quantized samples filtered or averaged. This would simplify the “averaging” complexity, and a second threshold as described above may be applied to enhance the precision of marking the “turn on” and “turn off” of the severe impairments.
Still other types of fidelity processing may include, for example: (1) summing; (2) ranking; (3) thresholding and summing; (4) summing and twice thresholding (sum and individual points in the window); (5) quantizing the error power estimates or otherwise nonlinearly processing them (e.g., square root or log); (6) averaging across the window and taking the maximum of the average and (some factor multiplying) the middle error power estimate in the window; (7) taking the maximum of the median ranked value in the window and (some factor multiplying) the middle error power estimate in the window; (8) nonlinearly processing the error power estimates and averaging; and (9) quantizing the results from the aforementioned operations and/or nonlinearly processing them.
Furthermore, the channel fidelity metric may be used to analyze channel behavior. More specifically, the channel fidelity metric may be used to analyze for example duration and fraction of time of impaired conditions compared to unimpaired conditions, especially for determining most suitable FEC and symbol rates and constellation sizes, etc., for the dynamically varying channel. In addition, the channel fidelity metric may be applied to the receiver for beneficial use of processing signals received contemporaneously with the channel fidelity estimate. Some examples of using the channel fidelity metric to enhance receiver performance include: (1) marking Reed-Solomon symbols for erasure in a Reed-Solomon decoder capable of erasure and error correction decoding, and (2) in convolutional coded FEC (or other soft-decision decoders, such as Turbo decoding), affecting the soft-decision metric for a symbol with this additional channel fidelity metric.
This latter embodiment especially benefits from this technique if channel interleaving is performed on the symbol soft-decisions prior to the decoding. Various embodiments of the present invention are especially effective at enhancing receiver performance with severe impairment duration of multiple symbols, and with high density signaling constellations, as seen in these particular examples.
While the error power estimates provided previously above have been generated outside of the decoding process, decoding may be used to generate a potentially improved error power estimate. In other words, another method for generating the error power estimate includes actually performing a preliminary decoding (if FEC is employed), or partial decoding, and performing a better estimate of the transmitted waveform to more accurately estimate the error power. Such an approach means that there may be delays in the generation of the error power estimates, but often this is not a constraint. A second-pass at the decoding, now with the benefit of the channel fidelity metric (versus time) arising from the first-pass error power estimates, provides enhanced performance in the time-varying impairment scenario.
A fidelity processor 1013 uses the error power estimate to generate a channel fidelity metric, such as provided previously. FEC decoder 1015 uses the channel fidelity metric, along with the original, delayed input to decode the input, and output decoded data (i.e., an estimate of the transmitted signal) at output 1017. It is contemplated that the FEC decoder 1005 and FEC decoder 1015 may be separate units or devices, or combined into a single decoder.
As may be understood upon reviewing
Based on the above, various embodiments of the present invention provide means for characterizing the transitory nature of the impairments (i.e., to develop knowledge) characterizing not just typical or even average levels of an impairment, but an understanding and characterization of the dynamic behavior of the impairment. With this knowledge, it is possible to facilitate improved communications in the channel, either by adjusting the transmission signal design, or by altering or adjusting the receiver processing, or both.
If the dynamic nature of the impairments is so rapid that it transitions from benign to severe and back to benign again, faster than the receiver can determine and communicate this degradation back to the original transmitter in the channel, then any adjustments in the transmission waveform are “permanent,” in the sense that adaptation to the temporarily degraded channel is precluded by the dynamics. Still, the optimal transmission waveform may be different if and when it is learned that the channel contains some severe but transitory impairment(s). Thus, it benefits the communications system to learn and characterize the transitory nature of the impairments, leading to a superior transmit waveform with this new knowledge.
While some situations may preclude the feedback and adjustment of the transmit waveform for adapting to a temporary increase of an impairment, in such situations, the receiver may still benefit from this knowledge.
The present invention also includes alternate embodiments for detecting impacted chips (symbols, waveforms, etc.). One embodiment of the present invention relates to some kind of distortion inducing mechanism (a duration of one up to several chips), which introduces a brief, temporary distortion during the operation of a communication system similar to that described previously. This embodiment uses 128 chips to send a multiplicity of symbols simultaneously during a fraction of that frame. If the communication is subjected to a brief, temporary distortion, noise for example, the suspect (disturbed) chips are identified and blanked.
However, blanking the chip may affect the orthogonal spreading codes, such that they are no longer orthogonal. For example, if six chips are blanked out, then processing the remaining 120 of the 128 chips does not result in a zero value for the suspect chips unless the six blanked chips included three agreements and three disagreements (an unlikely occurrence). More likely, the remaining un-blanked chips contain some remnants of the suspect chips, resulting in a correlation between virtually all of the codes, which may result in ICI.
These signals are remodulated using spreading codes as illustrated by block 1312. Remodulating the signals may include putting the signals through a mass filter and taking the slicer outputs. A determination regarding the distortion or noise is made between the remodulated signal and the received signal regarding each signal as illustrated by block 1314. Such determination may include taking the missing signals, wiping them off and recreating them. Further, one or more of the techniques provided previously may be re-applied to such distortion estimate. This process may be repeated for multiple iterations. At the end of one or more passes or iterations, a set of signals (chips, symbols, waveforms, etc.) may be identified as containing or being suspected of containing elevated amounts of distortion and/or noise as illustrated by block 1316.
The illustrated method continues, blanking the samples that represent the identified suspect signals as illustrated by block 1318. In this embodiment blanking means are used to set the received signal to a value of zero for the identified suspect signals. The signals are correlated with the spreading code as illustrated by block 1320, providing an input to one or more slicers for each of the symbols in the spreading frame (128 symbols for example) as illustrated by block 1322. In one embodiment, these slicer inputs (alternatively referred to as “blanked slicer inputs”) may be corrupted due to the intercode interference or ICI introduced into the inputs by blanking the one or more signals. It is contemplated that the set of spreading codes are orthogonal (thus having zero ICI) only when at least one but up to all 128 signals are correlated.
A hard decision is made on each signal using at least one but up to 128 of the slicer inputs as illustrated by block 1324, even though such slicer inputs may contain ICI due to blanking. Such hard decisions are then used in a Partial Remodulator (alternatively referred to as “PRM”) wherein the composite transmitted value is reconstructed for each of the blanked signals, forming Partially Remodulated Energy (alternatively referred to as “PRME”) as illustrated by block 1326. In one embodiment, this assumes that such hard decisions are the actual transmitted signals. The PRME is correlated with the blanked positions or signals for each of the spreading codes, and at least one but up to 128 partial correlation results (alternatively referred to as “Partial Correlation Results” or “PRCs”) are added to the previously obtained blanked slicer inputs as illustrated by block 1328. This new set of at least one but up to 128 slicer inputs (alternatively referred to as “First Iteration Blanking-Repaired” or “1st IBR” slicer inputs, is then “hard decisioned.” This blanking-repaired set of decisions may be used as the receiver hard decisions. However, in another embodiment the process may continue with at least one more iteration.
In a second iteration, the hard decisions from the 1st IBR slicer inputs are used in the PRM and the resulting PRME is correlated with the blanked positions or signals. This set of at least one but up to 128 partial correlation results (alternatively referred to as “2nd PRCs”) is added to the blanked slicer inputs. In one embodiment, the 2nd PRCs are added to the original blanked slicer inputs. This addition results in at least one but up to 128 new slicer inputs (alternatively referred to as the “2nd IBR slicer inputs”). These are 2nd IBR slicer inputs are “hard decisioned.” These latest hard decisions may be the final hard decisions, or another iteration may be performed.
In subsequent iterations, the hard decisions from the Nth IBR slicer inputs are again passed to the PRM, and the resulting PRME is correlated with the blanked signals or chip positions, yielding N+1st PRCs. In one embodiment, the N+1st PRCs are added to the original blanked slicer inputs, producing N+1st IBR slicer inputs. Such N+1st IBR slicer inputs may again be “hard decisioned.” This blanking-repaired set of decisions may again be used as the receiver hard decisions.
The process may, in one embodiment, continue for a specific set of iterations (one or two iterations for example), or end when stability is reached. In one or more embodiments of the present invention, stability is defined as reaching the same hard decisions in two successive iterations; however other ending criteria are contemplated. It is also possible to execute one or more of the previously described iterations and use such hard decisions as feedback to a burst noise estimator (not shown). Such burst noise estimator may used to refine the estimate of which signals or chips were indeed impacted by increased distortion/noise. Then the iterative processing may start anew, with new blanked signals, chip positions, or waveforms.
As provided previously, one embodiment of the present invention relates to a mitigation process using orthogonal decomposition of individual chips, signals, waveforms, etc. It is contemplated that this invention may be applicable to any set of orthogonal waveforms spanning the time-frequency signal space. In such an embodiments, the received waveform is decomposed into the various components of the new basis set. Any distorted or noisy dimensions are estimated (similar to that provided previously using a “dimension component” replacing the chips for example). These distorted/noisy dimensions are blanked, and the time-domain waveforms regenerated but without such distorted/noisy dimensions. The time-domain waveforms are correlated with each of the spreading codes, providing the blanked slicer inputs. The PRM takes the hard decisions using such blanked slicer inputs, computing the PRME needed to be reintroduced due to the elimination of some of the signal space dimensions. The iterations continue just as above, except in this embodiment the transfer from chip samples to the desired basis set and back again must be included in the processing.
The impulse noise detection block 1408 communicatively couples to the signal level block 1404 and to the moving average window block 1406. The impulse noise detection block 1408 is operable to receive the signal level 1414 of each chip 1412 of the plurality of chips in the spreading interval and to receive the composite signal level 1416 corresponding to each chip 1412 of the plurality of chips. The impulse noise detection block 1408 is further operable to produce an erasure indication 1420 for each chip of the plurality of chips of the corresponding chip window. This is a particular embodiment of the “Channel OK” or “Channel Degraded” decision indicated in
The erasure indication 1420 of
The impulse noise detection block 1408 includes comparators 1508, 1520, and 1526. Comparator 1526 compares the signal level of the chip 1414 to a first threshold 1528 to produce a first result. The first result inputs to shift register 1530, which provides a three-chip shift delay operation. A second comparator 1520 compares the composite signal level 1416 of the plurality of chips of the chip window to a second threshold 1522 to produce a second comparison result. The second comparison result is received into three-element shift register 1524. A third comparator 1508 compares the composite signal level 1416 of the plurality of chips of the corresponding chip window to a third threshold 1510 to produce a third comparison result. The output of comparator 1508 is received by shift register 1512, which compares the third comparison results of adjacent chips. A summation element 1514 having positive and negative inputs from the shift register 1512 produces a fourth comparison result based upon third comparison results of adjacent chips. This fourth comparison result is received by shift register 1516, which has two delay elements. Further, element 1518 receives the fourth comparison result and produces an output based upon the fourth comparison result. The output of element 1518 and shift registers 1516, 1524, and 1530 is received by combinational logic and shift register block 1532. This block 1532 includes a plurality of logic gates and a shift register 1534 and produces as its output the erasure indication 1420 to combiner 1410. The combiner 1410 also receives the output of the delay block 1402 and produces its output 1422 based upon these two inputs.
Operation continues in comparing the signal level of the chip to a first threshold to produce a first comparison result (step 1606). Then, operation continues by determining the composite signal level of a plurality of chips of a chip window of the spreading interval (step 1608). Next, operation continues with comparing the composite signal level of the plurality of chips of the chip window to a second threshold to produce a second comparison result (step 1610). Finally, the operation for the particular chip includes keeping or erasing the chip based upon the first comparison result and the second comparison result (step 1610). Operation from step 1612 returns to step 1602 where a next chip is considered. In keeping or erasing the chip based upon the first comparison result and the second comparison result at step 1612, operation may include passing the plurality of kept chips or erased chips to a coupled decoder, to a coupled despreader, or to a coupled combiner.
The operation at step 1606 may include magnitude-squaring a measured level of each chip of the plurality of chips of the chip window to produce a corresponding plurality of the signal levels.
The operation of step 1608 may include summing a corresponding plurality of signal levels to produce a signal level summation result and then averaging the signal level summation result to produce the composite signal level. This composite signal level is then compared to the second threshold at step 1608.
According to various embodiments of step 1612, the chip is erased when either the first comparison result or the second comparison result is unfavorable, the chip is erased only when both the first comparison result and the second comparison result are unfavorable, or based upon some other combination of the first comparison result on the second comparison result.
The kept or erased chips 1422 are received by a despreader 1806, which despreads such chips across the spreading interval to produce a reconstructed symbol 1812. The reconstructed symbols 1812 may be received by a successive interference cancellation block 1808 that will further operate to remove interference or ingress noise from the received symbol or sequence of symbols. Examples of such successive interference cancellation devices were previously described with reference to
Many modifications and variations of the present invention are possible in light of the above teachings. Thus, it is to be understood that, within the scope of the appended claims, the invention may be practiced otherwise than as described hereinabove.
The present U.S. Utility Patent Application claims priority pursuant to 35 U.S.C. §120, as a continuation, to the following U.S. Utility Patent Application which is hereby incorporated herein by reference in its entirety and made part of the present U.S. Utility Patent Application for all purposes: 1. U.S. application Ser. No. 12/110,305, entitled “Chip blanking and processing in SCDMA to mitigate impulse and burst noise and/or distortion”, filed Apr. 26, 2008, and scheduled to issue as U.S. Pat. No. 7,602,839 on Oct. 13, 2009, which claims priority pursuant to 35 U.S.C. 120 as a continuation, to the following U.S. Utility Patent Application which is hereby incorporated herein by reference in its entirety and made part of the present U.S. Utility Patent Application for all purposes: 2. U.S. application Ser. No. 10/962,803, entitled “Chip blanking and processing in SCDMA to mitigate impulse and burst noise and/or distortion,” filed Oct. 12, 2004, that issues as U.S. Pat. No. 7,366,258 on Apr. 29, 2008, which claims priority pursuant to 35 U.S.C. §120, as a continuation-in-part, to the following U.S. Utility Patent Application which is hereby incorporated herein by reference in its entirety and made part of the present U.S. Utility Patent Application for all purposes: 3. U.S. application Ser. No. 10/136,059, entitled “Chip blanking and processing in SCDMA to mitigate impulse and burst noise and/or distortion,” filed Apr. 30, 2002 now U.S. Pat. No. 7,236,545 B2, issued on Jun. 26, 2007, which claims priority pursuant to 35 U.S.C. §120, as a continuation-in-part, to the following U.S. Utility Patent Application which is hereby incorporated herein by reference in its entirety and made part of the present U.S. Utility Patent Application for all purposes: 4. U.S. application Ser. No. 10/000,415, entitled “Detection and mitigation of temporary impairments on a communications channel,” filed Nov. 2, 2001 now U.S. Pat. No. 7,308,050 B2, issued on Dec. 11, 2007, which claims priority pursuant to 35 U.S.C. §119(e) to the following U.S. Provisional patent application which is hereby incorporated herein by reference in its entirety and made part of the present U.S. Utility Patent Application for all purposes: 5. U.S. Provisional Application Ser. No. 60/296,884, entitled “Detection and mitigation of temporary impairments on a communications channel,” filed Jun. 8, 2001.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4928288 | D'Aria et al. | May 1990 | A |
| 5432822 | Kaewell, Jr. | Jul 1995 | A |
| 5606569 | MacDonald et al. | Feb 1997 | A |
| 6366605 | Schilling | Apr 2002 | B1 |
| 6490705 | Boyce | Dec 2002 | B1 |
| 6721373 | Frenkel et al. | Apr 2004 | B1 |
| 7173972 | Thomson et al. | Feb 2007 | B2 |
| 7254771 | Song et al. | Aug 2007 | B1 |
| 7602839 | Kolze et al. | Oct 2009 | B2 |
| Number | Date | Country | |
|---|---|---|---|
| 20100229075 A1 | Sep 2010 | US |
| Number | Date | Country | |
|---|---|---|---|
| 60296884 | Jun 2001 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 12110305 | Apr 2008 | US |
| Child | 12575740 | US | |
| Parent | 10962803 | Oct 2004 | US |
| Child | 12110305 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 10136059 | Apr 2002 | US |
| Child | 10962803 | US | |
| Parent | 10000415 | Nov 2001 | US |
| Child | 10136059 | US |
