# Patent

## Title
Time domain equalization for discrete multi-tone systems

## Abstract

A multiple carrier communication system includes a primary impulse shortening filter that receives an output signal of an analog to digital converter and accepts coefficients. A secondary impulse shortening filter receives the output signal of the analog to digital converter, outputs an output signal, and passes coefficients to the primary impulse shortening filter. A reference signal generator outputs a reference signal. A comparator compares the output signal and the reference signal and outputs a resulting error signal. An adaptive processor computes coefficients for the secondary impulse shortening filter based on the error signal.

## Background
CROSS REFERENCE TO RELATED APPLICATIONS
This application is a continuation of U.S. patent application Ser. No. 10/320,920 filed on Dec. 17, 2002, now U.S. Pat. No. 6,785,328 which claims priority from U.S. application Ser. No. 09/233,914, filed Jan. 21, 1999, which claims priority from U.S. Provisional Application No. 60/087,336, filed May 29, 1998. The disclosures of those applications are incorporated herein by reference.


BACKGROUND
The invention relates to time-domain equalization in a discrete multi-tone (DMT) receiver.
Conventional single carrier modulation techniques translate data bits for transmission through a communication channel by varying the amplitude and/or phase of a single sinusoidal carrier. By contrast, DMT, which is also referred to as Orthogonal Frequency Division Multiplexing (OFDM) or Multicarrier Modulation (MCM), employs a large number of sinusoidal subcarriers, e.g., 128 or 256 subcarriers. The available bandwidth of the communication channel is divided into subchannels and each subchannel communicates a part of the data. A DMT system may employ quadrature amplitude modulation (QAM) for each of the subcarriers.
OFDM-based systems transmit blocks of information bits. The time required to transmit one such block is called the symbol period. The time domain waveform that corresponds to one such block of bits is called a symbol.
Intersymbol interference (ISI) arises from the characteristics of practical communication channels and limits the rate at which information can be transmitted through them. Specifically, communication channels typically have an Effective Discrete-Time Impulse Response (EDIR) that is greater than one sample time in length, which causes ISI. ISI is a well-known phenomenon in single-carrier communication systems and there are many techniques for reducing it. The process of such ISI reduction is called equalization. ISI is discussed, for example, in Proakis, Digital Communications, McGraw Hill, 2nd Edition, 1989.
Equalization in OFDM-based systems is achieved by a two stage process. First, at the transmitter, a Cyclic Prefix (CP) is employed by affixing an end-portion of each symbol to the beginning of the symbol. A cyclic prefix that is greater than the EDIR of the channel prevents one symbol from interfering with another. Furthermore, it also facilitates a simple method of neutralizing the time domain spread of each symbol forced by the channel. This is achieved through a simple frequency domain process in the receiver which requires one multiplication operation for each subcarrier used. The use of a Cyclic Prefix to reduce ISI is discussed, for example, in: Cimini, “Analysis and Simulation of a Digital Mobile Channel using Orthogonal Frequency Division Multiplexing,” IEEE Transactions on communications, pp 665-675, July 1985; Chow, “A Discrete Multi-Tone Transceiver System for HDSL applications,” IEEE Journal on Selected Areas of Communications, 9(6):895-908, August 1991; and “DMT Group VDSL PMD Draft Standard Proposal,” Technical Report, T1E1.4/96-329R2, ANSI 1997.
Another problem arising in conventional DMT systems is noise bleeding, which occurs when noise from one frequency band interferes with a signal whose subcarrier is in another frequency band. Noise bleeding is caused, in general, by a discrete Fourier transform (DFT) operation at the receiver. Noise bleeding is discussed in, for example, Worthen et. al., “Simulation of VDSL Test Loops,” Technical Report T1E1.4/97-288, ANSI 1997.
In a perfectly synchronized DMT system, a signal in one frequency band does not interfere with a signal whose subcarrier is in another frequency band. However, noise from one band may interfere with other less noisy bands and render them unusable. Techniques for dealing with noise-bleeding include wavelet-based solutions. However, wavelet-based solutions are, in general, computationally intensive.
Other references dealing with time domain equalization include: Chow, J. S. and Cioffi, J. M., “A Cost-effective Maximum Likelihood Receiver for Multicarrier Systems”, Proceedings of the ICC, 1992; Melsa, Peter J. W., Younce, Richard C., and Rohrs, Charles E., “Optimal Impulse Response Shortening”, Proceedings of the thirty-third Annual Allerton Conference on Communication, Control and Computing, 1995, pp. 431-438; Harikumar, Gopal and Marchok, Daniel, “Shortening the Channel Impulse Response of VDSL Loops for Multicarrier Applications”, Technical report T1E1.4/97-289, ANSI, 1997.
SUMMARY
A spectrally constrained impulse shortening filter (SCISF) may be used, for example, in DMT systems. The coefficients of the SCISF may be computed efficiently. For example, the coefficients may be computed and changed through a training process that may occur upon start up of the communication system and periodically during its operation.
The SCISF serves two primary functions. First, it reduces intersymbol interference (ISI) by reducing the length of the effective discrete-time impulse response (EDIR) of the communication channel. Conventional impulse shortening filters may have deep nulls in their frequency response. By contrast, the SCISF has a filter characteristic that is essentially free from undesired nulls that may attenuate or completely eliminate certain subcarriers.
Second, the SCISF reduces noise bleeding between subcharnels by attenuating noisy channels in a manner that does not reduce the signal to noise ratio (SNR) in these channels, but reduces the noise power that may appear in the sidelobes of adjacent subchannels. The SCISF accomplishes these functions by applying a frequency constraint to the signal based on a desired spectral response.
The coefficients of the SCISF are computed independent of the length of the cyclic prefix, the symbol length, and the frequency domain equalization characteristics of the system. The SCISF is particularly effective in systems in which additive noise dominates intersymbol interference, or in which noise bleeding predominates. The SCISF reduces noise bleeding with a filter structure that is shorter than that obtained with other techniques. Consequently, the SCISF is less complex and its coefficients are easier to compute, which reduces system complexity and cost. The SCISF may be particularly well suited, for example, for very high-speed digital subscriber lines (VDSL) systems, which generally have low intersymbol interference and tend to suffer from noise bleeding.
In addition, dynamic selection of a cyclic prefix (CP) that maximizes the data throughput for a communication channel having a particular noise profile is provided. Dynamic selection of the CP allows the communication system to adapt to changing noise conditions in the communication channel.
In one aspect, generally, a primary impulse shortening filter is adapted in a multiple carrier communication system. A secondary impulse shortening filter is provided. An output signal of the secondary impulse shortening filter is compared to a reference signal to compute an error signal. Coefficients of the secondary impulse shortening filter are computed in an adaptive processor based on the error signal. Coefficients of the primary impulse shortening filter are replaced with coefficients of the secondary impulse shortening filter.
Embodiments may include one or more of the following features. An output signal of the primary impulse shortening filter may be decoded to form output data. The output data may be encoded to form the reference signal. A discrete Fourier transform may be applied to the output signal of the primary impulse shortening filterprior to decoding the output signal. An inverse discrete Fourier transform may be applied to the encoded output data in forming the reference signal.
A digital signal may be received from an output of an analog to digital converter. The digital signal may be input to the primary impulse shortening filter. The digital signal may be delayed. The delayed digital signal may be input to the secondary impulse shortening filter and the adaptive processor.
The encoded output data may be scaled with a set of scaling factors in forming the reference signal. The scaling factors may be determined by: measuring received noise power spectral density, computing a desired spectral response based on the measured noise power, and computing the scaling factors so that the coefficients computed in the adaptive processor provide the secondary impulse shortening filter with a spectral response that matches the desired spectral response. A discrete Fourier transform may be applied to the output signal of the primary impulse shortening filter prior to decoding the output signal. The noise power spectral density may be measured at an output of the discrete Fourier transform. An inverse discrete Fourier transform may be applied to the scaled, encoded output data.
In another aspect, an impulse shortening filter is adapted in a multiple carrier communication system having a spectrally constrained impulse shortening filter. An output signal of the spectrally constrained impulse shortening filter is compared to a reference signal to compute an error signal. Coefficients of the spectrally constrained impulse shortening filter are computed in an adaptive processor based on the error signal.
Embodiments may include one or more of the following features. The reference signal may be a predetermined signal stored in a memory in the communication system. A discrete Fourier transform may be applied to predetermined reference values to form transformed reference values. The transformed reference values may be scaled with a set of scaling factors to form scaled. An inverse discrete Fourier transform may be applied to the scaled values to form the reference signal.
A data signal may be received from an output of an analog to digital converter. The data signal may be input to the spectrally constrained impulse shortening filter and the adaptive processor.
In another aspect, a multiple carrier communication system includes a primary impulse shortening filter that receives an output signal of an analog to digital converter and accepts coefficients. A secondary impulse shortening filter receives the output signal of the analog to digital converter, outputs an output signal, and passes coefficients to the primary impulse shortening filter. A reference signal generator outputs a reference signal. A comparator compares the output signal and the reference signal and outputs a resulting error signal. An adaptive processor computes coefficients for the secondary impulse shortening filter based on the error signal.
Embodiments may include one or more of the following features. A discrete Fourier transform may receive an output signal of the primary impulse shortening filter. A decoder may receive the transformed output signal from the discrete Fourier transform. The reference signal generator may include an encoder that receives output data from the decoder. The reference signal generator may include a scaling filter that scales the output data from the encoder using a set of scaling factors. An inverse discrete Fourier transform may receive the scaled output signal from the scaling filer.
In another aspect, a multiple carrier communication system may include a spectrally constrained impulse shortening filter that receives an output signal of an analog to digital converter and accepts coefficients. A reference signal generator outputs a reference signal. A comparator compares the output signal and the reference signal and outputs a resulting error signal. An adaptive processor computes coefficients for the spectrally constrained impulse shortening filter based on the error signal.
Embodiments may include one or more of the following features. A memory may store the reference signal as a predetermined signal. A discrete Fourier transform may receive the reference signal from the memory. A scaling filter may scale the reference signal using a set of scaling factors. An inverse discrete Fourier transform may receive the scaled reference signal.
Other features and advantages will be apparent from the following detailed description, including the drawings, and from the claims.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram of a discrete multi-tone communication system with a spectrally constrained impulse shortening filter.
FIG. 2 is a block diagram of a system for adapting a spectrally constrained impulse shortening filter in an initial training process.
FIGS. 3A and 3B are block diagrams of a system for adapting a spectrally constrained impulse shortening filter in an periodic or continuous training process.
FIG. 4 is a block diagram of a generalized adaptation system that employs frequency scaling in the feedback loop.
FIG. 5 is a block diagram of a system for adapting a spectrally constrained impulse shortening filter in an initial training process that includes frequency scaling in the feedback loop.
FIGS. 6A and 6B are block diagrams of a system for adapting a spectrally constrained impulse shortening filter in an periodic or continuous training process that includes frequency scaling in the feedback loop.
FIGS. 7A-7D are plots of simulation results for a discrete multi-tone system.
FIGS. 8A-8D are plots of simulation results for a discrete multi-tone system.



