We propose a technique to reduce the number of trellis states in BCJR-type algorithms, i.e., algorithms. with a structure similar to that of the well-known algorithm by Bahl, Cocke, Jelinek, and Raviv (1974). This work is inspired by reduced-state sequence detection (RSSD). The key idea is the construction, during one of the recursions in the reduced-state trellis, of a “survivor map” to be used in the other recursion. In a more general setting, two distinct survivor maps could be determined in the two recursions and used jointly to approximate the a posteriori probabilities. Three examples of application to iterative decoding are shown: (1) coherent detection for intersymbol interference (ISI) channels; (2) noncoherent detection based on an algorithm previously proposed by the authors; and (3) detection based on linear prediction for Rayleigh fading channels. As in classical RSSD, the proposed algorithm allows significant state-complexity reduction with limited performance degradation.

Reduced-state BCJR-type algorithms / Colavolpe, Giulio; Ferrari, Gianluigi; Raheli, Riccardo. - In: IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS. - ISSN 0733-8716. - 19(2001), pp. 848-859. [10.1109/49.924869]

Reduced-state BCJR-type algorithms

COLAVOLPE, Giulio;FERRARI, Gianluigi;RAHELI, Riccardo
2001

Abstract

We propose a technique to reduce the number of trellis states in BCJR-type algorithms, i.e., algorithms. with a structure similar to that of the well-known algorithm by Bahl, Cocke, Jelinek, and Raviv (1974). This work is inspired by reduced-state sequence detection (RSSD). The key idea is the construction, during one of the recursions in the reduced-state trellis, of a “survivor map” to be used in the other recursion. In a more general setting, two distinct survivor maps could be determined in the two recursions and used jointly to approximate the a posteriori probabilities. Three examples of application to iterative decoding are shown: (1) coherent detection for intersymbol interference (ISI) channels; (2) noncoherent detection based on an algorithm previously proposed by the authors; and (3) detection based on linear prediction for Rayleigh fading channels. As in classical RSSD, the proposed algorithm allows significant state-complexity reduction with limited performance degradation.
Reduced-state BCJR-type algorithms / Colavolpe, Giulio; Ferrari, Gianluigi; Raheli, Riccardo. - In: IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS. - ISSN 0733-8716. - 19(2001), pp. 848-859. [10.1109/49.924869]
File in questo prodotto:
File Dimensione Formato  
00924869.pdf

non disponibili

Tipologia: Documento in Post-print
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 312.25 kB
Formato Adobe PDF
312.25 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11381/1450617
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 93
  • ???jsp.display-item.citation.isi??? 79
social impact