中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A phase estimation algorithm for optical linear sampling

文献类型:期刊论文

作者Li, Fei-Tao1,2; Zhao, Wei1; Liu, Yuan-Shan1
刊名guangzi xuebao/acta photonica sinica
出版日期2016-08-01
卷号45期号:8
关键词Digital signal processing Modulation Optical communication Phase noise Quadrature amplitude modulation Signal processing Signal sampling
ISSN号10044213
其他题名一种用于光线性采样的载波相位估计算法
产权排序1
通讯作者liu, yuan-shan (yuanshanliu@yahoo.com)
英文摘要an improved blind phase search algorithm was proposed. in this algorithm, carrier phase noise was estimated by searching minimum euler distance twice. to verify this algorithm, an optical linear sampling simulation system was set up. the constellation diagram of 10gbaud/s 16qam signal was simulated by using an optical frequency comb with pulse width of 500fs and duration of 10ns as optical sampling source. the simulation result shows that, the phase noise between the signal source and optical sampling source can be compensated effectively by this algorithm when the sum linewidth of the two lasers is less than 10mhz. finally, the constellation diagram of 10gbaud/s 16qam signal is displayed clearly. © 2016, science press. all right reserved.
收录类别EI
语种英语
源URL[http://ir.opt.ac.cn/handle/181661/28285]  
专题西安光学精密机械研究所_瞬态光学技术国家重点实验室
作者单位1.State Key Laboratory of Transient Optics and Photonics, Xi'an Institute of Optics and Precision Mechanics, Chinademy of Sciences, Xi'an; 710119, China
2.University of Chinese Academy of Sciences, Beijing; 100039, China
推荐引用方式
GB/T 7714
Li, Fei-Tao,Zhao, Wei,Liu, Yuan-Shan. A phase estimation algorithm for optical linear sampling[J]. guangzi xuebao/acta photonica sinica,2016,45(8).
APA Li, Fei-Tao,Zhao, Wei,&Liu, Yuan-Shan.(2016).A phase estimation algorithm for optical linear sampling.guangzi xuebao/acta photonica sinica,45(8).
MLA Li, Fei-Tao,et al."A phase estimation algorithm for optical linear sampling".guangzi xuebao/acta photonica sinica 45.8(2016).

入库方式: OAI收割

来源:西安光学精密机械研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。