• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.83-93
• /
• 2013

By comparing Wiener's MMSE on stochastic signal transmission with Shannon's mutual information first proved by C.E. Shannon in terms of information theory, connections between two approaches were investigated. What Wiener wanted to see in signal transmission in noisy channel is to try to capture fundamental limits for signal quality in signal estimation. On the other hands, Shannon was interested in finding fundamental limits of signal quantity that maximize the uncertainty in mutual information using the entropy concept in noisy channel. First concern of this paper is to show that in deriving limits of Shannon's point to point fundamental channel capacity, Shannon's mutual information obtained by exploiting MMSE combiner and Wiener filter's MMSE are interelated by integro-differential equantion. Then, At the meeting point of Wiener's MMSE and Shannon's mutual information the upper bound of spectral efficiency and the lower bound of energy efficiency were computed. Choosing a proper lattice-type code of a mod-${\Lambda}$AWGN channel model and MMSE estimation of ${\alpha}$ confirmed to lead to the fundamental Shannon capacity limits.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.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.

• Journal of Communications and Networks
• /
• v.11 no.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.