IEEE Organizations related to Message Passing Algorithm

Back to Top


Conferences related to Message Passing Algorithm

Back to Top

2020 IEEE International Symposium on Information Theory (ISIT)

Information theory, coding theory, communication theory, signal processing, and foundations of machine learning


2020 IEEE International Conference on Consumer Electronics (ICCE)

The International Conference on Consumer Electronics (ICCE) is soliciting technical papersfor oral and poster presentation at ICCE 2018. ICCE has a strong conference history coupledwith a tradition of attracting leading authors and delegates from around the world.Papers reporting new developments in all areas of consumer electronics are invited. Topics around the major theme will be the content ofspecial sessions and tutorials.


2020 IEEE International Conference on Robotics and Automation (ICRA)

The International Conference on Robotics and Automation (ICRA) is the IEEE Robotics and Automation Society’s biggest conference and one of the leading international forums for robotics researchers to present their work.


2020 IEEE International Symposium on Antennas and Propagation and North American Radio Science Meeting

The joint meeting is intended to provide an international forum for the exchange of information on state of the art research in the area of antennas and propagation, electromagnetic engineering and radio science


2020 IEEE 23rd International Conference on Information Fusion (FUSION)

The International Conference on Information Fusion is the premier forum for interchange of the latest research in data and information fusion, and its impacts on our society. The conference brings together researchers and practitioners from academia and industry to report on the latest scientific and technical advances.



Periodicals related to Message Passing Algorithm

Back to Top

Antennas and Propagation, IEEE Transactions on

Experimental and theoretical advances in antennas including design and development, and in the propagation of electromagnetic waves including scattering, diffraction and interaction with continuous media; and applications pertinent to antennas and propagation, such as remote sensing, applied optics, and millimeter and submillimeter wave techniques.


Automatic Control, IEEE Transactions on

