Joint Factor Graph Research Articles

Double Polar Codes for Joint Source and Channel Coding

In this paper, we design a joint source and channel coding (JSCC) framework combining the source polar coding and the channel polar coding. The source is first compressed using a polar code (PC), and source check decoding is employed to construct an error set containing the index of all source decoding errors. Then, the proposed JSCC system employs another PC or systematic PC (SPC) to protect the compressed source and the error set against noise, which is called double PC (D-PC) or systematic double PC (SD-PC), respectively. For a D-PC JSCC system, we prove a necessary condition for the optimal mapping between the source PC and the channel PC. On the receiver side, by introducing the joint factor graph representation of the D-PC and SD-PC, we propose two joint source and channel decoders: a joint belief propagation (J-BP) decoder, and a systematic joint belief propagation (SJ-BP) decoder. In addition, a biased extrinsic information transfer (B-EXIT) chart is developed for various decoders as a theoretical performance evaluation tool. Both B-EXIT and simulation results show that the performance of the proposed JSCC scheme has no error floor and outperforms the turbo-like BP decoder.

Multiuser Detection of GF-NOMA With Dynamic-Active Users and Temporal-Correlated Channels

In this letter, an efficient multiuser detection (MUD) is proposed for the grant-free non-orthogonal multiple access in the scenario with dynamic active users and unknown temporal-correlated channels. The proposed MUD performs active user and slot detection, channel estimation, and data detection simultaneously by iterative generalized approximate message passing (GAMP) and message passing (MP) over the joint factor graph. Concretely, GAMP is to decouple the transmissions of different users, and MP to update channel and user activity information. Finally, computer simulations are provided to validate the performance of the proposed method.

Inter-node compression with LDPC joint source–channel coding for highly correlated sources

This paper investigates a new communication system where two nodes want to disseminate highly correlated contents to a single destination and can be applied for densely deployed wireless sensors networks applications. Motivated by their capacity-achieving performance and existing practical implementations, the proposed communication scheme is fully based on Low-Density Parity-Check (LDPC) codes for data compression and channel coding. More specifically, we consider a network of two correlated binary sources with two orthogonal communication phases. Data are encoded at the first source with an LDPC channel code and broadcast in the first phase. Based on the first source received data, the second source computes the correlation vector and applies a Joint Source–Channel (JSC) LDPC code, which output is communicated in the second phase. At the receiver, the whole network is mapped on a joint factor graph over which an iterative message-passing joint decoder is proposed. The aim of the joint decoder is to exploit the residual correlation between the sources for better estimation. Simulation results are investigated and compared to the theoretical limits and to an LDPC-based distributed coding system where no inter-node compression is applied.

An Ultra-Reliable Low-Latency Non-Binary Polar Coded SCMA Scheme

The joint transmission scheme of polar codes and sparse code multiple access (SCMA) has been regarded as a promising technology for future wireless communication systems. However, most of the existing polar-coded SCMA (PC-SCMA) systems suffer from high latency caused by the feedback iteration and list decoding. In addition, the error performance of PC-SCMA systems is unsatisfactory for ultra-reliable transmission. Inspired by the compelling benefits of non-binary polar codes, in this paper, we design a non-binary polar-coded SCMA (NB-PC-SCMA) system with a free order matching strategy to address the issues of delay and reliability. Specifically, we first formulate a joint factor graph for NB-PC-SCMA and propose a non-binary successive cancellation list (NB-SCL) and damping based joint iterative detection and decoding (NSD-JIDD) multiuser receiver to improve the BER and latency performance. Then, a lazy-search based NB-SCL (L-NB-SCL) decoding is proposed to reduce the computational complexity by simplifying the path search pattern of the list decoder. After that, we modify the update of user nodes for SCMA detection to improve the convergence error and finally propose the improved NSD-JIDD (ISD-JIDD) algorithm, which can avoid redundant operations by exploiting L-NB-SCL decoding. Simulation results show that the proposed NB-PC-SCMA system achieves better bit error rate (BER) performance and considerable latency gain when compared to its counterparts. In particular, the proposed ISD-JIDD can achieve similar BER performance of NSD-JIDD with less complexity.

Gaussian Approximate Message Passing Detection of Orthogonal Time Frequency Space Modulation