DESCRIPTION
As shown in FIG. 1, a discrete multi-tone (DMT) communication system 10 has a transmitter 12 and a receiver 14. The transmitter 12 accepts an input data bit stream which passes through a constellation encoder 20. The encoder 20 divides the serial input bit stream into blocks of data. These blocks of data are further subdivided into smaller blocks corresponding to subchannels. Each of these smaller blocks are used to compute a complex value representing a constellation point. Each constellation point corresponds to a subsymbol. The subsymbols are then output by the encoder. Taken together, the subsymbols constitute a symbol.
The subsymbols are supplied to an inverse discrete Fourier transform (IDFT) 30, which may be implemented, for example, in a digital signal processor. The IDFT 30 outputs N time samples of a symbol. The time samples are processed by a parallel to serial converter 40 to form a single stream of time samples.
Following the parallel to serial converter 40, a prefix adder 50 adds a cyclic prefix to the beginning of each symbol to reduce intersymbol interference (ISI). Alternatively, the cyclic prefix may be added in the parallel to serial converter. After the cyclic prefix is added, the resulting signal passes through a digital-to-analog (D/A) converter 60 for transmission to the receiver 14 through a communication channel 70. An analog transmit filter 65 may be included following the D/A converter to band limit the transmitted signal.
At the receiver 14, the signal passes through an analog-to-digital (A/D) converter 80 and then through a spectrally constrained impulse shortening filter (SCISF) 90. A prefix stripper 100 strips the cyclic prefixes from the resulting symbols and a serial to parallel converter 110 divides the stream of time samples into parallel signal paths that form the inputs to a discrete Fourier transform (DFT) 120. The DFT 120 converts the time samples into subsymbols. A frequency domain equalization filter 130 equalizes the subsymbols. A decoder 140 converts the subsymbols into a data bits and outputs the resulting data. An analog receive filter 75 may be included prior to the A/D converter in order to band limit the received signal.
As discussed above, a cyclic prefix is added to each symbol prior to transmission through the communication channel to reduce the effects of ISI. The cyclic prefix is added by copying the last v time samples from the end of a symbol and placing them at the beginning of the symbol. To eliminate ISI, the length of the cyclic prefix, v, is chosen to be longer than the effective discrete-time impulse response (EDIR) of the channel. However, because the cyclic prefix constitutes redundant data, increasing the length of the cyclic prefix reduces the efficiency of the communication system. For example, in a system having N time samples per symbol and a cyclic prefix of v time samples, the efficiency of the system will be reduced by a factor of N/(N+v). Efficiency may be maximized either by minimizing v or maximizing N. However, increasing N increases the complexity, latency and computational requirements of the system and at some point becomes impractical. Accordingly, it is desirable to minimize v.
A spectrally constrained impulse shortening filter having an impulse response, g(n), may be employed in the receiver to minimize the length of the cyclic prefix by decreasing the EDIR of the effective communication channel, which includes the transmit and receive filters, the impulse shortening filter, and the physical transmission channel. The use of an impulse shortening filter is referred to as time domain equalization. Decreasing the EDIR allows a shorter cyclic prefix to be used without increasing ISI.
The SCISF may be configured, by determining the filter-coefficients during a training or adaptation period. The SCISF filters the output {yk} of the receiver A/D 80. The coefficients are selected using an algorithm that minimizes the squared error between a reference sequence {uk} generated by the receiver and the output of the SCISF {ûk}. The SCISF may be a finite impulse response (FIR) filter or an infinite impulse response (IIR) filter. The SCISF may be trained following activation of the communication system or periodically during operation of the system to compensate for variations in the channel noise profile.
The training may be performed using a variation of one of the classical adaptive algorithms, such as least mean squares (LMS), normalized LMS, or recursive least squares (RLS). For example, the following algorithm is a version of the normalized LMS algorithm in which b0, . . . , bN and a1, . . . , aN are the FIR and IIR parts of a SCISF having an impulse response, g. The z-transform G(z) is:




  
    
      
        
          G
          ⁡
          
            (
            z
            )
          
        
        =
        
          
            
              b
              0
            
            +
            
              
                b
                1
              
              ⁢
              
                z
                
                  -
                  1
                
              
            
            +
            ⋯
            +
            
              
                b
                N
              
              ⁢
              
                z
                
                  -
                  N
                
              
            
          
          
            1
            -
            
              
                a
                1
              
              ⁢
              
                z
                
                  -
                  1
                
              
            
            -
            ⋯
            -
            
              
                a
                N
              
              ⁢
              
                z
                
                  -
                  N
                
              
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




