Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Hunger, R. Joham, M. |
| Copyright Year | 2010 |
| Description | Author affiliation: Associate Institute for Signal Processing, Technische Universität München, 80290 Munich, Germany (Hunger, R.; Joham, M.) |
| Abstract | We investigate the geometry of the feasible Quality of Service (QoS) region in the vector broadcast channel when the available transmit power is unbounded. It turns out that a complete description of the feasible QoS region attains its simplest form in the minimum mean square error (MMSE) domain although most of the literature handles feasibility in the SINR domain. As our main contribution, we show that the closure of the feasible MMSE region is a polytope corresponding to a hyper-cube that maybe is cropped by an additional half-space constraint. Interestingly, this half-space constraint is the only relevant one which separates feasibility from infeasibility and it reflects a lower bound on the sum MMSE. Under the assumption of regular channels, this lower bound does not depend on the channel realization but solely depends on the number of users and antennas deployed at the base station. Testing feasibility of given QoS targets is easily performed by first converting the QoS targets into upper bounds on the MMSEs and afterwards verifying that the sum of target MMSEs is larger than the difference between antennas at the base station and the number of users. The derived results can be used to decide whether a new user with given QoS requirements can be admitted to the system, and if not, how the requirements have to be adapted such that they become feasible. |
| Starting Page | 3478 |
| Ending Page | 3481 |
| File Size | 136092 |
| Page Count | 4 |
| File Format | |
| ISBN | 9781424442959 |
| ISSN | 15206149 |
| DOI | 10.1109/ICASSP.2010.5495959 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2010-03-14 |
| Publisher Place | USA |
| Access Restriction | Subscribed |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | Broadcasting Signal to noise ratio Quality of service Base stations Geometry Covariance matrix Signal processing Telephony Mean square error methods Testing feasibility check QoS region |
| Content Type | Text |
| Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|