Decoding a family of dense codes using the sum-product algorithm and subthreshold PMOS - Archive ouverte HAL
Communication Dans Un Congrès Année : 2009

Decoding a family of dense codes using the sum-product algorithm and subthreshold PMOS

Résumé

Cortex codes are a family of block codes with good minimum distance properties whose parity-check matrices are very dense. Digital implementations of Cortex decoders using standard decoding algorithms have not shown an acceptable performance. Motivated by the encoder structure, a new bipartite graph is introduced and exemplified for the Cortex construction of the extended Hamming code. The Cortex graph has longer girth and approximately 80% less cycles than the Tanner graph. A Cortex and an LDPC-like decoder were implemented for the same code using identical PMOS-based Gilbert multipliers. This makes them the first reported analog decoders using mainly PMOS transistors. The Cortex outperforms the LDPC-like decoder in Bit Error Rate and at the same time saves 44% of die surface. The results are supported using data from a test chip designed for a 0.25 um CMOS process.
Fichier non déposé

Dates et versions

hal-01853651 , version 1 (03-08-2018)

Identifiants

  • HAL Id : hal-01853651 , version 1

Citer

Jorge Ernesto Perez Chamorro, Fabrice Seguin, Cyril Lahuec, Gérald Le Mestre, Michel Jezequel. Decoding a family of dense codes using the sum-product algorithm and subthreshold PMOS. IEEE International Symposium on Circuits And Systems, Taiwan, May 2009, Taipei, Taiwan. pp.2685 - 2688. ⟨hal-01853651⟩
50 Consultations
0 Téléchargements

Partager

More