Number theoretic Hilbert transform

The number theoretic Hilbert transform is an extension[1] of the discrete Hilbert transform to integers modulo a prime . The transformation operator is a circulant matrix.

The number theoretic transform is meaningful in the ring , when the modulus is not prime, provided a principal root of order n exists. The NHT matrix, where , has the form

The rows are the cyclic permutations of the first row, or the columns may be seen as the cyclic permutations of the first column. The NHT is its own inverse: where I is the identity matrix.

The number theoretic Hilbert transform can be used to generate sets of orthogonal discrete sequences that have applications in signal processing, wireless systems, and cryptography.[2] Other ways to generate constrained orthogonal sequences also exist.[3][4]

References

  1. Kak, Subhash (2015), "Orthogonal residue sequences", Circuits Systems Signal Processing, 34 (3): 1017–1025, doi:10.1007/s00034-014-9879-1
  2. Donelan, H. (1999). Method for generating sets of orthogonal sequences. Electronics Letters 35: 1537-1538.
  3. Appuswamy, R., Chaturvedi, A.K. (2006). A new framework for constructing mutually orthogonal complementary sets and ZCZ sequences. IEEE Trans. Inf. Theory 52: 3817-3826.

See also

  • Number theoretic transform
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.