Abstract: An N-point Fast Fourier Transform (FFT) using mixed radix stages with in-place data sample storage may be performed by decomposing N into a product of R sequential mixed radix stages of radix-r(i). N data samples are partitioned into at least B memory banks, where B is equal to a largest radix of the R radix stages. Each input data sample to each radix-r(i) butterfly comes from r(i) different memory banks and the output data samples are written to the same memory locations in the r(i) memory banks. Determining from which memory bank the input data samples and output data samples of the butterflies are stored is done based on the radix size and sequential position of the radix stage. Determining the address of the input data samples and the output data samples within each memory bank is based on the radix size and sequential position of the radix stage.

Abstract: An N-point Fast Fourier Transform (FFT) using mixed radix stages with in-place data sample storage may be performed by decomposing N into a product of R sequential mixed radix stages of radix-r(i). N data samples are partitioned into at least B memory banks, where B is equal to a largest radix of the R radix stages. Each input data sample to each radix-r(i) butterfly comes from r(i) different memory banks and the output data samples are written to the same memory locations in the r(i) memory banks. Determining from which memory bank the input data samples and output data samples of the butterflies are stored is done based on the radix size and sequential position of the radix stage. Determining the address of the input data samples and the output data samples within each memory bank is based on the radix size and sequential position of the radix stage.

Abstract: A method for Orthogonal Frequency Division Multiplexing Access (OFDMA) ranging is provided. The method includes receiving a signal having OFDMA symbols. An FFT is performed on this signal. Matching ranging codes are found. The power for a given hypothesized ranging code is determined and compared to a power threshold to determine if the code was transmitted. The timing offset and power are reported as the result of ranging.

Abstract: In a digital subscriber line (DSL) network, a net coding gain penalty is determined for provision of impulse noise protection. FEC coding, interleaver depth, and framing parameters are selected to maximize the impulse noise protection while not causing an excessive increase in transmit power or equivalently, loss of net coding gain.

Abstract: A system and method for changing the data rate over an interleaved latency path. The method overcomes shortfalls of the ADSL2 seamless rate adaptation (SRA) and dynamic rate repartitioning (DRR).

Abstract: A method for charging the data rate over an interleaved latency path overcomes shortfalls of the ADSL2 seamless rate adaptation (SRA) and dynamic rate repartitioning (DRR). The interleaver depth is allowed to change during either a rate charge or rate repartioning so that the interleaver delay is constant before and after the change. The transmitter pauses its transmission for a time approximately equal to the delay of the interleaver so that there are approximately no errors introduced at the receiver.

Abstract: A system and method for improving bit-loading in discrete multitone (DMT)-based digital subscriber line (DSL) modems. In one embodiment, the system includes: (1) a model generator configured to generate a model containing a calculated total bit loading for an assumed gross coding gain and estimated total bit loadings for a other plurality of assumed gross coding gains and (2) a bit loader associated with the model generator and configured to load bits in accordance with the model.

Abstract: A method for constellation design in telecommunications network using pulse code modulation to transmit data signals upstream between client and server voice-band modems. The invention selects a constellation for transmission over an analog channel of an equivalence class of data points using pulse code modulation based on the presence or absence of robbed bit signaling and interference from echo levels. The constellation is designed by determining noise in a PCM channel using a cumulative distribution function for echo, determining the extent of said noise for an array of possible constellation points, and selecting constellation points such that the largest negative noise of a first point remains above the largest positive noise level of a neighboring second point. Constellations are created off-line and stored store for retrieval during modulation depending on the level of the echo.

Abstract: A method of constructing a valid set of configuration parameters for ADSL2 and ADSL2+ compliant systems include selecting delays of a power of two ms, in which the ADSL2 or ADSL2+ compliant system may also possess a selected minimum noise protection value to produce maximum downstream and upstream net data rates corresponding to the selected delay and the selected minimum noise protection value.

Abstract: ADSL systems with hybrid FDD/TDD duplexing using a hyperframe of mixtures of upstream-downstream FDD frames and all downstream frames.

Abstract: A new class of fixed partial response targets are disclosed for use in a PRML magnetic medium read channel. The preferred embodiment exhibits an equalization response characterized by the polynomial 7+4*D−4*D2−5*D3−2*D4, where D represents the unit delay operator. This read channel target provides improved matching to the inherent magnetic channel over the known canonical class of targets (1−D)(1+D){circumflex over ( )}N, and thereby reduces equalization losses. The improved spectral matching reduces amplification of noise in the channel, thereby reducing bit-error-rates. The new class of targets also exhibits a spectral null at DC, reducing problems for offset cancellation circuitry and making the disk drive less sensitive to thermal asperities. It also exhibits a spectral depression rather than a spectral null at the Nyquist frequency, making quasi-catastrophic error sequences virtually impossible.

Abstract: A data channel, such as a magnetic recording/playback channel implements a time-varying maximum-transition-run code such that the code allows three consecutive transitions while it removes a dominant plus-minus-plus error-event and does not permit of four or more consecutive transitions.