Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Kyeongyeon Kim Kitaek Bae Ho Yang |
| Copyright Year | 2012 |
| Description | Author affiliation: SAIT, Mt. 14-1, Nongseo-dong, Giheung-gu, Yongin-si Gyeonggi-do, South Korea (Kyeongyeon Kim; Kitaek Bae; Ho Yang) |
| Abstract | Signal space diversity (SSD) has been exploited to improve detection performance of quadrature amplitude modulation (QAM) over fading channels and recently adopted for the second generation of digital video broadcasting system (i.e., DVB-T2). To fully exploit SSD, maximum likelihood (ML) detection has been used for soft-demapping. Because of exponential complexity of the ML detector or its max-log approximated detection (i.e., full search algorithm), sub-region based soft-demapping algorithms are proposed. Those algorithms still have high complexity due to two dimensional Euclidean distance calculation. In this paper, we propose one-dimensional soft-demapping algorithms with decorrelation. By reformulating a received rotated QAM signal as two received PAM signals, the ML detection for rotated QAM is simplified to a minimum mean squared error (MMSE) decorrelation followed by per channel soft-demapping under Gaussian assumption on post detected interference. In addition, interference cancellation (IC) is considered to reduce residual interference after MMSE decorrelation. For 256 QAM with 4/5 code rate in memoryless Rayleigh channels with/without erasure events, the performance gap between the proposed one-dimensional soft-demapping with decorrelation and the full search algorithm is within 0.1dB at $10^{−4}$ bit error rate (BER), while the complexity is less than 1% of the full search algorithm. |
| Starting Page | 787 |
| Ending Page | 791 |
| File Size | 235208 |
| Page Count | 5 |
| File Format | |
| ISBN | 9781457720703 |
| e-ISBN | 9781457720710 |
| DOI | 10.1109/CCNC.2012.6181165 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2012-01-14 |
| Publisher Place | USA |
| Access Restriction | Subscribed |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | Quadrature amplitude modulation Complexity theory Decorrelation Bit error rate Approximation algorithms Interference Digital video broadcasting |
| 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...
|