Speech encryption based on fast Fourier transform permutation
Published: Nov 11, 2002
Abstract
This paper deals with the permutation of FFT (Fast Fourier Transform) coefficients in a speech encryption system. The scrambling algorithm is based on the permutation of the FFT coefficients and provides a highly secured scrambled signal by permuting a large number of those coefficients. The algorithm for the generation the permutation matrices is explained. This system is useful for a band limited telephone channel and mobile communication....
Paper Details
Title
Speech encryption based on fast Fourier transform permutation
Published Date
Nov 11, 2002
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History