The adaptation of coefficients ai and bi is defined in the following equations, in which ai(k) and bi(k) are the values of these coefficients during the kth iteration. The parameter μ is a predetermined constant with a value of 0.4.





  
    
      
        
          
            u
            ^
          
          k
        
        =
        
          
            
              ∑
              
                i
                =
                0
              
              N
            
            ⁢
            
              
            
            ⁢
            
              
                
                  b
                  i
                
                ⁡
                
                  (
                  k
                  )
                
              
              ⁢
              
                y
                
                  k
                  -
                  i
                
              
            
          
          +
          
            
              ∑
              
                j
                =
                1
              
              N
            
            ⁢
            
              
            
            ⁢
            
              
                
                  a
                  i
                
                ⁡
                
                  (
                  k
                  )
                
              
              ⁢
              
                
                  u
                  ^
                
                
                  k
                  -
                  i
                
              
            
          
        
      
    
    
      
        (
        
          2
          ⁢
          a
        
        )
      
    
  
  
    
      
        
          α
          k
        
        =
        
          [
          
            
              
                b
                0
              
              ⁡
              
                (
                k
                )
              
            
            ,
            ...
            ⁢
            
              
            
            ,
            
              
                b
                N
              
              ⁡
              
                (
                k
                )
              
            
          
          ]
        
      
    
    
      
        (
        
          2
          ⁢
          b
        
        )
      
    
  
  
    
      
        
          β
          k
        
        =
        
          [
          
            
              
                a
                1
              
              ⁡
              
                (
                k
                )
              
            
            ,
            ...
            ⁢
            
              
            
            ,
            
              
                a
                N
              
              ⁡
              
                (
                k
                )
              
            
          
          ]
        
      
    
    
      
        (
        
          2
          ⁢
          c
        
        )
      
    
  
  
    
      
        
          d
          k
        
        =
        
          [
          
            
              y
              k
            
            ,
            
              y
              
                k
                -
                1
              
            
            ,
            ...
            ⁢
            
              
            
            ,
            
              y
              
                k
                -
                N
              
            
          
          ]
        
      
    
    
      
        (
        
          2
          ⁢
          d
        
        )
      
    
  
  
    
      
        
          c
          k
        
        =
        
          [
          
            
              
                u
                ^
              
              
                k
                -
                1
              
            
            ,
            
              
                u
                ^
              
              
                k
                -
                2
              
            
            ,
            ...
            ⁢
            
              
            
            ,
            
              
                u
                ^
              
              
                k
                -
                N
              
            
          
          ]
        
      
    
    
      
        (
        
          2
          ⁢
          e
        
        )
      
    
  
  
    
      
        
          e
          k
        
        ⁢
        
          =
          Δ
        
        ⁢
        
          
            u
            k
          
          -
          
            
              u
              ^
            
            k
          
        
      
    
    
      
        (
        
          2
          ⁢
          f
        
        )
      
    
  
  
    
      
        
          α
          
            k
            +
            1
          
        
        =
        
          
            α
            k
          
          +
          
            μ
            ⁢
            
              
                
                  e
                  k
                
                ⁢
                
                  d
                  k
                
              
              
                
                  
                  
                    d
                    k
                  
                  
                
                2
              
            
          
        
      
    
    
      
        (
        
          2
          ⁢
          g
        
        )
      
    
  
  
    
      
        
          β
          
            k
            +
            1
          
        
        =
        
          
            β
            k
          
          +
          
            μ
            ⁢
            
              
                
                  e
                  k
                
                ⁢
                
                  c
                  k
                
              
              
                
                  
                  
                    c
                    k
                  
                  
                
                2
              
            
          
        
      
    
    
      
        (
        
          2
          ⁢
          h
        
        )
      
    
  




In a first embodiment, the coefficients of the SCISF are determined during an initial training period following the activation of the communication system using the LMS algorithm described above. A predetermined sequence of bits xk is input to the transmitter 12. The sequence of bits results in a sequence of real numbers {xk} at the input of the D/A 60. As shown in FIGS. 1 and 2, the transmitted signal is filtered and noise-corrupted by the transmission channel 70, resulting in a received sequence {yk} at the output of the A/D 80 in the receiver 14. The SCISF 90 filters and transforms the received sequence {yk} into an output sequence {{circumflex over (x)}k}. The output sequence {{circumflex over (x)}k} is compared (in a signal comparator 205) to the predetermined sequence xk, which is stored in memory 210 in the receiver. The comparison results in an error signal ek that is input to the LMS algorithm processor 215 along with sequence {{circumflex over (x)}k}.
The training process determines coefficients for the SCISF so that the output {{circumflex over (x)}k} matches the predetermined sequence {xk} as closely as possible in a least squares sense, i.e., the mean square error between the output and the predetermined sequence is minimized. During the training process, the coefficients of the SCISF converge to values that enable the SCISF to reduce ISI and additive noise. The resulting SCISF matches P1(ω) in the frequency domain in a least squares sense, where:




  
    
      
        
          
            P
            1
          
          ⁡
          
            (
            ω
            )
          
        
        =
        
          
            
              
                S
                x
              
              ⁡
              
                (
                ω
                )
              
            
            ⁢
            
              
                H
                *
              
              ⁡
              
                (
                ω
                )
              
            
          
          
            
              
                
                  S
                  x
                
                ⁡
                
                  (
                  ω
                  )
                
              
              ⁢
              
                
                  
                  
                    H
                    ⁡
                    
                      (
                      ω
                      )
                    
                  
                  
                
                2
              
            
            +
            
              
                S
                η
              
              ⁡
              
                (
                ω
                )
              
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




In the equation above, Sx(ω) is the power-spectral density at the input of the transmitter D/A 60, Sη(ω) is the power spectral density of the additive noise at the output of the A/D 80, and H(ω) is the frequency response of the effective discrete-time impulse response (EDIR) of the transmission channel 70, transmit filter 65, and receive filter 75 measured between the input of the transmitter D/A 60 and the output of the receiver A/D 80.

