The Discrete Hilbert Transform for Non-Periodic Signals
Sumanth Kumar Reddy Gangasani

TL;DR
This paper analyzes the guard band size needed for the discrete Hilbert transform applied to non-periodic signals, demonstrating that a guard band equal to the message duration suffices for various signals, aiding data hiding and security.
Contribution
It establishes that a guard band equal to message duration is sufficient for non-periodic discrete Hilbert transform, supporting its use in data hiding and security.
Findings
Guard band equal to message duration is sufficient for various signals.
The result applies to both analog and digital data.
Supports the application of discrete Hilbert transform in security.
Abstract
This note investigates the size of the guard band for non-periodic discrete Hilbert transform, which has recently been proposed for data hiding and security applications. It is shown that a guard band equal to the duration of the message is sufficient for a variety of analog signals and is, therefore, likely to be adequate for discrete or digital data.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Steganography and Watermarking Techniques · Chaos-based Image/Signal Encryption · Advanced Data Compression Techniques
