140 research outputs found
Side information aware source and channel coding in wireless networks
Signals in communication networks exhibit significant correlation, which can stem from the physical nature of the underlying sources, or can be created within the system. Current layered network architectures, in which, based on Shannonās separation theorem, data is compressed and transmitted over independent bit-pipes, are in general not able to exploit such correlation efficiently. Moreover, this strictly layered architecture was developed for wired networks and ignore the broadcast and highly dynamic nature of the wireless medium, creating a bottleneck in the wireless network design. Technologies that exploit correlated information and go beyond the layered network architecture can become a key feature of future wireless networks, as information theory promises significant gains. In this thesis, we study from an information theoretic perspective, three distinct, yet fundamental, problems involving the availability of correlated information in wireless networks and develop novel communication techniques to exploit it efficiently. We first look at two joint source-channel coding problems involving the lossy transmission of Gaussian sources in a multi-terminal and a time-varying setting in which correlated side information is present in the network. In these two problems, the optimality of Shannonās separation breaks down and separate source and channel coding is shown to perform poorly compared to the proposed joint source-channel coding designs, which are shown to achieve the optimal performance in some setups. Then, we characterize the capacity of a class of orthogonal relay channels in the presence of channel side information at the destination, and show that joint decoding and compression of the received signal at the relay is required to optimally exploit the available side information. Our results in these three different scenarios emphasize the benefits of exploiting correlated side information at the destination when designing a communication system, even though the nature of the side information and the performance measure in the three scenarios are quite different.Open Acces
On the Non-Orthogonal Layered Broadcast Codes in Cooperative Wireless Networks
A multi-fold increase in spectral eļ¬ciency and throughput are envisioned in the ļ¬fth generation of cellular networks to meet the requirements of International Telecommunication Union (ITU) IMT-2020 on massive connectivity and tremendous data traļ¬c. This is achieved by evolution in three aspects of current networks. The ļ¬rst aspect is shrinking the cell sizes and deploying dense picocells and femtocells to boost the spectral reuse. The second is to allocate more spectrum resources including millimeter-wave bands. The third is deploying highly eļ¬cient communications and multiple access techniques. Non-orthogonal multiple access (NOMA) is a promising communication technique that complements the current commercial spectrum access approach to boost the spectral eļ¬ciency, where different data streams/usersā data share the same time, frequency and code resource blocks (sub-bands) via superimposition with each other. The receivers decode their own messages by deploying the successive interference cancellation (SIC) decoding rule. It is known that the NOMA coding is superior to conventional orthogonal multiple access (OMA) coding, where the resources are split among the users in either time or frequency domain. The NOMA based coding has been incorporated into other coding techniques including multi-input multi-output (MIMO), orthogonal frequency division multiplexing (OFDM), cognitive radio and cooperative techniques. In cooperative NOMA codes, either dedicated relay stations or stronger users with better channel conditions, act as relay to leverage the spatial diversity and to boost the performance of the other users. The advantage of spatial diversity gain in relay-based NOMA codes, is deployed to extend the coverage area of the network, to mitigate the fading eļ¬ect of multipath channel and to increase the system throughput, hence improving the system eļ¬ciency. In this dissertation we consider the multimedia content delivery and machine type communications over 5G networks, where scalable content and low complexity encoders is of interest. We propose cross-layer design for transmission of successive reļ¬nement (SR) source code interplayed with non-orthogonal layered broadcast code for deployment in several cooperative network architectures. Firstly, we consider a multi-relay coding scheme where a source node is assisted by a half-duplex multi-relay non-orthogonal amplify-forward (NAF) network to communicate with a destination node. Assuming the channel state information (CSI) is not available at the source node, the achievable layered diversity multiplexing tradeoļ¬ (DMT) curve is derived. Then, by taking distortion exponent (DE) as the ļ¬gure of merit, several achievable lower bounds are proved, and the optimal expected distortion performance under high signal to noise ratio (SNR) approximation is explicitly obtained. It is shown that the proposed coding can achieve the multi-input single-output (MISO) upper bound under certain regions of bandwidth ratios, by which the optimal performance in these regions can be explicitly characterized. Further the non-orthogonal layered coding scheme is extended to a multi-hop MIMO decode-forward (DF) relay network where a set of DE lower bounds is derived.
Secondly, we propose a layered cooperative multi-user scheme based on non-orthogonal amplify-forward (NAF) relaying and non-orthogonal multiple access (NOMA) codes, aiming to achieve multi-user uplink transmissions with low complexity and low signaling overhead, particularly applicable to the machine type communications (MTC) and internet of things (IoT) systems. By assuming no CSI available at the transmitting nodes, the proposed layered codes make the transmission rate of each user adaptive to the channel realization. We derive the close-form analytical results on outage probability and the DMT curve of the proposed layered NAF codes in the asymptotic regime of high SNR, and optimize the end-to-end performance in terms of the exponential decay rate of expected distortion.
Thirdly, we consider a single relay network and study the non-orthogonal layered scheme in the general SNR regime. A layered relaying scheme based on compress-forward (CF) is introduced, where optimization of end to end performance in terms of expected distortion is conducted to jointly determine network parameters. We further derive the explicit analytical optimal solution with two layers in the absence of channel knowledge.
Finally, we consider the problem of multicast of multi-resolution layered messages over downlink of a cellular system with the assumption of CSI is not available at the base station (BS). Without loss generality, spatially random users are divided into two groups, where the near group users with better channel conditions decode for both layers, while the users in the second group decode for base layer only. Once the BS launches a multicast message, the ļ¬rst group users who successfully decoded the message, deploy a distributed cooperating scheme to assist the transmission to the other users. The cooperative scheme is naive but we will prove it can eļ¬ectively enhance the network capacity. Closed form outage probability is explicitly derived for the two groups of users. Further it is shown that diversity order equal to the number of users in the near group is achievable, hence the coding gain of the proposed distributed scheme fully compensate the lack of CSI at the BS in terms of diversity order
Recommended from our members
Spatially Coupled Sparse Regression Codes for Single- and Multi-user Communications
Sparse regression codes (SPARCs) are a class of channel codes for efficient communication over the single-user additive white Gaussian noise (AWGN) channel at rates approaching the channel capacity. In a standard SPARC, codewords are sparse linear combinations of columns of an i.i.d. Gaussian design matrix, and the user message is encoded in the indices of those columns. Techniques such as power allocation and spatial coupling have been proposed to improve the performance of low-complexity iterative decoding algorithms such as approximate message passing (AMP).
In this thesis we investigate spatially coupled SPARCs, where the design matrix has a block- wise band-diagonal structure, and modulated SPARCs, which generalise standard SPARCs by introducing modulation to the encoding of user messages. We introduce a base matrix framework which provides a unified way to construct power allocated and spatially coupled design matrices, and propose AMP decoders for modulated SPARCs constructed using base matrices.
We prove that phase shift keying modulated and spatially coupled SPARCs with AMP decoding asymptotically achieve the capacity of the (complex) AWGN channel. We also show via numerical simulations that they can achieve lower error rates than standard coded modulation schemes at finite code lengths. A sliding window AMP decoder is proposed for spatially coupled SPARCs that significantly reduces the decoding latency and complexity.
We then investigate coding schemes based on random linear models and AMP decoding for the multi-user Gaussian multiple access channel in the asymptotic regime where the number of users grows linearly with the code length. For a fixed target error rate and message size per user (in bits), we obtain the exact trade-off between energy-per-bit and the user density achievable in the large system limit. We show that a coding scheme based on spatially coupled Gaussian matrices and AMP decoding achieves near-optimal trade-off for a large range of user densities. To the best of our knowledge, this is the first efficient coding scheme to do so in this multiple access regime. Moreover, the spatially coupled coding scheme has a practical interpretation: it can be viewed as block-wise time-division with overlap.Funded by a Doctoral Training Partnership Award from the Engineering and Physical Sciences Research Council
Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities
This monograph presents a unified treatment of single- and multi-user
problems in Shannon's information theory where we depart from the requirement
that the error probability decays asymptotically in the blocklength. Instead,
the error probabilities for various problems are bounded above by a
non-vanishing constant and the spotlight is shone on achievable coding rates as
functions of the growing blocklengths. This represents the study of asymptotic
estimates with non-vanishing error probabilities.
In Part I, after reviewing the fundamentals of information theory, we discuss
Strassen's seminal result for binary hypothesis testing where the type-I error
probability is non-vanishing and the rate of decay of the type-II error
probability with growing number of independent observations is characterized.
In Part II, we use this basic hypothesis testing result to develop second- and
sometimes, even third-order asymptotic expansions for point-to-point
communication. Finally in Part III, we consider network information theory
problems for which the second-order asymptotics are known. These problems
include some classes of channels with random state, the multiple-encoder
distributed lossless source coding (Slepian-Wolf) problem and special cases of
the Gaussian interference and multiple-access channels. Finally, we discuss
avenues for further research.Comment: Further comments welcom
Performance Analysis of Block Codes over Finite-state Channels in Delay-sensitive Communications
As the mobile application landscape expands, wireless networks are tasked with supporting different connection profiles, including real-time traffic and delay-sensitive communications. Among many ensuing engineering challenges is the need to better understand the fundamental limits of forward error correction in non-asymptotic regimes. This dissertation seeks to characterize the performance of block codes over finite-state channels with memory and also evaluate their queueing performance under different encoding/decoding schemes.
In particular, a fading formulation is considered where a discrete channel with correlation over time introduces errors. For carefully selected channel models and arrival processes, a tractable Markov structure composed of queue length and channel state is identified. This facilitates the analysis of the stationary behavior of the system, leading to evaluation criteria such as bounds on the probability of the queue exceeding a threshold. Specifically, this dissertation focuses on system models with scalable arrival profiles based on Poisson processes, and finite-state memory channels. These assumptions permit the rigorous comparison of system performance for codes with arbitrary block lengths and code rates. Based on this characterization, it is possible to optimize code parameters for delay-sensitive applications over various channels. Random codes and BCH codes are then employed as means to study the relationship between code-rate selection and the queueing performance of point-to-point data links. The introduced methodology offers a new perspective on the joint queueing-coding analysis for finite-state channels, and is supported by numerical simulations.
Furthermore, classical results from information theory are revisited in the context of channels with rare transitions, and bounds on the probabilities of decoding failure are derived for random codes. An analysis framework is presented where channel dependencies within and across code words are preserved. The results are subsequently integrated into a queueing formulation. It is shown that for current formulation, the performance analysis based on upper bounds provides a good estimate of both the system performance and the optimum code parameters. Overall, this study offers new insights about the impact of channel correlation on the performance of delay-aware communications and provides novel guidelines to select optimum code rates and block lengths
Resource allocation for 5G technologies under statistical queueing constraints
As the launch of fifth generation (5G) wireless networks is approaching, recent years have witnessed comprehensive discussions about a possible 5G standard. Many transmission scenarios and technologies have been proposed and initial over-the-air experimental trials have been conducted. Most of the existing literature studies on 5G technologies have mainly focused on the physical layer parameters and quality of service (QoS) requirements, e.g., achievable data rates. However, the demand for delay-sensitive data traffic over wireless networks has increased exponentially in the recent years, and is expected to further increase by the time of 5G. Therefore, other constraints at the data-link layer concerning the buffer overflow and delay violation probabilities should also be regarded. It follows that evaluating the performance of the 5G technologies when such constraints are considered is a timely task.
Motivated by this fact, in this thesis we explore the performance of three promising 5G technologies when operating under certain QoS at the data-link layer. We follow a cross-layer approach to examine the interplay between the physical and data-link layers when statistical QoS constraints are inflicted in the form of limits on the delay violation and buffer overflow probabilities. Noting that wireless systems, generally, have limited physical resources, in this thesis we mainly target designing adaptive resource allocation schemes to maximize the system performance under such QoS constraints.
We initially investigate the throughput and energy efficiency of a general class of multiple-input multiple-output (MIMO) systems with arbitrary inputs. As a cross-layer evaluation tool, we employ the effective capacity as the main performance metric, which is the maximum constant data arrival
rate at a buffer that can be sustained by the channel service process under specified QoS constraints. We obtain the optimal input covariance matrix that maximizes the effective capacity under a short-term average power budget. Then, we perform an asymptotic analysis of the effective capacity in the low signal-to-noise ratio and large-scale antenna (massive MIMO) regimes. Such analysis has a practical importance for 5G scenarios that necessitate low latency, low power consumption, and/or ability to simultaneously support massive number of users.
Non-orthogonal multiple access (NOMA) has attracted significant attention in the recent years as a promising multiple access technology for 5G. In this thesis, we consider a two-user power-domain NOMA scheme in which both transmitters employ superposition coding and the receiver applies successive interference cancellation (SIC) with a certain order. For practical concerns, we consider limited transmission power budgets at the transmitters, and assume that both transmitters have arbitrarily distributed input signals. We again exploit the effective capacity as the main cross-layer performance measure. We provide a resource management scheme that can jointly obtain the optimal power allocation policies at the transmitters and the optimal decoding order at the receiver, with the goal of maximizing the effective capacity region that provides the maximum allowable sustainable arrival rate region at the transmitters' buffers under QoS guarantees.
In the recent years, visible light communication (VLC) has emerged as a potential transmission technology that can utilize the visible light spectrum for data transmission along with illumination. Different from the existing literature studies on VLC, in this thesis we consider a VLC system in which the access point (AP) is unaware of the channel conditions, thus the AP sends the data at a fixed rate. Under this assumption, and considering an ON-OFF data source, we provide a cross-layer study when the system is subject to statistical buffering constraints. To this end, we employ the maximum average data arrival rate at the AP buffer and the non-asymptotic bounds on buffering delay as the main performance measures. To facilitate our analysis, we adopt a two-state Markov process to model the fixed-rate transmission strategy, and we then formulate the steady-state probabilities of the channel being in the ON and OFF states.
The coexistence of radio frequency (RF) and VLC systems in typical indoor environments can be leveraged to support vast user QoS needs. In
this thesis, we examine the benefits of employing both technologies when operating under statistical buffering limitations.
Particularly, we consider a multi-mechanism scenario that utilizes RF and VLC links for data transmission in an indoor environment. As the transmission technology is the main physical resource to be concerned in this part, we propose a link selection process through which the transmitter sends data over the link that sustains the desired QoS guarantees the most. Considering an ON-OFF data source, we employ the maximum average data arrival rate at the transmitter buffer and the non-asymptotic bounds on data buffering delay as the main performance measures. We formulate the performance measures under the assumption that both links are subject to average and peak power constraints
- ā¦