Fast joint detection with cyclic reduction exploiting displacement structures

Author

Yang, Weidong ; Kim, Sang-Youb ; Xu, Guanghan ; Kavak, Adnan

Author_Institution

Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA

Volume

5

fYear

2000

fDate

2000

Firstpage

2857

Abstract

Joint detection with the minimum-mean square error (MMSE) criterion has been explored in previous works. Yang, Liu, Xu and Kim (see Asilomar Conference on Signals, Systems and Computers, Asilomar, CA, 1999) discussed joint detection with cyclic reduction, which has been proved to be faster than the popular Cholesky decomposition based algorithm under many scenarios. In this paper, a faster version of cyclic reduction which exploits displacement structures is presented. The proposed fast algorithm is useful when the channel length is long. Simulation results are given for a wireless communication setup

Keywords

code division multiple access; computational complexity; land mobile radio; least mean squares methods; matrix algebra; signal detection; Cholesky decomposition based algorithm; MMSE criterion; antenna array CDMA system; base station; channel length; computational complexity; cyclic reduction; displacement structures; downlink; fast algorithm; fast joint detection; matrix; minimum-mean square error; mobile terminals; simulation results; uplink; wireless communication; Bismuth; Computational modeling; Computer errors; Detection algorithms; Equations; Matrix decomposition; Multiaccess communication; Partitioning algorithms; Wireless communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 2000. ICASSP '00. Proceedings. 2000 IEEE International Conference on

Conference_Location

Istanbul

ISSN

1520-6149

Print_ISBN

0-7803-6293-4

Type

conf

DOI

10.1109/ICASSP.2000.861117

Filename

861117