A Message-Passing Receiver for BICM-OFDM over Unknown Clustered-Sparse Channels

Abstract

We propose a factor-graph-based approach to joint channel-estimation-and-decoding (JCED) of bit- interleaved coded orthogonal frequency division multiplexing (BICM-OFDM). In contrast to existing designs, ours is capable of exploiting not only sparsity in sampled channel taps but also clustering among the large taps, behaviors which are known to manifest at larger communication bandwidths. In order to exploit these channel-tap structures, we adopt a two-state Gaussian mixture prior in conjunction with a Markov model on the hidden state. For loopy belief propagation, we exploit a "generalized approximate message passing" (GAMP) algorithm recently developed in the context of compressed sensing, and show that it can be successfully coupled with soft-input soft-output decoding, as well as hidden Markov inference, through the standard sum-product framework. For N subcarriers and any channel length L < N, the resulting JCED-GAMP scheme has a computational complexity of only O(N log2 N + N|S|), where |S| is the constellation size. Numerical experiments using IEEE 802.15.4a channels show that our scheme yields BER performance within 1 dB of the known-channel bound and 3-4 dB better than soft equalization based on LMMSE and LASSO.

Cited by in corpus (28)

• Dynamic Compressive Sensing of Time-Varying Signals via Approximate Message Passing
• Capacity-achieving Sparse Superposition Codes via Approximate Message Passing Decoding
• A Factor Graph Approach to Joint OFDM Channel Estimation and Decoding in Impulsive Noise Environments
• Hybrid Approximate Message Passing
• Parametric Bilinear Generalized Approximate Message Passing
• Parameterless Optimal Approximate Message Passing
• Joint Channel-Estimation/Decoding with Frequency-Selective Channels and Few-Bit ADCs
• An Iterative Receiver for OFDM With Sparsity-Based Parametric Channel Estimation
• Optimal Data Detection in Large MIMO
• Adaptive Detection of Structured Signals in Low-Rank Interference
• Concise Derivation of Complex Bayesian Approximate Message Passing via Expectation Propagation
• Asymptotic Analysis of Complex LASSO via Complex Approximate Message Passing (CAMP)
• Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing
• Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising
• Approximate Message Passing with Nearest Neighbor Sparsity Pattern Learning
• Blind Sensor Calibration using Approximate Message Passing
• Capacity Optimality of AMP in Coded Systems
• A Low Complexity OFDM Receiver with Combined GAMP and MF Message Passing
• Vector Approximate Message Passing Algorithm for Structured Perturbed Sensing Matrix
• New Transceiver Designs for Interleaved Frequency Division Multiple Access
• A Fast Iterative Bayesian Inference Algorithm for Sparse Channel Estimation
• Message-Passing Receiver for Joint Channel Estimation and Decoding in 3D Massive MIMO-OFDM Systems
• Low-Complexity Message Passing Based Massive MIMO Channel Estimation by Exploiting Unknown Sparse Common Support with Dirichlet Process
• A Bayesian approach to sparse channel estimation in OFDM systems
• Multichannel group sparsity methods for compressive channel estimation in doubly selective multicarrier MIMO systems (extended version)
• Belief-propagation-based joint channel estimation and decoding for spectrally efficient communication over unknown sparse channels
• Study of Joint Activity Detection and Channel Estimation Based on Message Passing with RBP Scheduling for MTC
• Compressive sensing based Bayesian sparse channel estimation for OFDM communication systems: high performance and low complexity