Orthogonal and Non-Orthogonal Signal Representations Using New Transformation Matrices Having NPM Structure

06/20/2021
by   Shaik Basheeruddin Shah, et al.
0

In this paper, we introduce two types of real-valued sums known as Complex Conjugate Pair Sums (CCPSs) denoted as CCPS^(1) and CCPS^(2), and discuss a few of their properties. Using each type of CCPSs and their circular shifts, we construct two non-orthogonal Nested Periodic Matrices (NPMs). As NPMs are non-singular, this introduces two non-orthogonal transforms known as Complex Conjugate Periodic Transforms (CCPTs) denoted as CCPT^(1) and CCPT^(2). We propose another NPM, which uses both types of CCPSs such that its columns are mutually orthogonal, this transform is known as Orthogonal CCPT (OCCPT). After a brief study of a few OCCPT properties like periodicity, circular shift, etc., we present two different interpretations of it. Further, we propose a Decimation-In-Time (DIT) based fast computation algorithm for OCCPT (termed as FOCCPT), whenever the length of the signal is equal to 2^v,v∈ℕ. The proposed sums and transforms are inspired by Ramanujan sums and Ramanujan Period Transform (RPT). Finally, we show that the period (both divisor and non-divisor) and frequency information of a signal can be estimated using the proposed transforms with a significant reduction in the computational complexity over Discrete Fourier Transform (DFT).

READ FULL TEXT
research
05/10/2021

Effective Methods of QR-Decompositions of Square Complex Matrices by Fast Discrete Signal-Induced Heap Transforms

The purpose of this work is to present an effective tool for computing d...
research
03/29/2018

Novel Fourier Quadrature Transforms and Analytic Signal Representations for Nonlinear and Non-stationary Time Series Analysis

The Hilbert transform (HT) and associated Gabor analytic signal (GAS) re...
research
11/10/2021

Data Compression: Multi-Term Approach

In terms of signal samples, we propose and justify a new rank reduced mu...
research
01/14/2021

A General Method for Generating Discrete Orthogonal Matrices

Discrete orthogonal matrices have several applications, such as in codin...
research
07/19/2019

Sparse Recovery for Orthogonal Polynomial Transforms

In this paper we consider the following sparse recovery problem. We have...
research
11/26/2022

Transform Once: Efficient Operator Learning in Frequency Domain

Spectral analysis provides one of the most effective paradigms for infor...
research
02/02/2015

Complex-Valued Hough Transforms for Circles

This paper advocates the use of complex variables to represent votes in ...

Please sign up or login with your details

Forgot password? Click here to reset