Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
Optimum Circuits for Bit-Dimension Permutations
Linköping University, Department of Electrical Engineering, Computer Engineering. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0001-5739-3544
Univ Politecn Madrid, Spain.
Linköping University, Department of Electrical Engineering, Computer Engineering. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0003-3470-3911
2019 (English)In: IEEE Transactions on Very Large Scale Integration (vlsi) Systems, ISSN 1063-8210, E-ISSN 1557-9999, Vol. 27, no 5, p. 1148-1160Article in journal (Refereed) Published
Abstract [en]

In this paper, we present a systematic approach to design hardware circuits for bit-dimension permutations. The proposed approach is based on decomposing any bit-dimension permutation into elementary bit-exchanges. Such decomposition is proven to achieve the theoretical minimum number of delays required for the permutation. This offers optimum solutions for multiple well-known problems in the literature that make use of bit-dimension permutations. This includes the design of permutation circuits for the fast Fourier transform, bit reversal, matrix transposition, stride permutations, and Viterbi decoders.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2019. Vol. 27, no 5, p. 1148-1160
Keywords [en]
Bit-dimension permutation; bit reversal; data management; fast Fourier transform (FFT); matrix transposition; pipelined architecture; streaming data; Viterbi decoder
National Category
Other Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:liu:diva-158360DOI: 10.1109/TVLSI.2019.2892322ISI: 000466226400014Scopus ID: 2-s2.0-85065104805OAI: oai:DiVA.org:liu-158360DiVA, id: diva2:1333835
Note

Funding Agencies|Swedish ELLIIT Program; FPU Fellowship of the Spanish Ministry of Education [AP2005-0544]; Spanish National Research and Development Program [TEC2014-53815-R]; Madrid Regional Government [S2013/ICE3000]

Available from: 2019-07-02 Created: 2019-07-02 Last updated: 2019-10-22Bibliographically approved

Open Access in DiVA

fulltext(1647 kB)10 downloads
File information
File name FULLTEXT01.pdfFile size 1647 kBChecksum SHA-512
d6e67dc688085f80991bd45badc9f424806f973fac962f851a9abf969da9a2f286bae113922da67f4d8f4c2900f250bead1c6b64a584509e4fd007d855b81541
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Garrido, MarioGustafsson, Oscar
By organisation
Computer EngineeringFaculty of Science & Engineering
In the same journal
IEEE Transactions on Very Large Scale Integration (vlsi) Systems
Other Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 10 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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