Adaptive frequency-domain reference noise canceller for multicarrier communications systems

Information

  • Patent Grant
  • 9160381
  • Patent Number
    9,160,381
  • Date Filed
    Friday, December 6, 2013
    11 years ago
  • Date Issued
    Tuesday, October 13, 2015
    9 years ago
Abstract
A method and apparatus to align data blocks in a data signal and a reference signal to increase cross-correlation between the data signal and the reference signal as compared to the unaligned data and reference signals and cancel interference in the data signal in the frequency-domain under changing conditions and in the presence of the data signal.
Description
BACKGROUND OF THE INVENTION

1. Field of the Invention


This invention relates generally to a multi-carrier communication system and, in particular, to noise cancellation in a multi-carrier communication system.


2. Background Art


A multi-carrier communication system, such as a Discrete Multi-Tone (DMT) system in the various types of Digital Subscriber Line (DSL), for example, asymmetric digital subscriber line (ADSL) and very high-speed digital subscriber line (VDSL) systems, carries an information bit stream from a transmitter to a receiver. The information bit stream is typically converted into a sequence of data symbols having a number of tones. Each tone may be a group of one or more frequencies defined by a center frequency and a set bandwidth. The tones are also commonly referred to as sub-carriers or sub-channels. Each tone acts as a separate communication channel to carry information between a local transmitter-receiver (transceiver) device and a remote transceiver device.


BRIEF SUMMARY OF THE INVENTION


FIG. 1 is a block diagram illustrating a conventional DMT receiver. A channel equalizer is used to control the spread of the data symbols after going through the channel A cyclic prefix (CP) may be employed in such systems to simplify channel equalization to minimize a source of cross channel interference. Generally, if the length of the channel impulse response is equal to or less than the cyclic prefix length plus one sample, then channel equalization is trivial and perfect equalization can be achieved. The channel can be inverted in the frequency domain after a discrete Fourier transform (DFT) by a single complex multiply for each sub-channel. This is usually referred to as frequency-domain equalization (FEQ).


On transmission lines in DMT communication systems, such as ADSL or VDSL, the data signal is generally transmitted differentially. Interference such as radio-frequency interference (RFI), crosstalk and impulse noise electromagnetically couples into both the common mode and the differential mode of such transmission lines. In the case of a binder containing multiple transmission lines, such interference may couple into some or all of the transmission line in the binder and such noise may be correlated between lines.


Conventional techniques for reducing differential noise, thereby improving data rates over the DSL, include use of common-mode information. In a traditional DSL system, the common-mode voltage is measured, an estimate of the differential-mode interference is constructed and the interference estimate is subtracted from the desired signal.


Traditional cancellation may occur in the time-domain or the frequency domain. For example, frequency bands containing RFI are band-pass filtered and then subtracted from the differential-mode signal in the time domain. In the frequency domain, a small set of frequency bins are used to compute and remove an estimate of RFI on a larger number of data carrying frequency bins. Other conventional systems cancel crosstalk in both the time domain and the frequency domain by solving a specific set of equations.


However, there are significant drawbacks associated with filtering and subtracting an interference estimate in the time-domain. For example, training and updating the noise estimation unit is difficult, especially in the presence of a data signal. Furthermore, time-domain subtraction tends to result in noise enhancement. A reduction in the power spectral density (PSD) of the interference may be achieved over parts of the frequency band where the interference is strongest, but interference PSD enhancement may occur in other frequency regions, resulting in sub-optimal system performance.


