> Details

Garrido, Mario [Author]; Pirsch, Peter [Author]

Continuous-Flow Matrix Transposition Using Memories - [published Version]

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: Text; E-Article
  • Title: Continuous-Flow Matrix Transposition Using Memories
  • Contributor: Garrido, Mario [Author]; Pirsch, Peter [Author]
  • Published: New York, NY : Institute of Electrical and Electronics Engineers, 2020
  • Published in: IEEE Transactions on Circuits and Systems I: Regular Papers 67 (2020), Nr. 9 ; IEEE Transactions on Circuits and Systems I: Regular Papers
  • Issue: published Version
  • Language: English
  • DOI: https://doi.org/10.15488/12639; https://doi.org/10.1109/TCSI.2020.2987736
  • ISSN: 1549-8328
  • Keywords: Electronics engineering ; Square matrices ; Continuous flow ; Matrix algebra ; SDRAM ; pipelined architecture ; external memory ; Control signal ; Fundamental theory ; Electrical engineering ; Matrix transposition ; Continuous flows
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: In this paper, we analyze how to calculate the matrix transposition in continuous flow by using a memory or group of memories. The proposed approach studies this problem for specific conditions such as square and non-square matrices, use of limited access memories and use of several memories in parallel. Contrary to previous approaches, which are based on specific cases or examples, the proposed approach derives the fundamental theory involved in the problem of matrix transposition in a continuous flow. This allows for obtaining the exact equations for the read and write addresses of the memories and other control signals in the circuits. Furthermore, the cases that involve non-square matrices, which have not been studied in detail in the literature, are analyzed in depth in this paper. Experimental results show that the proposed approach is capable of transposing matrices of 8192 times 8192 32-bit data received in series at a rate of 200 mega samples per second, which doubles the throughput of previous approaches. ¬© 2004-2012 IEEE.
  • Access State: Open Access
  • Rights information: Attribution (CC BY)