Message passing (MP) aided detectors are designed for orthogonal time frequency space (OTFS) modulated system. We first characterize the transmit-receive relationship of our OTFS-modulated system in the delay-Doppler (DD) domain by designing a joint factor graph. Based on this joint factor graph, we then conceive a joint message passing aided (JMPA) detector. Furthermore, a novel low-complexity Gaussian approximate MP (GA-MP) detector is also conceived, which models the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">a posteriori</i> probabilities propagated through the proposed joint factor graph by Gaussian distributions. Finally, we demonstrate that the proposed GA-MP detector outperforms the state-of-the-art MP detector by at least 1.5 dB at a bit error ratio (BER) of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$10^{-4}$</tex-math></inline-formula> , while keeping the same complexity order.

A New RSS-Based Wireless Geolocation Technique Utilizing Joint Voronoi and Factor Graph

A New RSS-Based Wireless Geolocation Technique Utilizing Joint Voronoi and Factor Graph

A New MRF-Based Lossy Compression for Encrypted Binary Images

Although there exist many researches on the compression of original non-encrypted binary images, few approaches focus on the compression of encrypted binary images. As binary images like contract, signature, halftone images are still used widely in practice, how to compress efficiently encrypted binary images in a lossy way deserves further exploration. To this end, this paper develops a lossy compression scheme for encrypted binary images by exploiting the Markov random field (MRF) model. Considering that the third-party in scenarios of cloud or distributed computing cannot access to the encryption key, we develop the concatenated down-sampling and LDPC-based encoding to perform the compression, in which four different down-sampling methods are designed to facilitate improving the quality of reconstructed image. In reconstruction, we first formulate the lossy reconstruction from the encrypted and compressed binary image as an optimization problem, and then build a joint factor graph involving the LDPC-decoding, decryption, and MRF to solve this optimization problem, in which the MRF is exploited to well infer pixels discarded in the down-sampling process. By adapting the sum-product algorithm (SPA) to the constructed joint factor graph for lossy reconstruction (JFG-LR) and running the adapted SPA on the JFG-LR, we thus recover the original binary image in a lossy way. By integrating the stream-cipher-based encryption, the down-sampling and LDPC-based compression, and the JFG-LR-involved reconstruction, we thus propose a new lossy compression scheme for encrypted binary images. Experimental results show that the proposed scheme achieves desirable compression efficiency, which is comparable to or even better than that of the JBIG2 with the original unencrypted binary image as input.

Short Non-Binary Low-Density Parity-Check Codes for Phase Noise Channels

This work considers the design of short non-binary low-density parity-check (LDPC) codes over finite fields of order m, for channels with phase noise. In particular, m-ary differential phase-shift keying (DPSK) modulated code symbols are transmitted over an additive white Gaussian noise (AWGN) channel with Wiener phase noise. At the receiver side, non-coherent detection takes place, with the help of a multi-symbol detection algorithm, followed by a non-binary decoding step. Both the detector and decoder operate on a joint factor graph. As a benchmark, finite length bounds and information rate expressions are computed and compared with the codeword error rate (CER) performance, as well as the iterative threshold of the obtained codes. As a result, performance within 1:2 dB from finite-length bounds is obtained, down to a CER of 1e-3.

Efficient Compression of Encrypted Binary Images Using the Markov Random Field

Similar to conventional compression with the original, unencrypted image as the input, the recently emerged compression on encrypted images generally exploits statistical correlation of natural images to improve compression efficiency. Most of these compression schemes in the literature leverage statistical correlation at the content-owner or service-provider side, which would either increase the computational burden on the content-owner or disclose statistical distributions to the service-provider and thus probably hinder their practical applications. Through analysis on properties of the compression system for encrypted data, we believe that it is more preferable to exploit statistical correlation of natural images at the receiver side with both encryption key and sufficient computational capability, which in turn would improve compression efficiency while achieving low computational complexity and sufficient security for the content owner and the service provider. In light of this, we use the Markov random field (MRF) to characterize binary images in the spatial domain and represent it with a factor graph. The constructed MRF representation of the binary image in the factor graph is then integrated seamlessly with the factor graph for low-density parity check (LDPC)-based decompression, yielding a joint factor graph for binary image reconstruction. By deriving message update equations for the joint factor graph, we develop a new lossless compression scheme for encrypted binary images, which involves stream-cipher-based encryption, LDPC-based compression, and factor-graph-based image reconstruction. Preferable parameters for the proposed scheme are first determined numerically on a specific binary image and then applied to other binary images. Extensive simulations show that significant improvements in terms of compression bit rate over the state of the art are achieved, demonstrating the feasibility and effectiveness of the proposed scheme.