Upon completion of the initial training of the SCISF, the SCISF coefficients are fixed and the frequency domain equalizer (FEQ 130) of the receiver is trained using standard techniques for DMT receivers. Following the training of the FEQ, the SCISF can be periodically trained or adapted during operation of the communication system. Since it is not efficient to repeatedly transmit a predetermined bit sequence during operation of the communication system, the periodic training process uses transmitted communication data to generate the reference and output sequences, as described below.
During operation of the communication system, a sequence of communication data bits xk is input to the transmitter 12 (see FIG. 1). The sequence of data bits results in a sequence of real numbers {xk} at the input of the D/A 60. As shown in FIGS. 1 and 3A, the transmitted signal is filtered and noise-corrupted by the transmission channel 70, resulting in a received sequence {yk} at the output of the A/D 80 in the receiver 14. The SCISF 90 filters and transforms the received sequence {yk} into an output sequence {{circumflex over (x)}′k}.
The received sequence {yk} is also input to a delay 305 and then to a secondary SCISF 300 that has the same coefficients as the primary SCISF 90 following the initial training. Such a configuration allows periodic training to be performed without disruption to the operation of the communication system. The secondary SCISF 300 is periodically or continuously trained using an algorithm similar to that used for the initial training. The new coefficients of the secondary SCISF 300 are periodically copied to the primary SCISF 90.
In an initial training process, the output sequence {{circumflex over (x)}k} of the secondary SCISF 300 would be compared (in a signal comparator 205) to a predetermined sequence xk stored in memory. However, as discussed above, a sequence of data communication bits is used as a reference sequence for training rather than a predetermined sequence. As such, the receiver must have a way of generating a reference signal to compare to the output of the SCISF.
To compute the reference sequence, the receiver essentially duplicates the encoding and modulation processes of the transmitter using the output of the decoder 140. Because the initial training has already been performed, the SCISF 90 output {{circumflex over (x)}′k} matches the predetermined sequence {xk} closely and ISI and additive noise are minimized. Hence, the data output of the decoder 140 closely matches the transmitted sequence of communication data bits xk. The data bits are input to an encoder 320, an IDFT 330, a parallel to serial converter 340, and a prefix adder 350 similar to those in the transmitter. The output sequence {xk} of this chain is input to the LMS algorithm processor 215 and used as a reference sequence in the training algorithm.
The output sequence {{circumflex over (x)}k} of the secondary SCISF 300 is compared (in a signal comparator 205) to the reference sequence {xk}, which is output by the encoding/modulation chain (320, 330, 340 and 350). As noted above, the received sequence {yk} passes through a delay 305 before being input to the secondary SCISF 300. The delay 305 compensates for the processing delay in the demodulation/decoding chain and the encoding/modulation chain. The comparison results in an error signal ek that is input to the LMS algorithm processor 215. The training process determines coefficients for the secondary SCISF 300 so that the output {{circumflex over (x)}k} matches the reference sequence {xk} as closely as possible in a least squares sense, i.e., the mean square error between the output and the reference sequence is minimized. Periodically, the coefficients of the secondary SCISF 300 are copied to the primary SCISF 90.
Alternatively, as shown in FIG. 3B, the periodic training may be performed with a single SCISF 90. In this configuration, a received sequence {yk} is output by the A/D 80 in the receiver 14. The SCISF 90 filters and transforms the received sequence {yk} into an output sequence {{circumflex over (x)}′k}. The received sequence {yk} is also input to a delay 305. After the received sequence {yk} passes through the SCISF 90, a data switch 360 is changed from position A to position B, allowing the delayed received sequence to make a second pass through the SCISF 90. An output switch 370 also may be opened, so that data is not output during the training process. In addition, the SCISF coefficients are controlled by the LMS algorithm during the training process.
A reference sequence is computed as in the configuration of FIG. 3A. The data bits are input to an encoder 320, an IDFT 330, a parallel to serial converter 340, and a prefix adder 350. The resulting reference sequence {xk} is input to the LMS algorithm processor.
The output sequence {{circumflex over (x)}k} of the second pass through the SCISF 90 is compared (in signal comparator 205) to the reference sequence. As noted above, the received sequence {yk} passes through a delay 305 before being input to the SCISF 90 for the second pass. The delay 305 compensates for the processing delay in the demodulation/decoding chain and the encoding/modulation chain. The comparison results in an error signal ek that is input to the LMS algorithm processor 215. The training process determines coefficients for the SCISF 90 so that the output {{circumflex over (x)}k} matches the reference sequence {xk} as closely as possible in a least squares sense, i.e., the mean square error between the output and the reference sequence is minimized. The coefficients of the SCISF 90 then are updated to the coefficients determined in the training process.
In a second embodiment, the SCISF 90 coefficients are chosen so that the frequency response of the SCISF matches a desired spectral response Gd(ω) that seeks to minimize the effects of noise-bleeding and maximize system bit throughput. The desired spectral response Gd(ω) is determined based on the signal-to-noise ratios observed in the various frequency bins of the DFT 120 in the receiver.
For example, an OFDM system may have M tones, N of which (m1 through mN) are used. The system operates over a channel with analog frequency response Hc(f). Referring again to FIG. 1, the analog noise power spectral density at the input of the receiver A/D 80 is Sη(f). Prior to receiver A/D 80, the received analog signal may be filtered by an anti-aliasing filter (i.e., receive filter 75) having a transfer function Ha(f). The effective discrete-time impulse response (EDIR) of the transmission channel of the OFDM system (including the transmit filter 65 and receive filter 75) is h(n). The output of the A/D 80 is input to a SCISF 90 having an impulse response g(n). G(ω) is the spectral response corresponding to g(n).
The expected signal energy μ(k) observed in frequency bin k at the output of the DFT 120, which has a length of NM, is:




  
    
      
        
          
            μ
            ⁡
            
              (
              k
              )
            
          
          =
          
            
              C
              1
            
            ⁢
            
              D
              k
            
            ⁢
            
              
                
                
                  H
                  ⁡
                  
                    (
                    
                      
                        π
                        ⁢
                        
                          
                        
                        ⁢
                        k
                      
                      M
                    
                    )
                  
                
                
              
              2
            
            ⁢
            
              
                
                
                  G
                  ⁡
                  
                    (
                    
                      
                        π
                        ⁢
                        
                          
                        
                        ⁢
                        k
                      
                      M
                    
                    )
                  
                
                
              
              2
            
          
        
        ;
        
          
            H
            ⁡
            
              (
              ω
              )
            
          
          =
          
            
              
                H
                c
              
              ⁡
              
                (
                
                  ω
                  
                    2
                    ⁢
                    
                      
                    
                    ⁢
                    π
                    ⁢
                    
                      
                    
                    ⁢
                    T
                  
                
                )
              
            
            ⁢
            
              
                H
                a
              
              ⁡
              
                (
                
                  ω
                  
                    2
                    ⁢
                    π
                    ⁢
                    
                      
                    
                    ⁢
                    T
                  
                
                )
              
            
          
        
      
    
    
      
        (
        4
        )
      
    
  




