Fast Demodulation Algorithm for Rate Compatible Modulation by Log-Map Principle

Article Preview

Abstract:

Rate compatible modulation (RCM) is a promising technology to smooth rate adaption of physical layer in wireless network, and do not request the accurate channel estimation. Since RCM demodulation adopt probability convolution operator in belief propagation algorithm, it greatly bring big computing complexity. This paper proposes fast demodulation algorithm for RCM by using log-map principle. First, we propose a new demodulation algorithm by a novel approach to convert arithmetic domain to logarithm domain. Then, we design a parallel manner that to find multivariable computation in Log-MAP algorithm for hard implementation. Finally, we evaluate fast demodulation algorithm by two evaluation metrics BER and goodput, respectively. Our analysis show that the demodulation complexity can be reduced about 90%. While experimental results show that the fast demodulation algorithm performance only has a marginal loss.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 945-949)

Pages:

2310-2314

Citation:

Online since:

June 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] J. D. Brown, S. Pasupathy, and K. N. Plataniotis, Adaptive demodulation using rateless erasure codes, IEEE Trans. on Comm., vol. 54, pp.1574-1585, (2006).

DOI: 10.1109/tcomm.2006.881236

Google Scholar

[2] A. Gudipati, and S. Katti, Automatic rate adaptation, In Proc. of ACM Hotnets, (2010).

Google Scholar

[3] J. Perry, H. Balakrishnan, and D. Shah, Rateless spinal codes, In Proc. of ACM Hotnets, (2011).

Google Scholar

[4] A. Gudipati and S. Katti, Strider: automatic rate adaptation and collision handling, In Proc. of ACM SIGCOMM, pp.158-169, (2011).

DOI: 10.1145/2043164.2018455

Google Scholar

[5] H. Cui, C. Luo, K. Tan, F. Wu, C. W. Chen, Seamless rate adaptation for wireless networking, in Proc. of ACM MSWiM, pp.437-446, (2011).

Google Scholar

[6] R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MITPress, (1963).

Google Scholar

[7] MacKay D.J.C., Neal R.M. Near Shannon limit performance of low density parity check codes[J]. Electronics Letters, 32(18), pp.1645-1646, (1996).

DOI: 10.1049/el:19961141

Google Scholar

[8] Min Wang, Jun Wu, Sai Feng Shi, Chong Luo, Feng Wu. Fast Decoding and Hardware Design for Binary-Input Compressive Sensing. Emerging and Selected Topics in Circuits and Systems, IEEE Journal on, Volume 2 , Issue 3, pp.591-603, (2012).

DOI: 10.1109/jetcas.2012.2220291

Google Scholar

[9] H. Wang, H.W. Yang, D.C. Yang, Improved Log-Map demodulation algorithm for turbo-like codes, Communications Letters, IEEE, Volume 10, Issue 3, pp.186-188, (2006).

DOI: 10.1109/lcomm.2006.1603379

Google Scholar

[10] D. Qiao, S. Member, S. Choi, and K. G. Shin, Goodput analysis and link adaption for ieee 802. 11a wireless lans. IEEE Trans. on Mobile Computing, Vol 1, p.278–292, (2002).

DOI: 10.1109/tmc.2002.1175541

Google Scholar