CaltechTHESIS
  A Caltech Library Service

Information-theoretic Studies and Capacity Bounds: Group Network Codes and Energy Harvesting Communication Systems

Citation

Mao, Wei (2015) Information-theoretic Studies and Capacity Bounds: Group Network Codes and Energy Harvesting Communication Systems. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/Z9ZS2TFB. http://resolver.caltech.edu/CaltechTHESIS:04272015-133555770

Abstract

Network information theory and channels with memory are two important but difficult frontiers of information theory. In this two-parted dissertation, we study these two areas, each comprising one part. For the first area we study the so-called entropy vectors via finite group theory, and the network codes constructed from finite groups. In particular, we identify the smallest finite group that violates the Ingleton inequality, an inequality respected by all linear network codes, but not satisfied by all entropy vectors. Based on the analysis of this group we generalize it to several families of Ingleton-violating groups, which may be used to design good network codes. Regarding that aspect, we study the network codes constructed with finite groups, and especially show that linear network codes are embedded in the group network codes constructed with these Ingleton-violating families. Furthermore, such codes are strictly more powerful than linear network codes, as they are able to violate the Ingleton inequality while linear network codes cannot. For the second area, we study the impact of memory to the channel capacity through a novel communication system: the energy harvesting channel. Different from traditional communication systems, the transmitter of an energy harvesting channel is powered by an exogenous energy harvesting device and a finite-sized battery. As a consequence, each time the system can only transmit a symbol whose energy consumption is no more than the energy currently available. This new type of power supply introduces an unprecedented input constraint for the channel, which is random, instantaneous, and has memory. Furthermore, naturally, the energy harvesting process is observed causally at the transmitter, but no such information is provided to the receiver. Both of these features pose great challenges for the analysis of the channel capacity. In this work we use techniques from channels with side information, and finite state channels, to obtain lower and upper bounds of the energy harvesting channel. In particular, we study the stationarity and ergodicity conditions of a surrogate channel to compute and optimize the achievable rates for the original channel. In addition, for practical code design of the system we study the pairwise error probabilities of the input sequences.

Item Type:Thesis (Dissertation (Ph.D.))
Subject Keywords:Information theory; Finite groups; Ingleton inequality; Group network codes; Entropy vectors; Energy harvesting; Channel capacity; Finite state channels
Degree Grantor:California Institute of Technology
Division:Engineering and Applied Science
Major Option:Electrical Engineering
Thesis Availability:Public (worldwide access)
Research Advisor(s):
  • Hassibi, Babak
Thesis Committee:
  • Hassibi, Babak (chair)
  • Kostina, Victoria
  • Bruck, Jehoshua
  • Vaidyanathan, P. P.
  • Wierman, Adam C.
Defense Date:10 April 2015
Record Number:CaltechTHESIS:04272015-133555770
Persistent URL:http://resolver.caltech.edu/CaltechTHESIS:04272015-133555770
DOI:10.7907/Z9ZS2TFB
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:8834
Collection:CaltechTHESIS
Deposited By: Wei Mao
Deposited On:30 Apr 2015 17:25
Last Modified:12 Apr 2016 17:34

Thesis Files

[img]
Preview
PDF - Final Version
See Usage Policy.

1132Kb

Repository Staff Only: item control page