scispace - formally typeset
Journal ArticleDOI

Impulse response shortening for discrete multitone transceivers

Peter J. W. Melsa, +2 more
- 01 Dec 1996 - 
- Vol. 44, Iss: 12, pp 1662-1672
Reads0
Chats0
TLDR
Various methods of determining the coefficients for this time-domain finite impulse response (FIR) filter are explored and an optimal shortening and a least-squares approach are developed for shortening the channel's impulse response.
Abstract
In discrete multitone (DMT) transceivers an intelligent guard time sequence, called a cyclic prefix (CP), is inserted between symbols to ensure that samples from one symbol do not interfere with the samples of another symbol. The length of the CP is determined by the length of the impulse response of the effective physical channel. Using a long CP reduces the throughput of the transceiver, To avoid using a long CP, a short time-domain finite impulse response (FIR) filter is used to shorten the effective channels impulse response. This paper explores various methods of determining the coefficients for this time-domain filter. An optimal shortening and a least-squares (LS) approach are developed for shortening the channel's impulse response. To provide a computationally efficient algorithm a variation of the LS approach is explored. In full-duplex transceivers the length of the effective echo path impacts the computational requirements of the transceiver. A new paradigm of joint shortening is introduced and three methods are developed to jointly shorten the channel and the echo impulse responses in order to reduce the length of the CP and reduce computational requirements for the echo canceller.

read more

Citations
More filters
Proceedings ArticleDOI

Delay optimized zero-forcing channel shortening algorithm for wireless communication

TL;DR: This paper proposes a method to include a delay in the zero-forcing equalizer and obtain an optimal value of the delay, based on the location of zeros of the channel, using numerical simulations.
Proceedings Article

Enhancing Data Efficiency in IEEE- 802.11a Using Frequency and Time domain Equalization

TL;DR: In this article, the cyclic prefix between the OFDM symbols is removed by equalization and the intersymbol interference and intercarrier interference are removed at the transmitter itself by transmitting data in unused carriers, which is the combination of data in the used carriers.
Proceedings ArticleDOI

A new algorithm for joint impulse response shortening in DMT systems

TL;DR: A new algorithm is proposed that is able to reduce the effective channel and echo impulse responses using a single TEQ filter and has better throughput performance for the channel path and better generalized signal-to-interference ratio for the echo path than some existing algorithm.
References
More filters
Journal ArticleDOI

A new look at the statistical model identification

TL;DR: In this article, a new estimate minimum information theoretical criterion estimate (MAICE) is introduced for the purpose of statistical identification, which is free from the ambiguities inherent in the application of conventional hypothesis testing procedure.
Journal ArticleDOI

A discrete multitone transceiver system for HDSL applications

TL;DR: A discrete multitone (DMT) transceiver design for high bit rate digital subscriber line (HDSL) access is presented and analyzed and is an excellent candidate for HDSL implementation.
Proceedings ArticleDOI

Equalizer training algorithms for multicarrier modulation systems

TL;DR: Several algorithms for designing the time-domain equalizer, which use adaptation in the frequency domain and windowing in the time domain in order to minimize the mean squared error of the equalized response, are described.
Proceedings ArticleDOI

A cost-effective maximum likelihood receiver for multicarrier systems

TL;DR: Results indicate that near-optimum performance can be achieved by using the general optimum class of structures derived that includes the decision feedback equalizer and the lesser-known autoregressive moving average filters at a great computational reduction.
Proceedings ArticleDOI

Recursive ladder algorithms for ARMA modeling

TL;DR: In this paper, the extension of the all-pole (AR) exact least-squares ladder algorithms to the pole-zero (ARMA) case is presented, based on a general set of recursions obtained by a geometric approach.
Related Papers (5)