The log-log LMS algorithm

Mahant-Shetti, S.S.; Hosur, S.; Gatherer, Alan

doi:10.1109/icassp.1997.599526

Cited by 18 publications

(9 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To improve the convergence speed while at the same time keep the complexity at a reasonable level, the idea of the log-log LMS algorithm [4] is adopted. The updating equation of the log-log LMS algorithm is given by…”

Section: Gspt-as Lms Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Low-complexity adaptive algorithms for pre-distortion of power amplifiers

Chen

Chiueh

2005

2005 IEEE International Symposium on Circuits and Systems (ISCAS)

View full text Add to dashboard Cite

Abstract-Adaptive systems have been broadly used in a wide range of applications and can be categorized into linear or nonlinear adaptive systems. Unfortunately, hardware complexity for implementing adaptive systems is usually high. In this paper, a low-complexity LMS algorithm based on a new number system is proposed and applied to multilayer perceptron (MLP). Simulation results show that the proposed adaptive algorithm, with its much lower complexity, can still achieve comparable performance to traditional adaptive algorithms.

show abstract

Section: Gspt-as Lms Algorithmmentioning

confidence: 99%

“…As a result, the complexity of the network is reduced since fewer digits need processing in a multiplication operation. Then, we propose an adaptive algorithm for MLPs with GSPT weights and it operates like the log-log LMS algorithm [4], yet with a variable step-size and a simple updating mechanism.…”

Section: Introductionmentioning

confidence: 99%

Low-complexity adaptive algorithms for pre-distortion of power amplifiers

Chen

Chiueh

2005

2005 IEEE International Symposium on Circuits and Systems (ISCAS)

View full text Add to dashboard Cite

show abstract

“…A power-of-two quantizer is used for the equalizer output error, and a hard limiter for the receiving data to reduce the multiplication to a simple shift. Such an approach, here called the log-log LMS algorithm, is presented in [12], where the authors proposed only a fast adaptation algorithm, while the filtering section is unchanged and the filter coefficients are represented as floating-point. On the contrary, to assure a high filter-throughput rate, we also need a fast filtering section to avoid a cumbersome hardware multiplier.…”

Section: Introductionmentioning

confidence: 99%

Power-of-two adaptive filters using tabu search

Traferro

Uncini

2000

IEEE Trans. Circuits Syst. II

View full text Add to dashboard Cite

Digital filters with power-of-two or a sum of power-of-two coefficients can be built using simple and fast shift registers instead of slower floating-point multipliers, such a strategy can reduce both the VLSI silicon area and the computational time. Due to the quantization and the nonuniform distribution of the coefficients through their domain, in the case of adaptive filters, classical steepest descent based approaches cannot be successfully applied. Methods for adaptation processes, as in the least mean squares (LMS) error and other related adaptation algorithms, can actually lose their convergence properties. In this brief, we present a customized Tabu Search (TS) adaptive algorithm that works directly on the power-of-two filter coefficients domain, avoiding any rounding process. In particular, we propose TS for a time varying environment, suitable for real time adaptive signal processing. Several experimental results demonstrate the effectiveness of the proposed method.Index Terms-Adaptive digital filter, finite precision design of adaptive digital filter, finite wordlength, global optimization, signed digit code, signed power-of-two, tabu search.

show abstract

“…By employing such representations, multiplications required for the filtering process can be replaced by simple shift and addhubtract operations and the implementation complexity of the feedforward filter can be reduced. To reduce the implementation complexity of the updating part, several adaptive algorithms such as sign-sign, sign-error, sign-data, and log-log LMS algorithms have been proposed [4]. In addition, by utilizing these techniques, several multiplierless adaptive equalizers have been implemented [5, 61.…”

Section: Introductionmentioning

confidence: 99%

Algorithm and architecture design for a low-complexity adaptive equalizer

Chen¹,

Chen²,

Chiueh³

2003

2003 IEEE International Symposium on Circuits and Systems (ISCAS)

View full text Add to dashboard Cite

As the need for multimedia communication continues to surge, consumers demand higher and higher transmission data rate. To circumvent the channel impairment caused by multipath fading, more and more receivers resort to adaptive equalizers. However, the complexity of time-domain adaptive equalizers can be too high for some specific applications. In this paper, a novel adaptive algorithm and its low-complexity architecture are proposed. This algorithm, called GSPT LMS algorithm, employs a new Grouped Signed Power-of-Two (GSPT) number representation. An adaptive equalizer using the proposed algorithm has been simulated and shown to be capable of equalization of 8PSK signals in several practical channels. Finally, the proposed adaptive equalizer and two other adaptive equalizers are implemented on FPGA. Simulation results show that the proposed architecture has the lowest complexity and saves about 50% to 70% of hardware.

show abstract

The log-log LMS algorithm

Cited by 18 publications

References 2 publications

Low-complexity adaptive algorithms for pre-distortion of power amplifiers

Low-complexity adaptive algorithms for pre-distortion of power amplifiers

Power-of-two adaptive filters using tabu search

Algorithm and architecture design for a low-complexity adaptive equalizer

Contact Info

Product

Resources

About