LDPC Decoding With Low Complexity for OFDM Index Modulation
نویسندگان
چکیده
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملJoint Coded-Precoded OFDM with Low-Complexity Turbo-decoding
We combine error-control coding with linear precoding for flat-fading channels, as well as for wireless OFDM transmissions through frequency-selective fading channels. The performance is analyzed and compared with the standard coded system without precoding. By wedding linear precoding with conventional error-control coding, the diversity order becomes equal to the error-control code’s minimum ...
متن کاملLow-complexity High-speed Quasi-cyclic Ldpc Coded Modulation in Ofdm Wireless Communication System
This paper investigates a Low-Density Parity-Check (LDPC) coded rthogonal Frequency-Division Multiplexing (OFDM) wireless communication system based on IEEE 802.11a standard. This paper studies low-complexity high speed decoder architectures for quasi-cyclic low density parity check (QC-LDPC) codes. Algorithmic transformation and architectural level optimization are incorporated to reduce the c...
متن کاملLow complexity decoding of finite geometry LDPC codes
We develop a new low complexity algorithm for decoding low-density parity-check (LDPC) codes. The developments are oriented specifically toward the low cost -yet effectivedecoding of (high rate) finite geometry LDPC codes. The decoding procedure updates the hard-decision received vector iteratively in search of a valid codeword in the vector space. Only one bit is changed in each iteration and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: 2169-3536
DOI: 10.1109/access.2021.3077256