Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms (Q1062442): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Discrete Cosine Transform / 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 Symmetric Cosine Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation and the effectiveness of 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: A Storage Efficient Way to Implement the Discrete Cosine Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computing the Discrete Cosine Transform / 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 cosine transform in one and two dimensions / 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: A fast algorithm for the discrete sine transform implemented by the fast cosine transform / rank
 
Normal rank

Latest revision as of 17:38, 14 June 2024

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

    Statements

    Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms (English)
    0 references
    0 references
    1984
    0 references
    Fast algorithms for the discrete sine and cosine transforms are given in the decimation-in-time version. Their mathematical basis is placed on the radix-2 factorization of the transformation matrices. Algorithms for their inverse transforms are also developed in the decimation-in-time version. Detailed flow diagrams for these transforms are provided.
    0 references
    factorization
    0 references
    sine transform
    0 references
    cosine transforms
    0 references
    decimation-in-time version
    0 references
    inverse transforms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references