Reduced complexity symbol-by-symbol demodulation

Author

Fitz, Michael P. ; Gelfand, Saul B.

Author_Institution

Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA

fYear

1995

fDate

17-22 Sep 1995

Firstpage

291

Abstract

Reduced complexity symbol-by-symbol demodulation is examined. We examine the performance with standard complexity reduction techniques (e.g., M-algorithm and T-algorithm) and then derive a reduced state symbol-by-symbol demodulation algorithm which makes symbol-by-symbol demodulation performance and complexity competitive with sequence estimation. An overview is also included of optimum recursive estimation

Keywords

computational complexity; demodulation; recursive estimation; M-algorithm; T-algorithm; complexity reduction techniques; optimum recursive estimation; performance; reduced complexity symbol by symbol demodulation; reduced state symbol-by-symbol demodulation algorithm; sequence estimation; Concatenated codes; Decoding; Demodulation; Error probability; Partitioning algorithms; Recursive estimation; State estimation; Statistics; Time measurement; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on

Conference_Location

Whistler, BC

Print_ISBN

0-7803-2453-6

Type

conf

DOI

10.1109/ISIT.1995.535806

Filename

535806

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2733166