Low Computational Complexity and High Computational Speed in Leading DCD ERLS Algorithm

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

ABDI FATEMEH; AMIRI PARVIZ; REFAN MOHAMMAD HOSSEIN

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING INNOVATIONS Year:2019 | Volume:7 | Issue:1 Page(s): 19-26

Download Full-Text

View:

184

Download:

Cites:

Information Journal Paper

Title

Low Computational Complexity and High Computational Speed in Leading DCD ERLS Algorithm

Author(s)

ABDI FATEMEH | AMIRI PARVIZ | REFAN MOHAMMAD HOSSEIN | Issue Writer Certificate

Keywords

Exponentially weighted Recursive least squares (ERLS)

Dichotomous coordinate descent (DCD)

Variable forgetting factor (VFF)

Field-programmable gate array (FPGA)

Abstract

Adaptive algorithm adjusts the system coefficients based on the measured data. This paper presents a dichotomous coordinate descent method to reduce the computational complexity and to improve the tracking ability based on the variable forgetting factor. Vedic mathematics is used to implement the multiplier and the divider operations in the VFF equations. The proposed method decreases the area and increases the computation speed. The linear exponentially weighted recursive least squares as the main algorithm is implemented in many applications such as the adaptive controller, the system identification, active noise cancellation techniques, and etc. The DCD method calculates the inverse matrix in the ERLS algorithm and decreases the resources used in the field-programmable gate array, also the designer can use the cheaper FPGA board to implement the adaptive algorithm because the method doesn't need lots of resources. The proposed method leads to implementing complex algorithms with simple structures and high technology. The proposed method is implemented with ISE software on the Spartan 6 Xilinx board. The proposed algorithm calculates the multiplication result with less than 15ns time and reduces the used FPGA resources to lower than 20% as compared with the classic RLS.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

ABDI, FATEMEH, AMIRI, PARVIZ, & REFAN, MOHAMMAD HOSSEIN. (2019). Low Computational Complexity and High Computational Speed in Leading DCD ERLS Algorithm. JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING INNOVATIONS, 7(1), 19-26. SID. https://sid.ir/paper/756187/en

Vancouver: Copy

ABDI FATEMEH, AMIRI PARVIZ, REFAN MOHAMMAD HOSSEIN. Low Computational Complexity and High Computational Speed in Leading DCD ERLS Algorithm. JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING INNOVATIONS[Internet]. 2019;7(1):19-26. Available from: https://sid.ir/paper/756187/en

IEEE: Copy

FATEMEH ABDI, PARVIZ AMIRI, and MOHAMMAD HOSSEIN REFAN, “Low Computational Complexity and High Computational Speed in Leading DCD ERLS Algorithm,” JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING INNOVATIONS, vol. 7, no. 1, pp. 19–26, 2019, [Online]. Available: https://sid.ir/paper/756187/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops