The search functionality is under construction.
The search functionality is under construction.

Computationally Efficient Implementation of Hypercomplex Digital Filters

Hisamichi TOYOSHIMA

  • Full Text Views

    0

  • Cite this

Summary :

Hypercomplex coefficient digital filters provide several attractive advantages such as compact realization with reduced system order, inherent parallelism. However, they also possess a drawback in that a multiplier requires a large amount of computations. This paper proposes a computationally efficient implementation of digital filters whose coefficient is a type of hypercomplex number; a bicomplex number. By decomposing a bicomplex multiplier into two parallel complex multipliers, we show that hypercomplex digital filters can be implemented as two parallel complex digital filters. The proposed implementation offers more than a 60% reduction in the count of real multipliers.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.8 pp.1870-1876
Publication Date
2002/08/01
Publicized
Online ISSN
DOI
Type of Manuscript
Special Section LETTER (Special Section on Digital Signal Processing)
Category
Digital Filter

Authors

Keyword