Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,110,144 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Binary symmetric channel
Convolutional code
Forward error correction
Forward–backward algorithm
Expand
Broader (1)
Error detection and correction
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Optimal trajectory planning by Big Bang-Big Crunch algorithm
Sabri Yilmaz
,
M. Gokasan
International Conference on Control, Decision and…
2014
Corpus ID: 15789948
Path planning is an interesting topic which is affected by lots of variables, as: time, energy, torque and stability. In this…
Expand
2010
2010
Symmetric Information Rate of an Ideal Readback Two Dimensional Magnetic Recording (TDMR) Channel with Random Voronoi Grains
E. Hwang
,
R. Negi
,
B. Kumar
IEEE International Conference on Communications
2010
Corpus ID: 29654069
Two-dimensional magnetic recording (TDMR) is a data storage paradigm that has recently been proposed to record more than one…
Expand
2010
2010
Rate-Adaptive nonbinary-LDPC-coded modulation with backpropagation for long-haul optical transport networks
M. Arabaci
,
I. Djordjevic
,
T. Schmidt
,
R. Saunders
,
ro Marcocci
International Conference on Transparent Optical…
2010
Corpus ID: 16035669
We propose a novel rate-adaptive, polarization-multiplexed, nonbinary-LDPC-coded modulation scheme with backpropagation as an…
Expand
2008
2008
Trellis-Based Receivers for SC-FDMA Transmission over MIMO ISI Channels
W. Gerstacker
,
P. Nickel
,
F. Obernosterer
,
U. L. Dang
,
P. Gunreben
,
W. Koch
IEEE International Conference on Communications
2008
Corpus ID: 2626396
For the uplink of the E-UTRA long term evolution (LTE) system, single-carrier frequency-division multiple access (SC-FDMA…
Expand
2005
2005
Low-complexity iterative joint source-channel decoding for variable-length encoded Markov sources
R. Thobaben
,
J. Kliewer
IEEE Transactions on Communications
2005
Corpus ID: 2803139
In this paper, we present a novel packetized bit-level decoding algorithm for variable-length encoded Markov sources, which…
Expand
2004
2004
A BCJR-DFE Based Receiver for Achieving Near Capacity Performance on Inter Symbol Interference Channels
K. Narayanan
2004
Corpus ID: 11380437
A non-iterative receiver is proposed to achieve near capacity performance on inter-symbol interference channels. There are two…
Expand
Highly Cited
2001
Highly Cited
2001
Extrinsic information in iterative decoding: a unified view
G. Colavolpe
,
G. Ferrari
,
R. Raheli
IEEE Transactions on Communications
2001
Corpus ID: 8516679
We address the use of the extrinsic information generated by each component decoder in an iterative decoding process. The BJCR…
Expand
2000
2000
Memory EÆcient Implementation of the BCJR Algorithm
S. Huettinger
2000
Corpus ID: 15171630
In this paper, a modi cation of the BCJR algorithm { the Forward BCJR algorithm { is introduced. This novel algorithm can…
Expand
2000
2000
Contradicting a myth: good turbo codes with large memory order
P. Massey
,
O.Y. Takeshita
,
D. J. Costello
IEEE International Symposium on Information…
2000
Corpus ID: 61288534
The purpose of this paper is to contradict a common myth about turbo codes. We are specifically addressing R=1/3 parallel…
Expand
1997
1997
Reduced-search BCJR algorithms
V. Franz
,
J.B. Anderson
Proceedings of IEEE International Symposium on…
1997
Corpus ID: 57556749
Summary form only given. There is great interest in coding systems that employ various kinds of code concatenation. In all of…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE