2016
DOI: 10.1063/1.4953113
|View full text |Cite
|
Sign up to set email alerts
|

Modularized architecture of address generation units suitable for real-time processing MR data on an FPGA

Abstract: In this paper, we describe a modular approach to the design of an Address Generation Unit (AGU). The approach consists of development of a generic Address Generation Core (AGC) as a basic building block and the construction of an AGU from the AGCs. We illustrate this concept with AGUs capable of handling 2D- and 3D-structured data, and as well as their setup for executing 2D and 3D FFT algorithms on a Field Programmable Gate Array (FPGA). The AGUs developed using our proposed method are simple and easily expan… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 18 publications
(25 reference statements)
0
1
0
Order By: Relevance
“…The data that satisfy this requirement are defined to be regular in structure; otherwise, the data are defined to be irregular. 25 Although the MRI raw data acquired under some basic imaging sequences are regular, modern MRI experiments generate many more irregular data sets. The irregularity of the data not only prevents us from a direct application of the above algorithm but also complicates the data partition and allocation during parallel computations of a 2D FFT.…”
Section: A Review Of a Generic Parallel 2d Fft Algorithmmentioning
confidence: 99%
“…The data that satisfy this requirement are defined to be regular in structure; otherwise, the data are defined to be irregular. 25 Although the MRI raw data acquired under some basic imaging sequences are regular, modern MRI experiments generate many more irregular data sets. The irregularity of the data not only prevents us from a direct application of the above algorithm but also complicates the data partition and allocation during parallel computations of a 2D FFT.…”
Section: A Review Of a Generic Parallel 2d Fft Algorithmmentioning
confidence: 99%