2,482 research outputs found
Merging Belief Propagation and the Mean Field Approximation: A Free Energy Approach
We present a joint message passing approach that combines belief propagation
and the mean field approximation. Our analysis is based on the region-based
free energy approximation method proposed by Yedidia et al. We show that the
message passing fixed-point equations obtained with this combination correspond
to stationary points of a constrained region-based free energy approximation.
Moreover, we present a convergent implementation of these message passing
fixedpoint equations provided that the underlying factor graph fulfills certain
technical conditions. In addition, we show how to include hard constraints in
the part of the factor graph corresponding to belief propagation. Finally, we
demonstrate an application of our method to iterative channel estimation and
decoding in an orthogonal frequency division multiplexing (OFDM) system
Sub-graph based joint sparse graph for sparse code multiple access systems
Sparse code multiple access (SCMA) is a promising air interface candidate technique for next generation mobile networks, especially for massive machine type communications (mMTC). In this paper, we design a LDPC coded SCMA detector by combining the sparse graphs of LDPC and SCMA into one joint sparse graph (JSG). In our proposed scheme, SCMA sparse graph (SSG) defined by small size indicator matrix is utilized to construct the JSG, which is termed as sub-graph based joint sparse graph of SCMA (SG-JSG-SCMA). In this paper, we first study the binary-LDPC (B-LDPC) coded SGJSG- SCMA system. To combine the SCMA variable node (SVN) and LDPC variable node (LVN) into one joint variable node (JVN), a non-binary LDPC (NB-LDPC) coded SG-JSG-SCMA is also proposed. Furthermore, to reduce the complexity of NBLDPC coded SG-JSG-SCMA, a joint trellis representation (JTR) is introduced to represent the search space of NB-LDPC coded SG-JSG-SCMA. Based on JTR, a low complexity joint trellis based detection and decoding (JTDD) algorithm is proposed to reduce the computational complexity of NB-LDPC coded SGJSG- SCMA system. According to the simulation results, SG-JSGSCMA brings significant performance improvement compare to the conventional receiver using the disjoint approach, and it can also outperform a Turbo-structured receiver with comparable complexity. Moreover, the joint approach also has advantages in terms of processing latency compare to the Turbo approaches
Coded DS-CDMA Systems with Iterative Channel Estimation and no Pilot Symbols
In this paper, we describe direct-sequence code-division multiple-access
(DS-CDMA) systems with quadriphase-shift keying in which channel estimation,
coherent demodulation, and decoding are iteratively performed without the use
of any training or pilot symbols. An expectation-maximization
channel-estimation algorithm for the fading amplitude, phase, and the
interference power spectral density (PSD) due to the combined interference and
thermal noise is proposed for DS-CDMA systems with irregular repeat-accumulate
codes. After initial estimates of the fading amplitude, phase, and interference
PSD are obtained from the received symbols, subsequent values of these
parameters are iteratively updated by using the soft feedback from the channel
decoder. The updated estimates are combined with the received symbols and
iteratively passed to the decoder. The elimination of pilot symbols simplifies
the system design and allows either an enhanced information throughput, an
improved bit error rate, or greater spectral efficiency. The interference-PSD
estimation enables DS-CDMA systems to significantly suppress interference.Comment: To appear, IEEE Transactions on Wireless Communication
- …