2019
DOI: 10.3390/electronics8050509
|View full text |Cite
|
Sign up to set email alerts
|

Some Structures of Parallel VLSI-Oriented Processing Units for Implementation of Small Size Discrete Fractional Fourier Transforms

Abstract: Discrete orthogonal transforms such as the discrete Fourier transform, discrete cosine transform, discrete Hartley transform, etc., are important tools in numerical analysis, signal processing, and statistical methods. The successful application of transform techniques relies on the existence of efficient fast algorithms for their implementation. A special place in the list of transformations is occupied by the discrete fractional Fourier transform (DFrFT). In this paper, some parallel algorithms and processin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
4
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 16 publications
0
4
0
Order By: Relevance
“…In addition, the algorithm has a regular modular structure. Typical cores of the algorithm are standard small-size DFrFTs, which allows them to be used as unified building blocks in software or hardware implementation [13]. This will simplify and unify the process of developing programs and digital signal processors that implement the considered algorithm.…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations
“…In addition, the algorithm has a regular modular structure. Typical cores of the algorithm are standard small-size DFrFTs, which allows them to be used as unified building blocks in software or hardware implementation [13]. This will simplify and unify the process of developing programs and digital signal processors that implement the considered algorithm.…”
Section: Discussionmentioning
confidence: 99%
“…. , K have a special structure; therefore, the numbers of arithmetic operations when calculating the matrixvector product of each of them by the vector can be further reduced by about a half [12,13].…”
Section: Computational Complexitymentioning
confidence: 99%
See 2 more Smart Citations
“…With rare exceptions, most publications known to the authors mainly deal with fast algorithms for other types of DCT. It should be noted that, as in the case of other discrete orthogonal transformations [28][29][30], the DCT-I algorithms for short sequences are also of particular interest. In the case of hardware or software implementation of digital signal processing methods, small-sized DCT-I implementation cores can serve as building blocks for the synthesis of larger-size algorithms [4,7,[31][32][33].…”
Section: Introductionmentioning
confidence: 99%