Results 301 to 310 of about 1,103,393 (348)
Some of the next articles are maybe not open access.
Iterative decoder architectures
IEEE Communications Magazine, 2003Implementation constraints on iterative decoders applying message-passing algorithms are investigated. Serial implementations similar to traditional microprocessor datapaths are compared against architectures with multiple processing elements that exploit the inherent parallelism in the decoding algorithm. Turbo codes and low-density parity check codes,
null Engling Yeo +2 more
openaire +1 more source
Stochastic Bit-Wise Iterative Decoding of Polar Codes
IEEE Transactions on Signal Processing, 2019Polar codes have received recent attention due to their potential to be applied in advanced wireless communication protocols such as the fifth generation mobile communication system (5G).
Kaining Han +3 more
semanticscholar +1 more source
Iterative Detection and Decoding for Large-Scale Multiple-Antenna Systems With 1-Bit ADCs
IEEE Wireless Communications Letters, 2018We present a novel iterative detection and decoding scheme for uplink large-scale multiuser multiple-antenna systems. In order to reduce the receiver’s energy consumption and computational complexity, 1-bit analog-to-digital converters are used in the ...
Z. Shao, R. D. de Lamare, L. Landau
semanticscholar +1 more source
Deriving the PCC iterative decoder from the SCC iterative decoder
2010 6th International Symposium on Turbo Codes & Iterative Information Processing, 2010In this paper, we show that the iterative decoder for parallel concatenated codes can be derived from the iterative decoder for serially concatenated codes. In order to show this, we use the observation that any parallel concatenated code (PCC) may be regarded as a serially concatenated code (SCC) with certain code constraints satisfied.
Anders Nilsson, Tor M. Aulin
openaire +1 more source
Toward Low-latency Iterative Decoding of QLDPC Codes Under Circuit-Level Noise
arXiv.orgWe introduce a sliding window decoder based on belief propagation (BP) with guided decimation for the purposes of decoding quantum low-density parity-check codes in the presence of circuit-level noise.
Anqi Gong, Sebastian Cammerer, J. Renes
semanticscholar +1 more source
Transactions of the Institute of Measurement and Control
In practical applications, due to the limited communication bandwidth, the network control systems (NCSs) are prone to data dropouts when the load is high.
Yujuan Tao +4 more
semanticscholar +1 more source
In practical applications, due to the limited communication bandwidth, the network control systems (NCSs) are prone to data dropouts when the load is high.
Yujuan Tao +4 more
semanticscholar +1 more source
Iterative Decoding With Replicas
IEEE Transactions on Information Theory, 2007Replica shuffled versions of iterative decoders for low-density parity-check (LDPC) codes and turbo codes are presented. The proposed schemes can converge faster than standard and plain shuffled approaches. Two methods, density evolution and extrinsic information transfer (EXIT) charts, are used to analyze the performance of the proposed algorithms ...
Juntan Zhang +3 more
openaire +1 more source
Iterative Decoding using Eigenmessages
IEEE Transactions on Communications, 2009The eigenmessage approach to iterative decoding introduces a degree of nonlocality into a belief propagation decoder by representing an entire set of messages around a cycle of the Tanner graph as a linear operator. The eigenvector for the operator represents a fixed point of the belief propagation algorithm around a cycle, with incident messages fixed.
Todd Moon +3 more
openaire +1 more source
Accelerating Auto-regressive Text-to-Image Generation with Training-free Speculative Jacobi Decoding
International Conference on Learning RepresentationsThe current large auto-regressive models can generate high-quality, high-resolution images, but these models require hundreds or even thousands of steps of next-token prediction during inference, resulting in substantial time consumption.
Yao Teng +7 more
semanticscholar +1 more source
IEEE Transactions on Information Theory, 1969
It is shown that use of a two-stage decoding procedure consisting simply of an inner stage of block decoding and an outer stage employing a single sequential decoder does not result in an improvement in the computational overflow problem for the sequential decoder.
openaire +2 more sources
It is shown that use of a two-stage decoding procedure consisting simply of an inner stage of block decoding and an outer stage employing a single sequential decoder does not result in an improvement in the computational overflow problem for the sequential decoder.
openaire +2 more sources