The theory, design and application of Control Systems. It shall encompass components, and the integration of these components, as are necessary for the construction of such systems. The word `systems' as used herein shall be interpreted to include physical, biological, organizational and other entities and combinations thereof, which can be represented through a mathematical symbolism. The Field of Interest: shall ...


Broadcasting, IEEE Transactions on

Broadcast technology, including devices, equipment, techniques, and systems related to broadcast technology, including the production, distribution, transmission, and propagation aspects.


Circuits and Systems for Video Technology, IEEE Transactions on

Video A/D and D/A, display technology, image analysis and processing, video signal characterization and representation, video compression techniques and signal processing, multidimensional filters and transforms, analog video signal processing, neural networks for video applications, nonlinear video signal processing, video storage and retrieval, computer vision, packet video, high-speed real-time circuits, VLSI architecture and implementation for video technology, multiprocessor systems--hardware and software-- ...


Communications Letters, IEEE

Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)



Most published Xplore authors for Message Passing Algorithm

Back to Top

Xplore Articles related to Message Passing Algorithm

Back to Top

Message passing algorithm based on QR decomposition for an SCMA system with multiple antennas

2017 International Conference on Information and Communication Technology Convergence (ICTC), 2017

Sparse code multiple access (SCMA) is a nonorthogonal multiple access scheme based on a multi-dimensional codebook with sparse codewords. The sparsity property of SCMA allows the receiver to take advantage of low-complexity message passing algorithm (MPA) detector with maximum likelihood (ML)-like performance. The use of multiple antennas at the SCMA receiver will improve the detection performance of the MPA at ...


Clipping Noise-Aided Message Passing Algorithm for SCMA-OFDM System

IEEE Communications Letters, 2018

Sparse code multiple access combined with orthogonal frequency division multiplexing (SCMA-OFDM) is a promising wireless air-interface technology for fifth generation (5G) networks to support massive connections. The existing problem for SCMA-OFDM system is that the peak-to-average power ratio (PAPR) is unbearable high. The clipping method is often adopted to reduce the PAPR. However, the clipping brings extra noise to the ...


A message passing algorithm for compressed sensing in wireless random access networks

2013 19th Asia-Pacific Conference on Communications (APCC), 2013

In this paper, we consider the joint multiuser detection and channel estimation problem in wireless random access networks which consists of a large number of users with a single antenna and a base station (BS) multiple antennas. We first convert the problem into the compressed sensing framework and then propose a message passing (MP) algorithm which reduces the implementation complexity ...


Shuffled Multiuser Detection Schemes for Uplink Sparse Code Multiple Access Systems

IEEE Communications Letters, 2016

The existing multiuser detection schemes for uplink (UP) sparse code multiple access (SCMA) systems are based on a parallel message update for message passing algorithm (MPA). In this letter, a shuffled MPA (S-MPA) scheme for UP SCMA systems is proposed, based on a serial message update strategy. Since the updated messages can join the message propagation immediately in current iteration, ...


Parallel-implemented message passing algorithm for SCMA decoder based on GPGPU

2017 9th International Conference on Wireless Communications and Signal Processing (WCSP), 2017

Current multi-user detection scheme for sparse code multiple access (SCMA) is iterative message passing algorithm (MPA) in which the message update strategy is in a parallel manner. To take full advantage of MPA's feature of parallelism, this letter proposes a hardware implementation strategy of max- log MPA decoder used in SCMA systems with soft baseband, which is based on general-purpose ...



Educational Resources on Message Passing Algorithm

Back to Top

IEEE-USA E-Books

  • Message passing algorithm based on QR decomposition for an SCMA system with multiple antennas

    Sparse code multiple access (SCMA) is a nonorthogonal multiple access scheme based on a multi-dimensional codebook with sparse codewords. The sparsity property of SCMA allows the receiver to take advantage of low-complexity message passing algorithm (MPA) detector with maximum likelihood (ML)-like performance. The use of multiple antennas at the SCMA receiver will improve the detection performance of the MPA at the expense of an increase in complexity. To reduce the complexity of the MPA, we propose an MPA detection scheme based on QR decomposition, referred to as QR-MPA detection, for an SCMA system with multiple antennas. The proposed QR-MPA detection scheme achieves performance close to the optimal MPA performance by converting the factor graph into two subgraphs through QR decomposition and exchanging a posterior probabilities between subgraphs in a circular manner. Simulation results are presented to compare the performance of the proposed QR-MPA detection scheme with that of the conventional MPA detection scheme.

  • Clipping Noise-Aided Message Passing Algorithm for SCMA-OFDM System

    Sparse code multiple access combined with orthogonal frequency division multiplexing (SCMA-OFDM) is a promising wireless air-interface technology for fifth generation (5G) networks to support massive connections. The existing problem for SCMA-OFDM system is that the peak-to-average power ratio (PAPR) is unbearable high. The clipping method is often adopted to reduce the PAPR. However, the clipping brings extra noise to the SCMA-OFDM system. Due to the conventional message passing algorithm (C-MPA) didn't consider the clipping noise, it will cause the C-MPA decoding to be inaccurate and degrade the bit error rate performance. To tackle this issue, a novel clipping noise-aided MPA scheme, named CNA-MPA, which take both the additive white Gaussian noise (AWGN) and the clipping noise into consideration for decoding accurately is proposed. Simulation results show that the analysis of the clipping noise is accurate and the proposed CNA-MPA scheme leveraging both the AWGN and clipping noise can handle the phenomenon of the performance deterioration occurred in the C-MPA scheme at high Eb/N0regime.

  • A message passing algorithm for compressed sensing in wireless random access networks

    In this paper, we consider the joint multiuser detection and channel estimation problem in wireless random access networks which consists of a large number of users with a single antenna and a base station (BS) multiple antennas. We first convert the problem into the compressed sensing framework and then propose a message passing (MP) algorithm which reduces the implementation complexity at BS. Simulation results show that the performance of the proposed MP algorithm becomes improved as the number of antennas at BS.

  • Shuffled Multiuser Detection Schemes for Uplink Sparse Code Multiple Access Systems

    The existing multiuser detection schemes for uplink (UP) sparse code multiple access (SCMA) systems are based on a parallel message update for message passing algorithm (MPA). In this letter, a shuffled MPA (S-MPA) scheme for UP SCMA systems is proposed, based on a serial message update strategy. Since the updated messages can join the message propagation immediately in current iteration, the convergence rate is accelerated, so that the complexity of the proposed S-MPA scheme can be substantially reduced with negligible bit error rate (BER) degradation. Simulations show that the proposed S-MPA scheme with two iterations provides similar BER performance to the original MPA scheme with six iterations. Furthermore, a parallel form of the proposed S-MPA scheme, termed group S-MPA, is developed to decrease the detection delay of the proposed S-MPA scheme, which offers a good BER-latency tradeoff.

  • Parallel-implemented message passing algorithm for SCMA decoder based on GPGPU

    Current multi-user detection scheme for sparse code multiple access (SCMA) is iterative message passing algorithm (MPA) in which the message update strategy is in a parallel manner. To take full advantage of MPA's feature of parallelism, this letter proposes a hardware implementation strategy of max- log MPA decoder used in SCMA systems with soft baseband, which is based on general-purpose computing on graphics processing units (GPGPU). By splitting the decoding process into independent and concurrent threads, the proposed strategy can significantly reduce the process latency of max-log MPA decoder. Simulation results of decoding efficiency demonstrate that the parallel strategy can considerably accelerate the decoding process. Meanwhile, the launch details and the performance analysis of decoder's key kernel function are presented in expectation of making further improvement on current scheme.

  • Message-Passing Algorithm for Sum-rate Maximization in Multi-antenna Underlay D2D Communications

    In this paper, we propose a resource allocation of device-to-device (D2D) communications underlaying multiantenna cellular systems by employing message- passing algorithm. It is possible to construct the factor graph of the D2D pairs by considering the interference power at the base station and among the D2D pairs. The goal is to avoid interfering the cellular transmission while increasing the sum data rate of D2D pairs. We show that the proposed resource allocation based on message passing algorithm allow us to almost reach the performance of the exhaustive search and outperforms the random allocation. Since the associated factor graph is not fully connected, the complexity of the algorithm is significantly reduced compared to the exhaustive search.

  • Weighted message passing algorithm for SCMA

    Sparse code multiple access (SCMA) is a new frequency domain non-orthogonal multiple-access technique which can make full use of limited spectrum resources in wireless communication system. In SCMA, multiple users share the same time-frequency resources of orthogonal frequency division multiple access (OFDMA). However, message passing algorithm (MPA) is used in the process of SCMA decoding. And when the iteration number of MPA is large, the decoding complexity of SCMA is very high. In this paper, we propose an algorithm to decrease the decoding complexity of SCMA by introducing weight factors to replace MPA algorithm iterative process. We give each codeword in the codebook an original probability value which is related to the distance between received signal and the codeword. We set a corresponding weight factor for each probability value to change the original probability distribution of each codeword in the codebook. Simulation shows that this algorithm can greatly decrease the decoding complexity of SCMA while suffering only a bit of performance loss.

  • Design of turbo codes without 4-cycles in Tanner graph representation for message passing algorithm

    Turbo code and Low Density Parity Check (LDPC) code are both recommended as FEC code in many communication standards owing to their impressive error correcting performance. Aiming at the common architecture which can decode both of the two codes, this paper describes the method of decoding turbo codes with message passing algorithm which is conventionally used for LDPC codes. In this method, turbo codes are viewed as block codes and the sparse parity check matrices are constructed through Smith Decomposition or GBT (Generator matrix based transformation). In order to guarantee decoding performance, we propose the criterion of turbo codes with no 4-cycles, which is mathematically proved and demonstrated by the simulation results.

  • A Message-Passing Algorithm for Counting Short Cycles in Nonbinary LDPC Codes

    Trapping sets with short cycles are known to give a detrimental effect on the error floor performance of a low-density parity-check (LDPC) code. Unlike in binary LDPC codes., short cycles in a nonbinary low-density parity-check (NB- LDPC) code may be even more harmful to its performance if they do not satisfy the so-called full rank condition (FRC). This is because they may induce low- weight codewords or absorbing sets in that case. Thus, it is crucial to count the number of short cycles not satisfying the FRC as well as the number of short cycles for analyzing the performance of an NB-LDPC code. In this paper, we first develop a novel message-passing algorithm and identify how it is related to the FRC. We then propose a low-complexity algorithm for counting the number of short cycles not satisfying the FRC in an NB-LDPC code, as well as the number of short cycles.

  • A reduced complexity message passing algorithm with improved performance for LDPC decoding

    In this paper, a simplified message passing algorithm for decoding low-density parity-check (LDPC) codes is proposed with a view to reduce the implementation complexity. The algorithm is based on simple hard-decision decoding techniques while utilizing the advantages of soft channel information for improvement in decoder performance. The algorithm has been validated through simulation using LDPC code compliant with wireless local area network (WLAN -IEEE 802.11n) standard. The results show that the proposed algorithm can achieve significant improvement in bit error rate (BER) performance and average decoding iterations compared to fully hard-decision based decoding algorithms.



Standards related to Message Passing Algorithm

Back to Top

No standards are currently tagged "Message Passing Algorithm"