Loading…

Artificial bee colony algorithm for the design of multiplier-less nonuniform filter bank transmultiplexer

Nonuniform filter bank transmultiplexer (NUFB TMUX) can be used to implement multicarrier communication system where applications with different data rates are to be multiplexed. It is possible to reduce the hardware complexity of the NUFB TMUX by representing the filter coefficients in canonic sign...

Full description

Saved in:
Bibliographic Details
Published in:Information sciences 2012-06, Vol.192, p.193-203
Main Authors: Manoj, V.J., Elias, Elizabeth
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Nonuniform filter bank transmultiplexer (NUFB TMUX) can be used to implement multicarrier communication system where applications with different data rates are to be multiplexed. It is possible to reduce the hardware complexity of the NUFB TMUX by representing the filter coefficients in canonic signed digit (CSD) format. In this paper the design of a multiplier-less NUFB TMUX is presented. NUFB TMUX with continuous filter coefficients is designed and the filter coefficients are synthesized in CSD format. Filter coefficient synthesis in CSD format is formulated as an optimization problem and an artificial bee colony (ABC) algorithm is used for the optimization. To preserve the canonic nature of filter coefficients in the ABC algorithm the filter coefficients are encoded using a look-up table. The look-up table also provides the number of signed power-of-two (SPT) terms in the CSD numbers. Simulation results show that the performance of the multiplier-less NUFB TMUX designed using the proposed ABC algorithm is much better than that of the multiplier-less NUFB TMUX obtained by rounding the continuous coefficients of filters to the nearest CSD number. Multiplier-less NUFB TMUX designed by the proposed ABC algorithm also outperforms that designed using genetic algorithm (GA) and particle swarm optimization (PSO).
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2011.02.023