Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Kato, K. Fukawa, K. Yamada, R. Suzuki, H. Okamoto, N. |
| Copyright Year | 2014 |
| Description | Author affiliation: Tokyo Inst. of Technol., Tokyo, Japan (Fukawa, K.; Suzuki, H.) || Telecommun. & Image Technol. Labs., Sharp Corp., Chiba, Japan (Kato, K.; Yamada, R.; Okamoto, N.) |
| Abstract | As a signal detection method for multiple-input multiple-output (MIMO) communications, this paper proposes multi-stream constrained search (MSCS) that achieves very good trade-off between computational complexity and bit error rate (BER) performance. The proposed method sets a minimum mean-squared error (MMSE) detection result to the starting point. From this point, MSCS searches for signal candidates in multi-dimensions of the noise enhancement from which the MMSE detection suffers. In the search, some streams of the signal candidates are fixed at constellation points. Among the obtained signal candidates, the detected signal is selected as the one that minimizes the log likelihood function. Furthermore, this paper proposes stream selection-MSCS (S-MSCS) that selects the constrained streams under the criterion of small equivalent amplitudes of channels caused by the MMSE detection. Setting the number of patterns of constrained streams to just one can reduce complexity, and selecting the constrained streams on the basis of the equivalent amplitude can maintain excellent BER performance. Computer simulations under 8 × 8 MIMO channel conditions with 16QAM demonstrate that S-MSCS can maintain only 0.5 dB degradation of the average BER performance from the maximum likelihood detection (MLD), while reducing the computational complexity to about one third of that of QR decomposition with M algorithm (QRM)-MLD. |
| Starting Page | 4418 |
| Ending Page | 4423 |
| File Size | 134499 |
| Page Count | 6 |
| File Format | |
| ISBN | 9781479920037 |
| DOI | 10.1109/ICC.2014.6884016 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2014-06-10 |
| Publisher Place | Australia |
| Access Restriction | Subscribed |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | Vectors Computational complexity Noise MIMO Bit error rate Modulation |
| 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...
|