The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms (Q1105346): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Karhunen-Loeve Transform for a Class of Random Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Computational Algorithm for the Discrete Cosine Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Computational Algorithm for the Discrete Sine Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for the discrete W transform and for the discrete Fourier transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Cosine Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Symmetric Cosine Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3675490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm to compute the discrete cosine Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple FFT and DCT algorithms with reduced number of operations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the discrete Fourier and cosine transforms / rank
 
Normal rank

Latest revision as of 17:00, 18 June 2024

scientific article
Language Label Description Also known as
English
The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms
scientific article

    Statements

    The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms (English)
    0 references
    0 references
    1988
    0 references
    Decimation-in-frequency algorithms for discrete sine and cosine transforms are developed. Their feature is the recursive and modular structure, and thereby, these algorithms are ready to realize fertile hardware organization. The complexity of these algorithms is also discussed.
    0 references
    Decimation-in-frequency algorithms
    0 references
    discrete sine and cosine transforms
    0 references
    recursive and modular structure
    0 references
    complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references