• 제목/요약/키워드: Information-theoretic limits

검색결과 4건 처리시간 0.017초

신호 전송의 양과 질에서 위너의 MMSE와 샤논의 정보 이론적 정보량 극한 과 격자 코드 와의 만남 (Encounter of Lattice-type coding with Wiener's MMSE and Shannon's Information-Theoretic Capacity Limits in Quantity and Quality of Signal Transmission)

  • 박대철;이문호
    • 전자공학회논문지
    • /
    • 제50권8호
    • /
    • pp.83-93
    • /
    • 2013
  • 통계적 신호 전송에 관한 위너의 MMSE와 정보이론 관점에서 처음으로 증명한 샤논의 상호 정보량을 비교함으로서 둘 사이의 관련성을 연구하였다. 위너가 신호 전송에서 보려했던 것은 잡음이 존재하는 채널에서 복원하려는 신호의 전송 품질의 근본적 극한(limit)를 계산해내려는 것이라 해석할 수 있다. 반면, 샤논은 엔트로피 개념을 적용하여 상호 정보에 대한 불확실성의 차를 최대화로 하는 전송 정보량의 근본적 상한(upper bound)의 극한(limits)을 계산을 계산하려는 것이라 해석할 수 있다. 본 논문의 관심은 샤논의 점 대 점 채널 용량의 근본적 극한을 계산하는 샤논의 공식을 유도함에 있어 위너의 최소 평균 자승 오차(MMSE) 컴바이너에 의한 최적 위너 필터를 사용했을 때 위너의 MMSE와 샤논의 상호 정보량이 미적분관계로 연결되어 있음을 확인하는 것이며, 위너 필터의 MMSE 와 샤논의 상호 정보량이 만나는 점에서 대역 효율성의 상한과 에너지 효율성의 하한을 계산하였다. mod-${\Lambda}$ AWGN 채널 모델에 의한 적절한 성형 격자 ${\Lambda}$의 선택과 ${\alpha}$의 MMSE 추정에 의해 격자형 부호 방식이 샤논의 원래 채널 용량 극한에 미치게 됨을 확인하였다.

D2D Utility Maximization in the Cellular System: Non Cooperative Game Theoretic Approach

  • Oh, Changyoon
    • 한국컴퓨터정보학회논문지
    • /
    • 제24권7호
    • /
    • pp.79-85
    • /
    • 2019
  • We investigate the D2D utility maximization in the cellular system. We focus on the non cooperative game theoretic approach to maximize the individual utility. Cellular system's perspective, interference from the D2D links must be limited to protect the cellular users. To accommodate this interference issue, utility function is first defined to control the individual D2D user's transmit power. More specifically, utility function includes the pricing which limits the individual D2D user's transmit power. Then, non cooperative power game is formulated to maximize the individual utility. Distributed algorithm is proposed to maximize the individual utility, while limiting the interference. Convergence of the proposed distributed algorithm is verified through computer simulation. Also the effect of pricing factor to SIR and interference is provided to show the performance of the proposed distributed algorithm.

One Improved RLWE-based FHE and Fast Private Information Retrieval

  • Song, Wei-Tao;Hu, Bin;Zhao, Xiu-Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권12호
    • /
    • pp.6260-6276
    • /
    • 2019
  • With the rapid development of cloud computing, it raises real questions on privacy protection, which greatly limits the use of cloud computing. However, fully homomorphic encryption (FHE) can make cloud computing consistent with privacy. In this paper, we propose a simpler FHE scheme based on ring LWE problem, with a smaller size of ciphertext and a lower noise-expansion factor for homomorphic multiplication. Then based on our optimized RLWE-based FHE scheme, we propose a fast single-database private information retrieval protocol, combining with batching and number theoretic transform technology.

Bi-Directional Half-Duplex Relaying Protocols

  • Kim, Sang-Joon;Devroye, Natasha;Tarokh, Vahid
    • Journal of Communications and Networks
    • /
    • 제11권5호
    • /
    • pp.433-444
    • /
    • 2009
  • The bi-directional relay channel is the natural extension of a three-terminal relay channel where node a transmits to node b with the help of a relay r to allow for two-way communication between nodes a and b. That is, in a bi-directional relay channel, a and b wish to exchange independent messages over a shared channel with the help of a relay r. The rates at which this communication may reliably take place depend on the assumptions made on the relay processing abilities. We overview information theoretic limits of the bi-directional relay channel under a variety of conditions, before focusing on half-duplex nodes in which communication takes place in a number of temporal phases (resulting in protocols), and nodes may forward messages in four manners. The relay-forwarding considered are: Amplify and forward (AF), decode and forward (DF), compress and forward (CF), and mixed forward. The last scheme is a combination of CF in one direction and DF in the other. We derive inner and outer bounds to the capacity region of the bi-directional relay channel for three temporal protocols under these four relaying schemes. The first protocol is a two phase protocol where a and b simultaneously transmit during the first phase and the relay r alone transmits during the second. The second protocol considers sequential transmissions from a and b followed by a transmission from the relay while the third protocol is a hybrid of the first two protocols and has four phases. We provide a comprehensive treatment of protocols in Gaussian noise, obtaining their respective achievable rate regions, outer bounds, and their relative performance under different SNR and relay geometries.