The exponential server timing channel-the simplest queuing timing channel-is non-stationary and has infinite memory. Thus, developing error-correcting codes for such channels is challenging. Previously, Coleman and Ki...
详细信息
ISBN:
(纸本)9781457705953
The exponential server timing channel-the simplest queuing timing channel-is non-stationary and has infinite memory. Thus, developing error-correcting codes for such channels is challenging. Previously, Coleman and Kiyavash developed a class of coding techniques that are reliable in limited scenarios, but have undesirable complexity-performance tradeoffs. This paper utilizes a recent result by Coleman on developing an achievability theorem based upon how the channel is memoryless conditioned upon intermediate queue states. In this paper, we use this property, along with the fact that the distribution of a Poisson process conditioned upon the number of counts at time T is a uniform distribution on the unordered time epochs on [0, T]. Our approach uses a sparse graph coding technique over finite fields of large alphabets. Unlike the previous coding scheme, all intermediate messages of the decoder are of a fixed alphabet and the graphical representation is equivalent to a sparse graph for decoding on memoryless channels. Simulation results demonstrate the effectiveness of this approach.
In this study, it is planned to use the optical OFDM (NDC-O-OFDM) method, which does not use DC bias addition, as a solution to the energy inefficiency problem of the DCO-OFDM system, which is one of the most importan...
详细信息
ISBN:
(数字)9781665450928
ISBN:
(纸本)9781665450928
In this study, it is planned to use the optical OFDM (NDC-O-OFDM) method, which does not use DC bias addition, as a solution to the energy inefficiency problem of the DCO-OFDM system, which is one of the most important and spectrum efficient optical OFDM techniques for visible light communication (VLC) systems. In order to increase the performance of the NDC-O-OFDM system, the use of channel coding techniques such as Reed Solomon (RS) and 1/2 rate convolutional coding (CC) is recommended in this study. Numerical simulation studies are carried out to verify the performance of this proposed new channel coded waveform in the optical MIMO channel environment and to compare it with other optical OFDM systems. From the produced numerical results, it is understood that it is achieved approximately 6.5 dB SNR gain without sacrificing energy efficiency with the proposed channel-coded NDC-O-OFDM waveform against the un-coded NDC-O-OFDM and un-coded DCO-OFDM waveforms.
The duality between the sphere packing exponents, random coding exponents, and correct decoding exponents for Slepian-Wolf coding and channel coding is established. A systematic analysis and comparison of the expurgat...
详细信息
ISBN:
(纸本)9781424415632
The duality between the sphere packing exponents, random coding exponents, and correct decoding exponents for Slepian-Wolf coding and channel coding is established. A systematic analysis and comparison of the expurgated exponents for Slepian-Wolf coding and channel coding is provided. This analysis, in conjunction with the linear codebook-level duality between Slepian-Wolf coding and channel coding, reveals that nonlinear Slepian-Wolf codes can strictly outperform linear Slepian-Wolf codes in terms of rate-error tradeoff at high rates.
We consider a setting of Slepian-Wolf coding, where the random bin of the source vector undergoes channel coding, and then decoded at the receiver, based on additional side information, correlated to the source. For a...
详细信息
ISBN:
(纸本)9781509018062
We consider a setting of Slepian-Wolf coding, where the random bin of the source vector undergoes channel coding, and then decoded at the receiver, based on additional side information, correlated to the source. For a given distribution of the randomly selected channel codewords, we propose a universal decoder that depends on the statistics of neither the correlated sources nor the channel, assuming first that they are both memoryless. Exact analysis of the random-binning/random-coding error exponent of this universal decoder shows that it is the same as the one achieved by the optimal maximum aposteriori (MAP) decoder. Previously known results on universal Slepian-Wolf source decoding, universal channel decoding, and universal source-channel decoding, are all obtained as special cases of this result. Subsequently, we further generalize the results in two directions: (i) finite-state sources and finite-state channels, along with a universal decoding metric that is based on Lempel-Ziv parsing, and (ii) full (symmetric) Slepian-Wolf coding, where both source streams are separately fed into random-binning source encoders, followed by random channel encoders, which are then jointly decoded by a universal decoder.
We study the problem of Slepian-Wolf coding for general sources (not necessarily stationary) with finite alphabet. A linear codebook-level duality between Slepian-Wolf coding for general sources and channel coding for...
详细信息
ISBN:
(纸本)9781424407682
We study the problem of Slepian-Wolf coding for general sources (not necessarily stationary) with finite alphabet. A linear codebook-level duality between Slepian-Wolf coding for general sources and channel coding for a class of cyclic-symmetric channels is established under optimal decoding, through which the general formula for the Slepian-Wolf limit can be reinterpreted using Verdu and Han's channel capacity formula.
This paper presents the performance of periodic spectrum transmission for single-carrier with frequency-domain equalization (SC-FDE) using channel coding. So far, we have proposed periodic spectrum transmission and sh...
详细信息
ISBN:
(纸本)9781424405688
This paper presents the performance of periodic spectrum transmission for single-carrier with frequency-domain equalization (SC-FDE) using channel coding. So far, we have proposed periodic spectrum transmission and showed the effectiveness of enhancing a frequency diversity benefit compared with the typical case when adopting a low rate transmission such as 1-bit/sample. In this paper, the impact of channel coding on the proposed scheme is intensively discussed compared with coded OFDM (COFDM) as well as the typical SC-FDE. This is because OFDM is sure to be the promising approach when taking channel coding into account. Computer simulation results show that the proposed scheme 1-bit/sample transmission outperforms COFDM irrespective of coding rate.
Joint source channel coding (JSCC) is an effective method which trade off the efficiency and the quality of the video transmission. In this paper, a new rate-quality (R-Q) model is first proposed to represent the codi...
详细信息
ISBN:
(纸本)9780769532783
Joint source channel coding (JSCC) is an effective method which trade off the efficiency and the quality of the video transmission. In this paper, a new rate-quality (R-Q) model is first proposed to represent the coding characteristics of H.264 instead of rate-distortion (R-D) model. Then, the end-to-end video transmission distortion is analyzed and an adaptive JSCC over wireless channel based on the R-Q model of the H.264 and the error protection characteristics of the Turbo code is proposed, which can optimize the rate allocation of the available network bandwidth between source coding and channel coding according to the current status of the wireless channels, so as to improve the robustness. The experiment results indicate that, compared with the scheme using the fixed channel coding rate, under the same channel conditions, our proposed JSCC scheme can greatly improve the transmission robustness and achieve better reconstructed video quality at the receiver.
In this paper, we focus on network coding design for the wireless sensor networks (WSNs), where multiple source nodes communicate with a common destination node with the help of multiple relay nodes in a two-hop fashi...
详细信息
ISBN:
(纸本)9781467359399;9781467359382
In this paper, we focus on network coding design for the wireless sensor networks (WSNs), where multiple source nodes communicate with a common destination node with the help of multiple relay nodes in a two-hop fashion. Specifically, we propose an unequal error protection (UEP) distributed network-channel coding (DNCC) scheme based on Luby-transform (LT) codes. We analyse three properties of the proposed UEP DNCC scheme, i.e. effective weights, turning points, and thresholds of the source nodes' number. Also, we derive the upper and lower bit error rate (BER) bounds for the proposed UEP DNCC scheme over Rayleigh fading channels under maximum-likelihood (ML) decoding. Based on the analysis, it is observed that the proposed UEP DNCC scheme can achieve all protection levels required when the number of source nodes is large enough. Simulation results show that our UEP DNCC scheme can provide desirable UEP to all source nodes.
This paper researches the Parallel Concatenated Convolutional Codes (PCCCs) and Serial Concatenated Convolutional Codes (SCCCs) channel encoders' theoretical performance and design criteria in deep-space communica...
详细信息
ISBN:
(纸本)9781424437092
This paper researches the Parallel Concatenated Convolutional Codes (PCCCs) and Serial Concatenated Convolutional Codes (SCCCs) channel encoders' theoretical performance and design criteria in deep-space communication. Using random interleaver and studying the random interleaver design algorithm. Theoretical analysis presents the reasons for their excellent performance. Different encoding techniques are considered and various channel conditions.
Networks established among nanomachines, also called nanonetworks, are crucial since, a single nanomachine most likely cannot handle task by itself. At the nano scale, electromagnetic waves lose their effectiveness. M...
详细信息
ISBN:
(纸本)9781538615010
Networks established among nanomachines, also called nanonetworks, are crucial since, a single nanomachine most likely cannot handle task by itself. At the nano scale, electromagnetic waves lose their effectiveness. Molecular communication via diffusion (MCvD) is a new concept that aims to solve this problem. Information is carried out by either the type of molecules, or their concentration. The robustness of this communication method, as in the example of classical communication, is very important. channel coding is the component that make communication less erroneous. If the desired error performance is high, channel coding is mandatory. In this paper, the performance of Bose-Chaudhuri-Hocquenghem (BCH) and Reed-Solomon (RS) codes for MCvD are evaluated by simulation and results are analyzed.
暂无评论