检索结果-南通市图书馆

coded modulation Faster-than-Nyquist Transmission with Precoder and Channel Shortening Optimization

China Communications 2021年第2期18卷 49-64页

作者： Hui Che Yong Bai School of Information and Communication Engineering Beijing University of Posts and TelecommunicationsBeijing 100876China School of Information and Communication Engineering Hainan UniversityHaikou 570228China

Faster-than-Nyquist(FTN)signaling can improve the spectrum efficiency(SE)of the transmission *** this paper,we propose a coded modulation FTN(CM-FTN)transmission scheme with precoder and channel shortening(CS)optimization to improve bit error rate(BER)performance and reduce the complexity of FTN *** our proposal,the information rate(IR)or spectral efficiency(SE)is employed and verified as a better performance metric for CM-FTN than the minimum Euclidian distance(MED).The precoder of CM-FTN is optimized for maximizing the IR criterion using the bare-bones particle swarm optimization(BB-PSO)***,a three-carrier CM-FTN system model is used to capture the broadening effect of *** targeting for the IR maximization,the inter-symbol interference(ISI)length for CS is optimized to reduce the receiver complexity without performance *** results demonstrate that our method has a 0.6dB precoding gain compared with the nonprecoding scheme and a maximum of 87.5%of the complexity of FTN equalizer is reduced without BER loss.

关键词： faster-than-Nyquist coded modulation information rate minimum Euclidian distance precoder channel shortening

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Forced-convergence decoding for LDPC-coded modulation

引用

Science China(Information Sciences) 2013年第1期56卷 147-157页

作者： DAI LiYun YANG HongWen FAN JianXiao RAO WenYuan School of Software and Communication Engineering Jiangxi University of Finance and Economics School of Information and Communication Engineering Beijing University of Posts and Telecommunications

Low-density parity-check(LDPC)-coded modulation has attracted much attention for its outstanding performance in a bandwidth-limited ***,it involves relatively high decoding *** to different convergence behaviors of variable nodes,the nodes detected early can be deleted from the Tanner graph,which reduces the size of the parity-check matrix iteration by iteration and thus the decoding *** this paper,we propose a new decoding algorithm for LDPC-coded modulation with reduced *** addition,by deleting the converged bits from the modulation constellation and updating the bit metrics of the demapper with the reduced constellation,more accurate estimation of the bits can be *** results show that,compared with conventional decoding schemes,the proposed method not only greatly reduces the overall decoding complexity for LDPC-coded modulation but also significantly improves decoding performance.

关键词： forced-convergence low-density parity-check code coded modulation belief propagation decoding

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Block Markov Superposition Transmission with Color Shift Keying

引用

Chinese Journal of Electronics 2018年第5期27卷 1080-1084页

作者： ZENG Huicong LIN Nina MA Xiao School of Electronics and Information Technology Sun Yat-sen University School of Data and Computer Science Sun Yat-sen University

Color shift keying(CSK) is the only Multiple-input multiple-output(MIMO) modulation scheme supported by IEEE 802.15.7 standard. It modulates the intensity of visible lights emitted by colored Lightemitting-diodes(LEDs) for data transmission. We discuss different demodulation criteria for CSK in either signal space or color space, and compare their Bit-error rate(BER) performance. In order to improve the performance of CSK, we present a coded CSK modulation scheme,which is based on the recently proposed coding scheme called Block Markov superposition transmission(BMST).For comparison, we consider Reed-Solomon(RS) code together with CSK(referred as RS-CSK), which is exploited in PHY III operation mode in IEEE 802.15.7 standard. The mutual information of CSK is also given for performance analysis. Simulation results show that the proposed scheme achieves a significant gain compared with the RS-CSK.

关键词： Block Markov superposition transmission(BMST) coded modulation Color shift keying(CSK) Reed-Solomon code Visible light communication

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

New bounds on the mutual information for discrete constellations and application to wireless channel estimation

引用

Digital Communications and Networks 2020年第4期6卷 542-546页

作者： A.Taufiq Asyhari School of Computing and Digital Technology Birmingham City UniversityMillennium PointBirminghamB47XGUK

The lack of closed-form expressions of the mutual information for discrete constellations has limited its uses for analyzing reliable communication over wireless fading *** order to address this issue,this paper proposes analytically-tractable lower bounds on the mutual information based on Arithmetic-Mean-Geometric-Mean(AMGM)*** new bounds can apply to a wide range of discrete constellations and reveal some insights into the rate behavior at moderate to high Signal-to-Noise Ratio(SNR)*** usability of the bounds is further demonstrated to approximate the optimum pilot overhead in stationary fading channels.

关键词： Channel estimation coded modulation Discrete constellations Mutual information Wireless communications

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：