A low-complexity soft-decision decoding architecture for the binary extended Golay code

International audienceThe (24, 12, 8) extended binary Golay code is a well-known rate-1/2 short block-length linear error-correcting code with remarkable properties. This paper investigates the design of an efficient low-complexity soft-decision decoding architecture for this code. A dedicated algorithm is introduced that takes advantage of the code’s properties to simplify the decoding process. Simulation results show that the proposed algorithm achieves close to maximum-likelihood performance with low computational cost. The decoder architecture is described, and VLSI synthesis results are presented

Design and implementation of a soft-decision decoder for Cortex codes

International audienceCortex codes are a family of rate-1/2 self-dual systematic linear block codes with good distance properties. This paper investigates the challenging issue of designing an efficient soft-decision decoder for Cortex codes. A dedicated algorithm is introduced that takes advantage of the particular structure of the code to simplify the decoding. Simulation results show that the proposed algorithm achieves an excellent trade-off between performance and complexity for short Cortex codes. A decoder architecture for the (32,16,8) Cortex code based on the (4,2,2) Hadamard code has been successfully designed and implemented on FPGA device. To our knowledge, this is the first efficient digital implementation of a soft-decision Cortex decoder

Joint Space-Time Coded Modulation and Channel Coding for Iterative Non-Coherent MIMO Schemes

cet article a été publié dans la conférence IEEE WPMC 2011(3-6octobre)International audienceA new joint channel-coding, modulation and spacetime coding scheme is proposed as a new multi-antenna Multi- Input Multi-Output (MIMO) scheme called "Matrix Coded Modulation" or "MCM". The existing non-coherent schemes such as the Differential Space-Time Modulation (DSTM) leads to performance degradation compared to coherent systems in which perfect channel state information (CSI) is assumed. Decoding in the MCM schemes is performed iteratively, based on specified detection criteria. This new scheme is also adapted for coherent and non-coherent systems. The polynomial distribution of the Euclidean distance based on the detection criteria depends on the Hamming minimal distance of the channel-error correcting code employed in the MCM scheme

Stochastic multiple-stream decoding of Cortex codes

International audienceCortex codes are short length block codes having a large Hamming distance. Their modular construction, based on simple and very short block codes, yield to difficulties in efficiently decoding them with digital decoders implementing the Sum-Product algorithm. However, this construction lends itself to analog decoding with performance close to ML decoding as was recently demonstrated. A digital decoding method close to analog decoding is stochastic decoding. This paper brings the two together to design a Cortex stochastic architecture with good decoding performance. Moreover, the proposed stochastic decoder architecture is simplified when compared to the customary one. Instead of edge or tracking forecast memories the proposed architecture uses multiple streams to represent the same probability and deterministic shufflers. This results in a more efficient architecture in terms of ratio between data throughput and hardware complexity. Finally, the proposed method offers decoding performance similar to a Min-Sum decoder with 50 iterations