Cited time in webofscience Cited time in scopus

Full metadata record

DC Field Value Language
dc.contributor.author Lee, Jaeseok ko
dc.contributor.author Choi, Jun Won ko
dc.contributor.author Shim, Byonghyo ko
dc.date.available 2017-07-05T08:33:05Z -
dc.date.created 2017-04-10 -
dc.date.issued 2016-10 -
dc.identifier.citation Journal of Communications and Networks, v.18, no.5, pp.699 - 712 -
dc.identifier.issn 1229-2370 -
dc.identifier.uri http://hdl.handle.net/20.500.11750/2184 -
dc.description.abstract Recently, greedy algorithm has received much attention as a cost-effective means to reconstruct the sparse signals from compressed measurements. Much of previous work has focused on the investigation of a single candidate to identify the support (index set of nonzero elements) of the sparse signals. Well-known drawback of the greedy approach is that the chosen candidate is often not the optimal solution due to the myopic decision in each iteration. In this paper, we propose a tree search based sparse signal recovery algorithm referred to as the tree search matching pursuit (TSMP). Two key ingredients of the proposed TSMP algorithm to control the computational complexity are the pre-selection to put a restriction on columns of the sensing matrix to be investigated and the tree pruning to eliminate unpromising paths from the search tree. In numerical simulations of Internet of Things (IoT) environments, it is shown that TSMP outperforms conventional schemes by a large margin. © 2011 KICS. -
dc.language English -
dc.publisher Korea Information and Communications Society -
dc.title Sparse Signal Recovery via Tree Search Matching Pursuit -
dc.type Article -
dc.identifier.doi 10.1109/JCN.2016.000100 -
dc.identifier.wosid 000388681600003 -
dc.identifier.scopusid 2-s2.0-85011965752 -
dc.type.local Article(Overseas) -
dc.type.rims ART -
dc.description.journalClass 1 -
dc.identifier.kciid ART002162872 -
dc.contributor.nonIdAuthor Choi, Jun Won -
dc.contributor.nonIdAuthor Shim, Byonghyo -
dc.identifier.citationVolume 18 -
dc.identifier.citationNumber 5 -
dc.identifier.citationStartPage 699 -
dc.identifier.citationEndPage 712 -
dc.identifier.citationTitle Journal of Communications and Networks -
dc.type.journalArticle Article -
dc.description.isOpenAccess N -
dc.subject.keywordAuthor Compressive sensing -
dc.subject.keywordAuthor greedy algorithm -
dc.subject.keywordAuthor sparse recovery -
dc.subject.keywordAuthor tree pruning -
dc.subject.keywordAuthor tree search -
dc.subject.keywordPlus Compressive Sensing -
dc.subject.keywordPlus Cost Effectiveness -
dc.subject.keywordPlus Greedy Algorithm -
dc.subject.keywordPlus Greedy Algorithms -
dc.subject.keywordPlus Internet of Things -
dc.subject.keywordPlus Iterative Methods -
dc.subject.keywordPlus RECONSTRUCTION -
dc.subject.keywordPlus RECOVERY -
dc.subject.keywordPlus Signal Reconstruction -
dc.subject.keywordPlus Sparse Recovery -
dc.subject.keywordPlus Sparse Recovery -
dc.subject.keywordPlus Tree Pruning -
dc.subject.keywordPlus Tree Pruning -
dc.subject.keywordPlus Tree Search -
dc.subject.keywordPlus Tree Search -
dc.subject.keywordPlus Tree Search -
dc.subject.keywordPlus Trees (Mathematics) -
Files in This Item:

There are no files associated with this item.

Appears in Collections:
Department of Electrical Engineering and Computer Science ETC 1. Journal Articles

qrcode

  • twitter
  • facebook
  • mendeley

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE