Quasi-cyclic Random Projection Code and Hardware Implementation

Saifeng Shi, Min Wang, Xinlu Lu, Jun Wu

College of Electronics and Information Engineering, Tongji University, Shanghai, China.
College of Electronics and Information Engineering, Tongji University, Shanghai, China; School of Mathematics and Computer Science, Gannan Normal University, Ganzhou, China.

DOI: 10.4236/cn.2013.53B2017                

Abstract

Random Projection Code (RPC) is a mechanism that combines channel coding and modulation together and realizes rate adaptation in the receiving end. Random projection code’s mapping matrix has significant influences on decoding performance as well as hardware implementation complexity. To reduce hardware implementation complexity, we design a quasi-cyclic mapping matrix for RPC codes. Compared with other construction approaches, our design gets rid of data filter component, thus reducing chip area 7284.95 um2, and power consumption 331.46 uW in 0.13 um fabrication. Our simulation results show that our method does not cause any performance loss and even gets 0.2 dB to 0.5 dB gain at BER 10^-4.

Keywords

Quasi-cyclic; Mapping Matrix; Random Projection Code; Hardware Implementation

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1]	M. Wang, J. Wu, S. F. Shi, C. Luo and F. Wu, “Fast Decoding and Hardware Design for Binary-Input Compressive Sensing,” Emerging and Selected Topics in Circuits and Systems, IEEE Journal on, Vol. 2, No. 3, 2012, pp. 591- 603.
[2]	J. D. Brown, S. Pasupathy and K. N. Plataniotis, “Adaptive Demodulation Using Rateless Erasure Codes,” IEEE Transactions on Communications, Vol. 54, 2006, pp. 1574-1585. doi:10.1109/TCOMM.2006.881236
[3]	A. Gudipati and S. Katti, “Automatic Rate Adaptation,” In Proc. of ACM Hotnets, 2010. doi:10.1145/1868447.1868461
[4]	H. Cui, C. Luo, K. Tan, F. Wu and C. W. Chen, “Seamless Rate Adaptation for Wireless Networking,” in Proc. of ACM MSWiM, 2011, pp. 437-446.
[5]	G. Masera, F. Quaglio and F. Vacca, “Implementation of a Flexible LDPC Decoder,” IEEE Transactions on Circuits and Systems II: Express Briefs, Vol. 54, No. 6, 2007, pp. 542-546. doi:10.1109/TCSII.2007.894409
[6]	Y. Chen and K. Parhi, “Overlapped Message Passing for Quasi-cyclic Low-density Parity Check Codes,” IEEE Transactions on Circuits and Systems I: Regular Papers, Vol. 51, No. 6, 2004, pp. 1106-1113. doi:10.1109/TCSI.2004.826194
[7]	G. Masera, F. Quaglio and F. Vacca, “Implementation of a Flexible LDPC Decoder,” Circuits and Systems II: Express Briefs, IEEE Transactions on, Vol. 54, No. 6, 2007, pp. 542-546. doi:10.1109/TCSII.2007.894409
[8]	A. Tarable, S. Benedetto and G. Montorsi, “Mapping Interleaving Laws to Parallel Turbo and Ldpc Decoder Architectures,” Information Theory. IEEE Transactions on, Vol. 50, 2004, 2004, pp. 2002 - 2009.
[9]	M. Mansour and N. Shanbhag, “A 640-mb/s 2048-bit Programmable Ldpc Decoder Chip,” Solid-State Circuits, IEEE Journal of, Vol. 41, 2006, pp. 684-698. doi:10.1109/JSSC.2005.864133
[10]	Z. Khan and T. Arslan, “Pipelined Implementation of a Real Time Programmable Encoder for Low Density Parity Check Code on a ReconFigureurable Instruction Cell Architecture,” Design, Automation & Test in Europe Conference & Exhibition, 2007. DATE '07, 16-20 April 2007, pp. 1-6.