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

Joint Source Channel Decoding Exploiting 2D Source Correlation with Parameter Estimation for Image Transmission over Rayleigh Fading Channels

This  paper  investigates  the  performance  of  a  2- Dimensional  (2D)  Joint  Source  Channel  Coding  (JSCC)  system assisted  with  parameter  estimation  for  2D  image  transmission over  an  Additive  White  Gaussian  Noise  (AWGN)  channel  and a  Rayleigh  fading  channel.  Baum-Welsh  Algorithm  (BWA)  is employed  in  the  proposed  2D  JSCC  system  to  estimate  the source correlation statistics during channel decoding. The source correlation is then exploited during channel decoding using a Modified Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm. The performance of the 2D JSCC system with the BWA-based parameter estimation technique (2D-JSCC-PET1) is evaluated via image transmission simulations.  Two  images,  each  exhibits  strong  and weak  source  correlation  are  considered  in  the  evaluation  by measuring the Peak Signal Noise Ratio of the decoded images at the  receiver.  The proposed 2D-JSCC-PET1 system is compared with various benchmark systems. Simulation results reveal that the 2D-JSCC-PET1 system outperforms the other benchmark systems (performance gain of 4.23 dB over the 2D-JSCC-PET2 system and 6.10 dB over the 2D JSCC system).  The proposed system also can perform very close to the ideal 2D JSCC system relying on the assumption of perfect source correlation knowledge at the receiver that shown only 0.88 dB difference in performance gain

Packet data communications over coded CDMA with hybrid type-II ARQ

This dissertation presents in-depth investigation of turbo-coded CDNIA systems in packet data communication terminology. It is divided into three parts; (1) CDMA with hybrid FEC/ARQ in deterministic environment, (2) CDMA with hybrid FEC/ARQ in random access environment and (3) an implementation issue on turbo decoding. As a preliminary, the performance of CDMA with hybrid FEC/ARQ is investigated in deterministic environment. It highlights the practically achievable spectral efficiency of CDMA system with turbo codes and the effect of code rates on the performance of systems with MF and LMMSE receivers, respectively. For given ensemble distance spectra of punctured turbo codes, an improved union bound is used to evaluate the error probability of ML turbo decoder with MF receiver and with LMMSE receiver front-end and, then, the corresponding spectral efficiency is computed as a function of system load. In the second part, a generalized analytical framework is first provided to analyze hybrid type-11 ARQ in random access environment. When applying hybrid type-11 ARQ, probability of packet success and packet length is generally different from attempt to attempt. Since the conventional analytical model, customarily employed for ALOHA system with pure or hybrid type-I ARQ, cannot be applied for this case, an expanded analytical model is introduced. It can be regarded as a network of queues and Jackson and Burke\u27s theorems can be applied to simplify the analysis. The second part is further divided into two sub topics, i.e. CDMA slotted ALOHA with hybrid type-11 ARQ using packet combining and CDMA unslotted ALOHA with hybrid type-11 ARQ using code combining. For code combining, the rate compatible punctured turbo (RCPT) codes are examined. In the third part, noticing that the decoding delay is crucial to the fast ARQ, a parallel MAP algorithm is proposed to reduce the computational decoding delay of turbo codes. It utilizes the forward and backward variables computed in the previous iteration to provide boundary distributions for each sub-block MAP decoder. It has at least two advantages over the existing parallel scheme; No performance degradation and No additional computation

A Queueing Characterization of Information Transmission over Block Fading Rayleigh Channels in the Low SNR

Unlike the AWGN (additive white gaussian noise) channel, fading channels suffer from random channel gains besides the additive Gaussian noise. As a result, the instantaneous channel capacity varies randomly along time, which makes it insufficient to characterize the transmission capability of a fading channel using data rate only. In this paper, the transmission capability of a buffer-aided block Rayleigh fading channel is examined by a constant rate input data stream, and reflected by several parameters such as the average queue length, stationary queue length distribution, packet delay and overflow probability. Both infinite-buffer model and finite-buffer model are considered. Taking advantage of the memoryless property of the service provided by the channel in each block in the the low SNR (signal-to-noise ratio) regime, the information transmission over the channel is formulated as a \textit{discrete time discrete state} $D/G/1$ queueing problem. The obtained results show that block fading channels are unable to support a data rate close to their ergodic capacity, no matter how long the buffer is, even seen from the application layer. For the finite-buffer model, the overflow probability is derived with explicit expression, and is shown to decrease exponentially when buffer size is increased, even when the buffer size is very small.Comment: 29 pages, 11 figures. More details on the proof of Theorem 1 and proposition 1 can be found in "Queueing analysis for block fading Rayleigh channels in the low SNR regime ", IEEE WCSP 2013.It has been published by IEEE Trans. on Veh. Technol. in Feb. 201

