Matches in SemOpenAlex for { <https://semopenalex.org/work/W2116962375> ?p ?o ?g. }
Showing items 1 to 96 of
96
with 100 items per page.
- W2116962375 abstract "Given an n-length input signal x, it is well known that its Discrete Fourier Transform (DFT), X, can be computed in O(nlogn) complexity using a Fast Fourier Transform. If the spectrum X is exactly k-sparse (where k <;<; n), can we do better? We show that asymptotically in k and n, when k is sub-linear in n (i.e., k ∝ nδ where 0 <; δ <; 1), and the support of the non-zero DFT coefficients is uniformly random, we can exploit this sparsity in two fundamental ways (i) sample complexity: we need only M = rk deterministically chosen samples of the input signal x (where r <; 4 when 0 <; δ <; 0.99); and (ii) computational complexity: we can reliably compute the DFT X using O(k log k) operations, where the constants in the big Oh are small. Our algorithm succeeds with high probability, with the probability of failure vanishing to zero asymptotically in the number of samples acquired, M. Our approach is based on filterless subsampling of the input signal x using a small set of carefully chosen uniform subsampling patterns guided by the Chinese Remainder Theorem (CRT). Specifically, our subsampling operation on x is designed to create aliasing patterns on the spectrum X that look like parity-check constraints of good erasure-correcting sparse-graph codes. We show how computing the sparse DFT X is equivalent to decoding of these sparse-graph codes and is low in both sample complexity and decoding complexity. We accordingly dub our algorithm the FFAST (Fast Fourier Aliasing-based Sparse Transform) algorithm. In our analysis, we rigorously connect our CRT based graph constructions to random sparse-graph codes based on a balls-and-bins model and analyze the convergence behavior of the latter using well-studied density evolution techniques from coding theory. We provide simulation results in Section IV that corroborate our theoretical findings, and validate the empirical performance of the FFAST algorithm." @default.
- W2116962375 created "2016-06-24" @default.
- W2116962375 creator A5030620564 @default.
- W2116962375 creator A5030647153 @default.
- W2116962375 date "2013-07-01" @default.
- W2116962375 modified "2023-09-27" @default.
- W2116962375 title "Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity" @default.
- W2116962375 cites W1999763281 @default.
- W2116962375 cites W2031425559 @default.
- W2116962375 cites W2107625832 @default.
- W2116962375 cites W2113638573 @default.
- W2116962375 cites W2115104320 @default.
- W2116962375 cites W2116962375 @default.
- W2116962375 cites W2127271355 @default.
- W2116962375 cites W2128131274 @default.
- W2116962375 cites W2128765501 @default.
- W2116962375 cites W2129638195 @default.
- W2116962375 cites W2146509513 @default.
- W2116962375 cites W2158537680 @default.
- W2116962375 cites W2169732368 @default.
- W2116962375 cites W2554333597 @default.
- W2116962375 cites W4250955649 @default.
- W2116962375 doi "https://doi.org/10.1109/isit.2013.6620269" @default.
- W2116962375 hasPublicationYear "2013" @default.
- W2116962375 type Work @default.
- W2116962375 sameAs 2116962375 @default.
- W2116962375 citedByCount "49" @default.
- W2116962375 countsByYear W21169623752013 @default.
- W2116962375 countsByYear W21169623752014 @default.
- W2116962375 countsByYear W21169623752015 @default.
- W2116962375 countsByYear W21169623752016 @default.
- W2116962375 countsByYear W21169623752017 @default.
- W2116962375 countsByYear W21169623752018 @default.
- W2116962375 countsByYear W21169623752019 @default.
- W2116962375 countsByYear W21169623752020 @default.
- W2116962375 countsByYear W21169623752021 @default.
- W2116962375 countsByYear W21169623752022 @default.
- W2116962375 crossrefType "proceedings-article" @default.
- W2116962375 hasAuthorship W2116962375A5030620564 @default.
- W2116962375 hasAuthorship W2116962375A5030647153 @default.
- W2116962375 hasBestOaLocation W21169623752 @default.
- W2116962375 hasConcept C102519508 @default.
- W2116962375 hasConcept C11413529 @default.
- W2116962375 hasConcept C114614502 @default.
- W2116962375 hasConcept C118615104 @default.
- W2116962375 hasConcept C134306372 @default.
- W2116962375 hasConcept C136536468 @default.
- W2116962375 hasConcept C154945302 @default.
- W2116962375 hasConcept C179799912 @default.
- W2116962375 hasConcept C181789720 @default.
- W2116962375 hasConcept C203024314 @default.
- W2116962375 hasConcept C33923547 @default.
- W2116962375 hasConcept C4069607 @default.
- W2116962375 hasConcept C41008148 @default.
- W2116962375 hasConcept C57273362 @default.
- W2116962375 hasConcept C57733114 @default.
- W2116962375 hasConcept C63553672 @default.
- W2116962375 hasConcept C75172450 @default.
- W2116962375 hasConcept C76563020 @default.
- W2116962375 hasConceptScore W2116962375C102519508 @default.
- W2116962375 hasConceptScore W2116962375C11413529 @default.
- W2116962375 hasConceptScore W2116962375C114614502 @default.
- W2116962375 hasConceptScore W2116962375C118615104 @default.
- W2116962375 hasConceptScore W2116962375C134306372 @default.
- W2116962375 hasConceptScore W2116962375C136536468 @default.
- W2116962375 hasConceptScore W2116962375C154945302 @default.
- W2116962375 hasConceptScore W2116962375C179799912 @default.
- W2116962375 hasConceptScore W2116962375C181789720 @default.
- W2116962375 hasConceptScore W2116962375C203024314 @default.
- W2116962375 hasConceptScore W2116962375C33923547 @default.
- W2116962375 hasConceptScore W2116962375C4069607 @default.
- W2116962375 hasConceptScore W2116962375C41008148 @default.
- W2116962375 hasConceptScore W2116962375C57273362 @default.
- W2116962375 hasConceptScore W2116962375C57733114 @default.
- W2116962375 hasConceptScore W2116962375C63553672 @default.
- W2116962375 hasConceptScore W2116962375C75172450 @default.
- W2116962375 hasConceptScore W2116962375C76563020 @default.
- W2116962375 hasLocation W21169623751 @default.
- W2116962375 hasLocation W21169623752 @default.
- W2116962375 hasLocation W21169623753 @default.
- W2116962375 hasOpenAccess W2116962375 @default.
- W2116962375 hasPrimaryLocation W21169623751 @default.
- W2116962375 hasRelatedWork W1481532171 @default.
- W2116962375 hasRelatedWork W1990333983 @default.
- W2116962375 hasRelatedWork W2083788924 @default.
- W2116962375 hasRelatedWork W2095636570 @default.
- W2116962375 hasRelatedWork W2133977903 @default.
- W2116962375 hasRelatedWork W2152751081 @default.
- W2116962375 hasRelatedWork W2354756589 @default.
- W2116962375 hasRelatedWork W2625136784 @default.
- W2116962375 hasRelatedWork W4206595481 @default.
- W2116962375 hasRelatedWork W2554127067 @default.
- W2116962375 isParatext "false" @default.
- W2116962375 isRetracted "false" @default.
- W2116962375 magId "2116962375" @default.
- W2116962375 workType "article" @default.