Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Look Ahead Parallel Pursuit
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0003-2638-6047
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-7926-5081
2011 (English)In: 2011 IEEE Swedish Communication Technologies Workshop, Swe-CTW 2011, 2011, 114-117 p.Conference paper, Published paper (Refereed)
Abstract [en]

We endeavor to improve compressed sensing reconstruction performance of parallel pursuit algorithms. In an iteration, standard parallel pursuit algorithms use a support-set expansion by a fixed number of coefficients, leading to restricted performance. To achive a better performance, we develop a look ahead strategy that adaptively chooses the best number of coefficients. We develop a new algorithm which we call look ahead parallel pursuit, where a look ahead strategy is invoked on a minimal residual norm criterion. The new algorithm provides a trade-off between performance and complexity.

Place, publisher, year, edition, pages
2011. 114-117 p.
Keyword [en]
compressed sensing, greedy pursuit algorithms
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-60017DOI: 10.1109/Swe-CTW.2011.6082477Scopus ID: 2-s2.0-83755172588ISBN: 978-145771878-6 (print)OAI: oai:DiVA.org:kth-60017DiVA: diva2:477121
Conference
2011 IEEE Swedish Communication Technologies Workshop, Swe-CTW 2011. Stockholm. 19 October 2011 - 21 October 2011
Note
QC 20120113Available from: 2012-01-12 Created: 2012-01-12 Last updated: 2012-02-29Bibliographically approved
In thesis
1. Compressed Sensing: Algorithms and Applications
Open this publication in new window or tab >>Compressed Sensing: Algorithms and Applications
2012 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

The theoretical problem of finding the solution to an underdeterminedset of linear equations has for several years attracted considerable attentionin the literature. This problem has many practical applications.One example of such an application is compressed sensing (cs), whichhas the potential to revolutionize how we acquire and process signals. Ina general cs setup, few measurement coefficients are available and thetask is to reconstruct a larger, sparse signal.In this thesis we focus on algorithm design and selected applicationsfor cs. The contributions of the thesis appear in the following order:(1) We study an application where cs can be used to relax the necessityof fast sampling for power spectral density estimation problems. Inthis application we show by experimental evaluation that we can gainan order of magnitude in reduced sampling frequency. (2) In order toimprove cs recovery performance, we extend simple well-known recoveryalgorithms by introducing a look-ahead concept. From simulations it isobserved that the additional complexity results in significant improvementsin recovery performance. (3) For sensor networks, we extend thecurrent framework of cs by introducing a new general network modelwhich is suitable for modeling several cs sensor nodes with correlatedmeasurements. Using this signal model we then develop several centralizedand distributed cs recovery algorithms. We find that both thecentralized and distributed algorithms achieve a significant gain in recoveryperformance compared to the standard, disconnected, algorithms.For the distributed case, we also see that as the network connectivity increases,the performance rapidly converges to the performance of thecentralized solution.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2012. ix, 35 p.
Series
Trita-EE, ISSN 1653-5146
Keyword
compressed sensing, greedy pursuits, subspace pursuit, orthogonal matching pursuit, power spectral density estimation, distributed compressed sensing
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-90074 (URN)978-91-7501-269-8 (ISBN)
Presentation
2012-03-09, Q2, KTH, Osquldas väg 10, Stockholm, 15:58 (English)
Opponent
Supervisors
Funder
ICT - The Next Generation
Note

QC 20120229

Available from: 2012-02-29 Created: 2012-02-17 Last updated: 2013-04-15Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Saikat, ChatterjeeSkoglund, Mikael

Search in DiVA

By author/editor
Sundman, DennisSaikat, ChatterjeeSkoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 74 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf