Parallelizing the GSM speech compression algorithm on Raw

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.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2002

Author dc:creator

• Kapur, Vishal, 1980-

Advisor dc:contributor.advisor

• Anant Agarwal.

• Electrical Engineering and Computer Science.

Statement 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.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/8089

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/8089