For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Computationally Efficient Bicomplex Multipliers for Digital Signal Processing
IEICE TRANSACTIONS on Information and Systems
Publication Date: 1998/02/25
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Algorithm and Computational Complexity
computational complexity, hypercomplex number, bicomplex multiplier, digital signal processing,
Full Text: PDF>>
This correspondence reports novel computationally efficient algorithms for multiplication of bicomplex numbers, which belong to hypercomplex numbers. The proposed algorithms require less number of real multiplications than existing methods. Furthermore, they give more effective implementation when applied to constant coefficient digital filters.