On distributed space-time filtering

TitleOn distributed space-time filtering
Publication TypeConference Paper
Year of Publication2005
AuthorsYu, S., and R. Schober
Conference NameGlobal Telecommunications Conference, 2005. GLOBECOM '05. IEEE
Pagination6 pp. -3329
Date Publisheddec.
Keywordsdistributed space-time filtering, filtering theory, frequency-nonselective channel, Grassmannian frames, node cooperation, optimization problem, radio networks, signature filter vectors, space-time codes, telecommunication channels, wireless networks

Distributed space-time filtering (DSTF) has been recently proposed as a means for node cooperation in wireless networks. In this paper, we derive a new optimization criterion for the node signature filter vectors (SFVs) used in DSTF and we provide two practical design methods for sets of SFVs. We show that for the special case of a frequency-nonselective channel and two active nodes the SFV optimization problem is related to the design of Grassmannian frames. This relation allows us to derive a lower bound for the performance penalty incurred by the distributed implementation. We show that SFV sets designed with the proposed methods perform close to this lower bound and achieve a significant performance gain over previously proposed designs. Simulation results confirm the excellent performance of the proposed SFV sets in frequency-nonselective and frequency-selective channels


a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia