Low Complexity and High speed in Leading DCD ERLS Algorithm

Authors

Abstract:

Adaptive algorithms lead to adjust 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 when there are a lot of changes in the system. Vedic mathematics is used to implement the multiplier and the divider in the VFF equations, to improve the area and to increase the computational speed. The linear Exponentially Weighted Recursive Least Squares as the main algorithm in the system can be implemented in 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 used resources in a field-programmable gate array, also the designer can use the cheaper FPGA board to implement the adaptive algorithm because the design doesn't need high resources. The proposed method leads to implement complex algorithms with simple structures and high technology. This method is implemented with ISE software on the Spartan 6 Xilinx board. The proposed algorithm calculates the result multiplication with less than 15ns and reduces the used FPGA resources to lower than 20% compared to the classic RLS.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

full text

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

full text

Novel Implementation of LMS Adaptive Algorithm for High Speed and Low Complexity

This paper presents the least-mean-square (LMS) adaptive filter for deriving its Architectures for high-speed and low complexity implementation. It is shown that the direct-form LMS adaptive filter has nearly the same critical path as its transpose-form counterpart, but provides much faster convergence and lower register complexity. From the critical-path evaluation, it is further shown that no...

full text

Low-complexity widely linear RLS filter using DCD iterations

Resumo— Recentemente, filtros adaptativos amplamente lineares estão sendo usados para acessar completamente estatı́sticas de segunda ordem de sinais impróprios, com o objetivo de melhorar a estimação. Essa caracterı́stica torna esses filtros vantajosos em relação aos seus equivalentes estritamente lineares, apesar de apresentarem maior complexidade computacional. Nesse sentido, com o intuito de r...

full text

High speed and Low space complexity FPGA based ECC processor

Elliptic Curve Cryptography is one of the most interested research topic in VLSI. Network security is becoming more and more crucial as the volume of data being exchanged on the Internet increases. ECC offers high security for networking and communication. FPGA based architecture for elliptic curve cryptography coprocessor ,which has promising performance in terms of both Space Complexity and T...

full text

High-Speed and Low-Power Flash ADCs Encoder

This paper presents a high-speed, low-power and low area encoder for implementation of flash ADCs. Key technique for design of this encoder is performed by convert the conventional 1-of-N thermometer code to 2-of-M codes (M = ¾ N). The proposed encoder is composed from two-stage; in the first stage, thermometer code are converted to 2-of-M codes by used 2-input AND and 4-i...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 7  issue 1

pages  3- 3

publication date 2019-01-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023