Known frequency-domain techniques also have significant limitations. Common-mode interference may not be limited to crosstalk or RFI alone, but may be a combination of the two. There may also be wideband noise from sources other than radio transmitters (RFD or other communications systems (crosstalk) that is correlated between the common and differential modes. Conventional solutions are suited to target only crosstalk or RFI; not both. Also, the interference sources and their associated coupling transfer functions will, in general, change over time. Known cancellers do not have the ability to adapt to these changing conditions in the presence of the data signal. Furthermore, in a practical implementation, there are complications and difficulties associated with the dynamic range of both the differential-mode and common-mode signals. In implementations in which the multi-carrier communications system is an ADSL or VDSL system, there may be further complications involving interaction of the canceller with On-Line Reconfiguration (OLR), Seamless Rate Adaptation (SRA), and bitswap as defined in the various ADSL and VDSL standards. During such events the transmitted power and/or the constellation size changes for one or more sub-carriers.





BRIEF DESCRIPTION OF THE DRAWINGS/FIGURES

The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings.



FIG. 1 is a block diagram illustrating a conventional DMT receiver.



FIG. 2 is a block diagram illustrating an embodiment of a discrete multi-tone system.



FIG. 3 is a block diagram illustrating one embodiment of a receiver having an adaptive frequency-domain reference noise canceller.



FIG. 4 is a block diagram illustrating an alternative embodiment of a receiver having an adaptive frequency-domain reference noise canceller.



FIG. 5 is a block diagram illustrating a second alternative embodiment of a receiver having an adaptive frequency-domain reference noise canceller.



FIG. 6 is a flow chart illustrating one embodiment of an interference cancellation method.



FIG. 7 is a flow chart illustrating one embodiment of a block alignment adjustment method.



FIG. 8 is a block diagram illustrating one embodiment of a block aligner.





DETAILED DESCRIPTION OF THE INVENTION

In the following description, numerous specific details are set forth, such as examples of specific commands, named components, connections, number of frames, etc., in order to provide a thorough understanding of the present invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced without these specific details. In other instances, well known components or methods have not been described in detail but rather in a block diagram in order to avoid unnecessarily obscuring the present invention. Thus, the specific details set forth are merely exemplary. The specific details may be varied from and still be contemplated to be within the scope of the present invention.


Some portions of the description that follow are presented in terms of algorithms and symbolic representations of operations on data that may be stored within a memory and operated on by a processor. These algorithmic descriptions and representations are the means used by those skilled in the art to effectively convey their work. An algorithm is generally conceived to be a self-consistent sequence of acts leading to a desired result. The acts are those requiring manipulation of quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, parameters, or the like.


The following detailed description includes several modules, which will be described below. These modules may be implemented by hardware components, such as logic, or may be embodied in machine-executable instructions, which may be used to cause a general-purpose or special-purpose processor programmed with the instructions to perform the operations described herein. Alternatively, the operations may be performed by a combination of hardware and software.


Embodiments of a method and apparatus are described to cancel interference in a multi-carrier communications system. In one embodiment, a data signal and a reference signal are received at a receiver. The reference signal is obtained by measuring a common-mode or differential-mode voltage. A block aligner is used to align data blocks in the data and reference signals to increase cross-correlation between the data signal and the reference signal as compared to the unaligned data and reference signals. The aligned time-domain signals are transformed to the frequency-domain where interference cancellation occurs. A tone-by-tone canceller includes a decision feedback mechanism to adapt the canceller under changing conditions in the presence of the data signal in the frequency-domain.



FIG. 2 is a block diagram illustrating an embodiment of a discrete multi-tone system. The discrete multi-tone system 200, such as a Digital Subscriber Line (DSL) based network, may have two or more transceivers 202 and 204, such as a DSL modem in a set top box. In one embodiment, the set top box may be a stand-alone DSL modem. In one embodiment, for example, the set top box employs a DSL modem along with other media components to combine television (Internet Protocol TV or satellite) with broadband content from the Internet to bring the airwaves and the Internet to an end user's TV set. Multiple carrier communication channels may communicate a signal to a residential home. The home may have a home network, such as an Ethernet. The home network may either use the multiple carrier communication signal directly, or convert the data from the multiple carrier communication signal. The set top box may also include, for example, an integrated Satellite and Digital Television Receiver, High-Definition Digital Video Recorder, Digital Media Server and other components.


The first transceiver 202, such as a Discrete Multi-Tone transmitter, transmits and receives communication signals from the second transceiver 204 over a transmission medium 206, such as a telephone line. Other devices such as telephone 208 may also connect to this transmission medium 206. An isolating filter 210 generally exists between the telephone 208 and the transmission medium 206. A training period occurs when initially establishing communications between the first transceiver 202 and a second transceiver 204.


The discrete multi-tone system 200 may include a central office, multiple distribution points, and multiple end users. The central office may contain the first transceiver 202 that communicates with the second transceiver 204 at an end user's location.


Each transmitter portion 217, 219 of the transceivers 202, 204, respectively, may transmit data over a number of mutually independent sub-channels i.e., tones. In a DMT communication system, data samples on each tone are represented as one of a set of finite number of points in a two-dimensional (2D) Quadrature Amplitude Modulation (QAM) constellation. The transmitted data in a multi-carrier system is usually represented by a point from a constellation of a finite set of possible data points, regularly distributed over a two dimensional space. Each sub-channel carries only a certain portion of data through QAM of the sub-carrier. The number of information bits loaded on each tone and the size of corresponding QAM constellation may potentially vary from one tone to another and depend generally on the relative power of signal and noise at the receiver. When the characteristics of signal and noise are known for all tones, a bit-loading algorithm may determine the optimal distribution of data bits and signal power amongst sub-channels. Thus, a transmitter portion 217, 219 of the transceivers 202, 204 modulates each sub-carrier with a data point in a QAM constellation.


It should be noted that embodiments of the present invention are described below in reference to receiver 316, which represents one embodiment of receiver 216, for ease of discussion, and that receiver 218 may operate in a similar manner as described below for receiver 316.



FIG. 3 is a block diagram illustrating one embodiment of a receiver having an adaptive frequency-domain reference noise canceller. In this embodiment, receiver 316 includes time domain filtering modules 321, 322, block aligner 323, cyclic extension (CE) removal and serial-to-parallel module 324, sample drop and serial-to-parallel module 325, fast Fourier transform (FFT) modules 326, 327, channel flattening frequency-domain equalizer (CF-FEQ) module 328, bin power normalization module 329, adders 330, 333, interference estimator module 331, gain inversion and constellation scaling (GICS) module 332, and constellation decision logic module 334. Additional modules and functionality may exist in the receiver 316 that are not illustrated so as not to obscure an understanding of embodiments of the present invention. It should be noted that the operations of one or more modules may be incorporated into or integrated with other modules.


In one embodiment, receiver 316 is implemented in a DMT communications system operating over a twisted-pair communications channel. N is a variable representing the number of tones used in the multi-carrier communication receiver. The communications system may operate in the presence of RFI, crosstalk and other interference. In this embodiment, received samples of a differential-mode primary data signal sent over the twisted pair are provided to a first time-domain filtering module 321. Additionally, a sampled reference signal is received and provided to a second time-domain filtering module 322. The reference signal is obtained by sampling the common-mode signal of the same twisted-pair as the primary data signal. In an alternative embodiment, the reference signal is obtained by sampling the differential mode interference from a second twisted-pair that is not used for data transmission. In another alternative embodiment, the primary data signal is obtained by sampling the differential voltage of a copper pair in a twisted copper quad and the reference signal is obtained by sampling the differential-mode interference from the other two wires of the twisted quad.


In this embodiment, receiver 316 is configured to operate independently of the source of the reference signal. A data signal and a reference signal are received and undergo digital time-domain filtering at modules 321 and 322 respectively. Receiver 316 further includes a block aligner module 323. Block aligner module 323 adjusts the relative alignment of the 2N-sample blocks of the primary data signal and the reference signal as needed. The block aligner module 323 may be implemented with sample-dropping capability, by programming delay First in, First out (FIFO) buffers, or by adjusting the group delay of programmable finite impulse response (FIR) filters. The block aligner module 323 aligns the blocks such that the cross correlation of the reference signal and the primary line interference signal is increased as compared to the cross correlation of the unaligned data and reference signals. For example, the increase in cross-correlation may be in a range of approximately 50 percent to over an order of magnitude. In one embodiment, the blocks are aligned such that the cross-correlation is maximized. Block aligner module 323 will be described further below, with respect to FIG. 8.


A first output of block aligner module 323 provides the aligned data signal to cyclic extension (CE) removal and serial-to-parallel module 324. A second output of block aligner module 323 provides the aligned reference signal to sample drop and serial-to-parallel module 325. Modules 324 and 325 serve to remove samples corresponding to any cyclic extension that may have been added to the data stream at the transmitter as well as convert the serial sample stream in to chunks which may be operated on in parallel.


The data signal and reference signal undergo 2N-point discrete Fourier transforms (DFT). In this embodiment, the DFT is computed efficiently by means of a fast Fourier transform (FFT) at FFT modules 326 and 327. The time-domain samples of both the data signal and the reference signal are provided to FFT modules 326 and 327 which convert the samples into frequency-domain symbols to be used by the canceller.


The output of FFT module 326 for the data signal is sent to a channel flattening frequency-domain equalizer (CF-FEQ) module 328. The CF-FEQ module normalizes the phase and power on each frequency bin of the data signal. In a traditional DMT system, at the output of the FFT, each frequency bin of the data signal undergoes an FEQ multiply that inverts the channel attenuation and phase rotation, inverts the fine gain adjustment value assigned to the bin, and adjusts for the constellation size. The result is such that the FEQ output is scaled to an integer grid for decoding. In this embodiment of the present invention, the traditional FEQ is split into a CF-FEQ module 328 and a gain inversion and constellation scaling (GICS) module 332. The two stage approach allows the data signal from the output of FFT module 326 to be normalized for computationally efficient removal of interference using integer arithmetic. It also decouples on-line reconfiguration (OLR), seamless rate adaptation (SRA) and bitswap from the reference noise canceller. That is, the reference noise canceller taps do not need to change during or after such an event.


The output of FFT module 327 for the reference signal undergoes a scaling stage in which the power on each frequency bin of the reference signal is normalized. The bin-power normalization module 329 receives the output of FFT module 327 and corrects amplitude and phase distortion in the reference signal. The bin-power normalization module 329 produces a normalized reference channel output signal Yref.


The normalized reference channel output signal Yref is provided to an interference estimator module 331. Interference estimator module 331 multiplies the reference signal Yref by a single complex tap for each frequency bin thus forming an estimate of the interference in the differential-mode signal for each bin. This estimate is subtracted from the normalized primary channel output signal Y provided by the CF-FEQ module 328. The subtraction is performed by adder 330 and results in a canceller output signal Yc. The canceller output signal Yc is provided to an input of the GICS module 332.


GIGS module 332 adjusts the signal for per-bin gain and constellation size. The GIGS module 332 produces an output signal. Xhat which is provided to an input of a constellation decision logic module 334. In the constellation decision logic module 334, the signal Xhat undergoes constellation decoding where constellation decisions are formed. The constellation decision logic module 334 may include a trellis decoder or a simple un-coded constellation decoder or slicer. Constellation decision logic module 334 produces a constellation decision signal X. The constellation decision signal X is subtracted from the GICS module output signal Xhat to form a decision error estimate E. The subtraction is performed by adder 333. The decision error estimate E is used to adaptively update the canceller taps in the interference estimator module 331. In one embodiment, a least-mean-square (LMS) algorithm is used to update the taps. In alternative embodiments, other algorithms may be used to update the taps such as a recursive least square (RLS) algorithm, a gradient computation, or other algorithm. The structure of receiver 316 allows the canceller to adapt under changing conditions, such as interference sources and their associated coupling transfer functions, and effectively cancel interference in the presence of the actual data signal.



FIG. 4 is a block diagram illustrating an alternative embodiment of a receiver 416 having an adaptive frequency-domain reference noise canceller. In this embodiment, the CF-FEQ module 328 of FIG. 3 is removed and the GIGS module 332 of FIG. 3 is replaced with FEQ module 435. FEQ module 435 receives the canceller output signal Yc at an input and provides the decoder input signal Xhat to constellation decision logic module 334. The canceller output signal Yc is obtained by subtracting the interference estimate directly from the primary channel output Y of FFT module 326. The reference signal is processed in the same manner as described above with respect to FIG. 3.



FIG. 5 is a block diagram illustrating a second alternative embodiment of a receiver having an adaptive frequency-domain reference noise canceller. In this embodiment, the CF-FEQ module 328 of FIG. 3 is replaced with FEQ module 536 and GICS module 332 of FIG. 3 is removed. FEQ module 536 receives the output of FFT module 326 at an input and provides an FEQ output signal Y to adder 330. Bin power normalization module 329 of FIG. 3 has also been removed in this embodiment. The reference channel output Yref of the FFT module 327 is directly multiplied by a single complex tap to form an interference estimate at interference estimator module 331. The interference estimate is subtracted from the FEQ output signal Y at adder 330 and the canceller output Y is provided directly to the constellation decision logic module 334.



FIG. 6 is a flow chart illustrating one embodiment of an interference cancellation method 600. The process 600 may be performed by processing logic that comprises hardware, firmware, software, or a combination thereof. In one embodiment, process 600 is performed by the receiver 316 of FIG. 3.


Referring to FIG. 6, interference cancellation method 600 reduces the interference in a data signal in a multi-carrier communications system. At block 610, method 600 aligns data blocks from a received data signal and a reference signal to increase cross correlation between the data signal and the reference signal as compared to the unaligned data and reference signals. The block alignment process will be discussed further below with respect to FIG. 7.


At block 620, method 600 drops unneeded samples corresponding to the cyclic extension of the data signal from the aligned data and reference signals. Method 600 also removes any cyclic extension that may have been added to the data stream at the transmitter as well as converts the serial sample stream in to chunks which may be operated on in parallel. At block 630, method 600 transforms the data and reference signals from the time-domain to the frequency-domain. The transformation may be accomplished with the use of a discrete Fourier transform (DFT). In one embodiment, the DFT is performed by FFT modules 326 and 327 of FIG. 3.


At block 640, method 600 normalizes the power on each frequency bin of the data and reference signals. Method 600 corrects any amplitude and phase distortion in the signal to enable efficient noise cancellation. At block 650, the data signal undergoes a constellation decision logic stage where constellation decisions are formed. The output of the constellation decision logic is subtracted from the input to form an error estimate. The error estimate is used to adaptively update canceller taps at block 660. In one embodiment, a least-mean-square (LMS) algorithm is used to update the taps. In alternative embodiments, other algorithms may be used to update the taps such as a recursive least square (RLS) algorithm, a gradient computation, or other algorithm.


At block 670, method 600 multiplies the transformed reference signal by a single complex tap for each of one or more frequency bins of the reference signal. The multiplication results in an estimate of the interference in the data signal. At block 680, method 600 subtracts the interference estimate from the data signal. The subtraction results in a canceller output signal which is then applied to an input the constellation decision logic and method 600 continues at block 650 with the new input. In this manner, method 600 is able to adaptively update the interference canceller with an interference estimate to cancel changing sources of interference during data transmission.



FIG. 7 is a flow chart illustrating one embodiment of a block alignment adjustment method 700. The process 700 may be performed by processing logic that comprises hardware, firmware, software, or a combination thereof. In one embodiment, process 700 is performed by the block aligner 323 of FIG. 3.


Referring to FIG. 7, block alignment adjustment method 700 enables alignment of data blocks from at least a received data signal and a reference signal to increase cross correlation between the data signal and the reference signal as compared to the unaligned data and reference signals. Alignment of the data blocks allows for the canceller to achieve optimal noise cancellation. At block 710, method 700 sets the block alignment to a default value. In one embodiment, the default value may be zero offset in both the data signal and the reference signal.


At block 720, method 700 collects 2N time-domain samples from each of the time domain signal and the reference signal. In one embodiment, the collection of each of the two sets of 2N samples begins at the same absolute time. This results in the 2N-sample blocks of the data signal and reference signal being roughly-aligned.


At block 730, method 700 performs cross-correlation of the data and reference signals and computes a peak offset value. Block alignment fine tuning is performed by using the cross-correlation of the interference on the data and reference signals. The measurement occurs when the data signal is not present, such as before modem training commences or at a time during modem training when the far-end transmitter is quiet. After dual 2N-sample blocks are captured at block 720, the cross correlation is computed as

(y*yref)[n]=Σjy[j]*yref*[n+j]  (1)

where y is a block of 2N samples from the data signal in the time-domain during a quiet period, yref is the corresponding block of 2N samples from the reference signal in the time-domain during the same time period, n is the peak offset between the data and reference signals and j is a counting index. The offset is found by determining the values of n for which the cross correlation (y*yref)[n] is greater than when there is no offset (i.e. n=0). In one embodiment method 700 may determine the value of n for which the cross correlation is a maximum. A range of values for n may result in increased cross correlation, however as the values become nearer the value which results in maximum cross-correlation, the efficiency of the interference cancelling increases. Method 700 selects one value of n to use as the offset in the block aligner.


At block 740, method 700 makes a determination as to whether the selected value of n is greater or less than zero. If n is greater than zero, method 700 proceeds to block 750. At block 750, method 700 adjusts the block alignment by the offset n samples. In one embodiment, method 700 increases the delay in the data signal by n samples and in an alternative embodiment, method 700 decreases the delay in the reference signal by n samples. If n is less than zero, method 700 proceeds to block 760. At block 760, method 700 adjusts the block alignment by the offset, n samples. In one embodiment, method 700 increases the delay in the reference signal by (−n) samples and in an alternative embodiment, method 700 decreases the delay in the data signal by (−n) samples. After the block alignment has been adjusted at either block 750 or 760, method 600 ends.



FIG. 8 is a block diagram illustrating one embodiment of a block aligner 823. The block aligner 823 includes two D-sample delay FIFO buffers 883, 893. A first FIFO buffer 883 is in the primary data signal path and a second FIFO buffer 893 is in the reference signal path. If the delay through both time-domain filtering blocks 321, 322 is equivalent, and the Serial-to-Parallel blocks 324, 325 are synchronized such that sample collection for each block begins at the same time on both channels, then the block aligner 823 in this form allows for a plus or minus D-sample fine-tuning delay adjustment between the primary and reference paths. In an alternative embodiment, finite impulse response (FIR) filters are used in place of FIFO buffers 883, 893. Block aligner 823 aligns the blocks of the data and reference signals such that there is an increase in the cross-correlation between the data signal and the reference signal as compared to the unaligned data and reference signals.


In one embodiment, the methods described above may be embodied onto a machine-readable medium. A machine-readable medium includes any mechanism that provides (e.g., stores and/or transmits) information in a form readable by a machine (e.g., a computer). For example, a machine-readable medium includes read only memory (ROM); random access memory (RAM); magnetic disk storage media; optical storage media; flash memory devices; DVD's, or any type of media suitable for storing electronic instructions. The information representing the apparatuses and/or methods stored on the machine-readable medium may be used in the process of creating the apparatuses and/or methods described herein.


While some specific embodiments of the invention have been shown the invention is not to be limited to these embodiments. The invention is to be understood as not limited by the specific embodiments described herein, but only by the scope of the appended claims.

Claims
  • 1. A block aligner for aligning a data block in a data signal with a data block in a reference signal, the block aligner comprising: a first buffer configured to: receive the data signal,initiate a first tuning on the data signal if a delay between the data signal and the reference signal is equivalent; anda second buffer configured to: receive the reference signal, andinitiate a second tuning on the reference signal if the delay between the data signal and the reference signal is equivalent.
  • 2. The block aligner of claim 1, wherein the first buffer and the second buffer are first-in-first-out (FIFO) buffers.
  • 3. The block aligner of claim 1, wherein the first buffer and the second buffer are D-sample delay FIFO buffers.
  • 4. The block aligner of claim 1, wherein the first buffer is configured to initiate the first tuning on the data signal to change a cross-correlation between the data signal and the reference signal.
  • 5. The block aligner of claim 1, wherein the second buffer is configured to initiate the second tuning on the reference signal to change a cross-correlation between the data signal and the reference signal.
  • 6. The block aligner of claim 1, further comprising: a first time domain filtering block coupled to the first buffer, wherein the first time domain filtering block is configured to send the data signal to the first buffer; anda second time domain filtering block coupled to the second buffer, wherein the second time domain filtering block is configured to send the reference signal to the second buffer.
  • 7. The block aligner of claim 1, further comprising: a first serial-to-parallel block coupled to the first buffer, wherein the first buffer is further configured to send a tuned data signal to the first serial-to-parallel block; anda second serial-to-parallel block coupled to the second buffer, wherein the second buffer is further configured to send a tuned reference signal to the second serial-to-parallel block.
  • 8. The block aligner of claim 7, wherein the first serial-to-parallel block and the second serial-to-parallel block are synchronized such that sample collection of the first serial-to-parallel block and the second serial-to-parallel block begins at a same time.
  • 9. The block aligner of claim 1, wherein the first buffer is further configured to: initiate cancelling interference in the data signal based on the first tuning.
  • 10. The block aligner of claim 1, wherein the second buffer is further configured to: initiate cancelling interference in the reference signal based on the second tuning.
  • 11. A block alignment adjustment method, comprising: collecting, using a receiver device, a plurality of first samples from a data signal;collecting, using the receiver device, a plurality of second samples from a reference signal;cross-correlating, using the receiver device, the plurality of first samples and the plurality of second samples; andcancelling, using the receiver device, interference in the plurality of first samples and the plurality of second samples by tuning the plurality of first samples and the plurality of second samples based on the cross-correlating.
  • 12. The block alignment adjustment method of claim 11, wherein the plurality of first samples and the plurality of second samples are collected simultaneously.
  • 13. The block alignment adjustment method of claim 11, further comprising: computing a peak offset value based on the cross-correlating.
  • 14. An apparatus, comprising: a receiver configured to receive a plurality of first samples from a data signal and a plurality of second samples from a reference signal; anda block aligner, coupled to the receiver, configured to: cross-correlate the plurality of first samples and the plurality of second samples, andcancel interference in the plurality of first samples and the plurality of second samples by tuning the plurality of first samples and the plurality of second samples based on the cross-correlated plurality of first samples and plurality of second samples.
  • 15. The apparatus of claim 14, wherein the plurality of first samples and the plurality of second samples are collected simultaneously.
  • 16. The apparatus of claim 14, wherein the block aligner is further configured to compute a peak offset value based on the cross-correlating.
  • 17. The apparatus of claim 14, further comprising: a first buffer configured to initiate a first tuning on the data signal if a delay between the data signal and the reference signal is equivalent; anda second buffer configured to initiate a second tuning on the reference signal if the delay between the data signal and the reference signal is equivalent.
  • 18. The apparatus of claim 17, wherein the first buffer is configured to initiate the first tuning on the data signal to change a cross-correlation between the data signal and the reference signal.
  • 19. The apparatus of claim 17, wherein the second buffer is configured to initiate the second tuning on the reference signal to change a cross-correlation between the data signal and the reference signal.
  • 20. The apparatus of claim 14, wherein the block aligner is further configured to align the plurality of first samples and the plurality of second samples such that cross-correlation between the plurality of first samples and the plurality of second samples is maximized.
CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 12/287,577, filed Oct. 10, 2008, assigned U.S. Pat. No. 8,605,837, which is hereby incorporated by reference in its entirety.

US Referenced Citations (220)
Number Name Date Kind
4009371 Hamilton et al. Feb 1977 A
4024359 De Marco et al. May 1977 A
4024360 Biraghi et al. May 1977 A
4173714 Bloch et al. Nov 1979 A
4384355 Wemer May 1983 A
4679227 Hughes-Hartogs Jul 1987 A
4733389 Puvogel Mar 1988 A
4845466 Hariton et al. Jul 1989 A
4882733 Tanner Nov 1989 A
4977591 Chen et al. Dec 1990 A
5285474 Chow et al. Feb 1994 A
5304940 Harasawa et al. Apr 1994 A
5479447 Chow et al. Dec 1995 A
5483551 Huang et al. Jan 1996 A
5524125 Tsujimoto Jun 1996 A
5555274 Sheets Sep 1996 A
5559890 Obermeier et al. Sep 1996 A
5596258 Kimura et al. Jan 1997 A
5596439 Dankberg et al. Jan 1997 A
5627859 Parr May 1997 A
5703904 Langberg Dec 1997 A
5768473 Eatwell et al. Jun 1998 A
5790550 Peeters et al. Aug 1998 A
5815538 Grell et al. Sep 1998 A
5818872 Gupta Oct 1998 A
5844940 Goodson et al. Dec 1998 A
5852630 Langberg et al. Dec 1998 A
5867539 Koslov Feb 1999 A
5901205 Smith et al. May 1999 A
5909178 Balch et al. Jun 1999 A
5930268 Kurby et al. Jul 1999 A
5952914 Wynn Sep 1999 A
5974098 Tsuda Oct 1999 A
5978373 Hoff et al. Nov 1999 A
5978760 Rao et al. Nov 1999 A
6006083 Tong et al. Dec 1999 A
6014376 Abreu et al. Jan 2000 A
6052420 Yeap et al. Apr 2000 A
6118769 Pries et al. Sep 2000 A
6147963 Walker et al. Nov 2000 A
6161209 Moher Dec 2000 A
6185429 Gehrke et al. Feb 2001 B1
6205220 Jacobsen et al. Mar 2001 B1
6205410 Cai Mar 2001 B1
6212227 Ko et al. Apr 2001 B1
6226322 Mukherjee May 2001 B1
6256326 Kudo Jul 2001 B1
6266347 Amrany et al. Jul 2001 B1
6266422 Ikeda Jul 2001 B1
6295323 Gabara Sep 2001 B1
6330275 Bremer Dec 2001 B1
6345071 Hamdi Feb 2002 B1
6351509 Vitenberg et al. Feb 2002 B1
6359926 Isaksson et al. Mar 2002 B1
6363109 Polley et al. Mar 2002 B1
6378234 Luo Apr 2002 B1
6396827 Paivike et al. May 2002 B1
6411657 Verbin et al. Jun 2002 B1
6433819 Li et al. Aug 2002 B1
6445773 Liang et al. Sep 2002 B1
6456673 Wiese et al. Sep 2002 B1
6459739 Vitenberg Oct 2002 B1
6466588 Michaels Oct 2002 B1
6493395 Nordstrom et al. Dec 2002 B1
6498808 Tzannes Dec 2002 B1
6507608 Norrell Jan 2003 B1
6519291 Dagdeviren et al. Feb 2003 B1
6542028 Norrell et al. Apr 2003 B1
6546025 Dupuy Apr 2003 B1
6556635 Dehghan Apr 2003 B1
6597732 Dowling Jul 2003 B1
6608864 Strait Aug 2003 B1
6621346 Nabicht et al. Sep 2003 B1
6631175 Harikumar et al. Oct 2003 B2
6633545 Milbrandt Oct 2003 B1
6647070 Shalvi et al. Nov 2003 B1
6674795 Liu et al. Jan 2004 B1
6690666 Norrell et al. Feb 2004 B1
6721394 Murphy et al. Apr 2004 B1
6731914 Creigh et al. May 2004 B2
6738418 Stiscia et al. May 2004 B1
6754170 Ward Jun 2004 B1
6763061 Strait et al. Jul 2004 B1
6775241 Levin Aug 2004 B1
6791995 Azenkot et al. Sep 2004 B1
6798735 Tzannes et al. Sep 2004 B1
6822998 Yun et al. Nov 2004 B1
6826404 Delfs et al. Nov 2004 B2
6839429 Gaikwad et al. Jan 2005 B1
6859488 Azenkot et al. Feb 2005 B2
6871066 Khullar et al. Mar 2005 B1
6888497 King et al. May 2005 B2
6898236 Sun May 2005 B1
6934345 Chu et al. Aug 2005 B2
6940973 Yeap et al. Sep 2005 B1
6965636 DesJardins et al. Nov 2005 B1
6999504 Amrany et al. Feb 2006 B1
6999507 Jin Feb 2006 B2
7023910 Norrell Apr 2006 B1
7031669 Vaidyanathan et al. Apr 2006 B2
7035661 Yun Apr 2006 B1
7085315 Kelton Aug 2006 B1
7085539 Furman Aug 2006 B2
7120211 Shmulyian et al. Oct 2006 B2
7155007 Upton Dec 2006 B1
7174022 Zhang et al. Feb 2007 B1
7177419 Sedarat et al. Feb 2007 B2
7184467 Jacobsen et al. Feb 2007 B2
7200196 Li et al. Apr 2007 B2
7215727 Yousef et al. May 2007 B2
7221722 Thomas et al. May 2007 B2
7240252 Fessler et al. Jul 2007 B1
7260117 Long et al. Aug 2007 B2
7283509 Moon et al. Oct 2007 B2
7283598 Akita et al. Oct 2007 B2
7302379 Cioffi et al. Nov 2007 B2
7315592 Tsatsanis et al. Jan 2008 B2
7315967 Azenko et al. Jan 2008 B2
7330544 D'Angelo et al. Feb 2008 B2
7356049 Rezvani Apr 2008 B1
7366258 Kolze et al. Apr 2008 B2
7369607 Sedarat May 2008 B2
7421015 Sedarat Sep 2008 B2
7433395 Sedarat Oct 2008 B2
7443916 Sedarat et al. Oct 2008 B2
7502336 Romano et al. Mar 2009 B2
7529984 Heise May 2009 B2
7555037 Sedarat Jun 2009 B2
7630489 Oksman et al. Dec 2009 B2
7773666 Belge et al. Aug 2010 B2
7813439 Norrell et al. Oct 2010 B2
7822005 Ptasinski et al. Oct 2010 B2
7852950 Sedarat Dec 2010 B2
7953163 Wiese May 2011 B2
8194722 Norrell Jun 2012 B2
8340279 Jagannathan et al. Dec 2012 B2
8605837 Wiese et al. Dec 2013 B2
20010009850 Kushige Jul 2001 A1
20010011019 Jokimies Aug 2001 A1
20010055332 Sadjadpour et al. Dec 2001 A1
20020001340 Shenoi et al. Jan 2002 A1
20020044597 Shively et al. Apr 2002 A1
20020057713 Bagchi et al. May 2002 A1
20020078247 Lu et al. Jun 2002 A1
20020080862 Ali Jun 2002 A1
20020122515 Bodenschatz Sep 2002 A1
20020154620 Azenkot et al. Oct 2002 A1
20020163959 Haddad Nov 2002 A1
20030021240 Moon et al. Jan 2003 A1
20030035469 Frank et al. Feb 2003 A1
20030043925 Stopler et al. Mar 2003 A1
20030048368 Bosco et al. Mar 2003 A1
20030055996 Mori et al. Mar 2003 A1
20030091053 Tzannes et al. May 2003 A1
20030099285 Graziano et al. May 2003 A1
20030099286 Graziano et al. May 2003 A1
20030099350 Bostoen et al. May 2003 A1
20030108094 Lai et al. Jun 2003 A1
20030112860 Erdogan Jun 2003 A1
20030112887 Sang et al. Jun 2003 A1
20030124983 Parssinen et al. Jul 2003 A1
20030185176 Lusky et al. Oct 2003 A1
20030206579 Bryant Nov 2003 A1
20030227967 Wang et al. Dec 2003 A1
20040057502 Azenkot et al. Mar 2004 A1
20040066865 Yousef et al. Apr 2004 A1
20040071240 Betts Apr 2004 A1
20040085987 Gross et al. May 2004 A1
20040087278 Lin et al. May 2004 A1
20040091025 Sindhushayana et al. May 2004 A1
20040111345 Chuang et al. Jun 2004 A1
20040125015 King et al. Jul 2004 A1
20040141548 Shattil Jul 2004 A1
20040156441 Peeters et al. Aug 2004 A1
20040176063 Choi Sep 2004 A1
20040185852 Son et al. Sep 2004 A1
20040213170 Bremer Oct 2004 A1
20040223449 Tsuie et al. Nov 2004 A1
20050041753 Cunningham Feb 2005 A1
20050047489 Yousef et al. Mar 2005 A1
20050047514 Bolinth et al. Mar 2005 A1
20050053229 Tsatsanis et al. Mar 2005 A1
20050094550 Huh et al. May 2005 A1
20050099967 Baba May 2005 A1
20050111561 Sedarat et al. May 2005 A1
20050143008 Bailey Jun 2005 A1
20050159128 Collins et al. Jul 2005 A1
20050169357 Sedarat Aug 2005 A1
20050190825 Sedarat Sep 2005 A1
20050190848 Kiyanagii et al. Sep 2005 A1
20050190871 Sedarat Sep 2005 A1
20050216441 Thomas et al. Sep 2005 A1
20050271129 Reina Dec 2005 A1
20050276355 Chow et al. Dec 2005 A1
20060002457 Romano et al. Jan 2006 A1
20060019687 Garg et al. Jan 2006 A1
20060039550 Chadha et al. Feb 2006 A1
20060056305 Oksman et al. Mar 2006 A1
20060062379 Sedarat et al. Mar 2006 A1
20060067388 Sedarat et al. Mar 2006 A1
20060078044 Norrell et al. Apr 2006 A1
20060083321 Sedarat Apr 2006 A1
20060083322 DesJardins et al. Apr 2006 A1
20060083323 DesJardins et al. Apr 2006 A1
20060083324 DesJardins et al. Apr 2006 A1
20060115030 Erving et al. Jun 2006 A1
20060126747 Wiese Jun 2006 A1
20060171480 Erving et al. Aug 2006 A1
20060193390 Sedarat Aug 2006 A1
20060203843 Liu Sep 2006 A1
20060222098 Sedarat et al. Oct 2006 A1
20060227913 Sedarat Oct 2006 A1
20060253515 Sedarat Nov 2006 A1
20060291537 Fullerton et al. Dec 2006 A1
20070002940 Zhou Jan 2007 A1
20070183526 Norrell et al. Aug 2007 A1
20070217492 Cox et al. Sep 2007 A1
20080232444 Tzannes Sep 2008 A1
20080317110 Sedarat Dec 2008 A1
20110206104 Wiese et al. Aug 2011 A1
Foreign Referenced Citations (7)
Number Date Country
0 377 965 Jul 1989 EP
0 844 758 May 1998 EP
0 966 134 Dec 1999 EP
1 388 944 Feb 2004 EP
1 389 846 Feb 2004 EP
WO 2006042274 Apr 2006 WO
WO 2010042350 Apr 2010 WO
Non-Patent Literature Citations (102)
Entry
Ahmed, Nadeem, et al., “Optimal Transmit Spectra for Communication in the Presence of Crosstalk and Imperfect Echo Cancellation,” IEEE Globecom, pp. 364-368, Nov. 2001.
Al-Dhahir, Naofal, et al., “Optimum Finite-Length Equalization for Multicarrier Transceivers,” IEEE Transactions on Communications, vol. 44, No. 1, pp. 56-64, Jan. 1996.
Armada, Ana Garcia, et al., “Mulit-User Constant-Energy Bit Loading for M-PSK-Modulated Orthogonal Frequency Division Multiplexing,” IEEE Wireless Communications and Networking Conference, pp. 526-530, Copyright 2002.
Arslan, G., et al., “Equalization for Discrete Multitone Transceivers to Maximize Bit Rate,” IEEE Transactions on Signal Processing, vol. 49, No. 12, pp. 3123-3135, Dec. 2001.
Baccarelli, Enzo, et al., “Novel Efficient Bit-Loading Algorithms for Peak-Energy Limited ADSL-Type Multicarrier Systems,” IEEE Transactions on Signal Processing, vol. 50, No. 5, pp. 1237-1247, May 2002.
Barreto, Andre Noll, et al., “Adaptive Bit Loading for Wireless OFDM Systems,” IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications, pp. G-88-G-92, Oct. 2001.
Bingham, John A.C., et al., “Multicarrier Modulation for Data Transmission: An Idea Whose Time Has Come,” IEEE Communications Magazine, pp. 5-8, 11-14, May 1990.
Blahut, Richard E., “Theory and Practice of Error Control Codes,” ISBN No. 0-201-10102-5, Chapter 7: Bose-Chaudhuri-Hocquenghem Codes, pp. 161-206, Copyright 1984.
Blahut, Richard E., Theory and Practice of Error Control Codes, ISBN No. 0-201-10102-5, Chapter 11: Fast Algorithms, pp. 308-346, Copyright 1984.
Campello, Jorge, “Optimal Discrete Bit Loading for Multicarrier Modulation Systems,” IEEE International Symposium on Information Theory, Cambridge, MA, p. 193, Aug. 1998.
Chow, Peter S., et al., “A Practical Discrete Multitone Transceiver Loading Algorithm for Data Transmission Over Spectrally Shaped Channels,” IEEE Transactions on Communications, vol. 43, No. 2, pp. 773-775, 1995.
Cioffi, J. et al., “Analog RF Cancelation with SDMT (96-084),” T1E1.4/96-084 Contribution, Amati Communications Corporation, pp. 1-9, Apr. 22, 1996.
Cioffi, J.M. et al., “Generalized Decision-Feedback Equalization for Packet Transmission with ISI and Gaussian Noise,” In Communications, Computation, Control, and Signal Processing, a Tribute to Thomas Kailath, Kluwer Academic Publishers, pp. 79-127, 1997.
Communication pursuant to Rules 109 and 110 EPC, for European Patent Appl. No. 05806662.2-1525, 2 pages, dated May 21, 2007.
Communication pursuant to Article 94(3), EPC, for European Patent Appl. No. 05806662.2-1525, 4 pages, dated Feb. 26, 2008.
Draft Standard—Network and Customer Installation Interfaces—Asymmetric Digital Subscriber Line (ADSL) Metallic Interface, Draft American National Standard for Telecommunications, Alliance for Telecommunications Industry Solutions, Doc. No. T1.413-1998, pp. 1-248, Nov. 30-Dec. 4, 1998.
Farhang-Boroujeny, Behrouz, et al., “Design Methods for Time-Domain Equalizers in DMT Transceivers,” IEEE Transactions on Communications, vol. 49, No. 3, pp. 554-562, Mar. 2001.
Fischer, Robert F.H., et al., “A New Loading Algorithm for Discrete Multitone Transmission,” IEEE Globecom, pp. 724-728, 1996.
Franklin, Curt, “How DSL Works,” How Stuff Works, printed Nov. 16, 2004 from http://computer.howstuffworks.com/dsl.htm/printable, 6 pages.
Fukuda, Misao, et al, “A Line Terminating LSI Using Echo Cancelling Method for ISDN Subscriber Loop Transmission,” IEEE Journal on Selected Areas in Communications, vol. 6, No. 3, pp. 476-483, Apr. 1988.
Henkel, Werner, et al., “Maximizing the Channel Capacity of Multicarrier Transmission by Suitable Adaptation of the Time-Domain Equalizer,” IEEE Transactions on Communications, vol. 48, No. 12, pp. 2000-2004, Dec. 2000.
International Preliminary Report on Patentability, for International Appl. No. PCT/US2005/023634, filed Jun. 30, 2005, 4 pages, mailed Jan. 9, 2007.
International Preliminary Report on Patentability, for International Appl. No. PCT/US2005/036655, filed Oct. 11, 2005, 6 pages, mailed Apr. 11, 2007.
International Preliminary Report on Patentability, for International Appl. No. PCT/US2007/001997, fled Jan. 25, 2007, 6 pp., mailed Aug. 12, 2008.
International Telecommunication Union (ITU) Recommendation G.992.1, Asymmetric digital subscriper line (ADSL) transceivers, Series G: Transmission Systems and Media, Digital Systems and Networks, pp. 1-240, Jun. 1999.
International Telecommunication Union (ITU) Recommendation G.992.2, Splitterless asymmetric digital subscriber line (ADSL) transceivers, Series G: Transmission Systems and Media, Digital Systems and Networks, pp. 1-165, Jun. 1999.
International Telecommunication Union (ITU) Recommendation G.992.3, Assymmetric digital subscriber line transceivers 2 (ASDL 2), Series G: Transmission Systems and Media, Digital Systems and Networks, pp. 1-300, Jul. 2002.
International Telecommunication Union (ITU) Recommendation G.993.1, Very high speed digital subscriber line transceivers, Series G: Transmission Systems and Media, Digital Systems and Networks, pp. 1-217, Jun. 2004.
Kamkar-Parsi et al., “Wideband Crosstalk Interface Cancelling on xDSL Using Adaptive Signal Processing and Common Mode Signal,” IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. IV-1045-IV-1048, 2004.
Karp et al., “Zero-forcing frequency domain equalization for DMT systems with insufficient guard interval,” IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. 221-224, 2003.
Krongold, Brian S., et al., “Computationally Efficient Optimal Power Allocation Algorithms for Multicarrier Communications Systems,” IEEE Transactions On Communications, vol. 48, pp. 23-27, Jan. 2000.
Lampe, Lutz H.J., et al., “Performance Evaluation of Non-Coherent Transmission Over Power Lines,” Proceedings of International Symposium on Power-Line Communications (ISPLC 2000), pp. 23-30, Limerick, Ireland, 2000.
Lashkarian, Navid, et al., “Fast Algorithm for Finite-Length MMSE Equalizers with Application to Discrete Multitone Systems,” IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. 2753-2756, 1999.
Leke, Achankeng et al., “A Maximum Rate Loading Algorithm for Discrete Multitone Modulation Systems,” IEEE Globecom, pp. 1514-1518, 1997.
Magesacher, Thomas et al., “Adaptive Interference Cancellation Using Common-Mode Information in DSL,” Proceedings of European Signal Processing Conference, 4 pages, Sep. 2005.
Magesacher, Thomas et al., “Analysis of Adaptive Interference Cancellation Using Common-Mode Information in Wireline Communications,” EURASIP Journal on Advances in Signal Processing, vol. 2007, Article 84956, 11 pages, Jun. 2007.
Magesacher, Thomas et al., “Information Rate Bounds in Common-Mode Aided Wireline Communications,” European Transactions on Telecommunications, vol. 17, No. 5, pp. 533-545, Oct. 2006.
Magesacher, Thomas. et al., “On the Capacity of the Copper Cable Channel Using the Commone Mode”, Proc. of the Global Telecommunications Conference, Taipei, Taiwan, vol. 2, Nov. 2002, pp. 1269-1273.
Melsa, Peter J.W., et al., “Impulse Response Shorteing for Discrete Multitone Transceivers,” IEEE Transactions on Communications, vol. 44, No. 12, pp. 1662-1672, Dec. 1996.
Milosevic et al., “Simultaneous Mutichannel Time Domain Equalizer Design Based on the Maximum Composite Shortening SNR,” Dept. of Electrical and Compter Eng., The University of Texas, Austin, Texas, 5 pages, 2002.
Okamura, Yasuka et al., “ADSL System for Time Periodic Noise Environments,” NEC Res. & Develop., vol. 40, No. 1, pp. 64-69, Jan. 1999.
PCT Search Report and Written Opinion of the International Searching Authority, International Application No. PCT/US2005/023634, filed Jun. 30, 2005, 5 pages, mailed May 4, 2006.
PCT Search Report and Written Opinion of the International Searching Authority, International Application No. PCT/US2005/036655, filed Oct. 11, 2005, 7 pages, mailed Feb. 14, 2006.
PCT Search Report and Written Opinion of the International Searching Authority, International Application No. PCT/US2007/001997, filed Jan. 25, 2007, 8 pages, mailed Jul. 18, 2007.
PCT Search Report and Written Opinion of the International Searching Authority, International Application No. PCT/US2006/009687, filed Mar. 16, 2006, 6 pages, mailed Nov. 16, 2007.
PCT Search Report and Written Opinion of the International Searching Authority, International Application No. PCT/US2006/010004, filed Mar. 16, 2006, 5 pages, mailed Oct. 10, 2007.
PCT Search Report and Written Opinion of the International Searching Authority, International Application No. PCT/US2006/009804, filed Mar. 17, 2006, 8 pages, mailed Apr. 2, 2008.
PCT Search Report and Written Opinion of the International Searching Authority, International Application No. PCT/US2009/058821, filed Sep. 29, 2009, 8 pages, mailed Dec. 2, 2009.
Perez-Alvarez, Ivan A., et al., “A Differential Error Reference Adaptive Echo Canceller for Multilevel PAM Line Codes,” Work supported by National Project TIC95-0026, IEEE International Conference on Acoustics, Speech, and Signal Process, pp. 1707-1710, May 1996.
Sedarat, Hossein, et al., “Impulse Noise Protection for Multi-Carrier Communication Systems,” IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 3, pp. iii/853-iii/856, 2005.
Sedarat, Hossein, et al., “Multicarrier Bit-Loading in Presence of Biased Gaussian Noise Sources,” IEEE Consumer Communication and Networking Conference, 5 pages, Jan. 2005.
Sonalkar, Ranjan, et al., “An Efficient Bit-Loading Algorithm for DMT Application,” IEEE Communications Letters, vol. 4, pp. 80-82, Mar. 2000.
Sonalkar, Ranjan, et al., “Shannon Capacity of Frequency-Overlapped Digital Subscriber Loop Channels,” IEEE International Conference on Communications, pp. 1741-1745, Aug. 2002.
Starr, Thomas et al., Understanding Digital Subscriber Line Technology, Prentice Hall PTR, ISBN 0-13-780545-4, Upper Saddle River, NJ, pp. 94-97, 147-154, 206-217, 241-251, and 330-331, 1999.
STLC60134S: TOSCA Integrated ADSL. CMOS Analog Front-End Circuit, STMicroelectronics, 22 pages, Aug. 1999.
Toumpakaris, D. “A byte-erasure method for improved impulse immunity in DSL systems using soft information from an inner code,” IEEE International Conference on Communication (ICC), vol. 4, pp. 2431-2435, May 2003.
Toumpakaris, D., “A Square Distance-Based Byte-Erasure Method for Reduced-delay Protection of DSL Systems from Non-stationary Interference,” IEEE International Conference on Communications (ICC), vol. 4, pp. 2114-2119, San Francisco, CA, Dec. 2003.
Toumpakaris, D., “Reduced Delay Protection of DSL Systems Against Nonstationary Disturbances,” IEEE Transactions on Communications, vol. 52, No. 11, pp. 1927-1938, Nov. 2004.
Wu, Cheng-Shing, et al., “A Novel Cost-Effective Multi-Path Adaptive Interpolated FIR (IFIR)-Based Echo Canceller,” IEEE International Symposium on Circuits and Systems, pp. V-453-V-456, Copyright 2000.
Wyglinski, Alexander M., et al., “An Efficient Bit Allocation for Multicarrier Modulation,” IEEE Wireless Communication, Networking Conference, Atlanta, GA, 6 pages, Mar. 2004.
Yeap, T. H. et al., “Novel Common Mode Noise Cancellation Techniques for xDSL Applications”, Proc. of IEEE Instrumentation and Measurement Technology Conference, Anchorage, AK, May 2002, pp. 1125-1128.
Zogakis, T.N., et al, “Impulse Noise Mitigation Strategies for Multicarrier Modulation,” Proceedings of the International Conference on Communications (ICC), vol. 3, pp. 784-788, May 23, 1993.
Non-Final Office Action dated Oct. 30, 2007, U.S. Appl. No. 11/067,434, filed Feb. 25, 2005, Sedarat.
Final Office Action dated Apr. 29, 2008, U.S. Appl. No. 11/067,434, filed Feb. 25, 2005, Sedarat.
Non-Final Office Action dated Jul. 21, 2008, U.S. Appl. No. 11/067,434, filed Feb. 25, 2005, Sedarat.
Non-Final Office Action dated Jan. 6, 2009, U.S. Appl. No. 11/067,434, filed Feb. 25, 2005, Sedarat.
Non-Final Office Action dated Aug. 19, 2009, U.S. Appl. No. 11/067,434, filed Feb. 25, 2005, Sedarat.
Final Office Action dated May 27, 2010, U.S. Appl. No. 11/067,434, filed Feb. 25, 2005, Sedarat.
Notice of Allowance dated Sep. 15, 2010, U.S. Appl. No. 11/067,434, filed Feb. 25, 2005, Sedarat.
Non-Final Office Action dated May 16, 2008, U.S. Appl. No. 11/131,392, filed May 16, 2005, Wiese.
Non-Final Office Action dated Dec. 10, 2008, U.S. Appl. No. 11/131.392, filed May 16, 2005, Wiese.
Non-Final Office Action dated Jun. 9, 2009, U.S. Appl. No. 11/131,392, filed May 16, 2005, Wiese.
Non-Final Office Action dated Jul. 14, 2010, U.S. Appl. No. 11/131,392, filed May 16, 2005, Wiese.
Non-Final Office Action dated Aug. 21, 2008, U.S. Appl. No. 11/248,704, filed Oct. 11, 2005, Norrell et al.
Non-Final Office Action dated Feb. 4, 2009, U.S. Appl. No. 11/248,704, filed Oct. 11, 2005, Norrell et al.
Final Office Action dated Aug. 5, 2009, U.S. Appl. No. 11/248,704, filed Oct. 11, 2005, Norrell et al.
Non-Final Office Action dated Jun. 14, 2010, U.S. Appl. No. filed Oct. 11, 2005, Norrell et al.
Final Office Action dated Dec. 6, 2010, U.S. Appl. No. 11/248,704, filed Oct. 11, 2005, Norrell et al.
Non-Final Office Action dated Apr. 14, 2011, U.S. Appl. No. 11/248,704, filed Oct. 11, 2005, Norrell et al.
Non-Final Office Action dated Oct. 26, 2011, U.S. Appl. No. 11/248,704, filed Oct. 11, 2005, Norell et al.
Non-Final Office Action dated Nov. 26, 2008, U.S. Appl. No. 11/348,733, filed Feb. 6, 2006, Norrell et al.
Non-Final Office Action dated Apr. 8, 2009, U.S. Appl. No. 11/348,733, filed Feb. 6, 2006, Norrell et al.
Non-Final Office Action dated Oct. 23, 2009, U.S. Appl. No. 11/348,733, filed Feb. 6, 2006, Norrell et al.
Notice of Allowance dated Apr. 29, 2010, U.S. Appl. No. 11/348,733, filed Feb. 6, 2006, Norrell et al.
Non-Final Office Action dated Feb. 24, 2009, U.S. Appl. No. 11/377,114, filed Mar. 15, 2006, Sedarat.
Final Office Action dated Jul. 31, 2009, U.S. Appl. No. 11/377,114, filed Mar. 15, 2006, Sedarat.
Non-Final Office Action dated Aug. 30, 2010, U.S. Appl. No. 11/377,114, filed Mar. 15, 2006, Sedarat.
Final Office Action dated Jan. 4, 2011, U.S. Appl. No. 11/377,114, filed Mar. 15, 2006, Sedarat.
Non-Final Office Action dated Jul. 26, 2011, U.S. Appl. No. 11/377,114, filed Mar. 15, 2006, Sedarat.
Final Office Action dated Nov. 28, 2011, U.S. Appl. No. 11/377,114, filed Mar. 15, 2006, Sedarat.
Non-Final Office Action dated Nov. 9, 2007, U.S. Appl. No. 11/377,083, filed Mar. 15, 2006, Sedarat.
Non-Final Office Action dated May 19, 2008, U.S. Appl. No. 11/377,083, filed Mar. 15, 2006, Sedarat.
Notice of Allowance dated May 18, 2009, U.S. Appl. No. 11/377,083, filed Mar. 15, 2006, Sedarat.
Final Office Action dated Dec. 4, 2008, U.S. Appl. No. 11/377,083, filed Mar. 15, 2006, Sedarat.
Non-Final Office Action dated Dec. 11, 2008, U.S. Appl. No. 11/377,084, filed Mar. 15, 2006, Sedarat et al.
Non-Final Office Action dated Aug. 4, 2009, U.S. Appl. No. 11/377,084, filed Mar. 15, 2006, Sedarat et al.
Final Office Action dated Jul. 8, 2010, U.S. Appl. No. 11/377,084, filed Mar. 15, 2006, Sedarat et al.
Non-Final Office Action dated Aug. 16, 2011, U.S. Appl. No. 12/287,577, filed Oct. 10, 2008, Wiese et al.
Notice of Allowance dated Nov. 15, 2011, U.S. Appl. No. 12/287,577, filed Oct. 10, 2008, Wiese et al.
Notice of Allowance dated Aug. 7, 2013, U.S. Appl. No. 12/287,577, filed Oct. 10, 2008, Wiese et al.
Non-Final Office Action dated Oct. 4, 2012, U.S. Appl. No. 13/098,891, filed May 2, 2011, Wiese et al.
Notice of Allowance dated Feb. 21, 2013, U.S. Appl. No. 13/098,891, filed May 2, 2011, Wiese et al.
Related Publications (1)
Number Date Country
20140098911 A1 Apr 2014 US
Continuations (1)
Number Date Country
Parent 12287577 Oct 2008 US
Child 14099763 US