Choosing “green” codes by simulation-based modeling of implementations

How do we design an error correcting code and a corresponding decoding implementation to minimize not just the transmit power, but the sum of transmit and decoding power? Recent interest in this question has led to new fundamental results that show the traditional approach of designing the code and the decoder implementation in isolation can be suboptimal. However, joint design of codes and their corresponding decoder implementations can be hard simply because of the sheer number of possibilities for both, and the human effort often required in optimizing the decoder implementation for a given code. In this paper, we suggest taking a middle-path between analyzing theoretical models of decoding and building decoder implementations. Based on circuit simulations of power consumption of decoders for simple regular LDPC codes, we develop circuit models for the decoding power for larger and more complex (but still regular) LDPC codes. These models are then used to search for the best code and corresponding decoder (within a limited set) for a given communication distance and error probability.

[1]  Tong Zhang,et al.  Joint (3,k)-regular LDPC code and decoder/encoder design , 2004, IEEE Transactions on Signal Processing.

[2]  Dongweon Yoon,et al.  On the general BER expression of one- and two-dimensional amplitude modulations , 2002, IEEE Trans. Commun..

[3]  Anant Sahai,et al.  Time-division multiplexing for green broadcasting , 2009, 2009 IEEE International Symposium on Information Theory.

[4]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.

[5]  J. Yedidia,et al.  Construction of high-girth QC-LDPC codes , 2008, 2008 5th International Symposium on Turbo Codes and Related Topics.

[6]  David Declercq,et al.  Two-bit message passing decoders for LDPC codes over the binary symmetric channel , 2009, 2009 IEEE International Symposium on Information Theory.

[7]  Anant Sahai,et al.  Fundamental bounds on the interconnect complexity of decoder implementations , 2011, 2011 45th Annual Conference on Information Sciences and Systems.

[8]  Andrea J. Goldsmith,et al.  Information theory meets circuit design: Why capacity-approaching codes require more chip area and power , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  Anant Sahai,et al.  Green codes: Energy-efficient short-range communication , 2008, 2008 IEEE International Symposium on Information Theory.

[10]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[11]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[12]  Frank R. Kschischang,et al.  Power Reduction Techniques for LDPC Decoders , 2008, IEEE Journal of Solid-State Circuits.

[13]  Anant Sahai,et al.  Fundamental limits on complexity and power consumption in coded communication , .

[14]  Marc P. C. Fossorier,et al.  Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices , 2004, IEEE Trans. Inf. Theory.

[15]  Anant Sahai,et al.  Towards a Communication-Theoretic Understanding of System-Level Power Consumption , 2010, IEEE Journal on Selected Areas in Communications.

[16]  Lara Dolecek,et al.  Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices , 2009, IEEE Transactions on Communications.

[17]  Florian Hug,et al.  Some voltage graph-based LDPC tailbiting codes with large girth , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[18]  Martin J. Wainwright,et al.  An Efficient 10GBASE-T Ethernet LDPC Decoder Design With Low Error Floors , 2010, IEEE Journal of Solid-State Circuits.

[19]  S. Gambini,et al.  A 90 nm CMOS Low-Power 60 GHz Transceiver With Integrated Baseband Circuitry , 2009, IEEE Journal of Solid-State Circuits.

[20]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.