liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Instruction and hardware acceleration for MP-MLQ in G.723.1
Linköping University, Department of Electrical Engineering, Computer Engineering. Linköping University, The Institute of Technology.
Linköping University, Department of Electrical Engineering, Computer Engineering. Linköping University, The Institute of Technology.
2002 (English)In: IEEE Workshop on Signal Processing Systems, 2002. (SIPS '02)., 2002, 235-239 p.Conference paper, Published paper (Refereed)
Abstract [en]

This paper describes a significant improvement in complexity for the higher bit rate, 6.3 kbit/s, speech coding algorithm G.723.1. The solution is to reduce the number of multiplications of the most computing extensive part of the algorithm. This part stands for around 50% of the total complexity. This is done by identifying and excluding multiplication with zeros. G.723.1 is one of the proposed speech coders in the H.323 standard. The work has been done by thoroughly examining the fixed point source code from ITU, International Telecommunication Unions. A hardware structure for an application specific instruction set processor (ASIP) is proposed to increase the performance.

Place, publisher, year, edition, pages
2002. 235-239 p.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-33543DOI: 10.1109/SIPS.2002.1049715Local ID: 19568ISBN: 0-7803-7587-4 (print)OAI: oai:DiVA.org:liu-33543DiVA: diva2:254366
Conference
IEEE Workshop on Signal Processing Systems, 2002. (SIPS '02). San Diego, California, USA. October 16-18, 2002.
Available from: 2009-10-09 Created: 2009-10-09 Last updated: 2013-11-26
In thesis
1. Hardware for speech and audio coding
Open this publication in new window or tab >>Hardware for speech and audio coding
2004 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

While the Micro Processors (MPUs) as a general purpose CPU are converging (into Intel Pentium), the DSP processors are diverging. In 1995, approximately 50% of the DSP processors on the market were general purpose processors, but last year only 15% were general purpose DSP processors on the market. The reason general purpose DSP processors fall short to the application specific DSP processors is that most users want to achieve highest performance under minimized power consumption and minimized silicon costs. Therefore, a DSP processor must be an Application Specific Instruction set Processor (ASIP) for a group of domain specific applications.

An essential feature of the ASIP is its functional acceleration on instruction level, which gives the specific instruction set architecture for a group of applications. Hardware acceleration for digital signal processing in DSP processors is essential to enhance the performance while keeping enough flexibility. In the last 20 years, researchers and DSP semiconductor companies have been working on different kinds of accelerations for digital signal processing. The trade-off between the performance and the flexibility is always an interesting question because all DSP algorithms are "application specific"; the acceleration for audio may not be suitable for the acceleration of baseband signal processing. Even within the same domain, for example speech CODEC (COder/DECoder), the acceleration for communication infrastructure is different from the acceleration for terminals.

Benchmarks are good parameters when evaluating a processor or a computing platform, but for domain specific algorithms, such as audio and speech CODEC, they are not enough. The solution here is to profile the algorithm and from the resulting statistics make the decisions. The statistics also suggest where to start optimizing the implementation of the algorithm. The statistics from the profi ling has been used to improve implementations of speech and audio coding algorithms, both in terms of the cycle cost and for memory efficiency, i.e. code and data memory.

In this thesis, we focus on designing memory efficient DSP processors based on instruction level acceleration methods and data type optimization techniques. Four major areas have been attacked in order to speed up execution and reduce memory The first one is instruction level acceleration, where consecutive instructions appear frequently and are merged together. By this merge the code memory size is reduced and execution becomes faster. Secondly, complex addressing schemes are solved by acceleration for address calculations, i.e. dedicated hardware are used for address calculations. The third area, data storage and precision, is speeded up by using a reduced floating point scheme. The number of bits is reduced compared to the normal IEEE 754 floating point standard. The result is a lower data memory requirement, yet enough precision for the application; an mp3 decoder. The fourth contribution is a compact way of storing data in a general CPU. By adding two custom instructions, one load and one store, the data memory efficiency can be improved without making the firmware complex. We have tried to make application specific instruction sets and processors and also tried to improve processors based on an available instruction set.

Experiences from this thesis can be used for DSP design for audio and speech applications. They can additionally be used as a reference to a general DSP processor design methodology.

Place, publisher, year, edition, pages
Linköping: Linköpings universitet, 2004. 48 p.
Series
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1093
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-24115 (URN)3691 (Local ID)91-7373-953-7 (ISBN)3691 (Archive number)3691 (OAI)
Presentation
2004-06-02, Alan Turing (Estraden), Linköpings universitet, Linköping, 13:15 (Swedish)
Opponent
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2013-11-26

Open Access in DiVA

No full text

Other links

Publisher's full texthttp://www.da.isy.liu.se/pubs/mikol/mikol-sips2002.pdf

Authority records BETA

Olausson, MikaelLiu, Dake

Search in DiVA

By author/editor
Olausson, MikaelLiu, Dake
By organisation
Computer EngineeringThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 247 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf