In this paper, we extend structures and factorizations for paraunitary filter banks yielding linear phase filters [1] to the oversampled case. We derive minimal factorizations for a subset of these banks, and propose some design examples.

This paper has two purposes. Firstly, the paper is devoted to collecting basic facts about the Floquet theorem and various Floquet factorization algorithms claimed for finite-dimensional linear continuous-time periodic (FDLCP) systems. Secondly, the paper presents a unified representation framework for various Floquet factorizations in FDLCP systems, while structural and analytic characteristic...

Algorithms for classifying one-factorizations of regular graphs are studied. The smallest open case is currently graphs of order 12; one-factorizations of r-regular graphs of order 12 are here classified for r ≤ 6 and r = 10, 11. Two different approaches are used for regular graphs of small degree; these proceed one-factor by one-factor and vertex by vertex, respectively. For degree r = 11, we ...

We discuss computational procedures based on descriptor state-space realizations to compute proper range space bases of rational matrices. The main computation is the orthogonal reduction of the system matrix pencil to a special Kronecker-like form, which allows to extract a full column rank factor, whose columns form a proper rational basis of the range space. The computation of several types ...

We propose multi-layer hierarchically semiseparable (MHS) structures for the fast factorizations of dense matrices arising from multi-dimensional discretized problems such as certain integral operators. The MHS framework extends hierarchically semiseparable (HSS) forms (which are essentially one dimensional) to higher dimensions via the integration of multiple layers of structures, i.e., struct...

The labeled factorizations of a positive integer n are obtained as a completion of the set of ordered factorizations of n. This follows a new technique for generating ordered factorizations found by extending a method for unordered factorizations that relies on partitioning the multiset of prime factors of n. Our results include explicit enumeration formulas and some combinatorial identities. I...