Analog Scrambling by the General Fast Fourier Transform

DOI10.1007/3-540-39466-4_11MaRDI QIDQ5120695zbMATH OpenOpenAlexFDO

Authors Franz Pichler

Publication date 15 September 2020

Published in Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/3-540-39466-4_11

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Quality analog scramblers using frequency-response masking filter banks
• Reconstruction of a Linear Scrambler
• scientific article; zbMATH DE number 641228
• An analog scrambling scheme which does not expand bandwidth, Part II: Continuous time
• Analog random coding
• Unscrambling for fast DFT algorithms
• Generalization of waveform communications: the Fourier analyzer approach
• Estimation of scrambler based on propagator method
• A generalization of the discrete fourier transform

Cited in

(4)

• On the computational complexity of the general discrete Fourier transform
• Quality analog scramblers using frequency-response masking filter banks
• Time-Division Multiplexing Scramblers: Selecting Permutations and Testing the System
• scientific article; zbMATH DE number 641228 (Why is no real title available?)

This page was built for publication: Analog Scrambling by the General Fast Fourier Transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5120695)