检索结果-内蒙古大学图书馆

M-Ary QAM Asynchronous-NOMA D2D Network With Cyclic Triangular-SIC decoding Scheme

IEEE ACCESS 2023年 11卷 6045-6059页

作者： Basnayake, Vishaka Jayakody, Dushantha Nalin K. Mabed, Hakim Kumar, Ambrish Perera, Tharindu D. Ponnimbaduge D. Sri Lanka Technol Campus Ctr Telecommun Res Sch Engn Padukka 10500 Sri Lanka Univ Bourgogne Franche Comte DISC FEMTO ST F-25200 Montbeliard France Univ Autonoma Lisboa Ctr Invest Tecnol Autonoma TechLab P-1169023 Lisbon Portugal

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 with the number of users. Further, under realistic channel conditions, a synchronous non-orthogonal multiple access scheme is impractical in the uplink device-to-device communications. In this paper, an asynchronous non-orthogonal multiple access-based cyclic triangular successive interference cancellation scheme is proposed for a massive device-to-device network. The proposed scheme reduces the decoding complexity, energy consumption, and bit error rate of a superimposed signal received in an outband device-to-device network. More specifically, the scheme follows three consecutive stages;optimization, decoding, and re- transmission. In the optimization stage, a dual Lagrangian objective function is defined to maximize the number of data symbols decoded at the receiver by determining an optimal interference cancellation triangle, under the co-channel interference and data rate constraints. In the decoding stage, the data in the optimal interference cancellation triangle is decoded using a conventional triangular successive interference cancellation technique. Next, the remaining users' data are decoded in sequential iterations of the proposed scheme, using the retransmissions from such users. Utilizing the successive interference cancellation characteristics, the performance of the proposed device-to-device network is defined in terms of energy efficiency, bit error rate, computational complexity, and decoding delay metrics. Moreover, the performance of the proposed decoding scheme is compared with the conventional triangular successive interference cancellation decoding scheme to demonstrate the superiority of the proposed scheme.

关键词： Symbols NOMA Device-to-device communication Interference cancellation decoding Interference Receivers Asynchronous non-orthogonal multiple access cyclic triangular successive interference cancellation device-to-device communication network decoding complexity energy consumption optimization reliability

来源：评论

学校读者我要写书评

暂无评论

Trellis-Based QC-LDPC Convolutional Codes Enabling Low Power Decoders

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2015年第6期63卷 1939-1951页

作者： Pisek, Eran Rajan, Dinesh Cleveland, Joseph R. So Methodist Univ Dept Elect Engn Dallas TX 75275 USA

In this paper, we propose a new type of code called Trellis-based Quasi-Cyclic (TQC)-LDPC convolutional code, which is a special case of protograph-based LDPC convolutional codes. The proposed TQC-LDPC convolutional code can be derived from any QC-LDPC block code by introducing trellis-based convolutional dependency to the code. The main advantage of the proposed TQC-LDPC convolutional code is that it allows reduced decoder complexity and input granularity (which is defined as the minimum number of input information bits the code requires to generate a codeword) while maintaining the same bit error-rate as the underlying QC-LDPC block code ensemble. We also propose two related power-efficient encoding methods to increase the code rate of the derived TQC-LDPC convolutional code. The newly derived short constraint length TQC-LDPC convolutional codes enable low complexity trellis-based decoders and one such decoder is proposed and described in this paper (namely, QC-Viterbi). The TQC-LDPC convolutional codes and the QC-Viterbi decoder are compared to conventional LDPC codes and Belief Propagation (BP) iterative decoders with respect to bit-error-rate (BER), signal-to-noise ratio (SNR), and decoder complexity. We show both numerically and through hardware implementation results that the proposed QC-Viterbi decoder outperforms the BP iterative decoders by at least 1 dB for same complexity and BER. Alternatively, the proposed QC-Viterbi decoder has 3 times lower complexity than the BP iterative decoder for the same SNR and BER. This low decoding complexity, low BER, and fine granularity makes it feasible for the proposed TQC-LDPC convolutional codes and associated trellis-based decoders to be efficiently implemented in high data rate, next generation mobile systems.

关键词： LDPC convolutional coding spatially-coupled LDPC decoding complexity WiGig Viterbi decoder

来源：评论

学校读者我要写书评

暂无评论

decoding performance analysis of good-channel relaxed polar codes with 3 x 3 kernel matrix

引用

IET COMMUNICATIONS 2019年第8期13卷 1131-1139页

