检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:LIU Ye TONG Zhengrong ZHANG Weihua LI Tingting WANG Mingxu 刘叶;童峥嵘;张卫华;李婷婷;王明旭(Tianjin Key Laboratory of Film Electronic and Communication Devices,Engineering Research Center of Optoelectronic Devices and Communication Technology,Ministry of Education,School of Electrical and Electronic Engineering,Tianjin University of Technology,Tianjin 300384,China)
出 处:《Optoelectronics Letters》2021年第9期534-538,共5页光电子快报(英文版)
基 金:supported by the Natural Science Foundation of Tianjin(No.18JCYBJC86300)。
摘 要:In this paper,a hybrid technique using fast Hadamard transformation cascading a selective mapping(FHT-SLM)is proposed to reduce peak-to-average power ratio(PAPR)and complexity in coherent optical orthogonal frequency division multiplexing(CO-OFDM)system.The Hadamard transform is used to reduce the autocorrelation of signals so as to reduce the PAPR of signals.The fast Hadamard transform(FHT)algorithm is obtained by recursive decomposition of sparse matrix of a simple Hadamard matrix,which improves the computational efficiency and greatly reduces the computational complexity.Then,a selective mapping(SLM)scheme is used to select the smallest frame of PAPR in the time domain to further reduce PAPR of OFDM system.The simulation results show that at the complementary cumulative distribution function(CCDF)of10-4,the PAPR of the proposed scheme FHT-SLM(V=8)is optimized to 7.63 d B.Meanwhile,when the bit error rate(BER)is 10-3,the optical signals to noise ratio(OSNR)of FHT-SLM(V=8)algorithm is 21.2 d B.The total computational cost of the FHT-SLM(V=8)is 28672.Consequently,the simulation results prove that the proposed algorithm provides a choice for a balance among PAPR,BER and complexity.
关 键 词:HADAMARD algorithm AUTOCORRELATION
分 类 号:TN929.53[电子电信—通信与信息系统] TP18[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.185