The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A Speech Scrambler Using the Fast Fourier Transform Technique
Abstract
This paper describes an analog speech scrambler using the FFT technique (FFT scrambler). The FFT scrambler provides highly secured scrambled signal by permuting a large number of FFT coefficients. Important items to be considered in the designing of the FFT scrambler are discussed, such as FFT frame length, permutation of FFT coefficients, and frame synchronization, in addition to the configuration of the experimental FFT scrambler. Possible causes for the degradation of the descrambled signal, such as transmission channel group delay and intersymbol interference, are also discussed, together with experimental results.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Therefore, the number of all possible permutations is 128! 3.85E 215 25, 26 .”
From Chaotic Image Encryption Design Using Tompkins-Paige Algorithm (2009) · cites this paper as [26]
In the citing paper
“Tompkins-Paige algorithm gives a one-to-one correspondence between the integers and the permutation.”
From Chaotic Image Encryption Design Using Tompkins-Paige Algorithm (2009) · cites this paper as [26]
Citations
Cites
Applied Combinatorial Mathematics.
Thompson, G. L., & Beckenbach, E. F. (1967) · Journal of the American Statistical Association · doi:10.2307/2284007 · Cited by 191
Applied Combinatorial Mathematics.
Barton, D. E., & Beckenbach, E. F. (1965) · Journal of the Royal Statistical Society Series A (General) · doi:10.2307/2343475 · Cited by 155
Cessna, J. R., & Levy, D. M. (1972) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1972.1091128 · Cited by 76
An analog scrambling scheme which does not expand bandwidth, Part I: Discrete time
Wyner, A. D. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056050 · Cited by 74
An analog scrambling scheme which does not expand bandwidth, Part II: Continuous time
Wyner, A. D. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056071 · Cited by 60
Analog scramblers for speech privacy
Jayant, N. S. (1982) · Computers & Security · doi:10.1016/0167-4048(82)90047-5 · Cited by 26
A Simple Sample Value Scrambler Using FFT Algorithms for Secure Voice Communications
李琳山, Harn, Y.-P., Chen, Y., et al. (1980) · Cited by 11
Research works printed but not linked: 3
- weinstein, 0, Sampling based techniques for voice scrambling, Proc ICC 80, 16.2.1
- sakurai, 1980, On a speech scrambling method
- osatake, 1973, A quantized synchronization system
Cited by
Chaotic Image Encryption Design Using Tompkins-Paige Algorithm
Etemadi Borujeni, S., & Eshghi, M. (2009) · Mathematical Problems in Engineering · doi:10.1155/2009/762652 · Cited by 74
Metadata
- Authors
- Sakurai, K., Koga, K., & Muratani, T.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 1984-05
- Volume
- 2
- Issue
- 3
- Pages
- 434-442
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2103503013
- Cited by
- 26
- References
- 7
- Citations by year
- 2022: 1 · 2019: 1 · 2017: 1 · 2015: 1 · 2014: 1 · 2013: 2 · 2012: 2
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Journal on Selected Areas in Communications (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Signal Processing › Digital Filter Design and Implementation
- Physical Sciences › Computer Science › Signal Processing › Speech and Audio Processing
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Keywords
- speech scrambling, frame synchronization, group delay, intersymbol interference, secure communication
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