where C1 is a constant, 1/T is the sampling frequency and Dk is the transmitted power in frequency bin k. The noise power η(k) in bin k is:





  
    
      
        
          
            
              
                
                  
                    η
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                  =
                  
                    
                      
                        C
                        2
                      
                      [
                      
                        
                          
                            S
                            η
                          
                          ⁡
                          
                            (
                            
                              ω
                              
                                2
                                ⁢
                                π
                                ⁢
                                
                                  
                                
                                ⁢
                                T
                              
                            
                            )
                          
                        
                        ⁢
                        
                          
                            
                            
                              G
                              ⁡
                              
                                (
                                ω
                                )
                              
                            
                            
                          
                          2
                        
                      
                      
                    
                    ⁢
                    
                      
                        H
                        a
                      
                      ⁡
                      
                        (
                        
                          ω
                          
                            2
                            ⁢
                            π
                            ⁢
                            
                              
                            
                            ⁢
                            T
                          
                        
                        )
                      
                    
                  
                
                
              
              2
            
            ]
          
          *
          
            [
            
              
                
                  sin
                  2
                
                ⁡
                
                  (
                  
                    M
                    ⁢
                    
                      
                    
                    ⁢
                    ω
                  
                  )
                
              
              
                
                  sin
                  2
                
                ⁡
                
                  (
                  
                    ω
                    2
                  
                  )
                
              
            
            ]
          
        
        ⁢
        
          |
          
            ω
            =
            
              
                π
                ⁢
                
                  
                
                ⁢
                
                  k
                  ′
                
              
              M
            
          
        
      
    
    
      
        (
        5
        )
      
    
  




where C2 is a constant and * denotes a convolution of the discrete Fourier transforms. If the noise in the bands occupied by unused tones is sufficiently attenuated by the anti-alias filter (receive filter 75), η(k) is approximately:





  
    
      
        
          
            η
            ⁡
            
              (
              k
              )
            
          
          ≈
          
            
              C
              3
            
            ⁢
            
              
                ∑
                
                  l
                  =
                  
                    M
                    1
                  
                
                
                  M
                  2
                
              
              ⁢
              
                
              
              ⁢
              
                
                  
                    S
                    η
                  
                  ⁡
                  
                    (
                    
                      l
                      
                        2
                        ⁢
                        MT
                      
                    
                    )
                  
                
                ⁢
                
                  
                    
                    
                      G
                      ⁡
                      
                        (
                        
                          
                            π
                            ⁢
                            
                              
                            
                            ⁢
                            l
                          
                          M
                        
                        )
                      
                    
                    
                  
                  2
                
                ⁢
                
                  
                    
                    
                      
                        H
                        a
                      
                      ⁡
                      
                        (
                        
                          l
                          
                            2
                            ⁢
                            MT
                          
                        
                        )
                      
                    
                    
                  
                  2
                
                ⁢
                
                  (
                  
                    
                      τ
                      ⁡
                      
                        (
                        
                          k
                          -
                          l
                        
                        )
                      
                    
                    +
                    
                      τ
                      ⁡
                      
                        (
                        
                          
                            2
                            ⁢
                            M
                          
                          -
                          k
                          -
                          1
                        
                        )
                      
                    
                  
                  )
                
              
            
          
        
        ,
      
    
    
      
        (
        6
        )
      
    
  




where τ(n) is defined as:





  
    
      
        
          
            τ
            ⁡
            
              (
              n
              )
            
          
          =
          
            
              ∫
              
                -
                
                  
                    π
                    ⁢
                    
                      
                    
                  
                  NM
                
              
              
                
                  π
                  ⁢
                  
                    
                  
                
                NM
              
            
            ⁢
            
              
                [
                
                  
                    
                      sin
                      2
                    
                    ⁡
                    
                      (
                      
                        M
                        ⁡
                        
                          (
                          
                            
                              
                                π
                                ⁢
                                
                                  
                                
                                ⁢
                                n
                              
                              M
                            
                            -
                            λ
                          
                          )
                        
                      
                      )
                    
                  
                  
                    
                      sin
                      2
                    
                    ⁡
                    
                      (
                      
                        
                          1
                          2
                        
                        ⁢
                        
                          (
                          
                            
                              
                                π
                                ⁢
                                
                                  
                                
                                ⁢
                                n
                              
                              M
                            
                            -
                            λ
                          
                          )
                        
                      
                      )
                    
                  
                
                ⁢
                
                  
                
                ]
              
              ⁢
              
                d
                λ
              
            
          
        
        ,
      
    
    
      
        (
        7
        )
      
    
  




m1 . . . mN are the used tones, and C3 is a constant. A vector of frequency magnitudes g is defined as:





  
    
      
        g
        ⁢
        
          =
          Δ
        
        ⁢
        
          
            [
            
              
                
                  
                    
                      
                      
                        G
                        ⁡
                        
                          (
                          
                            
                              π
                              ⁢
                              
                                
                              
                              ⁢
                              
                                m
                                1
                              
                            
                            M
                          
                          )
                        
                      
                      
                    
                    2
                  
                
              
              
                
                  ⋮
                
              
              
                
                  
                    
                      
                      
                        G
                        ⁡
                        
                          (
                          
                            
                              π
                              ⁢
                              
                                
                              
                              ⁢
                              
                                m
                                N
                              
                            
                            M
                          
                          )
                        
                      
                      
                    
                    2
                  
                
              
            
            ]
          
          =
          
            [
            
              
                
                  
                    G
                    1
                  
                
              
              
                
                  ⋮
                
              
              
                
                  
                    G
                    N
                  
                
              
            
            ]
          
        
      
    
    
      
        (
        8
        )
      
    
  




The SNR in frequency bin





  k
  ⁢
  
    
  
  ⁢
  is
  ⁢
  
    
  
  ⁢
  
    
      
        r
        k
      
      ⁢
      
        G
        k
      
    
    
      
        s
        k
        T
      
      ⁢
      g
    
  




for scalars rk and vectors sk. The scalars rk are defined by:





  
    
      
        
          r
          k
        
        ⁢
        
          =
          Δ
        
        ⁢
        
          
            C
            1
          
          ⁢
          
            D
            k
          
          ⁢
          
            
              
              
                H
                ⁡
                
                  (
                  
                    
                      π
                      ⁢
                      
                        
                      
                      ⁢
                      k
                    
                    M
                  
                  )
                
              
              
            
            2
          
        
      
    
    
      
        (
        9
        )
      
    
  




and sk(l), the lth component of sk is defined by:





  
    
      
        
          
            s
            k
          
          ⁡
          
            (
            l
            )
          
        
        =
        
          
            C
            3
          
          ⁢
          S
          ⁢
          
            
          
          ⁢
          
            η
            ⁡
            
              (
              
                l
                
                  2
                  ⁢
                  MT
                
              
              )
            
          
          ⁢
          
            
              
              
                
                  H
                  a
                
                ⁡
                
                  (
                  
                    l
                    
                      2
                      ⁢
                      MT
                    
                  
                  )
                
              
              
            
            2
          
          ⁢
          
            (
            
              
                τ
                ⁡
                
                  (
                  
                    k
                    -
                    l
                  
                  )
                
              
              +
              
                τ
                ⁡
                
                  (
                  
                    
                      2
                      ⁢
                      M
                    
                    -
                    k
                    -
                    l
                  
                  )
                
              
            
            )
          
        
      
    
    
      
        (
        10
        )
      
    
  




