Non-linear graph-based codes for joint source-channel coding

We study the behavior of a new family of nonlinear graph-based codes, previously introduced for compression of asymmetric binary memoryless sources, for the joint source-channel coding scenario in which the codewords are transmitted through an additive white Gaussian noise channel. We focus on low entropy sources (with high redundancy) and compression rates. Monte Carlo simulation and density evolution results show that the proposed family, with a regular and simple parametrization of the degree profiles, outperforms linear codes.Peer ReviewedPostprint (published version

Exploiting 2-Dimensional Source Correlation in Channel Decoding with Parameter Estimation

Traditionally, it is assumed that source coding is perfect and therefore, the redundancy of the source encoded bit-stream is zero. However, in reality, this is not the case as the existing source encoders are imperfect and yield residual redundancy at the output. The residual redundancy can be exploited by using Joint Source Channel Coding (JSCC) with Markov chain as the source. In several studies, the statistical knowledge of the sources has been assumed to be perfectly available at the receiver. Although the result was better in terms of the BER performance, practically, the source correlation knowledge were not always available at the receiver and thus, this could affect the reliability of the outcome. The source correlation on all rows and columns of the 2D sources were well exploited by using a modified Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm in the decoder. A parameter estimation technique was used jointly with the decoder to estimate the source correlation knowledge. Hence, this research aims to investigate the parameter estimation for 2D JSCC system which reflects a practical scenario where the source correlation knowledge are not always available. We compare the performance of the proposed joint decoding and estimation technique with the ideal 2D JSCC system with perfect knowledge of the source correlation knowledge. Simulation results reveal that our proposed coding scheme performs very close to the ideal 2D JSCC system

Modern Coding Theory: The Statistical Mechanics and Computer Science Point of View

These are the notes for a set of lectures delivered by the two authors at the Les Houches Summer School on `Complex Systems' in July 2006. They provide an introduction to the basic concepts in modern (probabilistic) coding theory, highlighting connections with statistical mechanics. We also stress common concepts with other disciplines dealing with similar problems that can be generically referred to as `large graphical models'. While most of the lectures are devoted to the classical channel coding problem over simple memoryless channels, we present a discussion of more complex channel models. We conclude with an overview of the main open challenges in the field.Comment: Lectures at Les Houches Summer School on `Complex Systems', July 2006, 44 pages, 25 ps figure

Decoding the `Nature Encoded\u27 Messages for Wireless Networked Control Systems

Because of low installation and reconfiguration cost wireless communication has been widely applied in networked control system (NCS). NCS is a control system which uses multi-purpose shared network as communication medium to connect spatially distributed components of control system including sensors, actuator, and controller. The integration of wireless communication in NCS is challenging due to channel unreliability such as fading, shadowing, interference, mobility and receiver thermal noise leading to packet corruption, packet dropout and packet transmission delay. In this dissertation, the study is focused on the design of wireless receiver in order to exploit the redundancy in the system state, which can be considered as a `nature encoding\u27 for the messages. Firstly, for systems with or without explicit channel coding, a decoding procedures based on Pearl\u27s Belief Propagation (BP), in a similar manner to Turbo processing in traditional data communication systems, is proposed to exploit the redundancy in the system state. Numerical simulations have demonstrated the validity of the proposed schemes, using a linear model of electric generator dynamic system. Secondly, we propose a quickest detection based scheme to detect error propagation, which may happen in the proposed decoding scheme when channel condition is bad. Then we combine this proposed error propagation detection scheme with the proposed BP based channel decoding and state estimation algorithm. The validity of the proposed schemes has been shown by numerical simulations. Finally, we propose to use MSE-based transfer chart to evaluate the performance of the proposed BP based channel decoding and state estimation scheme. We focus on two models to evaluate the performance of BP based sequential and iterative channel decoding and state estimation. The numerical results show that MSE-based transfer chart can provide much insight about the performance of the proposed channel decoding and state estimation scheme. In this dissertation, the study is focused on the design of wireless receiver in order to exploit the redundancy in the system state, which can be considered as a `nature encoding\u27 for the messages. Firstly, for systems with or without explicit channel coding, a decoding procedures based on Pearl\u27s Belief Propagation (BP), in a similar manner to Turbo processing in traditional data communication systems, is proposed to exploit the redundancy in the system state. Numerical simulations have demonstrated the validity of the proposed schemes, using a linear model of electric generator dynamic system. Secondly, we propose a quickest detection based scheme to detect error propagation, which may happen in the proposed decoding scheme when channel condition is bad. Then we combine this proposed error propagation detection scheme with the proposed BP based channel decoding and state estimation algorithm. The validity of the proposed schemes has been shown by numerical simulations. Finally, we propose to use MSE-based transfer chart to evaluate the performance of the proposed BP based channel decoding and state estimation scheme. We focus on two models to evaluate the performance of BP based sequential and iterative channel decoding and state estimation. The numerical results show that MSE-based transfer chart can provide much insight about the performance of the proposed channel decoding and state estimation scheme

ON TURBO CODES AND OTHER CONCATENATED SCHEMES IN COMMUNICATION SYSTEMS

The advent of turbo codes in 1993 represented a significant step towards realising the ultimate capacity limit of a communication channel, breaking the link that was binding very good performance with exponential decoder complexity. Turbo codes are parallel concatenated convolutional codes, decoded with a suboptimal iterative algorithm. The complexity of the iterative algorithm increases only linearly with block length, bringing previously unprecedented performance within practical limits.. This work is a further investigation of turbo codes and other concatenated schemes such as the multiple parallel concatenation and the serial concatenation. The analysis of these schemes has two important aspects, their performance under optimal decoding and the convergence of their iterative, suboptimal decoding algorithm. The connection between iterative decoding performance and the optimal decoding performance is analysed with the help of computer simulation by studying the iterative decoding error events. Methods for good performance interleaver design and code design are presented and analysed in the same way. The optimal decoding performance is further investigated by using a novel method to determine the weight spectra of turbo codes by using the turbo code tree representation, and the results are compared with the results of the iterative decoder. The method can also be used for the analysis of multiple parallel concatenated codes, but is impractical for the serial concatenated codes. Non-optimal, non-iterative decoding algorithms are presented and compared with the iterative algorithm. The convergence of the iterative algorithm is investigated by using the Cauchy criterion. Some insight into the performance of the concatenated schemes under iterative decoding is found by separating error events into convergent and non-convergent components. The sensitivity of convergence to the Eb/Ng operating point has been explored.SateUite Research Centre Department of Communication and Electronic Engineerin

D13.1 Fundamental issues on energy- and bandwidth-efficient communications and networking

Deliverable D13.1 del projecte europeu NEWCOM#The report presents the current status in the research area of energy- and bandwidth-efficient communications and networking and highlights the fundamental issues still open for further investigation. Furthermore, the report presents the Joint Research Activities (JRAs) which will be performed within WP1.3. For each activity there is the description, the identification of the adherence with the identified fundamental open issues, a presentation of the initial results, and a roadmap for the planned joint research work in each topic.Preprin