Доступ предоставлен для: Guest
Портал Begell Электронная Бибилиотека e-Книги Журналы Справочники и Сборники статей Коллекции
Telecommunications and Radio Engineering
SJR: 0.202 SNIP: 0.2 CiteScore™: 0.23

ISSN Печать: 0040-2508
ISSN Онлайн: 1943-6009

Выпуски:
Том 78, 2019 Том 77, 2018 Том 76, 2017 Том 75, 2016 Том 74, 2015 Том 73, 2014 Том 72, 2013 Том 71, 2012 Том 70, 2011 Том 69, 2010 Том 68, 2009 Том 67, 2008 Том 66, 2007 Том 65, 2006 Том 64, 2005 Том 63, 2005 Том 62, 2004 Том 61, 2004 Том 60, 2003 Том 59, 2003 Том 58, 2002 Том 57, 2002 Том 56, 2001 Том 55, 2001 Том 54, 2000 Том 53, 1999 Том 52, 1998 Том 51, 1997

Telecommunications and Radio Engineering

DOI: 10.1615/TelecomRadEng.v56.i3.20
11 pages

Matrix Algorithms of Accelerated Computation of Fast Fourier Transform and Fast Hartley Transform

S. L. Zlobin
A. Ya. Stal'noy

Краткое описание

The conception of "running" or "sliding" spectrum is frequently used in spectral analysis and digital signal processing. "Running" or "sliding" spectral analysis is used in digital matched filtering of reflected signal in radiolocation, in adaptive arrays, in adaptive digital filtering, in speech signal and biomedical signal processing. Besides, operation of "running" spectral analysis can be implemented not only via Fourier transform, but on the basis of recently proposed Hartley transform too. Usually, in practice, fast transform algorithms are employed: FFT or FHT. A new matrix algorithm of accelerated computation of "running" ("sliding") Fourier or Hartley spectrum is described in the article. Spectrum length is arbitrary and equal to N, where N = bs, b is the FFT or FHT algorithm radix. Application of the arithmetical apparatus of block matrices and definition of "partial" spectra made it possible to describe "sliding" spectrum accelerated computation process in matrix form. The obtained algorithm is clear, distinct for regularity and simplicity of calculation process, makes it possible to get considerable computation economy in comparison with the common method. The algorithm is written in simple matrix expressions and can be simply programmed.


Articles with similar content:

Image Filtering Based on Discrete Cosine Transform
Telecommunications and Radio Engineering, Vol.66, 2007, issue 18
N. N. Ponomarenko, R. Oktem
Model Formulation of the Pulsed Subsurface Sounding Problem: Solution in the FDTD Approach
Telecommunications and Radio Engineering, Vol.53, 1999, issue 3
Andrei Olegovich Perov, N. N. Maita
OPTIMAL OPERATION POINT IN 3D DCT- BASED LOSSY COMPRESSION OF COLOR AND MULTICHANNEL REMOTE SENSING IMAGES
Telecommunications and Radio Engineering, Vol.74, 2015, issue 20
Benoit Vozel, V. V. Lukin, S. K. Abramov, R.A. Kozhemiakin, I. Djurovic, B. Djurovic
Application of the Extended χ2-Criterion for Embedded Information Detecting
Journal of Automation and Information Sciences, Vol.47, 2015, issue 4
Lyubov L. Nikitenko
The Use of Atomic Functions for Solving Boundary Value Problems of Mathematical Physics
Telecommunications and Radio Engineering, Vol.58, 2002, issue 7&8
Victor Filippovich Kravchenko, Vladimir Alexeevich Rvachev