Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Doctoral Dissertations

Electrical and Computer Engineering

University of Massachusetts Amherst

Information Theory

Articles 1 - 2 of 2

Full-Text Articles in Computer Engineering

Function And Dissipation In Finite State Automata - From Computing To Intelligence And Back, Natesh Ganesh Oct 2019

Function And Dissipation In Finite State Automata - From Computing To Intelligence And Back, Natesh Ganesh

Doctoral Dissertations

Society has benefited from the technological revolution and the tremendous growth in computing powered by Moore's law. However, we are fast approaching the ultimate physical limits in terms of both device sizes and the associated energy dissipation. It is important to characterize these limits in a physically grounded and implementation-agnostic manner, in order to capture the fundamental energy dissipation costs associated with performing computing operations with classical information in nano-scale quantum systems. It is also necessary to identify and understand the effect of quantum in-distinguishability, noise, and device variability on these dissipation limits. Identifying these parameters is crucial to designing …


Fundamental Limits Of Covert Communication In Packet Channels, Ramin Soltani Mar 2019

Fundamental Limits Of Covert Communication In Packet Channels, Ramin Soltani

Doctoral Dissertations

This dissertation focuses on covert communication in channels where the communication takes place by the transmission of packets. Consider a channel where authorized transmitter Jack sends packets to authorized receiver Steve according to a Poisson process with rate $\lambda$ packets per second for a time period $T$. Jack's transmitted packet visit Alice, Willie, Bob and Steve, respectively. Suppose that covert transmitter Alice wishes to communicate information to covert receiver Bob without being detected by a watchful adversary Willie. We consider three sets of assumptions for this channel. For each set of assumptions, we present a technique for establishing covert communication …