Matrix splitting with symmetry and dyadic framelet filter banks over algebraic number fields

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

6 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)2650-2679
Journal / PublicationLinear Algebra and Its Applications
Volume437
Issue number10
Publication statusPublished - 15 Nov 2012

Abstract

Algebraic number fields are of particular interest and play an important role in both mathematics and engineering since an algebraic number field can be viewed as a finite dimensional linear space over the rational number field Q. Algorithms using algebraic number fields can be efficiently implemented involving only integer arithmetics. In this paper, we properly formulate the matrix splitting problem over any general subfield of it C, including an algebraic number field as a special case, and provide a simple necessary and sufficient condition for a 2×2 matrix of Laurent polynomials with symmetry to be able to be factorized by a 2×2 matrix of Laurent polynomials with certain symmetry structure. We propose an effective algorithm on how to obtain the factorization matrix step by step. As an application, we obtain a satisfactory algorithm for constructing dyadic framelet filter banks with the perfect reconstruction property and with symmetry over algebraic number fields. Several examples are provided to illustrate the algorithms proposed in this paper. © 2012 Elsevier Inc. All rights reserved.

Research Area(s)

  • Algebraic framelet filters, Algebraic number fields, Extended Euclidean algorithm, Framelet filter banks, Matrix splitting, Symmetry, Wavelets