Channel Coding Techniques for Next-Generation Communication Systems: Chances and Challenges

A special issue of Electronics (ISSN 2079-9292). This special issue belongs to the section "Networks".

Deadline for manuscript submissions: closed (15 May 2022) | Viewed by 4723

Special Issue Editors


E-Mail Website
Guest Editor
Department of Engineering and Architecture, Università degli Studi di Trieste, Trieste, Italy
Interests: channel coding; decoding; antenna radiation patterns; wireless channels; 5G mobile communications

E-Mail Website
Guest Editor
Department of Electronics and Telecommunications (DET), Torino, Italy
Interests: parity check codes; space communication links; 5G mobile communication; iterative decoding; radio receivers; Internet of Things; Reed-Solomon codes; adders; array signal processing; cellular communication

E-Mail Website
Guest Editor
Institute of Communication and Navigation, German Aerospace Center (DLR), 82234 Wessling, Germany
Interests: codes on graphs; low-density parity-check codes; polar codes; coding for wireless communications; coding for optical links
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues, 

Channel coding techniques are extensively used in modern communication systems to enhance the bandwidth spectral efficiency and the robustness of information transmission. Modern channel codes have interested academic researchers and industries since turbo codes were discovered in 1993. These have been applied in the 4G cellular mobile systems and, at present, low density parity check (LDPC) codes and polar codes are being endorsed for the 5G standard.

In the current age, widely defined as the age of the Internet of Things (IoT), everything will be linked through communication connections. It is widely expected, as well, that next-generation communication systems will be involved in many scenarios such as wireless communications, optical communications, sensor networks, and distributed storage systems. These scenarios will urge new requisites to the communication systems going from lower complexity and lower latency encoder/decoder schemes, and very reliable capacity approaching coding schemes to lower energy consuming channel coding techniques. Not only may communication systems be considered as possible application scenarios, but also other environments may be taken into account, such as the emerging applications of channel codes to security, flash memories, and deep-space probing.

Dr. Francesca Vatta
Dr. Roberto Garello
Dr. Gianluigi Liva
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Electronics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • LDPC Codes
  • Polar Codes
  • Coded Modulation
  • Massive MIMO Systems
  • Quasi-Cyclic Codes
  • Rate-Compatible Codes
  • Parallel and Serial Concatenated Codes
  • CRC Codes
  • Iterative Decoding Algorithms
  • 5G Standard

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

18 pages, 713 KiB  
Article
Parity-Check-CRC Concatenated Polar Codes SSCFlip Decoder
by Qasim Jan, Shahid Hussain, Muhammad Furqan, Zhiwen Pan, Nan Liu and Xiaohu You
Electronics 2022, 11(23), 3839; https://doi.org/10.3390/electronics11233839 - 22 Nov 2022
Cited by 1 | Viewed by 1459
Abstract
Successive cancellation flip decoding requires a large number of extra successive cancellation decoding attempts at low signal-to-noise ratios (SNRs), resulting in high decoding complexity. In addition, it has a long decoding latency. Although modifications have been proposed in successive cancellation flip decoding, these [...] Read more.
Successive cancellation flip decoding requires a large number of extra successive cancellation decoding attempts at low signal-to-noise ratios (SNRs), resulting in high decoding complexity. In addition, it has a long decoding latency. Although modifications have been proposed in successive cancellation flip decoding, these still have high computational complexity at low SNRs due to a huge number of additional successive cancellation decoding attempts. It is desirable to detect the unsuccessful successive cancellation decoding process at an early stage in the additional successive cancellation flip attempts and stop it that can reduce the decoding complexity. This paper combines the parity-check-CRC concatenated polar codes with the low-latency simplified successive cancellation decoding and proposes a parity-check-CRC concatenated polar codes simplified successive cancellation flip (PC-CRC-SSCFlip) decoder. It further employs the parity-check vector to identify the unsuccessful simplified successive cancellation flip decoding at an early stage and terminates so that it can minimize the decoding complexity on average. Additionally, this work proposes an error-prone flipping list by incorporating the empirically observed indices based on channel-induced error distribution along with the first bit of each Rate-1 node. The proposed technique can identify more than one error-prone bit through a flipping list and correct them. In addition, the parity-check vector further narrows down the search space for the identification of erroneous decisions. Simulation results show that 60% of unsuccessful additional successive cancellation decoding attempts terminate early rather than decode the whole codeword. The proposed PC-CRC-SSCFlip decoder has approximately 0.7 dB and 0.3 dB gains over successive cancellation and successive cancellation flip decoders, respectively, at a fixed block error rate (BLER) = 103. Additionally, it reduces the average computational complexity and decoding latency of the successive cancellation flip decoder at low-to-medium SNRs while approaching successive cancellation decoding complexity at medium-to-high SNRs. Full article
Show Figures

Figure 1

15 pages, 823 KiB  
Article
Memory-Based LT Codes for Efficient 5G Networks and Beyond
by Khaled F. Hayajneh
Electronics 2021, 10(24), 3169; https://doi.org/10.3390/electronics10243169 - 20 Dec 2021
Cited by 1 | Viewed by 1749
Abstract
The next-generation networks (5G and beyond) require robust channel codes to support their high specifications, such as low latency, low complexity, significant coding gain, and flexibility. In this paper, we propose using a fountain code as a promising solution to 5G and 6G [...] Read more.
The next-generation networks (5G and beyond) require robust channel codes to support their high specifications, such as low latency, low complexity, significant coding gain, and flexibility. In this paper, we propose using a fountain code as a promising solution to 5G and 6G networks, and then we propose using a modified version of the fountain codes (Luby transform codes) over a network topology (Y-network) that is relevant in the context of the 5G networks. In such a network, the user can be connected to two different cells at the same time. In addition, the paper presents the necessary techniques for analyzing the system and shows that the proposed scheme enhances the system performance in terms of decoding success probability, error probability, and code rate (or overhead). Furthermore, the analyses in this paper allow us to quantify the trade-off between overhead, on the one hand, and the decoding success probability and error probability, on the other hand. Finally, based on the analytical approach and numerical results, our simulation results demonstrate that the proposed scheme achieves better performance than the regular LT codes and the other schemes in the literature. Full article
Show Figures

Figure 1

Back to TopTop