A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes
نویسنده:
ناشر:
سال
: 2014شناسه الکترونیک: 10.1109/ITSC.2014.6957974
کلیدواژه(گان): Blood flow,Brain,Safety,Spectroscopy,Thumb,Visualization
کالکشن
:
-
آمار بازدید
A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes
Show full item record
| contributor author | Pawar, S. , Ramchandran, K. | |
| date accessioned | 2020-03-12T20:31:21Z | |
| date available | 2020-03-12T20:31:21Z | |
| date issued | 2014 | |
| identifier other | 6875154.pdf | |
| identifier uri | https://libsearch.um.ac.ir:443/fum/handle/fum/1017253?locale-attribute=fa | |
| format | general | |
| language | English | |
| publisher | IEEE | |
| title | A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes | |
| type | Conference Paper | |
| contenttype | Metadata Only | |
| identifier padid | 8141278 | |
| subject keywords | Blood flow | |
| subject keywords | Brain | |
| subject keywords | Safety | |
| subject keywords | Spectroscopy | |
| subject keywords | Thumb | |
| subject keywords | Visualization | |
| identifier doi | 10.1109/ITSC.2014.6957974 | |
| journal title | nformation Theory (ISIT), 2014 IEEE International Symposium on | |
| filesize | 2619458 | |
| citations | 0 |