The exact order of the optimal sub-exponentially decaying factor in the classical bounds on the error probability of fixed-length codes over a Gallager-symmetric discrete memoryless channel with and without ideal feed...
详细信息
The exact order of the optimal sub-exponentially decaying factor in the classical bounds on the error probability of fixed-length codes over a Gallager-symmetric discrete memoryless channel with and without ideal feedback is determined for rates above the critical rate. Regardless of the availability of feedback, it is shown that the order of the optimal sub-exponential factor exhibits a dichotomy. Moreover, the proof technique is used to establish the third-order term in the normal approximation for symmetric channels, where a similar dichotomy is shown to exist.
We consider the time-division multiple-access relay channel (MARC) with block-fading channels and Gaussian noise, where two sources communicate with one destination with the help of one relay. Such a system can be use...
详细信息
We consider the time-division multiple-access relay channel (MARC) with block-fading channels and Gaussian noise, where two sources communicate with one destination with the help of one relay. Such a system can be used for the cooperative uplink of two mobile stations to a base station with the help of a relay. We propose a joint network-channel code design based on turbo codes for the MARC. We compare the proposed system with a distributed turbo code for the time-division relay channel and with a system which uses separate network-channel coding for the MARC. Our results show that the proposed code can gain diversity compared to the system for the time-division relay channel and allows to more efficiently exploit the redundancy in the transmission of the relay than separate network-channel coding. Copyright (C) 2009 John Wiley & Sons, Ltd.
In this paper, second-order coding rate of channel coding is discussed for general sequence of channels. The optimum second-order transmission rate with a constant error constraint is obtained by using the information...
详细信息
In this paper, second-order coding rate of channel coding is discussed for general sequence of channels. The optimum second-order transmission rate with a constant error constraint is obtained by using the information spectrum method. We apply this result to the discrete memoryless case, the discrete memoryless case with a cost constraint, the additive Markovian case, and the Gaussian channel case with an energy constraint. We also clarify that the Gallager bound does not give the optimum evaluation in the second-order coding rate.
In this paper, we have proposed and investigated an attractive joint source coding, channel coding, and modulation (JSCM) scheme for a two-way relaying system. We commence by quantifying the achievable capacity of the...
详细信息
In this paper, we have proposed and investigated an attractive joint source coding, channel coding, and modulation (JSCM) scheme for a two-way relaying system. We commence by quantifying the achievable capacity of the corresponding two-way relay channel before proposing low-complexity source coding schemes for concatenation with bandwidth-and power-efficient coded modulation schemes. Extrinsic information transfer (EXIT) charts are used to investigate the decoding convergence of the joint source and channel decoder and for the overall system design. The quality of the decoded source signals is quantified using the bit error ratio (BER) metric. It is found that the two-way-relay-based JSCM scheme is capable of attaining a combined coding and relaying gain of 5.7 dB over the conventional noncooperative JSCM scheme when communicating over uncorrelated Rayleigh fading channels in an outdoor environment.
Industrial wireless sensor networks (IWSN) begin to occupy wide areas in the industry for applications such as factory automation. To meet the strict latency and reliability requirements for (IWSN), channel coding is ...
详细信息
ISBN:
(纸本)9781728101170
Industrial wireless sensor networks (IWSN) begin to occupy wide areas in the industry for applications such as factory automation. To meet the strict latency and reliability requirements for (IWSN), channel coding is proposed to be used in the physical layer. To this aim, a comparison study is carried out in this paper among three different modern coding techniques, i.e. turbo, LDPC, and convolutional coding. The goal of this study is to define which coding technique better meets IWSN requirements. LDPC is shown to provide a good performance by means of latency and reliability. In addition, low latency HARQ based on error rate estimation is proposed in this paper. The proposed scheme utilizes few LDPC decoder iterations and can provide up to 5 dB gain compared to another scheme where the decoding process is completely skipped.
In this paper we study channels where a side-information sequence is available strictly causally at the transmitter, i.e., the channel input at time k may depend on the side-information sequence up to and including ti...
详细信息
ISBN:
(纸本)9781424413973
In this paper we study channels where a side-information sequence is available strictly causally at the transmitter, i.e., the channel input at time k may depend on the side-information sequence up to and including time k - 1. This is in contrast to Shannon's channel coding with causal side-information at the transmitter where the channel input at time k may depend on the side-information sequence up to and including time k. We consider side-information sequences with memory and study the Gaussian and modulo-additive channels.
In the Internet of Things, Packet Delivery Ratio and Time on Air are two predominant characteristics for both applications and operators, especially while using transmissions over Low Power Wide Area Networks such as ...
详细信息
ISBN:
(纸本)9781538668764
In the Internet of Things, Packet Delivery Ratio and Time on Air are two predominant characteristics for both applications and operators, especially while using transmissions over Low Power Wide Area Networks such as LoRa (TM). Our channel coding approach aims to imyrove these Quality of Service characteristics for LoRaWAN (TM) networks. Our CCARR protocol uses Reed-Solomon FEC and structures successive frames into segments. A completion acknowledgements dynamically controls the amount of FEC overload. We estimate the potential gain of CCARR with a probabilistic analysis. Simulation and of-the-shelves testbed experiments of the protocol corroborate analysis trends and show a large Packet Delivery Rate improvement over LoRaWAN (TM) and the literature with a controlled Time on Air increase due to optimized FEC overload.
In wireless sensor networks, security and energy efficiency are two important topics. In multipath routing, threat can come from compromised nodes, which might relay incorrect information (packet) to the next node dur...
详细信息
ISBN:
(纸本)9781424402694;9781424402700
In wireless sensor networks, security and energy efficiency are two important topics. In multipath routing, threat can come from compromised nodes, which might relay incorrect information (packet) to the next node during routing. Detection of such incorrect information is very difficult. In this paper, we propose a Secure and Energy Efficient Multipath-routing (SEEM) scheme aided with channel coding and interleaver. The M-path in multipath routing are selected using existing routing algorithm and fuzzy logic system considering the average remaining battery capacity and mobility of associated nodes. Simulation results show that even if certain paths are compromised, the receiver node is still able to recover the transmitted message from errors with very low bit error rate.
Two common source-channel coding strategies, joint and tandem, are compared on the basis of distortion versus complexity and distortion versus delay by analyzing specific representatives of each when transmitting anal...
详细信息
Two common source-channel coding strategies, joint and tandem, are compared on the basis of distortion versus complexity and distortion versus delay by analyzing specific representatives of each when transmitting analog data samples across a binary symmetric channel. channel-optimized transform coding is the joint source-channel strategy;transform coding plus Reed-Solomon coding is the tandem strategy. For each strategy, formulas for the mean-squared error, computational complexity, and delay are found and used to minimize distortion subject to constraints on complexity and delay, for source data modeled as Gauss-Markov. The results of such optimizations suggest there is a complexity threshold such that when the number of operations per data sample available for encoding and decoding is greater than this threshold, tandem coding is better, and when less, channel-optimized transform coding is better. Similarly, the results suggest there is also a delay threshold such that tandem coding is better than joint when only when the permissible encoding and decoding delay is greater than this threshold.
Joint Source-channel coding (JSCC) is a powerful technique that allows for the efficient transmission of information by simultaneously considering the characteristics of both the source and the channel. The recently p...
详细信息
Joint Source-channel coding (JSCC) is a powerful technique that allows for the efficient transmission of information by simultaneously considering the characteristics of both the source and the channel. The recently proposed Exponential Golomb Error Correction (ExpGEC) and Rice Error Correction (REC) codes provide generalized JSCC schemes for the near capacity coding of symbols drawn from large or infinite alphabets. Yet these require impractical decoding structures, with large buffers and inflexible system design, this was mitigated by the introduction of the Reordered Elias Gamma Error Correction (REGEC) which itself had limited flexibility with regards to source distribution. In this paper, we propose a novel Reordered Exponential Golomb Error Correction (RExpGEC) coding scheme, which is a JSCC technique designed for flexible and practical near-capacity performance. The proposed RExpGEC encoder and decoder are presented and its performance is analysed using Extrinsic Information Transfer (EXIT) charts. The flexibility of the RExpGEC is shown via the novel trellis encoder and decoder design. Finally, the Symbol Error Rate (SER) performance of RExpGEC code is compared when integrated into the novel RExpGEC-URC-QPSK scheme against other comparable JSCC and Separate Source channel coding (SSCC) benchmarkers. Specifically the RExpGEC-URC-QPSK scheme is compared against the REGEC-URC-QPSK scheme, and a serial concatenation of the Exponential Golomb and Convolution Code, which becomes the novel Exp-CC-URC-QPSK scheme. Our simulation results demonstrate the performance gains and flexibility of the proposed RExpGEC-URC-QPSK scheme against the benchmarkers in providing reliable and efficient communications. Specifically, the RExpGEC-URC-QPSK scheme outperforms the SSCC in a uncorrelated Rayleigh fading channel by 2 to 3.6 dB (dependent on source distribution). Furthermore, the RExpGEC-URC-QPSK scheme consistently operates within 2.5 dB of channel capacity when measuring Eb
暂无评论