作者： Cao, Yang Zhang, Han Tu, Qiaoling Chongqing Univ Technol Dept Elect & Elect Engn Chongqing 400054 Peoples R China

Relaxed polar codes are proposed to reduce the encoding and decoding complexity of polar codes. The original relaxed polar codes are based on 2 x 2 kernel matrices, but polar codes with 3 x 3 kernel matrices are expected to achieve better error performance. So, in this work, the authors extended relaxed polar codes to N = 3(n) case. Different from 2 x 2 kernel matrices, there are several choices for 3 x 3 kernel matrices. So, they classified 3 x 3 kernel matrices into three categories and derived transformation formulas of their Bhattacharyya parameters. Based on the formulas, they proved that the proposed relaxed polar codes had better error performance than the corresponding fully polarised codes when successive cancellation decoder was adopted. To estimate the complexity reduction, upper and lower bounds on complexity reduction of the proposed relaxed polar codes were provided. For the kernel selection, size relationship of complexity reduction of the proposed relaxed polar codes with different kernels were analysed. Results showed that relaxed polar codes with different matrices had their own characters and can be used in different channel and polarisation condition. Simulation results show that, with proper selection of matrices, the proposed relaxed polar codes can reduce more complexity and bring more coding gain.

关键词： channel coding decoding polar codes good-channel relaxed polar codes kernel matrix encoding complexity decoding complexity Bhattacharyya parameters

来源：评论

学校读者我要写书评

暂无评论

On the error exponent for woven convolutional codes with outer warp

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1999年第5期45卷 1649-1653页

作者： Zyablov, V Shavgulidze, S Skopintsev, O Höst, S Johannesson, R Univ Lund Dept Informat Technol Informat Theory Grp S-22100 Lund Sweden

In this correspondence the error exponent and the decoding complexity of binary woven convolutional codes with outer warp and with binary convolutional codes as outer and inner codes are studied. It is shown that an error probability that is exponentially decreasing with the product of the outer and inner code memories can be achieved with a nonexponentially increasing decoding complexity.

关键词： concatenated convolutional codes decoding complexity woven convolutional codes woven error exponents

来源：评论

学校读者我要写书评

暂无评论

A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1996年第6期42卷 1987-1991页

作者： Shen, BZ Tzeng, KK Wang, C LEHIGH UNIV DEPT ELECT ENGN & COMP SCI BETHLEHEM PA 18015 USA

A new bounded-distance (BD) decoding algorithm is presented for binary linear (n, k, d) block codes on additive white Gaussian noise channels, The algorithm is based on the generalized minimum distance (GMD) decoding algorithm of Forney using the acceptance criterion of Taipale and Pursley (GMD/TP), It is shown that the GMD/TP decoding algorithm is a BD decoding algorithm with effective error coefficient [GRAPHICS] It is also shown that the decision regions of GMD/TP are good inner approximations of those of full GMD decoding, and therefore full GMD decoding is BD and has an effective error coefficient that is well approximated by [GRAPHICS] Moreover, by adding a d-erasure-correction step to GMD decoding, the effective error coefficient can be reduced to A(d), the number of minimum-weight codewords, which is the same as the effective error coefficient of maximum-likelihood decoding, The decoding algorithm is mainly based on algebraic errors-and-erasures decoding and therefore has polynomial rather than exponential complexity.

关键词： bounded-distance decoding generalized minimum-distance decoding errors-and-erasures decoding effective error coefficient binary linear block codes decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Informed Fixed Scheduling for Faster Convergence of Shuffled Belief-Propagation decoding

引用

IEEE COMMUNICATIONS LETTERS 2017年第1期21卷 32-35页

作者： Aslam, Chaudhry Adnan Guan, Yong Liang Cai, Kui Han, Guojun Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore Singapore Univ Technol & Design Dept Sci Singapore 487372 Singapore Guangdong Univ Technol Guangzhou 510006 Guangdong Peoples R China

A novel informed fixed scheduling (IFS) scheme for shuffled belief-propagation (BP) decoding of binary low-density parity-check (LDPC) code is introduced to improve the BP decoding convergence. The IFS finds an appropriate order of variable nodes in accordance with the number of updated neighbors in the code graph, ensuring that the maximum number of latest message updates is utilized within a single iteration. This allows the utilization of most reliable message updates in a timely manner, leading to faster error-rate convergence. Simulation results show that the proposed IFS scheme improves the convergence speed of BP decoder by up to 20% for regular LDPC codes and 45% for irregular LDPC codes, without affecting the errorrate performance, at medium-to-high signal-to-noise ratio over binary-input additive white Gaussian noise channel.

