Logo
    • English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • English 
    • English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • Login
View Item 
  •   University of Thessaly Institutional Repository
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • View Item
  •   University of Thessaly Institutional Repository
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
Institutional repository
All of DSpace
  • Communities & Collections
  • By Issue Date
  • Authors
  • Titles
  • Subjects

On multicast beamforming and admission control for UMTS-LTE

Thumbnail
Author
Matskani, E.; Sidiropoulos, N. D.; Tassiulas, L.
Date
2008
DOI
10.1109/ICASSP.2008.4518121
Keyword
Admission control
Beamforming
Multicasting
UMTS-LTE
Acoustics
Adaptive algorithms
Boolean functions
Computer networks
Industrial engineering
Labeling
Labels
Parallel algorithms
Polynomial approximation
Signal processing
Speech
Convex approximations
Multicast
Approximation algorithms
Metadata display
Abstract
Transmit beamforming for physical layer multicasting is emerging as an appealing transmission modality for next-generation cellular wireless systems, notably UMTS-LTE. Optimal design of the transmit beamformer(s) from a quality of service perspective is a hard computational problem; however, convex approximation tools have been shown to yield high-quality approximate solutions. Recently, Lozano proposed a particularly simple adaptive multicast beamforming algorithm that aims to serve a certain percentage of users. In parallel, convex approximation algorithms were developed for the more general problem of joint co-channel multicast beamforming and admission control. In this paper, we focus on the important (in view of recent standardization activity) special case of a single multicast group, and put the two approaches to the test. Through simple examples, we pinpoint issues regarding convergence of Lozano's algorithm. In numerical experiments with measured channel data, we show that a convex approximation approach is preferable performance-wise. At the same time, we find merits in the simplicity of Lozano's approach, and suggest a way to improve its performance. ©2008 IEEE.
URI
http://hdl.handle.net/11615/30784
Collections
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ. [19735]
htmlmap 

 

Browse
All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister (MyDspace)
Help Contact
DepositionAboutHelpContact Us
Choose LanguageAll of DSpace
EnglishΕλληνικά
htmlmap