Underwater acoustic communications and adaptive signal processing

This dissertation proposes three new algorithms for underwater acoustic wireless communications. One is a new tail-biting circular MAP decoder for full tail-biting convolution (FTBC) codes for very short data blocks intended for Internet of Underwater Things (IoUT). The proposed algorithm was evaluated by ocean experiments and computer simulations on both Physical (PHY) and Media access control (MAC) layers. The ocean experimental results show that without channel equalization, the full tail-biting convolution (FTBC) codes with short packet lengths not only can perform similarly to zero-tailing convolution (ZTC) codes in terms of bit error rate (BER) in the PHY layer. Computer simulation results show that the FTBC codes outperform the ZTC codes in terms of MAC layer metrics, such as collision rate and bandwidth utilization, in a massive network of battery powered IoUT devices. Second, this dissertation also proposes a new approach to utilizing the underwater acoustic (UWA) wireless communication signals acquired in a real-world experiment as a tool for evaluating new coding and modulation schemes in realistic doubly spread UWA channels. This new approach, called passband data reuse, provides detailed procedures for testing the signals under test (SUT) that change or add error correction coding, change bit to symbol mapping (baseband modulation) schemes from a set of original experimental data --Abstract, page iv

Energy-efficient diversity combining for different access schemes in a multi-path dispersive channel

Dissertação para obtenção do Grau de Doutor em Engenharia Electrotécnica e ComputadoresThe forthcoming generation of mobile communications, 5G, will settle a new standard for a larger bandwidth and better Quality of Service (QoS). With the exploding growth rate of user generated data, wireless standards must cope with this growth and at the same time be energy efficient to avoid depleting the batteries of wireless devices. Besides these issues, in a broadband wireless setting QoS can be severely affected from a multipath dispersive channel and therefore be energy demanding. Cross-layered architectures are a good choice to enhance the overall performance of a wireless system. Examples of cross-layered Physical (PHY) - Medium Access Control (MAC) architectures are type-II Diversity Combining (DC) Hybrid-ARQ (H-ARQ) and Multi-user Detection (MUD) schemes. Cross-layered type-II DC H-ARQ schemes reuse failed packet transmissions to enhance data reception on posterior retransmissions; MUD schemes reuse data information from previously collided packets on posterior retransmissions to enhance data reception. For a multipath dispersive channel, a PHY layer analytical model is proposed for Single-Carrier with Frequency Domain Equalization (SC-FDE) that supports DC H-ARQ and MUD. Based on this analytical model, three PHY-MAC protocols are proposed. A crosslayered Time Division Multiple Access (TDMA) scheme that uses DC H-ARQ is modeled and its performance is studied in this document; the performance analysis shows that the scheme performs better with DC and achieves a better energy efficiency at the cost of a higher delay. A novel cross-layered prefix-assisted Direct-Sequence Code Division Multiple Access (DS-CDMA) scheme is proposed and modeled in this document, it uses principles of DC and MUD. This protocol performs better by means of additional retransmissions, achieving better energy efficiency, at the cost of higher redundancy from a code spreading gain. Finally, a novel cross-layered protocol H-ARQ Network Division Multiple Access (H-NDMA) is proposed and modeled, where the combination of DC H-ARQ and MUD is used with the intent of maximizing the system capacity with a lower delay; system results show that the proposed scheme achieves better energy efficiency and a better performance at the cost of a higher number of retransmissions. A comparison of the three cross-layered protocols is made, using the PHY analytical model, under normalized conditions using the same amount of maximum redundancy. Results show that the H-NDMA protocol, in general, obtains the best results, achieving a good performance and a good energy efficiency for a high channel load and low Signal-to-Noise Ratio (SNR). TDMA with DC H-ARQ achieves the best energy efficiency, although presenting the worst delay. Prefix-assisted DS-CDMA in the other hand shows good delay results but presents the worst throughput and energy efficiency