Decoding of Variable Length PLH Codes

The first challenging step of the demodulation of the Digital Video Broadcasting Second generation signal is frame synchronization. Physical Layer header is composed of Start of Frame and Physical Layer Signalling code. When the Start of Frame and the structure of Physical Layer Signalling code are known, Choi and Lee, Kim et al denote some Choi Lee Detectors and Post Detection Integration techniques, using the combination of differential detection of header code. In this paper, we present a scheme to achieve frame synchronization on the condition that the Physical Layer header code is uncertain.

Traditional signal processing design (e.g., frequency offset and channel estimation) at a receiver treats each packet arrival as an independent process to facilitate decoding and interpreting packet data. In this paper, we enhance the performance of this process in the wireless network domain. We propose STAteful inter-Packet signaL procEssing (STAPLE), a framework of stateful signal processing residing between the physical and link layers. STAPLE transforms the signal processing procedure into a lightweight stateful process that caches in a small-sized memory table physical and link layer header fields as packet state information. The similarity of such information among packets serves as prior knowledge to further enhance the reliability of signal processing and thus improve the wireless network performance. We implement STAPLE on USRP X300-series devices with adapted configurations for 802.11a/b/g/n/ac and 802.15.4. The STAPLE prototype is of low processing complexity and does not change any wireless standard specification. Comprehensive experimental results show that the benefit from STAPLE is universal in various wireless networks.

Motivated by recent results in Joint Source/Channel (JSC) coding and decoding, this paper addresses the problem of soft input decoding of Arithmetic Codes (AC). A new length-constrained scheme for JSC decoding of these codes is proposed based on the Maximum a posteriori (MAP) sequence estimation criterion. The new decoder, called Chase-like arithmetic decoder is supposed to know the source symbol sequence and the compressed bit-stream lengths. First, Packet Error Rates (PER) in the case of transmission on an Additive White Gaussian Noise (AWGN) channel are investigated. Compared to classical arithmetic decoding, the Chase-like decoder shows significant improvements. Results are provided for Chase-like decoding for image compression and transmission on an AWGN channel. Both lossy and lossless image compression schemes were studied. As a final application, the serial concatenation of an AC with a convolutional code was considered. Iterative decoding, performed between the two decoders showed substantial performance improvement through iterations.

Motivated by recent results in Joint Source/ Channel (JSC) coding and decoding, this paper addresses the problem of soft input decoding of Arithmetic Codes (AC). A new length-constrained scheme for JSC decoding of these codes is proposed based on the Maximum a posteriori (MAP) sequence estimation criterion. The new decoder, called Chase-like arithmetic decoder is supposed to know the source symbol sequence and the compressed bit-stream lengths. First, Packet Error Rates (PER) in the case of transmission on an Additive White Gaussian Noise (AWGN) channel are investigated. Compared to classical arithmetic decoding, the Chase-like decoder shows significant improvements. Results are provided for Chase-like decoding for image compression and transmission on an AWGN channel. Both lossy and lossless image compression schemes were studied. As a final application, the serial concatenation of an AC with a convolutional code was considered. Iterative decoding, performed between the two decoders showed substantial performance improvement through iterations.

Compared with binary Polar codes, non-binary Polar codes exhibit better performance, which is suitable for short packet services of Internet of Things. But its decoding complexity is high <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(O(2N\log_{2}(N))$</tex> , where <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$N$</tex> is the length of the symbol sequence). To make it practical, this paper proposes a sparse neural network (SNN) decoder. Firstly, the Polar factor graph is transformed into a bipartite graph which contains variable node and check node. Then, we propose a pruning algorithm to prune the bipartite graph so as to get a sparse graph. After that, the sparse graph is expanded to get the structure of the deep neural network. Optimized by the training of deep learning, the proposed SNN decoding scheme has competitive performance to the traditional Belief-Propagation (BP) decoding scheme. Moreover, the SNN decoder achieves a reduction of 51.7% in the number of connections compared with BP decoding scheme and its decoding latency is significantly lower than the traditional BP.

