DocumentCode :
2251665
Title :
Efficient architectures for soft-output algorithms
Author :
Chugg, Keith M. ; Chen, Xiaopeng
Author_Institution :
Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA
Volume :
1
fYear :
1998
fDate :
7-11 Jun 1998
Firstpage :
126
Abstract :
Algorithms which compute either the a posteriori probability (APP) or the minimum sequence metric (MSM) of an input symbol to a finite state machine based on some portion of the observation sequence are developed. Full-record (i.e., type-I) and fixed-delay algorithms are both considered and related to existing algorithms. In particular, the fixed-delay APP and MSM algorithms developed are shown to be significantly less complex than the equivalent algorithms of Li, Vucetic, and Sato (1995) i.e. the optimal soft-output algorithm (OSA) and the simplified version (SSA), respectively
Keywords :
algorithm theory; finite state machines; information theory; probability; a posteriori probability; efficient architectures; finite state machine; fixed-delay algorithms; full-record algorithms; minimum sequence metric; observation sequence; soft-output algorithms; Additive noise; Automata; Computer architecture; Concatenated codes; Convolutional codes; Integrated circuit noise; Interleaved codes; Intersymbol interference; Iterative algorithms; Semiconductor optical amplifiers;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 1998. ICC 98. Conference Record. 1998 IEEE International Conference on
Conference_Location :
Atlanta, GA
Print_ISBN :
0-7803-4788-9
Type :
conf
DOI :
10.1109/ICC.1998.682599
Filename :
682599
Link To Document :
بازگشت