repository
계층적 군집 나무들을 통한 1 비트 구형 복호화
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 홍송남 | - |
| dc.contributor.author | 김선호 | - |
| dc.date.accessioned | 2019-04-01T16:41:10Z | - |
| dc.date.available | 2019-04-01T16:41:10Z | - |
| dc.date.issued | 2019-02 | - |
| dc.identifier.other | 28882 | - |
| dc.identifier.uri | https://dspace.ajou.ac.kr/handle/2018.oak/15019 | - |
| dc.description | 학위논문(석사)--아주대학교 일반대학원 :전자공학과,2019. 2 | - |
| dc.description.tableofcontents | CHAPTER I. INTRODUCTION 1 1.1 Background and motivation 1 1.2 Thesis contributions 3 1.3 Thesis organization 5 CHAPTER II. SYSTEM MODEL 6 CHAPTER III. CONVENTIONAL DECTECTION FOR UPLINK MASSIVE MIMO SYSTEMS WITH ONE-BIT ADCS 9 3.1 Weighted Minimum Hamming Distance Decoding 9 3.2 Hierarchical Code Partitioning 18 3.2-1 Computational complexity analysis 26 CHAPTER V. PROPOSED LOW-COMPLEXITY DECODING ALGORITHM 28 4.1 Hierarchical Clustering Forest Decoding 28 4.1-1 Computational complexity analysis 32 4.1-2 Comparison to the existing works 34 CHAPTER IV. SIMULATION RESULTS 35 CHAPTER VI. CONCLUSIONS 39 REFERENCES 40 | - |
| dc.language.iso | eng | - |
| dc.publisher | The Graduate School, Ajou University | - |
| dc.rights | 아주대학교 논문은 저작권에 의해 보호받습니다. | - |
| dc.title | 계층적 군집 나무들을 통한 1 비트 구형 복호화 | - |
| dc.title.alternative | Seonho Kim | - |
| dc.type | Thesis | - |
| dc.contributor.affiliation | 아주대학교 일반대학원 | - |
| dc.contributor.alternativeName | Seonho Kim | - |
| dc.contributor.department | 일반대학원 전자공학과 | - |
| dc.date.awarded | 2019. 2 | - |
| dc.description.degree | Master | - |
| dc.identifier.localId | 905342 | - |
| dc.identifier.uci | I804:41038-000000028882 | - |
| dc.identifier.url | http://dcoll.ajou.ac.kr:9080/dcollection/common/orgView/000000028882 | - |
| dc.description.alternativeAbstract | This dissertation considers an uplink multiuser multiple-input multiple-output (MU MIMO) system with one-bit analog-to-digital converters (ADCs). In this system, we propose superior detection methods for the considered system. At first, an optimal weighted minimum distance (wMD) decoding is presented from a coding-theoretic perspective. Also, we show that wMD achieve an optimal performance. However, the drawback of wMD is intractability due to heavy complexity and thus its practical use is prohibited. This problem is addressed by introducing the so-called one-bit sphere decoding (OSDs). However, the major drawback is that, in order to achieve a satisfactory performance, several parameters should be optimized heuristically according to a system configuration. In this regard, we propose an alternative OSD based on hierarchical clustering forest, which can significantly alleviate the problem of parameter optimization. Simulation results demonstrate that the proposed OSD can outperform the existing OSDs (i.e., provide a higher quality on a reduced search space) and achieve the near optimal performance of the wMD decoding with considerably lower complexity. | - |
- Appears in Collections:
- Graduate School of Ajou University > Department of Electronic Engineering > 3. Theses(Master)
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
-
- License
- STATISTICS
- Total Visit :3,777,983
- Total Download :1,819
- Today View :14,484
