Results 11 to 20 of about 1,103,393 (348)
IEEE Information Theory Workshop, 2005., 2005 We analyze the relation between iterative decoding and the properties of the extended parity check matrix. By considering a modified version of bit flipping, which produces a list of decoded words, we derive several relations between decodable error patterns and parameters of the code.
J. Justesen, T. Hoholdt, J. Hjaltason
openaire +3 more sources
Shuffled Iterative Decoding [PDF]
IEEE Transactions on Communications, 2005 Shuffled versions of iterative decoding of low-density parity-check codes and turbo codes are presented. The proposed schemes have about the same computational complexity as the standard versions, and converge faster. Simulations show that the new schedules offer better performance/complexity tradeoffs, especially when the maximum number of iterations ...
J. Zhang, M.P.C. Fossorier
openaire +2 more sources
An Iterative BP-CNN Architecture for Channel Decoding [PDF]
IEEE Journal on Selected Topics in Signal Processing, 2017 Inspired by the recent advances in deep learning, we propose a novel iterative belief propagation – convolutional neural network (BP-CNN) architecture for channel decoding under correlated noise.
Fei Liang, Cong Shen, Feng Wu
semanticscholar +1 more source
Deep BCD-Net Using Identical Encoding-Decoding CNN Structures for Iterative Image Recovery [PDF]
Image, Video, and Multidimensional Signal Processing Workshop, 2018 In “extreme” computational imaging that collects extremely undersampled or noisy measurements, obtaining an accurate image within a reasonable computing time is challenging.
Il Yong Chun, J. Fessler
semanticscholar +1 more source
Optimum non-iterative turbo-decoding [PDF]
Proceedings of 8th International Symposium on Personal, Indoor and Mobile Radio Communications - PIMRC '97, 2002 By observing the structure of the decoder's trellis a new, non-iterative turbo-decoder based on a super-trellis structure is proposed, which exhibits the same decoding complexity as a conventional convolutional decoder possessing an identical number of trellis states.
Breiling, M, Hanzo, L
openaire +2 more sources
SSCANL decoder based joint iterative detection and decoding algorithm
Dianxin kexue, 2022 In order to improve the receiver performance of the sparse code multiple access (SCMA) system based on polar codes, the cyclic redundancy check (CRC) aided joint iterative detection and decoding receiver scheme based on simplify soft cancellation list ...
Chongyang LIU, Rui GUO
doaj +2 more sources
A Hypergraph Filtering Based Iterative Decoding Approach for Linear Channel Codes
IEEE Access, 2021 Efficient decoding for general linear channel codes has been a long standing problem. Message passing type algorithms can achieve near-optimal performance for channel codes with sparse check matrices and long code-lengths, but they may suffer from ...
Jiaqi He +4 more
doaj +1 more source
An Iterative Joint Linear-Programming Decoding of LDPC Codes and Finite-State Channels [PDF]
, 2011 In this paper, we introduce an efficient iterative solver for the joint linear-programming (LP) decoding of low-density parity-check (LDPC) codes and finite-state channels (FSCs). In particular, we extend the approach of iterative approximate LP decoding,
Kim, Byung-Hak, Pfister, Henry D.
core +1 more source
New criteria for iterative decoding [PDF]
2009 IEEE International Conference on Acoustics, Speech and Signal Processing, 2009 Iterative decoding was not originally introduced as the solution to an optimization problem rendering the analysis of its convergence very difficult. In this paper, we investigate the link between iterative decoding and classical optimization techniques.
Alberge, Florence +2 more
openaire +4 more sources
Convolutional codes for iterative decoding [PDF]
2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications, 2008 This paper gives an overview of three different classes of convolutional codes that are suitable for iterative decoding. They are characterized by the type of component codes that are used to construct the overall codes, which can be trivial parity-check constraints, block component codes, or convolutional component codes.
Lentmaier, Michael +3 more
openaire +3 more sources