To determine an expression for g that maximizes system bit throughput, the capacity of each frequency bin k is approximated by log(1+SNRk). Accordingly, the optimal spectral profile is determined by minimizing the cost function F, where:




  
    
      
        
          F
          ⁡
          
            (
            g
            )
          
        
        =
        
          -
          
            
              ∑
              
                k
                =
                
                  m
                  1
                
              
              
                m
                N
              
            
            ⁢
            
              log
              ⁡
              
                (
                
                  1
                  +
                  
                    
                      
                        r
                        k
                      
                      ⁢
                      
                        G
                        k
                      
                    
                    
                      
                        s
                        k
                        T
                      
                      ⁢
                      g
                    
                  
                
                )
              
            
          
        
      
    
    
      
        (
        11
        )
      
    
  




Since Gk=|G(πmk/M)|2, the minimization of the cost function is performed over all positive values of Gk, as:




  
    
      
        
          g
          opt
        
        =
        
          arg
          ⁢
          
            
          
          ⁢
          
            
              min
              
                g
                ∈
                G
              
            
            ⁢
            
              
            
            ⁢
            
              F
              ⁡
              
                (
                g
                )
              
            
          
        
      
    
    
      
        (
        12
        )
      
    
  




    
    
        where:

G={gεRN:∥g∥=1, Gi≧0,1≦i≦N}.  (13)

A variety of constrained optimization strategies may be used to solve the above equations for gopt.

    
    


