Generalized orthogonal discrete W transform and its fast algorithm (Q2657434): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2021/2529754 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3120872039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized unified computation of multidimensional discrete orthogonal transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Machine Calculation of Complex Fourier Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fast Hartley Transform Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete W transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized discrete Hartley transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a set of matrix algebras related to discrete Hartley-type transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete fractional Hartley and Fourier transforms / 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: On the Hartley - Fourier sine generalized convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memoryless block transceivers with minimum redundancy based on Hartley transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directional Hartley transform and content based image retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Parametric Discrete Fourier and Hartley Transforms, and Algorithms for Fast Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computation of the discrete W transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of the Fast Fourier Transform / rank
 
Normal rank

Latest revision as of 18:13, 24 July 2024

scientific article
Language Label Description Also known as
English
Generalized orthogonal discrete W transform and its fast algorithm
scientific article

    Statements

    Generalized orthogonal discrete W transform and its fast algorithm (English)
    0 references
    0 references
    0 references
    12 March 2021
    0 references
    Summary: Based on the generalized discrete Fourier transform, the generalized orthogonal discrete W transform and its fast algorithm are proposed and derived in this paper. The orthogonal discrete W transform proposed by Zhongde Wang has only four types. However, the generalized orthogonal discrete W transform proposed by us has infinite types and subsumes a family of symmetric transforms. The generalized orthogonal discrete W transform is a real-valued orthogonal transform, and the real-valued orthogonal transform of a real sequence has the advantages of simple operation and facilitated transmission and storage. The generalized orthogonal discrete W transforms provide more basis functions with new frequencies and phases and hence lead to more powerful analysis and processing tools for communication, signal processing, and numerical computing.
    0 references

    Identifiers