A Message-Fleeting Receiver for BICM-OFDM over Anonymous Crowded – Meagre Channels
M. Ashok Kumar1, T. Aditya Kumar2
1M. Ashok Kumar, M. Tech Student, Park College of Engineering And Technology, Kaniyur, (Tamil Nadu), India.
2T. Aditya Kumar, Assoc. Prof. Park College of Engineering and Technology, Kaniyur, (Tamil Nadu), India.
Manuscript received on September 20, 2014. | Revised Manuscript received on October 13, 2014. | Manuscript published on October 30, 2014. | PP: 146-148 | Volume-4 Issue-1, October 2014. | Retrieval Number: A3521104114/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In disparity to surviving designs, ours is proficient of manipulating not onlymeagrely in sampled channel taps but also crowding among the bulky taps, performances which are notorious to evident at larger communication bandwidths. We intend a factor-graph-based tactic to united channel – approximation and decrypting of bit-interleaved coded orthogonal frequency division multiplexing (BICM-OFDM). In order to exploit these channel-tap structures, we espouse a twostate Gaussian mixture prior in conjunction with a Markov model on the concealed state. For impractical credence promulgation, we exploit a “generalized approximate message passing” algorithm recently developed in the context of compressed sensing, and show that it can be successfully coupled with soft-input soft-output decrypting, as well as hidden Markov inference. For N subcarriers and M bits per subcarrier (and any channel length L < N), our scheme has a computational complexity of only O (N log2 N+N2M). Statistical trials using IEEE 802.15.4a channels show that our scheme yields BER performance within 1 dB of the known-channel bound and 5 dB better than decoupled channel-estimation-and-decoding via LASSO.
Keywords: OFDM, LASSO, Markov inference.