2020
DOI: 10.1109/tcsi.2020.2987736
|View full text |Cite
|
Sign up to set email alerts
|

Continuous-Flow Matrix Transposition Using Memories

Abstract: 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 a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 30 publications
0
5
0
Order By: Relevance
“…Thus, each memory fits in a 36 Kb BRAM [20] and 4 BRAMs are enough for storing the data. The read and write address of the data memories are generated with a circular counter as in [19].…”
Section: Implementation and Experimental Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Thus, each memory fits in a 36 Kb BRAM [20] and 4 BRAMs are enough for storing the data. The read and write address of the data memories are generated with a circular counter as in [19].…”
Section: Implementation and Experimental Resultsmentioning
confidence: 99%
“…It can be proved that σ mem • σ −1 mem = Id. To calculate the permutation σ mem with memories, it must be fulfilled that [19]…”
Section: B Conflict-free Accessmentioning
confidence: 99%
See 1 more Smart Citation
“…The NPU, driven by the input AER packets, works in an event-triggered approach works. Spike routers translate spikes into weighted latency information by accessing storage and SDRAM (Stankovic and Milenkovic, 2015 ; Goossens et al, 2016 ; Ecco and Ernst, 2017 ; Li et al, 2017 ; Garrido and Pirsch, 2020 ; Benchehida et al, 2022 ).…”
Section: Brain-like Computing Chipsmentioning
confidence: 99%
“…However, the method was only optimized for multi-dimensional FFT algorithm, was not suitable for spaceborne SAR algorithm. Mario et al [31] optimized the matrix transposition in a continuous flow in a hardware system. However, the method was not suitable for non-squared matrices.…”
Section: Introductionmentioning
confidence: 99%