Zobrazeno 1 - 10
of 287
pro vyhledávání: '"Souza, R. M."'
Digital Transforms have important applications on subjects such as channel coding, cryptography and digital signal processing. In this paper, two Fourier Transforms are considered, the discrete time Fourier transform (DTFT) and the finite field Fouri
Externí odkaz:
http://arxiv.org/abs/2007.10816
New number-theoretic transforms are derived from known linear block codes over finite fields. In particular, two new such transforms are built from perfect codes, namely the \textit {Hamming number-theoretic transform} and the \textit {Golay number-t
Externí odkaz:
http://arxiv.org/abs/1806.09727
The eigenstructure of the discrete Fourier transform (DFT) is examined and new systematic procedures to generate eigenvectors of the unitary DFT are proposed. DFT eigenvectors are suggested as user signatures for data communication over the real adde
Externí odkaz:
http://arxiv.org/abs/1702.01793
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
A new Efficient-bandwidth code-division-multiple-access (CDMA) for band-limited channels is introduced which is based on finite field transforms. A multilevel code division multiplex exploits orthogonality properties of nonbinary sequences defined ov
Externí odkaz:
http://arxiv.org/abs/1505.04140
New elliptic cylindrical wavelets are introduced, which exploit the relationship between analysing filters and Floquet's solution of Mathieu differential equations. It is shown that the transfer function of both multiresolution filters is related to
Externí odkaz:
http://arxiv.org/abs/1504.05262
A Fast algorithm for the Discrete Hartley Transform (DHT) is presented, which resembles radix-2 fast Fourier Transform (FFT). Although fast DHTs are already known, this new approach bring some light about the deep relationship between fast DHT algori
Externí odkaz:
http://arxiv.org/abs/1503.03794
This paper examines finite field trigonometry as a tool to construct trigonometric digital transforms. In particular, by using properties of the k-cosine function over GF(p), the Finite Field Discrete Cosine Transform (FFDCT) is introduced. The FFDCT
Externí odkaz:
http://arxiv.org/abs/1503.03763
A new family of error-correcting codes, called Fourier codes, is introduced. The code parity-check matrix, dimension and an upper bound on its minimum distance are obtained from the eigenstructure of the Fourier number theoretic transform. A decoding
Externí odkaz:
http://arxiv.org/abs/1503.03293
This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general, than the wel
Externí odkaz:
http://arxiv.org/abs/1503.02577