CORC  > 北京大学  > 信息科学技术学院
Low-Complexity LS Algorithm Using Coordinate Transformation
Yan Wen ; Xie Yizhuang ; Zhu Bocheng ; Chen He ; Ma Cuimei
刊名CHINESE JOURNAL OF ELECTRONICS
2017
关键词Least squares (LS) fitting Reference coordinate Coordinate transformation Low computational complexity
DOI10.1049/cje.2016.10.021
英文摘要To reduce the computational complexity, decrease hardware resource consumption, and make it practicable, we propose a novel coordinate transformation based low-complexity Least squares (LS) algorithm. The positive integral variable is set as a reference coordinate and coefficients are transformed to be constant. The fitting polynomial in the reference coordinate system can be easily realized with lower complexity. To achieve the fitting curve in the original coordinate system, coordinate transformation is needed. Compared with the conventional LS fitting, our implementation results show that the proposed LS fitting algorithm can greatly reduce hardware resources in the premise of meeting the precision requirements.; National Natural Science Foundation of China [61171194]; SCI(E); 中国科学引文数据库(CSCD); ARTICLE; 1; 156-159; 26
语种英语
内容类型期刊论文
源URL[http://ir.pku.edu.cn/handle/20.500.11897/476466]  
专题信息科学技术学院
推荐引用方式
GB/T 7714
Yan Wen,Xie Yizhuang,Zhu Bocheng,et al. Low-Complexity LS Algorithm Using Coordinate Transformation[J]. CHINESE JOURNAL OF ELECTRONICS,2017.
APA Yan Wen,Xie Yizhuang,Zhu Bocheng,Chen He,&Ma Cuimei.(2017).Low-Complexity LS Algorithm Using Coordinate Transformation.CHINESE JOURNAL OF ELECTRONICS.
MLA Yan Wen,et al."Low-Complexity LS Algorithm Using Coordinate Transformation".CHINESE JOURNAL OF ELECTRONICS (2017).
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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


©版权所有 ©2017 CSpace - Powered by CSpace