Two Distributed Arithmetic Based High Throughput Architectures of Non-Pipelined LMS Adaptive Filters

Distributed arithmetic (DA) is an efficient look-up table (LUT) based approach. The throughput of DA based implementation is limited by the LUT size. This paper presents two high-throughput architectures (Type I and II) of non-pipelined DA based least-mean-square (LMS) adaptive filters (ADFs) using two&#x2019;s complement (TC) and offset-binary coding (OBC) respectively. We formulate the LMS algorithm using the steepest descent approach with possible extension to its power-normalized LMS version and followed by its convergence properties. The coefficient update equation of LMS algorithm is then transformed via TC DA and OBC DA to design and develop non-pipelined architectures of ADFs. The proposed structures employ the LUT pre-decomposition technique to increase the throughput performance. It enables the same mapping scheme for concurrent update of the decomposed LUTs. An efficient fixed-point quantization model for the evaluation of proposed structures from a realistic point-of-view is also presented. It is found that Type II structure provides higher throughput than Type I structure at the expense of slow convergence rate with almost the same steady-state mean square error. Unlike existing non-pipelined LMS ADFs, the proposed structures offer very high throughput performance, especially with large order DA base units. Furthermore, they are capable of performing less number of additions in every filter cycle. Based on the simulation results, it is found that <inline-formula> <tex-math notation="LaTeX">$256^{\mathrm {th}}$ </tex-math></inline-formula> order filter with <inline-formula> <tex-math notation="LaTeX">$8^{\mathrm {th}}$ </tex-math></inline-formula> order DA base unit using Type I structure provides <inline-formula> <tex-math notation="LaTeX">$9.41 \times $ </tex-math></inline-formula> higher throughput while Type II structure provides <inline-formula> <tex-math notation="LaTeX">$16.68 \times $ </tex-math></inline-formula> higher throughput as compared to the best existing design. Synthesis results show that <inline-formula> <tex-math notation="LaTeX">$32^{\mathrm {nd}}$ </tex-math></inline-formula> order filter with <inline-formula> <tex-math notation="LaTeX">$8^{\mathrm {th}}$ </tex-math></inline-formula> order DA base unit using Type I structure achieves 38.76&#x0025; less minimum sampling period (MSP), occupies 28.62&#x0025; more area, consumes 67.18&#x0025; more power, utilizes 49.06&#x0025; more slice LUTs and 3.31&#x0025; more flip-flops (FFs), whereas Type II structure achieves 51.25&#x0025; less MSP, occupies 21.42&#x0025; more area, consumes 47.84&#x0025; more power, utilizes 29.10&#x0025; more slice LUTs and 1.47&#x0025; fewer FFs as compared to the best existing design.

Abstract licence: CC BY-NC-ND

42 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.