This paper studies non-orthogonal transmission over a $K$ -user fading multiple access channel. We propose a new reliable physical-layer network coding and cascade-computation decoding scheme. In the proposed scheme, $K$ single-antenna users encode their messages by the same practical channel code and QAM modulation, and transmit simultaneously. The receiver chooses $K$ linear coefficient vectors and computes the associated $K$ layers of finite-field linear message combinations in a cascade manner. Finally, the $K$ users’ messages are recovered by solving the $K$ linear equations. The proposed can be regarded as a generalized onion peeling. We study the optimal network coding coefficient vectors used in the cascade computation. Numerical results show the performance of the proposed approaches that of the iterative maximum $a~posteriori$ probability detection and decoding scheme, but without using receiver iteration. This results in considerable complexity reduction, processing delay, and easier implementation. Our proposed scheme significantly outperforms the iterative detection and decoding scheme with a single iteration, for example, by 1.7 dB for the two user case. The proposed scheme provides a competitive solution for non-orthogonal multiple access.

Multistage decoding of multilevel block multilevel phase-shift keying (M-PSK) modulation codes for the additive white Gaussian noise (AWGN) channel is investigated. Several types of multistage decoding, including a suboptimum soft-decision decoding scheme, are devised and analyzed. Upper bounds on the probability of an incorrect decoding of a code are derived for the proposed multistage decoding schemes. Error probabilities of some specific multilevel block 8-PSK modulation codes are evaluated and simulated. The computation and simulation results for these codes show that with multistage decoding, significant coding gains can be achieved with large reduction in decoding complexity. In one example, it is shown that the difference in performance between the proposed suboptimum multistage soft-decision decoding and the single-stage optimum decoding is small, only a fraction of a dB loss in SNR at the block error probability of 10/sup -6/. >

As a promising approach to implement indoor positioning, visible light positioning (VLP) based on optical camera communication (OCC) image sensor has attracted substantial attention. However, the decoding schemes of existing VLP systems still face many challenges. First, the transmission channel between transmitters and receivers can be easily affected by environmental changes, resulting in poor thresholding performance. Second, the inherently unsynchronized air transmission channel issue remains a big obstacle for decoding data. The above two problems limit the application of VLP systems, where various mobile devices are used as receivers and the properties of transmission channel are constantly changing with the movement of receivers. In this paper, a universal and effective decoding scheme named pixel-to-bit calculation (PBC) decoding algorithm for VLP systems is proposed and experimentally demonstrated. It includes a Staged Threshold Scheme which provides excellent thresholding performance for different transmission channel conditions, as well as a Synchronous Decoding Operation to automatically synchronize the clock between transmitters and receivers. A decoding rate of 95.62% at the height of 2.73 m is realized in a practical Robotic-based VLP system embedded with our proposed PBC decoding scheme. In addition, experimental results show that the average decoding rate of the proposed PBC decoding scheme reaches 99.9% when applying different transmitters and receivers.

Non binary turbo codes are gaining a lot of attention since the recent adoption of duo binary circular turbo codes by the Digital Video Broadcasting (DVB) community. In this paper, a Joint Source Channel Decoding (JSCD) scheme is proposed for circular non-binary turbo codes. With a view to exploit a-priori probabilities from source statistics, a symbol level trellis is incorporated into the circular trellis of the non-binary turbo decoder. Reversible Variable Length Codes (RVLC) are used as the input source in all simulations. Results show that with JSCD, circular duo binary turbo codes provide an average gain of 0.4 dB at Bit Error Rate (BER) of 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-5</sup> as compared to conventional decoding of circular duo binary turbo codes. With circular triple binary turbo codes, JSCD provides a striking average gain of 3.5 dB at a BER of 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-6</sup> compared to conventional decoding of circular triple binary turbo codes.

Low-density parity check (LDPC) codes are gaining increased attention in information theory field. However one of the main problems facing usage of these codes in communication systems is its high complexity decoding scheme that results in high decoding delay. Such a delay is not acceptable in many applications. This paper presents, a new hybrid decoding scheme. The proposed scheme mixes between soft-decision and hard-decision algorithms and provides a good tradeoff between error performance and decoding delay as proved by simulation results.

