Title :
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
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;
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
DOI :
10.1109/ISIT.1995.535806
