{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/8089"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/8089","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Parallelizing the GSM speech compression algorithm on Raw","abstract":"The GSM speech encoding algorithm, a widely used compression algorithm in mobile communications, was parallelized on Raw, a highly distributed hardware architecture with low latency communication. Parallelization architectures designed included a 2-stage pipeline and a 5-node satellite-hub model for distributing the time-intensive correlation calculations. Two additional architectures integrated these techniques: a 2-stage pipeline with a 4-node correlation parallelization, and an expanded 3-stage pipeline with a 9-node correlation parallelization. The expanded design took advantage of efficient switch-level data routing in the Raw network in order to distribute processing to non-local nodes. Results for the 3-stage, 9-node parallelization showed a factor of 3.6 speedup gain. A factor of 3.8 gain was achieved after optimizing data transfer. Future work includes extending the implementation to the entire GSM protocol, and utilizing available Raw resources to enhance the GSM speech compression algorithm with minimal performance loss.","abstract_html":"The GSM speech encoding algorithm, a widely used compression algorithm in mobile communications, was parallelized on Raw, a highly distributed hardware architecture with low latency communication. Parallelization architectures designed included a 2-stage pipeline and a 5-node satellite-hub model for distributing the time-intensive correlation calculations. Two additional architectures integrated these techniques: a 2-stage pipeline with a 4-node correlation parallelization, and an expanded 3-stage pipeline with a 9-node correlation parallelization. The expanded design took advantage of efficient switch-level data routing in the Raw network in order to distribute processing to non-local nodes. Results for the 3-stage, 9-node parallelization showed a factor of 3.6 speedup gain. A factor of 3.8 gain was achieved after optimizing data transfer. Future work includes extending the implementation to the entire GSM protocol, and utilizing available Raw resources to enhance the GSM speech compression algorithm with minimal performance loss.","abstract_has_math":false,"creators":["Kapur, Vishal, 1980-"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Anant Agarwal."],"committee_chairs":[],"committee_members":[],"year":2002,"date_issued":"2002","date_published":"2002","updated_at":"2026-07-22T22:21:30Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/8089","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Anant Agarwal."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Kapur, Vishal, 1980-"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2005-08-24T20:14:39Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2005-08-24T20:14:39Z"]},{"key":"dc:date.issued","label":"Date","values":["2002"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/8089"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.","Includes bibliographical references (leaves 48-49)."]},{"key":"dc:description.abstract","label":"Abstract","values":["The GSM speech encoding algorithm, a widely used compression algorithm in mobile communications, was parallelized on Raw, a highly distributed hardware architecture with low latency communication. Parallelization architectures designed included a 2-stage pipeline and a 5-node satellite-hub model for distributing the time-intensive correlation calculations. Two additional architectures integrated these techniques: a 2-stage pipeline with a 4-node correlation parallelization, and an expanded 3-stage pipeline with a 9-node correlation parallelization. The expanded design took advantage of efficient switch-level data routing in the Raw network in order to distribute processing to non-local nodes. Results for the 3-stage, 9-node parallelization showed a factor of 3.6 speedup gain. A factor of 3.8 gain was achieved after optimizing data transfer. Future work includes extending the implementation to the entire GSM protocol, and utilizing available Raw resources to enhance the GSM speech compression algorithm with minimal performance loss."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng.and S.B."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Parallelizing the GSM speech compression algorithm on Raw"]}]}],"canonical_facts":{"dc:contributor.advisor":["Anant Agarwal."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Kapur, Vishal, 1980-"],"dc:date.accessioned":["2005-08-24T20:14:39Z"],"dc:date.available":["2005-08-24T20:14:39Z"],"dc:date.issued":["2002"],"dc:description":["Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.","Includes bibliographical references (leaves 48-49)."],"dc:description.abstract":["The GSM speech encoding algorithm, a widely used compression algorithm in mobile communications, was parallelized on Raw, a highly distributed hardware architecture with low latency communication. Parallelization architectures designed included a 2-stage pipeline and a 5-node satellite-hub model for distributing the time-intensive correlation calculations. Two additional architectures integrated these techniques: a 2-stage pipeline with a 4-node correlation parallelization, and an expanded 3-stage pipeline with a 9-node correlation parallelization. The expanded design took advantage of efficient switch-level data routing in the Raw network in order to distribute processing to non-local nodes. Results for the 3-stage, 9-node parallelization showed a factor of 3.6 speedup gain. A factor of 3.8 gain was achieved after optimizing data transfer. Future work includes extending the implementation to the entire GSM protocol, and utilizing available Raw resources to enhance the GSM speech compression algorithm with minimal performance loss."],"dc:description.degree":["M.Eng.and S.B."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1721.1/8089"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Parallelizing the GSM speech compression algorithm on Raw"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:30Z"}