Once the optimal impulse response gopt and desired spectral response Gd(ω) (which may be expressed as Gd(πmk/M) for a system having M tones) have been determined, a training process is used to adapt the SCISF 90 so that its impulse response g matches the desired spectral response. As shown in FIG. 4, the training process may be generalized as a feedback system. A reference sequence xk is input to the system. This corresponds to inputting a predetermined reference bit sequence to a transmitter. The reference sequence passes through a transmission channel 410 having frequency response H(f) (including the physical transmission channel and the transmit and receive filters). Additive noise ηk from the transmission channel is represented in this general model as an external input 420 to the system. The resulting signal yk is input to a filter 430 having a frequency response G(f), e.g., a SCISF. The output of the filter 430 is then passed to an adaptation processor 440, which computes an error signal based on the feedback loop 450 and adapts the filter accordingly. The adaptation processor may, for example, use the LMS algorithm described above.
The reference sequence xk is also input to the feedback loop 450, which passes the reference sequence xk through a scaling filter 460 with frequency characteristic Q(f). The frequency characteristic Q(f) of the scaling filter 460 (which may be expressed as a set of frequency domain scaling factors Q(f) is determined so that the SCISF adapts to the desired spectral response. The output of the scaling filter 460 is used a reference for the calculation of the error signal in the adaptation processor 440, as described above.
Using the general feedback system shown in FIG. 4, a SCISF having an impulse response g may be trained to minimize the error ∥q*x−x*g*h−η*g∥2. The resulting filter matches P2(ω) in the frequency domain in a least-squares sense, where:




  
    
      
        
          
            
              P
              2
            
            ⁡
            
              (
              ω
              )
            
          
          =
          
            
              
                
                  S
                  x
                
                ⁡
                
                  (
                  ω
                  )
                
              
              ⁢
              H
              *
              
                (
                ω
                )
              
              ⁢
              
                Q
                ⁡
                
                  (
                  ω
                  )
                
              
            
            
              
                
                  
                    S
                    x
                  
                  ⁡
                  
                    (
                    ω
                    )
                  
                
                ⁢
                
                  
                    
                    
                      H
                      ⁡
                      
                        (
                        ω
                        )
                      
                    
                    
                  
                  2
                
              
              +
              
                
                  S
                  η
                
                ⁡
                
                  (
                  ω
                  )
                
              
            
          
        
        ,
      
    
    
      
        (
        14
        )
      
    
  




Sx(ω) is the power-spectral density at the input of the system, H(ω) is the frequency response of the effective discrete-time impulse response (EDIR) of the transmission channel, Sη(ω) is the power spectral density of the additive noise, and Q(ω) is the spectral response of the scaling filter 460 having impulse response q.

The solution for gopt in the equations above specifies only the magnitude of the spectral response of the SCISF. If the SCISF is a FIR filter, a linear phase characteristic may be used. If the length of the SCISF is ng, the desired values of G(w) for the frequency bins of interest are:




  
    
      
        
          
            G
            d
          
          ⁡
          
            (
            
              π
              ⁢
              
                
              
              ⁢
              
                
                  M
                  k
                
                /
                M
              
            
            )
          
        
        ⁢
        
          △
          =
        
        ⁢
        
          
            
              g
              opt
            
            ⁡
            
              (
              k
              )
            
          
        
        ⁢
        
          
            exp
            ⁡
            
              (
              
                
                  
                    -
                    jπ
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      M
                      k
                    
                    ⁡
                    
                      (
                      
                        
                          n
                          g
                        
                        -
                        1
                      
                      )
                    
                  
                
                
                  2
                  ⁢
                  M
                
              
              )
            
          
          .
        
      
    
    
      
        (
        15
        )
      
    
  




The values Qk are defined by:




  
    
      
        
          Q
          k
        
        =
        
          
            
              
                G
                d
              
              ⁡
              
                (
                
                  π
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      m
                      k
                    
                    /
                    M
                  
                
                )
              
            
            ⁢
            
              (
              
                
                  
                    
                      S
                      x
                    
                    ⁡
                    
                      (
                      
                        jπ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          k
                          /
                          M
                        
                      
                      )
                    
                  
                  ⁢
                  
                    
                      
                      
                        H
                        ⁡
                        
                          (
                          
                            jπ
                            ⁢
                            
                              
                            
                            ⁢
                            
                              k
                              /
                              M
                            
                          
                          )
                        
                      
                      
                    
                    2
                  
                
                +
                
                  
                    S
                    η
                  
                  ⁡
                  
                    (
                    
                      jπ
                      ⁢
                      
                        
                      
                      ⁢
                      
                        k
                        /
                        M
                      
                    
                    )
                  
                
              
              )
            
          
          
            
              
                S
                η
              
              ⁡
              
                (
                
                  jπ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    k
                    /
                    M
                  
                
                )
              
            
            ⁢
            H
            *
            
              (
              
                jπ
                ⁢
                
                  
                
                ⁢
                
                  k
                  /
                  M
                
              
              )
            
          
        
      
    
    
      
        (
        16
        )
      
    
  




The values of Qk may be computed during an initial training period and may be periodically updated during operation of the communication system.

As shown in FIGS. 5, 6A and 6B, the general feedback training process may be used to perform an initial training of a SCISF followed by periodic training analogous to the process described above with respect to FIGS. 1-3. One difference between the techniques is that a scaled reference signal (x*q)k is used rather than an unscaled reference xk.
Referring to FIG. 5, to perform the initial training, a predetermined sequence of bits xk is input to the transmitter. The transmitted signal is filtered and noise-corrupted by the transmission channel, resulting in a received sequence {yk} at the output of the A/D 80 in the receiver. The SCISF 90 filters and transforms the received sequence {yk} into an output sequence {{circumflex over (x)}k}. The output sequence {{circumflex over (x)}k} is compared (in a signal comparator 205) to a scaled reference sequence (x*q)k.
The scaled reference sequence is computed from a copy of the predetermined sequence xk that is stored in memory 210 in the receiver. As a first step, the predetermined sequence is input to a serial to parallel converter 510 and a DFT 515. The resulting frequency domain signal is input to a scaling filter 520 which applies the set of frequency domain scaling factors Qk that causes the SCISF to adapt to the desired spectral response, as discussed above. The scaled signal is input to an inverse discrete Fourier transform 330, a parallel to serial converter 340 and a cyclic prefix adder 350, resulting in a scaled reference sequence (x*q)k. The comparison of the output sequence {{circumflex over (x)}k} to the scaled reference sequence (x*q)k results in an error signal ek that is input to the LMS algorithm processor 215 along with sequence {{circumflex over (x)}k}. Alternatively, a frequency domain reference (e.g., a predetermined bit sequence that has been processed by a serial to parallel converter and DFT) may be stored in memory in the receiver, which would eliminate the need for the serial to parallel converter and discrete Fourier transform in the feedback loop.
Following the initial training, the SCISF is periodically trained during operation of the communication system. A sequence of communication data bits xk is input to the transmitter. Referring to FIG. 6A, the transmitted signal is filtered and noise-corrupted by the transmission channel, resulting in a received sequence {yk} at the output of the A/D 80 in the receiver. The SCISF 90 filters and transforms the received sequence {yk} into an output sequence {{circumflex over (x)}′k}.
The received sequence {yk} is also input to a delay 305 and then to a secondary SCISF 300 that has the same coefficients as the primary SCISF 90 following the initial training. The secondary SCISF 300 provides output sequence {ŷk}, which is compared to a reference sequence during the periodic training process. Such a configuration allows periodic training to be performed without disruption to the operation of the communication system. The secondary SCISF 300 is periodically or continuously trained using an algorithm similar to that used for the initial training. The new coefficients of the secondary SCISF 300 are periodically copied to the primary SCISF 90.
To compute the reference sequence, the data output of the decoder 140 is input to an encoder 320. The resulting frequency domain signal is input to a scaling filter 520 which applies the set of frequency domain scaling factors Qk that causes the SCISF to adapt to the desired spectral response, as discussed above. The scaled signal is input to an inverse discrete Fourier transform 330, a parallel to serial converter 340 and a cyclic prefix adder 350, resulting in a scaled reference sequence (x*q)k. The comparison of the output sequence {{circumflex over (x)}k} to the scaled reference sequence (x*q)k results in an error signal ek that is input to the LMS algorithm processor 215. The training process determines coefficients for the secondary SCISF 300 so that the output {{circumflex over (x)}k} matches the scaled reference sequence (x*q)k as closely as possible in a least squares sense, i.e., the mean square error between the output and the reference sequence is minimized. Periodically, the coefficients of the secondary SCISF 300 are copied to the primary SCISF 90.
Alternatively, as shown in FIG. 6B, the periodic training may be performed with a single SCISF 90. In this configuration, a received sequence {yk} is output by the A/D 80 in the receiver. The SCISF 90 filters and transforms the received sequence {yk} into an output sequence {{circumflex over (x)}′k}. The received sequence {yk} is also input to a delay. After the received sequence {yk} passes through the SCISF 90, a data switch 360 is changed from position A to position B; allowing the delayed received sequence to make a second pass through the SCISF 90. An output switch 370 also may be opened, so that data is not output during the training process. In addition, the SCISF coefficients are controlled by the LMS algorithm during the training process.
A reference sequence is computed as in the configuration of FIG. 6A. The data output of the decoder 140 is input to an encoder 320. The resulting frequency domain signal is input to a scaling filter 520 which applies the set of frequency domain scaling factors Qk that causes the SCISF to adapt to the desired spectral response, as discussed above. The scaled signal is input to an inverse discrete Fourier transform 330, a parallel to serial converter 340 and a cyclic prefix adder 350, resulting in a scaled reference sequence (x*q)k. The scaled reference sequence is input to the LMS algorithm processor.
The output sequence {{circumflex over (x)}k} of the second pass through the SCISF 90 is compared (in signal comparator 205) to the reference sequence (x*q)k. As noted above, the received sequence {yk} passes through a delay 305 before being input to the SCISF 90 for the second pass. The delay 305 compensates for the processing delay in the demodulation/decoding chain and the encoding/modulation chain. The comparison results in an error signal ek that is input to the LMS algorithm processor 215. The training process determines coefficients for the SCISF 90 so that the output {{circumflex over (x)}k} matches the scaled reference sequence (x*q)k as closely as possible in a least squares sense, i.e., the mean square error between the output and the reference sequence is minimized. The coefficients of the SCISF 90 then are updated to the coefficients determined in the training process.
In a third embodiment, the system dynamically selects the length of the cyclic prefix (CP) to maximize data throughput for a communication channel having a particular noise profile. As discussed above, a CP is added to each symbol prior to transmission through the communication channel to reduce the effects of ISI. However, because the CP constitutes redundant data, increasing the length of the CP reduces the efficiency of the communication system. Hence, to maximize efficiency, the length of the CP must be as short as the noise characteristics of the communication channel permit.
For a DMT communication system with M tones, the maximum sample rate W (samples/second) for a particular channel depends, in part, on the available bandwidth and hardware limitations. The sample rate includes communication data and CP bits. For a CP length of nc, the maximum symbol rate (which includes communication data, but not the CP) is W/(2M+nc).
Before determining the optimal CP length, the SCISF should be initially trained to the channel. However, a communication system need not have a SCISF to employ the CP optimization algorithm. It is noted that the SCISF coefficients determined during the training process do not depend on the CP length. The capacity of the sub-channel may be approximated as log(1+SNRi) bits per second, so the number of bits per symbol is Σi log(1+SNRi). For a CP length of nc, the maximum bit rate is expressed as a function of the cyclic prefix as:




  
    
      
        
          
            B
            a
          
          ⁡
          
            (
            
              n
              c
            
            )
          
        
        =
        
          
            W
            ⁢
            
              
                ∑
                i
              
              ⁢
              
                log
                ⁡
                
                  (
                  
                    1
                    +
                    
                      SNR
                      i
                    
                  
                  )
                
              
            
          
          
            
              2
              ⁢
              M
            
            +
            
              n
              c
            
          
        
      
    
    
      
        (
        17
        )
      
    
  




The optimal CP length is determined by computing the maximum bit rate for a set of candidate values of CP length and finding the length that maximizes Ba(nc).

The signal to noise ratio SNRi of each subchannel is determined by measuring the received signal and noise power and computing the ratio of the two. The noise power γi for the ith bin may be measured by transmitting a data communication sequence and computing the average of the squares of the errors measured at the output of the receiver DFT. The total received power (signal and noise) δi for the ith bin may be measured by computing the average of the squares of the outputs of the receiver DFT. The signal to noise ratio is determined from the expression: δi/γi=1+SNRi. Since the signal to noise ratio is determined in the receiver, the computed bit rate Ba(nc) must be transmitted back to the transmitter. The transmitter compares the bit rate to the values computed for other candidate CP lengths and selects the CP length nc with the highest maximum bit rate Ba(nc).
FIGS. 7A-7D and 8A-8D show performance simulations for test systems based on system parameters and test loops described in VDSL Alliance SDMT VDSL Draft Standard Proposal, Technical report, ANSI, 1998; and Very-high-speed digital subscriber lines: System requirements, T1E1.4/97-131R1, Technical report, ANSI, 1997. The results are for a VDSL system working over test loops 2 and 6 of length 4500 feet in the upstream direction. The system has a sampling frequency of 11.04 MHz. Noise is generated by near-end cross talk from an interfering ADSL and an interfering HDSL and white noise at a level of −140 dBm. The SCISF used in the simulations is length −15 FIR. A version of the Normalized LMS algorithm is used to train the SCISF during an initial training period using a predetermined transmitted sequence.
FIGS. 7A-7D show the simulated system performance for a communication system having the parameters defined for Test Loop 2, which is 4500 feet in length. FIG. 7A shows channel frequency response with and without a SCISF. The SCISF provides a much more uniform frequency response across the frequency band of interest and significantly improves the signal to noise ratio (SNR) in the higher frequency bins. FIG. 7B is a plot of the error signal (10 log|{circumflex over (x)}k−xk|) during the training process. The error decreases rapidly during the first few iterations and is nearly converged after only 20-30 iterations. FIG. 7C is a plot of transmitted power spectral density, received power spectral density and the additive noise power spectral density over the used subchannels at the output of the receiver A/D. FIG. 7D is a plot of SNR at the input to the receiver A/D, which is the maximum attainable SNR. The plot also shows the SNR at the output of the receiver DFT without a SCISF and the SNR at the outputs of the receiver DFT using an adapted SCISF.
FIGS. 8A-8D show the simulated system performance for a communication system having the parameters defined for Test Loop 6, which is 4500 feet in length. FIG. 8A shows channel frequency response with and without a SCISF. FIG. 8B is a plot of the error signal (10 log|{circumflex over (x)}k−xk|) during the training process. FIG. 8C is a plot of transmitted power spectral density, received power spectral density and the additive noise power spectral density over the used subchannels at the output of the receiver AID. FIG. 8D is a plot of SNR at the input to the receiver A/D. The plot also shows the SNR at the output of the receiver DFT without a SCISF and the SNR at the outputs of the receiver DFT using an adapted SCISF.
Other embodiments are within the scope of the following claims.

## Claims

1. A method for transmitting information comprising:
selecting a cyclic prefix length from a plurality of candidate lengths based on respective bit rates obtained for the candidate lengths; and
adding an end-portion of a block of information bits at a beginning of the block, wherein the added end-block portion has a length equal to the selected cyclic prefix length.

2. The method of claim 1 including transmitting the block of information bits with the end-portion added thereto through a communication channel.

3. The method of claim 1 wherein selecting a cyclic prefix length includes:
computing a respective maximum bit rate value for each of the candidate lengths; and
identifying a particular one of the candidate lengths having the largest maximum bit rate value of the computed maximum bit rate values.

4. The method of claim 1 including:
transmitting the computed respective bit rates; and
transmitting the block of information bits with the end-portion added thereto.

5. The method of claim 1 wherein selecting comprises determining the signal to noise ratio associated with each of the plurality of candidate lengths.

6. The method of claim 3 comprising:
transmitting the largest maximum bit rate value.

7. A method of dynamically selecting a cyclic prefix length, the method comprising:
computing a respective maximum bit rate value for each of a plurality of candidate cyclic prefix lengths;
identifying a particular one of the candidate cyclic prefix lengths having the largest maximum bit rate value of the computed maximum bit rate values; and
adding an end-portion of a block of information bits at a beginning of the block, wherein the added end-block portion has a length equal to the particular one candidate cyclic prefix length.

8. The method of claim 7, wherein the candidate cyclic prefix lengths include at least a first length and a second length, the method including:
transmitting data having a cyclic prefix of the first length;
computing a first maximum bit rate value for the cyclic prefix of the first length;
transmitting data having a cyclic prefix of the second length; and
computing a second maximum bit rate value for the cyclic prefix of the second length.

9. The method of claim 7 wherein computing a respective maximum bit rate value comprises determining the signal to noise ratio associated with each of the plurality of candidate cyclic prefix lengths.

10. The method of claim 7 comprising:
transmitting the largest maximum bit rate value.

11. The method of claim 7 wherein:
the computing a respective maximum bit rate value is performed by a discrete multi-tone receiver; and
the identifying a particular one of the candidate cyclic prefix lengths is performed by a discrete multi-tone transmitter.

12. A discrete multi-tone communication system comprising:
a discrete multi-tone receiver comprising:
means for computing a bit rate value for each of a plurality of candidate cyclic prefix lengths;
means for transmitting the bit rate values;

a discrete multi-tone transmitter comprising:
means for receiving the bit rate values;
means for identifying a particular one of the candidate cyclic prefix lengths having the largest bit rate value of the computed bit rate values.

13. The system of claim 12 wherein the discrete multi-tone transmitter comprises:
means for adding an end-portion of a block of information bits at a beginning of the block, wherein the added end-block portion has a length equal to the particular one candidate cyclic prefix length.

14. The system of claim 12 wherein the means for computing a bit rate value determines the signal to noise ratio associated with each of the plurality of candidate cyclic prefix lengths.

15. An article comprising a machine-readable medium that stores machine-executable instructions for causing a machine to:
select a cyclic prefix length from a plurality of candidate lengths based on respective bit rates obtained for the candidate lengths; and
add an end-portion of a block of information bits at a beginning of the block, wherein the added end-block portion has a length equal to the selected cyclic prefix length.

16. The article of claim 15, further causing a machine to:
transmit the block of information bits with the end-portion added thereto through a communication channel.

17. The article of claim 15, further causing a machine to:
compute a respective maximum bit rate value for each of the candidate lengths; and
identify a particular one of the candidate lengths having the largest maximum bit rate value of the computed maximum bit rate values.

18. The article of claim 15, further causing a machine to:
transmit the computed respective bit rates; and
transmit the block of information bits with the end-portion added thereto.

19. The article of claim 15, further causing a machine to:
determine the signal to noise ratio associated with each of the plurality of candidate lengths.

20. An article comprising a machine-readable medium that stores machine-executable instructions for causing a machine to:
compute a respective maximum bit rate value for each of a plurality of candidate cyclic prefix lengths;
identify a particular one of the candidate cyclic prefix lengths having the largest maximum bit rate value of the computed maximum bit rate values; and
add an end-portion of a block of information bits at a beginning of the block, wherein the added end-block portion has a length equal to the particular one candidate cyclic prefix length.

21. The article of claim 20, further causing a machine to:
transmit the largest maximum bit rate value.

22. The article of claim 20, further causing a machine to:
determine the signal to noise ratio associated with each of the plurality of candidate cyclic prefix lengths.