Zobrazeno 1 - 10
of 406
pro vyhledávání: '"Decoding complexity"'
Publikováno v:
IEEE Open Journal of the Communications Society, Vol 5, Pp 6329-6342 (2024)
Row-diagonal parity (RDP) code is a classical $(k+2,~k)$ systematic maximum distance separable (MDS) array code with $k \leq L-1$ under sub-packetization level $l = L-1$ , where L is a prime integer. When $k = L-1$ , its encoding requires $2-{}\frac
Externí odkaz:
https://doaj.org/article/2cdf76a2f3fd4b419b9ea11f23e02560
Publikováno v:
Alexandria Engineering Journal, Vol 73, Iss , Pp 1-10 (2023)
This paper presents the implementation of a low-complex iterative symbol-level decoding scheme for Reed-Solomon codes. Most soft-decision iterative decoders for Reed-Solomon codes work on a bit level due to the efficient passing of soft information d
Externí odkaz:
https://doaj.org/article/dc6493722b48432988df7375e134aeb9
Autor:
Xuebo Wang, Wai Ho Mow
Publikováno v:
IEEE Open Journal of the Communications Society, Vol 4, Pp 1839-1854 (2023)
Low-density lattice codes (LDLCs) achieve near-capacity performance on additive white Gaussian noise (AWGN) channels. The $M$ -Gaussian decoder is the state-of-the-art message passing decoder for LDLCs in terms of the error performance. However, this
Externí odkaz:
https://doaj.org/article/f4a3f326961a456c99ddddd6bb67f8b3
Autor:
Vishaka Basnayake, Dushantha Nalin K. Jayakody, Hakim Mabed, Ambrish Kumar, Tharindu D. Ponnimbaduge Perera
Publikováno v:
IEEE Access, Vol 11, Pp 6045-6059 (2023)
The complexity of successive interference cancellation at the receiver’s end is a challenging issue in conventional non-orthogonal multiple access assisted massive wireless networks. The computational complexity of decoding increases exponentially
Externí odkaz:
https://doaj.org/article/d993786934bd4842a2006755a41b8e41
Autor:
Yurii Khlaponin, Wafaa Adnan Sajid, Noor Baqir Hassan, Lway Faisal Abdulrazak, Ali Ibrahim Ahmed, Andrii Yashchuk
Publikováno v:
Proceedings of the XXth Conference of Open Innovations Association FRUCT, Vol 35, Iss 1, p 624 (2024)
Background: With significant improvements in communication systems, especially in the context of emerging smart cities, data dependability over noisy channels has become critical. Low-Density Parity-Check (LDPC) codes have gained popularity because t
Externí odkaz:
https://doaj.org/article/d516998af9f448108b8dff2ae304e9be
Publikováno v:
Digital Communications and Networks, Vol 8, Iss 3, Pp 359-372 (2022)
Binary Polar Codes (BPCs) have advantages of high-efficiency and capacity-achieving but suffer from large latency due to the Successive-Cancellation List (SCL) decoding. Non-Binary Polar Codes (NBPCs) have been investigated to obtain the performance
Externí odkaz:
https://doaj.org/article/6860222bebaf43d5a90e5f84b73f0342
Publikováno v:
IEEE Access, Vol 10, Pp 5378-5389 (2022)
The key computation in the min-sum decoding algorithm of a Low-Density Parity-Check (LDPC) is finding the first two minima and also the location of the first minimum among a set of messages passed from Variable Nodes (VNs) to Check Nodes (CNs) in a T
Externí odkaz:
https://doaj.org/article/1f558c18cb5e4759a7d219268ff72dd9
Publikováno v:
EURASIP Journal on Wireless Communications and Networking, Vol 2021, Iss 1, Pp 1-14 (2021)
Abstract Layered decoding (LD) facilitates a partially parallel architecture for performing belief propagation (BP) algorithm for decoding low-density parity-check (LDPC) codes. Such a schedule for LDPC codes has, in general, reduced implementation c
Externí odkaz:
https://doaj.org/article/2bd3bfc712904125b964c52288fa6f66
Autor:
Weijie Zhou, Hanxu Hou
Publikováno v:
Entropy, Vol 24, Iss 10, p 1499 (2022)
Blaum–Roth Codes are binary maximum distance separable (MDS) array codes over the binary quotient ring F2[x]/(Mp(x)), where Mp(x)=1+x+⋯+xp−1, and p is a prime number. Two existing all-erasure decoding methods for Blaum–Roth codes are the synd
Externí odkaz:
https://doaj.org/article/94ae3617225a4fd4a6e12281ccce17d8
Autor:
Osipov Dmitry, Titov Dmitry
Publikováno v:
Cybernetics and Information Technologies, Vol 18, Iss 5, Pp 77-86 (2018)
The following paper adapts the classical Zigangirov-Jelinek algorithm to the decoding of nonbinary block codes under severe mixed jamming. To ensure reliable communications in this scenario we combine reception techniques based on distribution free s
Externí odkaz:
https://doaj.org/article/a6b43d1c2d804e018d883e7ee9d07487