Journal article
A gridding algorithm for efficient density compensation of arbitrarily sampled fourier-domain data
- Abstract:
- Uniformly sampled data is sometimes not directly available in engineering applications ranging from synthetic aperture radars to magnetic resonance imaging. However, certain signal processing techniques such as the fast Fourier transform cannot be applied to non-equispaced data. It is therefore desirable to resample the data on a regular grid. Various interpolation schemes have been proposed for this purpose, such as gridding reconstruction. A computationally expensive step in the gridding algorithm is the estimation of the data sampling density. This paper presents a method for improving both the efficiency and the quality of gridding density estimation based on partial Voronoi diagrams. It is shown that significantly higher computational efficiency is achieved by this method over the existing schemes. Lower spreading and greater sidelobe suppression of the point spread function demonstrate the superiority of the proposed reconstruction method.
Actions
Access Document
- Publisher copy:
- 10.1109/SARNOF.2005.1426528
Authors
- Journal:
- 2005 IEEE/Sarnoff Symposium on Advances in Wired and Wireless Communication More from this journal
- Volume:
- 2005
- Pages:
- 125-128
- Publication date:
- 2005-01-01
- DOI:
- Language:
-
English
- Keywords:
- Pubs id:
-
pubs:395782
- UUID:
-
uuid:13cb2c08-775b-4122-9737-4592cca8da5f
- Local pid:
-
pubs:395782
- Source identifiers:
-
395782
- Deposit date:
-
2013-11-17
- ARK identifier:
Terms of use
- Copyright date:
- 2005
If you are the owner of this record, you can report an update to it here: Report update to this record