paper-with-me

홈 › Papers

Design of Discrete-time Matrix All-Pass Filters Using Subspace Nevanlinna Pick Interpolation

2022-10-25 · Agulla Surya Bharath, Devanshu Singh Gaharwar, Kumar Appaiah, Debasattam Pal

Unitary matrix-valued functions of frequency are matrix all-pass systems, since they preserve the norm of the input vector signals. Typically, such systems are represented and analyzed using their unitary-matrix valued frequency domain characteristics, although obtaining rational realizations for matrix all-pass systems enables compact representations and efficient implementations. However, an approach to obtain matrix all-pass filters that satisfy phase constraints at certain frequencies was hitherto unknown. In this paper, we present an interpolation strategy to obtain a rational matrix-valued transfer function from frequency domain constraints for discrete-time matrix all-pass systems. Using an extension of the Subspace Nevanlinna Pick Interpolation Problem (SNIP), we design a construction for discrete-time matrix all-pass systems that satisfy the desired phase characteristics. An innovation that enables this is the extension of the SNIP to the boundary case to obtain efficient time-domain implementations of matrix all-pass filters as matrix linear constant coefficient difference equations, facilitated by a rational (realizable) matrix transfer function. We also show that the derivative of matrix phase constraints, related to the group delay at the interpolating points, can be optimized to control the all-pass transfer matrices at the unspecified frequencies. Simulations show that the proposed technique for unitary matrix filter design performs as well as traditional DFT based interpolation approaches, including Geodesic interpolation and the popular Givens rotation based matrix parameterization.

📄 PDF Abstract BibTeX arXiv:2210.14015

Code (0)

등록된 구현이 없습니다.

Tasks

All

Methods 이 논문이 사용한 방법론

SNIP SNIP, or Scale Normalization for Image Pyramids, is a multi-scale training scheme that selectively back-propagates the gradients of object instances of different sizes as…

Similar Papers 제목 키워드 기반

DCT and DST Filtering with Sparse Graph Operators

2021-03-22 · Keng-Shih Lu, Antonio Ortega, Debargha Mukherjee, Yue Chen

Graph filtering is a fundamental tool in graph signal processing. Polynomial graph filters (PGFs), defined as polynomials of a fundamental graph operator, can be implemented in the vertex domain, and usually have a lower…

Towards an Adaptive Dynamic Mode Decomposition

2020-12-11 · Mohammad N. Murshed, M. Monir Uddin

Dynamic Mode Decomposition (DMD) is a data based modeling tool that identifies a matrix to map a quantity at some time instant to the same quantity in future. We design a new version which we call Adaptive Dynamic Mode D…

Graph Signal Processing: Filter Design and Spectral Statistics

2018-02-27

Graph signal processing analyzes signals supported on the nodes of a graph by defining the shift operator in terms of a matrix, such as the graph adjacency matrix or Laplacian matrix, related to the structure of the grap…

Efficient Similarity-based Passive Filter Pruning for Compressing CNNs

2022-10-27 · Arshdeep Singh, Mark D. Plumbley

Convolution neural networks (CNNs) have shown great success in various applications. However, the computational complexity and memory storage of CNNs is a bottleneck for their deployment on resource-constrained devices. …

Acoustic Scene ClassificationScene Classification

Revisiting 3D Reconstruction Kernels as Low-Pass Filters

2026-01-25 · Shengjun Zhang, Min Chen, Yibo Wei, Mingyu Dong 외 arxiv

3D reconstruction is to recover 3D signals from the sampled discrete 2D pixels, with the goal to converge continuous 3D spaces. In this paper, we revisit 3D reconstruction from the perspective of signal processing, ident…

3D Reconstruction