DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Chung, Sae-Young | - |
dc.contributor.advisor | 정세영 | - |
dc.contributor.author | Yoon, Jongmin | - |
dc.date.accessioned | 2018-06-20T06:22:07Z | - |
dc.date.available | 2018-06-20T06:22:07Z | - |
dc.date.issued | 2017 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=675413&flag=dissertation | en_US |
dc.identifier.uri | http://hdl.handle.net/10203/243304 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전기및전자공학부, 2017.2,[iv, 25 p. :] | - |
dc.description.abstract | For the design of symbols and spreading sequences, the understanding of vector space and minimum distance is essentially considered. In this paper, we modeled a system that performs optimized user detection and information bit recovery for uplink multiple access system. First, we propose a method to design the spreading sequences that minimize the influences of interference and noise in the base station that receives signal from multiple users. And, we propose an algorithm that constructs multi-dimensional subspace-based constellations. Then we derive theoretical bounds of minimum distances of this codeword-based constellation and spreading sequence designs. In conclusion, we show that this codebook and ID sequence design for uplink multiple access system increases performance in variable ways. | - |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | uplink multiple access | - |
dc.subject | coding gain | - |
dc.subject | Gray code | - |
dc.subject | Grassmannian manifold | - |
dc.subject | non-orthogonal multiple access | - |
dc.subject | 상향 다중 접속 | - |
dc.subject | 부호이득 | - |
dc.subject | 그레이 부호 | - |
dc.subject | 그라스마니안 다양체 | - |
dc.subject | 비직교 다중 접속 | - |
dc.title | Geometrical coding on multi-dimensional symbols | - |
dc.title.alternative | 다차원 심볼에서의 기하학적 코딩 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 325007 | - |
dc.description.department | 한국과학기술원 :전기및전자공학부, | - |
dc.contributor.alternativeauthor | 윤종민 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.