Results 231 to 240 of about 3,457,264 (301)
Some of the next articles are maybe not open access.
Discrete Weyl–Heisenberg transforms
Journal of Mathematical Physics, 1996The concepts of von Neumann lattices and tight frames are used for defining discrete quantum mechanical transforms in the phase plane. These transforms are obtained by finite shifts la and mb in the coordinate x and momentum p, respectively, of the Weyl–Heisenberg group, and they are called the discrete Weyl–Heisenberg transforms ψ(la,mb).
openaire +2 more sources
Discrete bäcklund transformation
Physics Letters A, 1987Abstract A discretized Backlund transformation is given for the discrete sine-Gordon equation, and the general soliton solution is obtained.
K.W. Wong, C.C. Lam, P.C.W. Fung
openaire +1 more source
Running discrete cosine transform
Journal of Biomedical Engineering, 1992The discrete cosine transform (DCT) has become an important tool in digital signal processing because its performance is close to the optimal Karhunen-Loeve transform. In this work the running discrete cosine transform (RDCT) is introduced. Using the properties of the discrete Fourier transform kernel W = exp (-2 pi j/N), a fast recursive algorithm was
openaire +2 more sources
THE TRANSFORMATION OF DISCRETE VARIABLES
Annals of Human Genetics, 1955SummaryIn all data in which the response is all or none the application of tests of significance should take account of inevitable discontinuities and of possible divergencies from the normal model. The present paper discusses the application of the probability integral transform to discontinuous data in order that tests of significance based on ...
openaire +3 more sources
Discrete-Time Fourier Transform Discrete Fourier Transform
2022Muhammad N. Khan +2 more
openaire +1 more source
Journal of the Optical Society of America, 1983
The discrete Hartley transform (DHT) resembles the discrete Fourier transform (DFT) but is free from two characteristics of the DFT that are sometimes computationally undesirable. The inverse DHT is identical with the direct transform, and so it is not necessary to keep track of the +i and −i versions as with the DFT. Also, the DHT has real rather than
openaire +1 more source
The discrete Hartley transform (DHT) resembles the discrete Fourier transform (DFT) but is free from two characteristics of the DFT that are sometimes computationally undesirable. The inverse DHT is identical with the direct transform, and so it is not necessary to keep track of the +i and −i versions as with the DFT. Also, the DHT has real rather than
openaire +1 more source
Closed-form designs of digital fractional order Butterworth filters using discrete transforms
Signal Processing, 2017C. Tseng, Su-Ling Lee
semanticscholar +1 more source
Discrete Gabor transform and discrete Zak transform
1996Gabor's expansion of a discrete-time signal into a set of shifted and modulated versions of an elementary signal or synthesis window is introduced, along with the inverse operation, i.e. the Gabor transform, which uses an analysis window that is related to the synthesis window and with the help of which Gabor's expansion coefficients can be determined.
openaire +1 more source
Forgery detection in digital images via discrete wavelet and discrete cosine transforms
Computers & electrical engineering, 2017Khizar Hayat, Tanzeela Qazi
semanticscholar +1 more source
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly