Results 51 to 60 of about 256 (160)
IET Signal Processing, Volume 2024, Issue 1, 2024.This paper investigates a backscatter communication (BackCom) based non‐orthogonal multiple access (NOMA) system in a multiple‐input and single‐output (MISO) scenario, where two decoding methods are deployed, including the sum‐capacity approach and QR decomposition.
Dingjia Lin +4 more
wiley +1 more source
A cyclic‐shift based method for counting cycles of quasi‐cyclic LDPC codes
Electronics Letters, Volume 60, Issue 2, January 2024.This paper presents some new necessary and sufficient conditions for the existence of cycles with arbitrary lengths and proposes a simple and novel method for counting cycles of QC‐LDPC codes based on the improved condition. Compared with the existing methods, the presented method is effective and feasible and can enumerate cycles of QC‐LDPC codes in a
Hengzhou Xu +5 more
wiley +1 more source
A construction of the high-rate regular quasi-cyclic LDPC codes
EURASIP Journal on Wireless Communications and Networking, 2019 In this paper, a scheme to construct the high-rate regular quasi-cyclic low-density parity-check (QC-LDPC) codes is developed based on the finite geometry low-density parity-check (LDPC) codes.
Qi Meng +3 more
doaj +1 more source
Counting short cycles of QC‐LDPC codes in base graph
Electronics Letters, Volume 60, Issue 2, January 2024.Here, a method for using the base matrix to count the number of short cycles of quasi‐cyclic low‐density parity‐check codes is proposed. The time complexity of the proposed algorithm is not directly related to the length of the codes, but only to the number of edges in the base graph. Moreover, as the lifting degree of the codes increases, the proposed
Liqian Wang +3 more
wiley +1 more source
Girth-Eight Reed-Solomon Based QC-LDPC Codes [PDF]
2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC), 2018 This paper presents a class of regular quasi-cyclic (QC) LDPC codes whose Tanner graphs have girth at least eight. These codes are constructed based on the conventional parity-check matrices of Reed-Solomon (RS) codes with minimum distance 5. Masking their parity-check matrices significantly reduces the numbers of short cycles in their Tanner graphs ...
Xin Xiao +4 more
openaire +1 more source
Novel construction of QC-LDPC codes with modified 2-D GRS codes
Tongxin xuebao, 2015 The construction method for QC-LDPC (quasi-cyclic low density parity-check) code with modified two-dimensional generalized reed-solomon (2-D GRS) code is proposed using the generator polynomial of GRS code,so thus the constructed code can have better ...
Ming ZHAO, Xiao-lin ZHANG
doaj +2 more sources
High Throughput Priority-Based Layered QC-LDPC Decoder with Double Update Queues for Mitigating Pipeline Conflicts. [PDF]
Sensors (Basel), 2022 Li Y +5 more
europepmc +1 more source
Joint Semi-Blind Self-Interference Cancellation and Equalisation Processes in 5G QC-LDPC-Encoded Short-Packet Full-Duplex Transmissions. [PDF]
Sensors (Basel), 2022 Vuong BQ +5 more
europepmc +1 more source
Guangtongxin yanjiu, 2012 为提高100Gbit/s光通信系统的传输距离,构造了高增益的NB-QC-LDPC（非二进制准循环低密度校验码）,这种纠错码构建在伽罗华域上,适合于采用QPSK（正交相移键控）或DQPSK（差分正交相移键控）调制格式的100Gbit/s系统。文章采用对数傅里叶和积译码算法分析了NB-QC-LDPC的误码性能。结果表明,与二进制准循环低密度校验码相比,码长为500、码率为0.8的NB-QC-LDPC,在误码率为10-8时可提供约1dB的编码增益。同样,在误码率为10-8时,若码率从0.9降低至0.8,NB ...
林智强, 张建勇
doaj