The Number Theoretic Hilbert Transform

Abstract

This paper presents a general expression for a number-theoretic Hilbert transform (NHT). The transformations preserve the circulant nature of the discrete Hilbert transform (DHT) matrix together with alternating values in each row being zero and non-zero. Specific examples for 4-point, 6-point, and 8-point NHT are provided. The NHT transformation can be used as a primitive to create cryptographically useful scrambling transformations.

11 pages

References in corpus (3)

• The Basic Discrete Hilbert Transform with an Information Hiding Application
• Encryption of Binary and Non-Binary Data Using Chained Hadamard Transforms
• Towards a Number Theoretic Discrete Hilbert Transform

Cited by in corpus (7)

• New Results on the Number Theoretic Hilbert Transform
• The 10-point and 12-point Number Theoretic Hilbert Transform
• Random Residue Sequences and the Number Theoretic Hilbert Transform
• Memory Capacity of Neural Networks using a Circulant Weight Matrix
• A Class of Orthogonal Sequences
• A Key Set Cipher for Wireless Sensor Networks
• A New Result on the Random Residue Sequence Algorithm