Abstract
A speech scrambler based on time-domain sample scrambling is described. Synchronization between transmitter and receiver is unnecessary, because special windowing and scrambling combinations make the process equivalent to a frequency-band scrambler with a limited number of possible scrambling permutations. The required computation is typically only 4-8 multiplications per sample. Although processing is digital, the output is intended for analogue speech transmission over standard telephone channels. In addition to the message being scrambled, speaker identity is also masked in the scrambled speech, but it is readily recognized in the descrambled output. The algorithm can be modified to form a cheap but low-quality bandwidth compressor, and to correct the pitch of recorded speech played back at a different rate. A limited number of simulation results are given, and the system is compared with two previous time-domain scramblers.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
