Comparison of computational complexity of adaptive equalization and OFDM for indoor wireless networks

Author

McDonnell, J.T.E. ; Wilkinson, T.A.

Author_Institution

Hewlett-Packard Lab., Bristol, UK

Volume

3

fYear

1996

fDate

15-18 Oct 1996

Firstpage

1088

Abstract

The computational requirements are investigated of conventional decision-feedback adaptive equalization using the least-mean-square (LMS) algorithm and orthogonal frequency division multiplexing (OFDM). This comparison was initiated to determine the least computationally intensive way of countering multipath effects in indoor wireless networks. Data rates examined ranged from 10 Mbits/s to 100 Mbits/s. For these data rates it was found that OFDM presents a significantly lower computational burden

Keywords

adaptive equalisers; computational complexity; decision feedback equalisers; digital radio; frequency division multiplexing; indoor radio; least mean squares methods; multipath channels; 10 to 100 Mbit/s; DFE; LMS algorithm; OFDM; adaptive equalization; computational complexity; decision-feedback adaptive equalization; indoor wireless networks; least-mean-square algorithm; multipath effects; orthogonal frequency division multiplexing; Adaptive equalizers; Bit rate; Computational complexity; Computer networks; Convergence; Decision feedback equalizers; Iterative algorithms; Least squares approximation; OFDM; Wireless networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Personal, Indoor and Mobile Radio Communications, 1996. PIMRC'96., Seventh IEEE International Symposium on

Conference_Location

Taipei

Print_ISBN

0-7803-3692-5

Type

conf

DOI

10.1109/PIMRC.1996.568450

Filename

568450