Generic Direct Approach for Decoding Turbo Codes Using Probability Density Based Reliability Model
01 Feb 2021-Journal of Communications Technology and Electronics (Pleiades Publishing)-Vol. 66, Iss: 2, pp 175-183
TL;DR: In this paper, the reliability has been identified in terms of probability densities of the bit values and the same used with the direct decoding algorithm for turbo codes proposed recently and has achieved a significant coding gain improvement.
Abstract: The probability of the received bit values has been directly used in the performance enhanced reliability based direct decoding algorithm for turbo codes proposed recently and has achieved a significant coding gain improvement. This is in contrast to the maximum a posteriori (MAP)—type decoders and their variants in vogue which use log-likelihood ratio (LLR) in place of reliability and go through an iterative process. In this paper reliability has been identified in terms of probability densities of the bit values and the same used with the direct decoding algorithm. Extensive simulations with commonly used encoders show a clear performance improvement especially for short block lengths. Neither does the approach constrain noise distribution in any way as brought out by considering different distributions.
References
More filters
23 May 1993
TL;DR: In this article, a new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed.
Abstract: A new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed. The turbo-code encoder is built using a parallel concatenation of two recursive systematic convolutional codes, and the associated decoder, using a feedback decoding rule, is implemented as P pipelined identical elementary decoders. >
5,963 citations
02 Aug 2016
TL;DR: In this article, the authors review recent advances in information theory, which provide the theoretical principles that govern the transmission of short packets, and then apply these principles to three exemplary scenarios (the two-way channel, the downlink broadcast channel, and the uplink random access channel), thereby illustrating how the transmissions of control information can be optimized when the packets are short.
Abstract: Most of the recent advances in the design of high-speed wireless systems are based on information-theoretic principles that demonstrate how to efficiently transmit long data packets. However, the upcoming wireless systems, notably the fifth-generation (5G) system, will need to support novel traffic types that use short packets. For example, short packets represent the most common form of traffic generated by sensors and other devices involved in machine-to-machine (M2M) communications. Furthermore, there are emerging applications in which small packets are expected to carry critical information that should be received with low latency and ultrahigh reliability. Current wireless systems are not designed to support short-packet transmissions. For example, the design of current systems relies on the assumption that the metadata (control information) is of negligible size compared to the actual information payload. Hence, transmitting metadata using heuristic methods does not affect the overall system performance. However, when the packets are short, metadata may be of the same size as the payload, and the conventional methods to transmit it may be highly suboptimal. In this paper, we review recent advances in information theory, which provide the theoretical principles that govern the transmission of short packets. We then apply these principles to three exemplary scenarios (the two-way channel, the downlink broadcast channel, and the uplink random access channel), thereby illustrating how the transmission of control information can be optimized when the packets are short. The insights brought by these examples suggest that new principles are needed for the design of wireless protocols supporting short packets. These principles will have a direct impact on the system design.
984 citations
26 Sep 2018
TL;DR: In this article, a principled and scalable framework which takes into account delay, reliability, packet size, network architecture and topology (across access, edge, and core), and decision-making under uncertainty is provided.
Abstract: Ensuring ultrareliable and low-latency communication (URLLC) for 5G wireless networks and beyond is of capital importance and is currently receiving tremendous attention in academia and industry. At its core, URLLC mandates a departure from expected utility-based network design approaches, in which relying on average quantities (e.g., average throughput, average delay, and average response time) is no longer an option but a necessity. Instead, a principled and scalable framework which takes into account delay, reliability, packet size, network architecture and topology (across access, edge, and core), and decision-making under uncertainty is sorely lacking. The overarching goal of this paper is a first step to filling this void. Towards this vision, after providing definitions of latency and reliability, we closely examine various enablers of URLLC and their inherent tradeoffs. Subsequently, we focus our attention on a wide variety of techniques and methodologies pertaining to the requirements of URLLC, as well as their applications through selected use cases. These results provide crisp insights for the design of low-latency and high-reliability wireless networks.
779 citations
18 Dec 2014
TL;DR: In this paper, the authors put forward a systematic view on URC in 5G wireless systems and analyzed the fundamental mechanisms that constitute a wireless connection and concluded that one of the key steps towards enabling URC is revision of the methods for encoding control information (metadata) and data.
Abstract: Wireless 5G systems will not only be “4G, but faster”. One of the novel features discussed in relation to 5G is Ultra-Reliable Communication (URC), an operation mode not present in today's wireless systems. URC refers to provision of certain level of communication service almost 100 % of the time. Example URC applications include reliable cloud connectivity, critical connections for industrial automation and reliable wireless coordination among vehicles. This paper puts forward a systematic view on URC in 5G wireless systems. It starts by analyzing the fundamental mechanisms that constitute a wireless connection and concludes that one of the key steps towards enabling URC is revision of the methods for encoding control information (metadata) and data. It introduces the key concept of Reliable Service Composition, where a service is designed to adapt its requirements to the level of reliability that can be attained. The problem of URC is analyzed across two different dimensions. The first dimension is the type of URC problem that is defined based on the time frame used to measure the reliability of the packet transmission. Two types of URC problems are identified: long-term URC (URC-L) and short-term URC (URC-S). The second dimension is represented by the type of reliability impairment that can affect the communication reliability in a given scenario. The main objective of this paper is to create the context for defining and solving the new engineering problems posed by URC in 5G.
315 citations
TL;DR: In this paper, the authors provide an overview of channel coding techniques for URLLC and compare them in terms of performance and complexity, identifying several important research directions and discussed in more detail.
Abstract: This article reviews state of the art channel coding techniques for URLLC. The stringent requirements of URLLC services, such as ultrahigh reliability and low latency, have made it the most challenging feature of 5G of mobile networks. The problem is even more challenging for services beyond the 5G promise, such as tele-surgery and factory automation, which require latencies less than 1ms and packet error rates as low as 10-9. This article provides an overview of channel coding techniques for URLLC and compares them in terms of performance and complexity. Several important research directions are identified and discussed in more detail.
293 citations