Toggle Main Menu Toggle Search

Open Access padlockePrints

Analysis of the LNS implementation of the fast affine projection algorithms

Lookup NU author(s): Dr Nick Coleman

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Abstract

It has been shown that a 32-bit logarithmic arithmetic unit can operate faster than, and maintain the accuracy of, a 32-bit floating point unit [J. N. Coleman, E. I. Chester, April 1999]. It uses the logarithmic number system (LNS), in which a real number is represented as a fixed-point logarithm. In this paper we investigate the implementation of three fast affine projection (FAP) algorithms using LNS. We propose a simplified conjugate gradient FAP (SCGFAP) algorithm. We show that the 32-bit or 20-bit LNS implementation of the CGFAP and the SCGFAP algorithm are superior to those of the classical FAP algorithm. (14 References).


Publication metadata

Author(s): Albu F, Kadlec J, Hermanek A, Fagan A, Coleman N

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Irish Signals and Systems Conference (ISSC)

Year of Conference: 2002

Pages: 251-255

Notes: Marnane W Lightbody G Pesch D Cork, Ireland. Proceedings of the Irish Signals and Systems Conference 2002. ISSC2002. Cork, Ireland. Analog Devices Ireland. Intel Ireland. Motorola SPS. Silicon & Software Syst. Xilinx Ireland. et al.


Share