This is my ECOC submission, which was performed at Aston University during my PhD.
We compute the random coding error exponent for memoryless flat fading channels with ideal channel state information (CSI) and inputs drawn from a discrete alphabet.
We characterize the achievable range of performance measures in product-form networks where one or more system parameters can be freely set by a network operator.
We introduce a reward paradigm to derive novel bounds for the performance of dynamic channel assignment (DCA) schemes.
There has been much interest in wireless communications and thus it is appropriate to determine the Shannon limit for such systems.
We propose an efficient entropy loading (EL) scheme with NGMI target based on lookup tables.
In this paper, we provide an information-theoretic analysis of a Gaussian multiple-input multiple-output multiple access channel (MIMO MAC) with imperfect channel knowledge at the receiver.
We consider a wireless system comprising multiple users that communicate with a base station.
We consider a continuous-time channel where the input waveform x(t) is constrained to take on but two values, i.e. x(t) = +-square root P, where P is the signal power.
This paper generalizes the information theoretic achievable rate analysis of time (slot length) adaptive and non- adaptive incremental redundancy (IR) hybrid ARQ (HARQ) of earlier works to bandwid
