Achieving high image quality is an important aspect in an increasing number of wireless multimedia applications. These applications require resource efficient error correction hardware to detect and correct errors introduced by the communication channel. This paper presents an innovative flexible architecture for error correction using Low-Density Parity-Check (LDPC) codes. The proposed partial...

Turbo codes enable high quality communication links by offering exceptional error correction capabilities. Turbo coding is proposed in the coming Universal Mobile Telecommunication Systems (UMTS) standard by the 3GPP for high data rates channels. Direct realization of the Turbo decoder algorithm in hardware encounters many challenges, such as algorithm complexity, large silicon area, high power...

An iterative decoding architecture based on stochastic computational elements is studied. Simulation results for a (7,4) Hamming code show only about a 0.5dB loss with respect to a belief propagationbased decoder. The critical path of the decoder is a single XOR gate, allowing it to operate at very high speed. The proposed method provides a digital, technology independent, alternative to analog...

Low Density Parity Checker (LDPC) decoder requires large amount of memory access which leads to high energy consumption. The amount of achievable memory bypassing depends on the decoding orders of the layers. The proposed decoder was implemented in TSMC 0.18m CMOS process. Experimental results show that for a LDPC decoder targeting IEEE 802.11n specification, the amount of memory access values ...

(Abstract) A new coding scheme called "turbo coding" has generated tremendous interest in channel coding of digital communication systems due to its high error correcting capability. Two key innovations in turbo coding are parallel concatenated encoding and iterative decoding. A soft-in soft-out component decoder can be implemented using the maximum a posteriori (MAP) or the maximum likelihood ...

We propose the new group metric (GM) soft-decision decoder for convolutionally coded synchronous multiple-access channels. The GM decoder exploits the independently operating encoders of the multiuser channel by making decoding decisions for a subset of the users, but incorporating all the multiuser information in its metrics. For a single user, this decoder will have a reduced complexity that ...

OBJECTIVE When using an intracortical BCI (iBCI), users modulate their neural population activity to move an effector towards a target, stop accurately, and correct for movement errors. We call the rules that govern this modulation a 'feedback control policy'. A better understanding of these policies may inform the design of higher-performing neural decoders. APPROACH We studied how three par...

Classical ML decoders of MIMO systems like the sphere decoder, the Schnorr-Euchner algorithm, the Fano and the stack decoders suffer of high complexity for high number of antennas and large constellation sizes. We propose in this paper a novel sequential algorithm which combines the stack algorithm search strategy and the sphere decoder search region. The proposed decoder that we call the Spher...

Modern serialization formats for digital video data are designed in a way that they allow for the combination of high compression rates, high quality as well as performant enand decoding. As the capability for real-time decoding often is a requirement, concrete decoders are usually implemented in a way that they best fit a specific architecture and, thus, are not portable. In scenarios, where i...