mdh.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Implementation of digit-serial LDI allpass filters using cyclic scheduling
Mälardalens högskola, Institutionen för datavetenskap och elektronik.
(Engelska)Manuskript (Övrigt vetenskapligt)
Nationell ämneskategori
Annan teknik
Identifikatorer
URN: urn:nbn:se:mdh:diva-4021OAI: oai:DiVA.org:mdh-4021DiVA, id: diva2:120548
Tillgänglig från: 2006-09-06 Skapad: 2006-09-06 Senast uppdaterad: 2015-10-12Bibliografiskt granskad
Ingår i avhandling
1. Implementation of digital-serial LDI/LDD allpass filters
Öppna denna publikation i ny flik eller fönster >>Implementation of digital-serial LDI/LDD allpass filters
2006 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

In this thesis, digit-serial implementation of recursive digital filters is considered. The theories presented can be applied to any recursive digital filter, and in this thesis we study the lossless discrete integrator (LDI) allpass filter. A brief introduction regarding suppression of limit cycles at finite wordlength conditions is given, and an extended stability region, where the second-order LDI allpass filter is free from quantization limit cycles, is presented.

The realization of digit-serial processing elements, i.e., digit-serial adders and multipliers, is studied. A new digit-serial hybrid adder (DSHA) is presented. The adder can be pipelined to the bit level with a short arithmetic critical path, which makes it well suited when implementing high-throughput recursive digital filters.

Two digit-serial multipliers which can be pipelined to the bit level are considered. It is concluded that a digit-serial/parallelmultiplier based on shift-accumulation(DSAAM) is a good candidate when implementing recursive digital systems, mainly due to low latency. Furthermore, our study shows that low latency will lead to higher throughput and lower power consumption.

Scheduling of recursive digit-serial algorithms is studied. It is concluded that implementation issues such as latency and arithmetic critical path are usually required before scheduling considerations can be made. Cyclic scheduling using digit-serial arithmetics is also considered. It is shown that digit-serial cyclic scheduling is very attractive for high-throughput implementations.

Ort, förlag, år, upplaga, sidor
Västerås: Institutionen för Datavetenskap och Elektronik, 2006. s. 154
Serie
Mälardalen University Press Dissertations, ISSN 1651-4238 ; 23
Nationell ämneskategori
Annan elektroteknik och elektronik
Forskningsämne
Elektronik
Identifikatorer
urn:nbn:se:mdh:diva-155 (URN)91-85485-07-1 (ISBN)
Disputation
2006-01-25, Lambda, Västerås, 13:15
Opponent
Tillgänglig från: 2006-09-06 Skapad: 2006-09-06

Open Access i DiVA

Fulltext saknas i DiVA

Av organisationen
Institutionen för datavetenskap och elektronik
Annan teknik

Sök vidare utanför DiVA

GoogleGoogle Scholar

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 29 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf