Low-Complexity LS Algorithm Using Coordinate Transformation

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...

Full description

Saved in:
Bibliographic Details
Published in:Chinese Journal of Electronics 2017-01, Vol.26 (1), p.156-159
Main Authors: Yan, Wen, Xie, Yizhuang, Zhu, Bocheng, Chen, He, Ma, Cuimei
Format: Article
Language:English
Subjects:
computational complexity
Coordinate transformation
curve fitting
fitting polynomial
hardware resource consumption
Least squares (LS) fitting
least squares approximations
Low computational complexity
low‐complexity least squares algorithm
low‐complexity LS algorithm
LS算法
positive integral variable
Reference coordinate
reference coordinate system
低复杂度
参考坐标系
坐标变换
拟合多项式
硬件资源
计算复杂度
资源消耗
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1022-4653
2075-5597
DOI:10.1049/cje.2016.10.021