{"id":{"repo_id":"ubc","oai_identifier":"oai:circle.library.ubc.ca:2429/1544"},"canonical_url":"https://search.dev.ndltd.org/etd/ubc/oai:circle.library.ubc.ca:2429/1544","repository":{"repo_id":"ubc","name":"University of British Columbia","base_url":"http://circle.library.ubc.ca/oai/request"},"display":{"title":"An asynchronous telephone speech scrambler with a new key generation method","abstract":"The design of an asynchronous telephone speech scrambler is proposed and its performance experimentally studied. The scrambler transforms the speech signal into a scrambled form by permuting the frequency coefficients of the speech signal. These coefficients are permuted in pairs instead of individually. Subjective tests indicate that such an arrangement results in an improvement in descrambled speech quality but no increase in the residual intelligibility of the scrambled speech signal. A new criterion for selecting good scrambling permutations known as the derangement criterion is introduced. Subjective tests based on the number test confirm that keys satisfying this criterion are able to produce scrambled speech with virtually no residual intelligibility. A new derangement generation algorithm is introduced. This algorithm maps an integer g, in the range of 0 ≤ g < (n - 1)!, uniquely to a derangement of n elements.","abstract_html":"The design of an asynchronous telephone speech scrambler is proposed and its performance experimentally studied. The scrambler transforms the speech signal into a scrambled form by permuting the frequency coefficients of the speech signal. These coefficients are permuted in pairs instead of individually. Subjective tests indicate that such an arrangement results in an improvement in descrambled speech quality but no increase in the residual intelligibility of the scrambled speech signal. A new criterion for selecting good scrambling permutations known as the derangement criterion is introduced. Subjective tests based on the number test confirm that keys satisfying this criterion are able to produce scrambled speech with virtually no residual intelligibility. A new derangement generation algorithm is introduced. This algorithm maps an integer g, in the range of 0 ≤ g &lt; (n - 1)!, uniquely to a derangement of n elements.","abstract_has_math":false,"creators":["Woo, Raymond W. M."],"institution":"University of British Columbia","degree_name":"Master of Applied Science - MASc","degree_level":"master's","degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1993,"date_issued":"1993","date_published":"1993","updated_at":"2026-07-24T05:07:26Z","subjects":[],"languages":["eng"],"rights":["For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2429/1544","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Woo, Raymond W. M."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["1993"]},{"key":"dc:publisher","label":"Institution","values":["University of British Columbia"]},{"key":"dc:type","label":"Dc Type","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["master's"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Applied Science - MASc"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of British Columbia"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2429/1544","http://circle.library.ubc.ca/bitstream/2429/1544/1/ubc_1993_fall_woo_raymond.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The design of an asynchronous telephone speech scrambler is proposed and its performance experimentally studied. The scrambler transforms the speech signal into a scrambled form by permuting the frequency coefficients of the speech signal. These coefficients are permuted in pairs instead of individually. Subjective tests indicate that such an arrangement results in an improvement in descrambled speech quality but no increase in the residual intelligibility of the scrambled speech signal. A new criterion for selecting good scrambling permutations known as the derangement criterion is introduced. Subjective tests based on the number test confirm that keys satisfying this criterion are able to produce scrambled speech with virtually no residual intelligibility. A new derangement generation algorithm is introduced. This algorithm maps an integer g, in the range of 0 ≤ g < (n - 1)!, uniquely to a derangement of n elements."]},{"key":"dc:format","label":"Dc Format","values":["3911299","application/pdf"]},{"key":"dc:title","label":"Title","values":["An asynchronous telephone speech scrambler with a new key generation method"]}]}],"canonical_facts":{"dc:creator":["Woo, Raymond W. M."],"dc:date":["1993"],"dc:description":["The design of an asynchronous telephone speech scrambler is proposed and its performance experimentally studied. The scrambler transforms the speech signal into a scrambled form by permuting the frequency coefficients of the speech signal. These coefficients are permuted in pairs instead of individually. Subjective tests indicate that such an arrangement results in an improvement in descrambled speech quality but no increase in the residual intelligibility of the scrambled speech signal. A new criterion for selecting good scrambling permutations known as the derangement criterion is introduced. Subjective tests based on the number test confirm that keys satisfying this criterion are able to produce scrambled speech with virtually no residual intelligibility. A new derangement generation algorithm is introduced. This algorithm maps an integer g, in the range of 0 ≤ g < (n - 1)!, uniquely to a derangement of n elements."],"dc:format":["3911299","application/pdf"],"dc:identifier":["http://hdl.handle.net/2429/1544","http://circle.library.ubc.ca/bitstream/2429/1544/1/ubc_1993_fall_woo_raymond.pdf"],"dc:language":["eng"],"dc:publisher":["University of British Columbia"],"dc:rights":["For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use."],"dc:title":["An asynchronous telephone speech scrambler with a new key generation method"],"dc:type":["Text"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["master's"],"thesis:degree_name":["Master of Applied Science - MASc"],"thesis:institution_name":["University of British Columbia"]},"updated_at":"2026-07-24T05:07:26Z"}