关键词： LDPC codes scheduling scheme belief-propagation decoding convergence speed decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Low-complexity Detection Schemes for QOSTBC With Four-Transmit-Antenna

引用

IEEE COMMUNICATIONS LETTERS 2015年第6期19卷 1053-1056页

作者： Gao, Ming Zhang, Linlin Han, Chun-lei Ge, Jian-hua Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China Xian Res Inst Nav Technol Xian 710071 Peoples R China

In this letter, we propose two improved decoding algorithms based on traditional low-complexity maximum likelihood (LC-ML) detection algorithm for the quasi-orthogonal space-time block code (QOSTBC) with four-transmit-antennas. The decoding complexities of the proposed algorithms are both lower than LC-ML decoder. By decomposing the channel matrix and its elementary transformation form with QR decomposition, the first algorithm can detect the four signals independently at the cost of some BER performance penalty whereas the second algorithm achieves almost the same BER performance with LC-ML decoder by using the interference cancellation method twice.

关键词： Quasi-orthogonal space-time block code (QOSTBC) multiple-input multiple-output (MIMO) QR decomposition decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Using partial unit memory codes to improve distance properties of woven turbo codes

引用

ELECTRONICS LETTERS 2003年第22期39卷 1587-1588页

作者： Fagoonee, L Honary, B Univ Lancaster Dept Commun Syst Lancaster LA1 4YR England

Partial unit memory (PUM) codes are reputed for their excellent distance properties and lower decoding complexity compared to equivalent convolutional codes. Woven turbo codes (WTCs) are constructed, which outperform turbo codes, using component PUM codes. Simulation results confirm that WTCs based on PUM codes outperform those based on equivalent convolutional codes, as reflected by their respective minimum distances, which is also calculated.

关键词： turbo codes decoding partial unit memory codes distance properties woventurbo codes PUM decoding complexity minimum distances

来源：评论

学校读者我要写书评

暂无评论

Product coded modulation

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1997年第4期45卷 389-392页

作者： Rajpal, S Lin, S UNIV HAWAII MANOA DEPT ELECT ENGNHONOLULUHI 96822

This letter presents a technique of combining multilevel coded modulation and product coding to form product modulation codes which achieve low bit error rates with reduced decoding complexity, Three multistage decoding algorithms are presented, and good codes for both the additive white Gaussian noise (AWGN) and Rayleigh fading channels have been constructed.

关键词： .multistage columns Rayleigh fading channel decoding complexity modulation code squared Euclidean product modulation product codes

来源：评论

学校读者我要写书评

暂无评论

Symbol-level iterative information set decoding of RS codes

引用

ALEXANDRIA ENGINEERING JOURNAL 2023年 73卷 1-10页

作者： Genga, Yuval Oyerinde, Olutayo Versfeld, Jaco Univ Witwatersrand Sch Elect & Informat Engn Johannesburg South Africa Stellenbosch Univ Dept Elect & Elect Engn Matieland South Africa

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 due to the sparsity of the binary parity check matrix. These decoders yield a good error correction performance, but this comes at the cost of an increased computational complexity resulting from working at a bit-level. This study aims to lower the computational complexity of iterative decoding of Reed-Solomon codes by intro-ducing a high-performance soft-decision iterative Reed-Solomon decoder that works on a symbol -level, in contrast to the bit-level implementation used in most iterative Reed-Solomon decoders. The proposed algorithm utilises soft information to decode while applying information set decoding techniques to an extended parity check matrix. The use of the extended parity check matrix provides additional parity check equations which assist the algorithm in determining the correct information set of symbols used in the decoding process. For a given on;k thorn Reed-Solomon code, the algorithm converges to a valid codeword by correctly decoding a specified information set of k symbols from the received vector. Simulations run show the proposed algorithm performs favourably when com-pared to other symbol-level iterative decoders while working at a relatively lower complexity.(c) 2023 THE AUTHORS. Published by Elsevier BV on behalf of Faculty of Engineering, Alexandria University. This is an open access article under the CC BY-NC-ND license (http://***/ licenses/by-nc-nd/4.0/).

关键词： Reed Solomon codes Soft-input soft-output decoding Iterative decoding Message passing decoding Information set decoding decoding complexity

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：