This paper presents a novel joint channel and physical layer network decoding scheme for a two-way relay communication system. The proposed decoding scheme can be viewed as a serial concatenated decoding scheme with the source codes, different or identical, as the outer codes and the physical network coding (PNC) as the inner code. To achieve good error performance, iteratively decodable codes are used as the source codes. Decoding of the scheme consists of two loops, the inner-loop for which the source codes are decoded with a message-passing decoding algorithm and the outer-loop for which the reliability messages are passed between the source decoders and the PNC decoder for updating message reliabilities. Using two different protograph repeat-accumulate codes as the source codes for low decoder complexity, the proposed scheme achieves a superior performance. In the case that the source codes are identical, the proposed scheme outperforms the previously proposed decoding schemes for two-way relay communication systems with two source nodes.

A new hybrid coding technique is introduced which is based on the Discrete Cosine Transform, interframe DPCM, conditional replenishment, detection of significant subareas in the transform domain, adaptive quantization, adaptive Huffman coding and postbuffer control. This coder concept is the result of a comparison of several coding methods including uniform/nonuniform quantization, constant/variable word length coding and prebuffer/post-buffer control schemes. An important feature of the presented coder is the selection of transform coefficients within each block which are grouped in subareas for adaptive entropy coding. The components of the coder are described and its excellent performance is demonstrated by means of SNR-measurements and a typical videoconference sequence.

Orthogonally multiplexed Quadrature Amplitude Modulation (OQAM) with Filter-Bank-based MultiCarrier modulation (FBMC) is a multicarrier modulation scheme that can be considered an alternative to the conventional orthogonal frequency division multiplexing (OFDM) with cyclic prefix (CP) for transmission over multipath fading channels. However, as OQAM-based FBMC is based on real orthogonality, transmission over a complex-valued channel makes the decoding process more challenging compared to CP-OFDM case. Moreover, if we apply Multiple Input Multiple Output (MIMO) techniques to OQAM-based FBMC, the decoding schemes are different from the ones used in CP-OFDM. In this paper, we consider the combination of OQAM-based FBMC with single-delay Space-Time Trellis Coding (STTC). We extend the decoding process presented earlier in the case of Nt = 2 transmit antennas to greater values of Nt. Then, for Nt ≥ 2, we make an analysis of the theoretical and simulation performance of ML and Viterbi decoding. Finally, to improve the performance of this method, we suggest an iterative decoding method. We show that the OQAM-based FBMC iterative decoding scheme can slightly outperform CP-OFDM.

Compared to binary low-density parity-check (LDPC) codes, non-binary (NB) LDPC codes can achieve higher coding gain when the code length is moderate. On the other hand, the decoding of NB-LDPC codes is more complicated since a vector of messages instead of a single message is passed along each edge of the associated Tanner graph. Layered decoding can be employed to simplify LDPC decoding. However, there is extra latency between the decoding of layers caused by check node processing, message permutation and updating when applied to NB-LDPC codes. In this paper, a novel scheduling scheme is developed to eliminate the extra latency for the Min-max decoding of quasi-cyclic (QC) NB-LDPC codes using trellis-based check node processing. Assume that each row of sub-matrices in the parity check matrix of a QCNB-LDPC code is divided into two layers, the proposed scheme can reduce the decoding latency by a factor of around (2d <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c</sub> + 5)/2d <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c</sub> , where d <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c</sub> is the check node degree. It leads to significant speedup when d <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c</sub> is not large. Moreover, the area overhead of the proposed scheme is less than 10%.

To the best of our knowledge, Belief Propagation List (BPL) achieves the best error-correction performance within the class of BP based polar code algorithms. It regards different permutations of the polar code factor graph as a range of available decoding for individually executing the BP algorithm. Then, a minimum Euclidean distance criterion is employed to combine these individual decisions. However, we demonstrated that simply increasing the number of lists involved in the BPL algorithm does not always improve its performance. Instead, we exploit the extrinsic information transfer (EXIT) chart technology to verify the efficiency of a list. Based on this analysis, an efficient list selection scheme is proposed. In the same spirit, in order to mitigate the impact of relatively inferior lists on other selected lists, new decision fusion schemes are also designed. Benefiting from these improvements of BPL algorithm, performance gains are evidenced in our simulation results.