scholarly journals A Parallel Framework with Block Matrices of a Discrete Fourier Transform for Vector-Valued Discrete-Time Signals

2015 ◽  
Vol 2015 ◽  
pp. 1-7
Author(s):  
Pablo Soto-Quiros
Keyword(s):  
Fourier Transform ◽  
Parallel Computing ◽  
Discrete Time ◽  
Parallel Implementation ◽  
Multicore Processors ◽  
Block Matrix ◽  
Mathematical Framework ◽  
Matrix Operations ◽  
Time Signals ◽  
Vector Valued

This paper presents a parallel implementation of a kind of discrete Fourier transform (DFT): the vector-valued DFT. The vector-valued DFT is a novel tool to analyze the spectra of vector-valued discrete-time signals. This parallel implementation is developed in terms of a mathematical framework with a set of block matrix operations. These block matrix operations contribute to analysis, design, and implementation of parallel algorithms in multicore processors. In this work, an implementation and experimental investigation of the mathematical framework are performed using MATLAB with the Parallel Computing Toolbox. We found that there is advantage to use multicore processors and a parallel computing environment to minimize the high execution time. Additionally, speedup increases when the number of logical processors and length of the signal increase.

Single-Rate Discrete-Time Signals and Systems

2009 ◽  
pp. 1-22
Author(s):  
Ljiljana Milic
Keyword(s):  
Fourier Transform ◽  
Discrete Fourier Transform ◽  
Discrete Time ◽  
Time Domain ◽  
Transform Domain ◽  
Concise Review ◽  
Discrete Signals ◽  
Time Signals ◽  
The Time Domain

This chapter is a concise review of time-domain and transform-domain representations of single-rate discrete-time signals and systems. We consider first the time-domain representation of discrete-time signals and systems. The representation in transform domain comprises the discrete-time Fourier transform (DTFT), the discrete Fourier transform (DFT), and the z-transform. The basic realization structures for FIR and IIR systems are briefly described. Finally, the relations between continuous and discrete signals are given.

Fundamentals of Fourier Analysis

2009 ◽  
Author(s):  
Robert J Marks II
Keyword(s):  
Fourier Transform ◽  
Discrete Time ◽  
Continuous Time ◽  
Fourier Integral ◽  
Time Signal ◽  
Continuous Sampling ◽  
Common Reference ◽  
Multidimensional Signals ◽  
Time Signals ◽  
The Fourier Transform

This chapter contains foundational material for modelling of signals and systems. Section 2.2 introduces classes of functions useful in signal processing and analysis. The Fourier transform, in Section 2.3, begins with the Fourier integral and develops the Fourier series, the discrete time Fourier transform and the discrete Fourier transform as special cases. The following material in this chapter can be skipped on a first reading. † denotes material relevant to multidimensional signals in Chapters 8 and 11. ‡ denotes material relevant to probability and stochastic processes in Chapter 4. ¶ denotes material used in continuous sampling in Chapter 10. There are a number of signal classes to which we will make common reference. Continuous time signals are denoted with their arguments in parentheses, e.g., x(t). Discrete time signals will be bracketed, e.g., x[n]. A continuous time signal, x(t), is periodic if there exists a T such that x(t) = x(t − T) for all t. The function x(t) = constant is periodic. A discrete time signal, x[n], is periodic if there exists a positive integer N such that x[n] = x[n − N] for all n. The function x[n] = constant is periodic.

scholarly journals The VIT Transform Approach to Discrete-Time Signals and Linear Time-Varying Systems

Eng ◽  
2021 ◽  
Vol 2 (1) ◽  
pp. 99-125
Author(s):  
Edward W. Kamen
Keyword(s):  
Discrete Time ◽  
Initial Conditions ◽  
Linear Time ◽  
Order Term ◽  
Initial Time ◽  
Time Varying ◽  
Varying Coefficients ◽  
Time Signals ◽  
Time Varying Systems ◽  
Time Varying Coefficients

A transform approach based on a variable initial time (VIT) formulation is developed for discrete-time signals and linear time-varying discrete-time systems or digital filters. The VIT transform is a formal power series in z−1, which converts functions given by linear time-varying difference equations into left polynomial fractions with variable coefficients, and with initial conditions incorporated into the framework. It is shown that the transform satisfies a number of properties that are analogous to those of the ordinary z-transform, and that it is possible to do scaling of z−i by time functions, which results in left-fraction forms for the transform of a large class of functions including sinusoids with general time-varying amplitudes and frequencies. Using the extended right Euclidean algorithm in a skew polynomial ring with time-varying coefficients, it is shown that a sum of left polynomial fractions can be written as a single fraction, which results in linear time-varying recursions for the inverse transform of the combined fraction. The extraction of a first-order term from a given polynomial fraction is carried out in terms of the evaluation of zi at time functions. In the application to linear time-varying systems, it is proved that the VIT transform of the system output is equal to the product of the VIT transform of the input and the VIT transform of the unit-pulse response function. For systems given by a time-varying moving average or an autoregressive model, the transform framework is used to determine the steady-state output response resulting from various signal inputs such as the step and cosine functions.

Sign in / Sign up

Export Citation Format

Share Document