2026-09-24T05:48:16Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/80892026-06-06T01:04:26Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Anant Agarwal. Kapur, Vishal, 1980- Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2005-08-24T20:14:39Z 2005-08-24T20:14:39Z 2002 2002 http://hdl.handle.net/1721.1/8089 51213825 Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002. Includes bibliographical references (leaves 48-49). 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. by Vishal Kapur. M.Eng. S.B. 49 leaves 2769685 bytes 2769442 bytes application/pdf application/pdf eng Massachusetts Institute of Technology 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. http://dspace.mit.edu/handle/1721.1/7582 Electrical Engineering and Computer Science. Parallelizing the GSM speech compression algorithm on Raw Parallelizing the global system for mobile communications speech compression algorithm on Raw Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="6e759fb6-89d7-43b4-9533-5317bdb9a301"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Parallelizing the GSM speech compression algorithm on Raw</Title> <Subtitle>Parallelizing the global system for mobile communications speech compression algorithm on Raw</Subtitle> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2002</PublicationDate> <Authors> <Author> <DisplayName>Kapur, Vishal, 1980-</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Electrical Engineering and Computer Science.</Keyword> <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> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>