Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Ottawa

$30,000.00

Application of basis selection algorithms to wireless communications systems

EF 2006-07

Résumé
Efficient signal representations require efficient signal decomposition algorithms. The problem of basis selection for signal decomposition consists of determining a small subset of vectors chosen from a large redundant set of vectors to match a given data. The basis selection algorithms are generally treated as a part of the specific application for which they are used. These applications include time/frequency representations of speech coding, spectral estimation, video coding and channel estimation. Finding an optimal solution using an exhaustive search is infeasible, suboptimal methods that require lower computational complexity have been proposed. Among these suboptimum techniques we have focused on sequential basis selection (SBS) in particular matching pursuit algorithms which have lower levels of computational complexity than the conventional least squares methods and work well especially in applications with sparsity properties.   The objective of our proposed research is to improve the performance of these SBS algorithms and extent their applications to more complex wireless applications. We are working on optimizing the associated dictionary structures. This corresponds to a training sequence design for channel estimation, array structure design for angle of arrival detection and code structure design for multi-user detection. By optimizing the dictionary, the requirement of a combinatorial search in the SBS algorithm is eliminated and the  complexity can be further reduced. Extending the wireless applications which utilize SBS algorithms will be done for multiple input multiple output (MIMO) systems, and for radiolocalization systems. MIMO systems are of interest due to their ability to provide substantial gains in capacity and quality. Similarly, accurately radiolocating a terminal is essential for efficient network operation of modern wireless systems. Many important results can be obtained by applying the overcomplete signal expansions to such systems due to the low complexities of the SBS algorithms. In addition to estimation of MIMO channels and geolocation, other potential applications we will investigate are higher dimensional angle of arrival estimation, and decoder design in channel coding systems.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
3917-2006
Name nom
Yongacoglu, Abbas
Department département
Information Technology and Engineering, School of
Organization id
28
Institution établissement
University of Ottawa
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2006
Competition year année de concours
2006
Award amount
30000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
334
Committee name en
Commun.,Computers & Components
Committee name fr
Communic.,ordin. et composants
Area of application code
805
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Communications technologies (satellites, radar, etc.)
Area of application fr
Technologie des télécommunications (satellites, radar,etc.)
Research subject code
2525
Research subject group en
Electrical and electronic engineering
Research subject group fr
Génie électrique et électronique
Research subject en
Wireless communication systems
Research subject fr
Systèmes de télécommunications sans fil
Partie
1
Nb partie
5
Application title
Application of basis selection algorithms to wireless communications systems
Keyword
NA
Application summary
Efficient signal representations require efficient signal decomposition algorithms. The problem of basis selection for signal decomposition consists of determining a small subset of vectors chosen from a large redundant set of vectors to match a given data. The basis selection algorithms are generally treated as a part of the specific application for which they are used. These applications include time/frequency representations of speech coding, spectral estimation, video coding and channel estimation. Finding an optimal solution using an exhaustive search is infeasible, suboptimal methods that require lower computational complexity have been proposed. Among these suboptimum techniques we have focused on sequential basis selection (SBS) in particular matching pursuit algorithms which have lower levels of computational complexity than the conventional least squares methods and work well especially in applications with sparsity properties.   The objective of our proposed research is to improve the performance of these SBS algorithms and extent their applications to more complex wireless applications. We are working on optimizing the associated dictionary structures. This corresponds to a training sequence design for channel estimation, array structure design for angle of arrival detection and code structure design for multi-user detection. By optimizing the dictionary, the requirement of a combinatorial search in the SBS algorithm is eliminated and the  complexity can be further reduced. Extending the wireless applications which utilize SBS algorithms will be done for multiple input multiple output (MIMO) systems, and for radiolocalization systems. MIMO systems are of interest due to their ability to provide substantial gains in capacity and quality. Similarly, accurately radiolocating a terminal is essential for efficient network operation of modern wireless systems. Many important results can be obtained by applying the overcomplete signal expansions to such systems due to the low complexities of the SBS algorithms. In addition to estimation of MIMO channels and geolocation, other potential applications we will investigate are higher dimensional angle of arrival estimation, and decoder design in channel coding systems.