Skip to search formSkip to main contentSkip to account menu

BCJR algorithm

Known as: BCJR 
The BCJR algorithm is an algorithm for maximum a posteriori decoding of error correcting codes defined on trellises (principally convolutional codes… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Path planning is an interesting topic which is affected by lots of variables, as: time, energy, torque and stability. In this… 
2010
2010
Two-dimensional magnetic recording (TDMR) is a data storage paradigm that has recently been proposed to record more than one… 
2010
2010
We propose a novel rate-adaptive, polarization-multiplexed, nonbinary-LDPC-coded modulation scheme with backpropagation as an… 
2008
2008
For the uplink of the E-UTRA long term evolution (LTE) system, single-carrier frequency-division multiple access (SC-FDMA… 
2005
2005
In this paper, we present a novel packetized bit-level decoding algorithm for variable-length encoded Markov sources, which… 
2004
2004
A non-iterative receiver is proposed to achieve near capacity performance on inter-symbol interference channels. There are two… 
Highly Cited
2001
Highly Cited
2001
We address the use of the extrinsic information generated by each component decoder in an iterative decoding process. The BJCR… 
2000
2000
In this paper, a modi cation of the BCJR algorithm { the Forward BCJR algorithm { is introduced. This novel algorithm can… 
2000
2000
The purpose of this paper is to contradict a common myth about turbo codes. We are specifically addressing R=1/3 parallel… 
1997
1997
Summary form only given. There is great interest in coding systems that employ various kinds of code concatenation. In all of…