Show simple item record

A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes

contributor authorPawar, S. , Ramchandran, K.
date accessioned2020-03-12T20:31:21Z
date available2020-03-12T20:31:21Z
date issued2014
identifier other6875154.pdf
identifier urihttps://libsearch.um.ac.ir:443/fum/handle/fum/1017253?show=full
formatgeneral
languageEnglish
publisherIEEE
titleA robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes
typeConference Paper
contenttypeMetadata Only
identifier padid8141278
subject keywordsBlood flow
subject keywordsBrain
subject keywordsSafety
subject keywordsSpectroscopy
subject keywordsThumb
subject keywordsVisualization
identifier doi10.1109/ITSC.2014.6957974
journal titlenformation Theory (ISIT), 2014 IEEE International Symposium on
filesize2619458
citations0


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record