Design and Optimization of Joint Iterative Detection and Decoding Receiver for Uplink Polar Coded SCMA System

SCMA and polar coding are possible candidates for 5G systems. In this paper, we firstly propose the joint iterative detection and decoding (JIDD) receiver for the uplink polar coded sparse code multiple access (PC-SCMA) system. Then, the EXIT chart is used to investigate the performance of the JIDD receiver. Additionally, we optimize the system design and polar code construction based on the EXIT chart analysis. The proposed receiver integrates the factor graph of SCMA detector and polar soft-output decoder into a joint factor graph, which enables the exchange of messages between SCMA detector and polar decoder iteratively. Simulation results demonstrate that the JIDD receiver has better BER performance and lower complexity than the separate scheme. Specifically, when polar code length $N=256$ and code rate $R = 1/2$ , JIDD outperforms the separate scheme 4.8 and 6 dB over AWGN channel and Rayleigh fading channel, respectively. It also shows that, under 150% system loading, the JIDD receiver only has 0.3 dB performance loss compared to the single user uplink PC-SCMA over AWGN channel and 0.6 dB performance loss over Rayleigh fading channel.

Joint detection and decoding for physical‐layer network coding in power line channel

In this study, a joint detection and generalised sum-product decoding algorithm for a two-way relay physical-layer network coding (PLNC) system in power line communication is proposed. Distinct from the existing works which mainly focused on separate or iterative PLNC detection and decoding, the proposed algorithm is a belief propagation-based joint PLNC detection and decoding algorithm, which integrates the PLNC, symbol detector and channel decoder together. The proposed algorithm is described by a joint factor graph, in which the detection nodes are connected to the factor graph of a generalised sum-product decoder. The PLNC demodulation is redesigned to make sure that the degree of each detection node in the joint factor graph is more than one. A low computational complexity solution of the proposed joint decoding algorithm based on the majority-logic algorithm is also proposed. The simulation results reveal the validity of the proposed algorithms.

Emotion Analysis in Code-Switching Text With Joint Factor Graph Model

Previous research on emotions analysis has placed much emphasis in monolingual instead of bilingual text. However, emotions on social media platforms are often found in bilingual or code-switching posts. Different from monolingual text, emotions in code-switching text can be expressed in both monolingual and bilingual forms. Moreover, more than one emotion can be expressed within a single post; yet they tend to be related in some ways which offers some implications. It is thus necessary to consider the correlation between different emotions. In this paper, a joint factor graph model is proposed to address this issue. In particular, attribute functions of the factor graph model are utilized to learn both monolingual and bilingual information from each post, factor functions are used to explore the relationship among different emotions, and a belief propagation algorithm is employed to learn and predict the model. Empirical studies demonstrate the importance of emotion analysis in code-switching text and the effectiveness of our proposed joint learning model.

Adaptive Correlation Estimation With Particle Filtering for Distributed Video Coding

Distributed video coding (DVC) is rapidly gaining popularity as a low cost, robust video coding solution, that reduces video encoding complexity. DVC is built on distributed source coding (DSC) principles where correlation between sources to be compressed is exploited at the decoder side. In the case of DVC, a current frame available only at the encoder is estimated at the decoder with side information generated from other frames available at the decoder. One of the main challenges in DVC design is that correlation among the source and side information needs to be estimated online and as accurately as possible. Since correlation dynamically changes with the scene, in order to exploit the robustness of DSC code designs, we integrate particle filtering (PF) with standard belief propagation (BP) decoding for inference on one joint factor graph to estimate correlation among source and side information. Correlation estimation is performed online as it is carried out jointly with decoding of the graph-based DSC code. Moreover, we demonstrate our joint bit-plane decoding with adaptive correlation estimation schemes within state-of-the-art DVC systems, which are transform-domain based with a feedback channel for rate adaptation. Experimental results show that our proposed system gives a significant performance improvement compared to the benchmark state-of-the-art DISCOVER codec (including correlation estimation) and the case without dynamic PF tracking, due to improved knowledge of timely correlation statistics via the combination of joint bit-plane decoding and particle-based BP (PBP) tracking.