Capacities of Gaussian relay networks with accuracy within a constant number of bits가우시안 중계기 네트워크에 대한 상수 비트 이내로의 용량 분석

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 644
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorLee, Yong-Hoon-
dc.contributor.advisor이용훈-
dc.contributor.advisorChung, Sae-Young-
dc.contributor.advisor정세영-
dc.contributor.authorNam, Woo-Seok-
dc.contributor.author남우석-
dc.date.accessioned2011-12-14-
dc.date.available2011-12-14-
dc.date.issued2009-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=327781&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/35371-
dc.description학위논문(박사) - 한국과학기술원 : 전기및전자공학전공, 2009. 8., [ v, 64 p. ]-
dc.description.abstractWe consider the capacities of wireless networks. In the first part of this work, a class of relay networks with orthogonal components (OC) is considered. In this class, we assume that outgoing channels at a node to its neighbors are orthogonal, while incoming signals from neighbors can interfere with each other. We are interested in the multicast capacity of these networks. As a subclass, we first focus on Gaussian relay networks with OC and find an achievable rate using a lattice coding scheme. It is shown that there is a constant gap between our achievable rate and the information theoretic cut-set bound. This is similar to the recent result by Avestimehr, Diggavi, and Tse who showed such an approximate characterization of the capacity of general Gaussian relay networks. However, our achievability uses a structured code instead of a random one. Using the same idea used in the Gaussian case, we also consider linear finite-field symmetric networks with OC, and characterize the capacity using a linear coding scheme. In the second part, the Gaussian two-way relay channel, where two source nodes exchange messages with each other through a relay, is considered. We assume that all nodes operate in full-duplex mode, and there is no direct channel between the source nodes. We propose an achievable scheme, which is composed of nested lattice codes for the uplink and structured binning for the downlink. The lattice coding scheme for the uplink is essentially the same as that used in the first part of this work, and provides the gain of computation coding. It is also closely related to the concept of network coding for wireless networks. We show that the scheme achieves to within ½ bit the the cut-set bound for all channel parameters, and asymptotically optimal as the signal to noise ratios (SNR) increase. The constant gaps to the capacities obtained in this work do not depend on the other parameters such as SNRs. Therefore, the result is meaningful in high SNR regim...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectrelay-
dc.subjectnetwork-
dc.subjectcapacity-
dc.subjecttwo-way-
dc.subject중계기-
dc.subject네트워크-
dc.subject용량-
dc.subject양방향-
dc.subjectrelay-
dc.subjectnetwork-
dc.subjectcapacity-
dc.subjecttwo-way-
dc.subject중계기-
dc.subject네트워크-
dc.subject용량-
dc.subject양방향-
dc.titleCapacities of Gaussian relay networks with accuracy within a constant number of bits-
dc.title.alternative가우시안 중계기 네트워크에 대한 상수 비트 이내로의 용량 분석-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN327781/325007 -
dc.description.department한국과학기술원 : 전기및전자공학전공, -
dc.identifier.uid020045080-
dc.contributor.localauthorLee, Yong-Hoon-
dc.contributor.localauthor이용훈-
dc.contributor.localauthorChung, Sae-Young-
dc.contributor.localauthor정세영-
Appears in Collection
EE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0