1 / 19

A High-Speed Analog Min-Sum Iterative Decoder

A High-Speed Analog Min-Sum Iterative Decoder. Saied Hemati, Amir H. Banihashemi, and Calvin Plett Carleton University, Ottawa, Canada. Outline. Introduction Min-Sum Decoding Algorithm Basic Modules and Circuits Analog Min-Sum Decoder for a (32,8) Code Measurement Results

zona
Download Presentation

A High-Speed Analog Min-Sum Iterative Decoder

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A High-Speed Analog Min-Sum Iterative Decoder Saied Hemati, Amir H. Banihashemi, and Calvin Plett Carleton University, Ottawa, Canada

  2. Outline • Introduction • Min-Sum Decoding Algorithm • Basic Modules and Circuits • Analog Min-Sum Decoder for a (32,8) Code • Measurement Results • Conclusion

  3. Introduction • Why analog? • Lower power/speed ratio • Lower noise generation • Lower area consumption • Better decoding performance (Hemati and Banihashemi, 2003) Previous Work: - Loeliger et al., 2001 - Mondragon-Torres et al., 2003 - Gaudet et al., 2003 - Morez et al., 2000 - Hemati et al., 2003 - Winstead et al., 2004 - Amat et al., 2004

  4. Other Approaches: - are based on belief propagation (BP) - have a differential multiplier as the basic processing module - use the well-known Gilbert differential multiplier • Linearity of the Gilbert multiplier relies on the exponential behavior of bipolar (or quasi-bipolar weakly inverted CMOS) transistors. • Bipolar technology is expensive and weakly inverted CMOS transistors are slow. • Multiple-input modules are constructed by cascading two-input Gilbert multiplier modules.

  5. Our Approach: - is based on min-sum (MS) - does not require an estimate of the noise power - is more robust against quantization noise - is based on current mirrors - multiple-input modules can be directly implemented • There are simple modifications of MS that can perform very close to BP.

  6. Min-sum Decoding Algorithm Basic operations in MS: mv V C

  7. Basic Modules and Circuits Current buffers duplicate input current at the output with flipped sign

  8. Basic modules and circuits Variable Nodes

  9. Basic Modules and Circuits Check Nodes

  10. Basic Modules and Circuits An RTAS module, (a) current rectifier, (b) sign extractor

  11. Basic Modules and Circuits (b) (a) (a) A current-mirror, (b) a current-mode 3-input max WTA.

  12. Basic Modules and Circuits ASTR module

  13. Analog MS Decoder for a (32,8) Code Tanner graph of the code

  14. Analog MS Decoder for a (32,8) Code Architecture of the implemented chip

  15. Analog MS Decoder for a (32,8) Code Microphotograph of the fabricated chip

  16. Measurement Results

  17. Measurement Results

  18. Measurement Results

  19. Conclusion • A modular methodology was proposed for designing CMOS analog MS iterative decoders. • The modules are based on current mirrors and therefore our approach can be used for implementing analog MS decoders in advanced bipolar and CMOS technologies. • A proof-of-concept analog MS decoder chip for a (32,8) regular LDPC code was fabricated and tested. • In low-SNR region, measurement results are close to the simulation results based on SR-MS algorithm.

More Related