Short Packets over Block-Memoryless Fading Channels: Pilot-Assisted or Noncoherent Transmission?

We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability. We focus on the practically relevant scenario in which there is no \emph{a priori} channel state information available at the transmitter and at the receiver. An upper bound built upon the min-max converse is compared to two lower bounds: the first one relies on a noncoherent transmission strategy in which the fading channel is not estimated explicitly at the receiver; the second one employs pilot-assisted transmission (PAT) followed by maximum-likelihood channel estimation and scaled mismatched nearest-neighbor decoding at the receiver. Our bounds are tight enough to unveil the optimum number of diversity branches that a packet should span so that the energy per bit required to achieve a target packet error probability is minimized, for a given constraint on the code rate and the packet size. Furthermore, the bounds reveal that noncoherent transmission is more energy efficient than PAT, even when the number of pilot symbols and their power is optimized. For example, for the case when a coded packet of $168$ symbols is transmitted using a channel code of rate $0.48$ bits/channel use, over a block-fading channel with block size equal to $8$ symbols, PAT requires an additional $1.2$ dB of energy per information bit to achieve a packet error probability of $10^{-3}$ compared to a suitably designed noncoherent transmission scheme. Finally, we devise a PAT scheme based on punctured tail-biting quasi-cyclic codes and ordered statistics decoding, whose performance are close ($1$ dB gap at $10^{-3}$ packet error probability) to the ones predicted by our PAT lower bound. This shows that the PAT lower bound provides useful guidelines on the design of actual PAT schemes.Comment: 30 pages, 5 figures, journa

Optimization in multi-relay wireless networks

The concept of cooperation in communications has drawn a lot of research attention in recent years due to its potential to improve the efficiency of wireless networks. This new form of communications allows some users to act as relays and assist the transmission of other users' information signals. The aim of this thesis is to apply optimization techniques in the design of multi-relay wireless networks employing cooperative communications. In general, the thesis is organized into two parts: ``Distributed space-time coding' (DSTC) and ``Distributed beamforming', which cover two main approaches in cooperative communications over multi-relay networks. In Part I of the thesis, various aspects of distributed implementation of space-time coding in a wireless relay network are treated. First, the thesis proposes a new fully-diverse distributed code which allows noncoherent reception at the destination. Second, the problem of coordinating the power allocation (PA) between source and relays to achieve the optimal performance of DSTC is studied and a novel PA scheme is developed. It is shown that the proposed PA scheme can obtain the maximum diversity order of DSTC and significantly outperform other suboptimal PA schemes. Third, the thesis presents the optimal PA scheme to minimize the mean-square error (MSE) in channel estimation during training phase of DSTC. The effect of imperfect channel estimation to the performance of DSTC is also thoroughly studied. In Part II of the thesis, optimal distributed beamforming designs are developed for a wireless multiuser multi-relay network. Two design criteria for the optimal distributed beamforming at the relays are considered: (i) minimizing the total relay power subject to a guaranteed Quality of Service (QoS) measured in terms of signal-to-noise-ratio (SNR) at the destinations, and (ii) jointly maximizing the SNR margin at the destinations subject to power constraints at the relays. Based on convex optimization techniques, it is shown that these problems can be formulated and solved via second-order conic programming (SOCP). In addition, this part also proposes simple and fast iterative algorithms to directly solve these optimization problems

Space Station communications and tracking systems modeling and RF link simulation

In this final report, the effort spent on Space Station Communications and Tracking System Modeling and RF Link Simulation is described in detail. The effort is mainly divided into three parts: frequency division multiple access (FDMA) system simulation modeling and software implementation; a study on design and evaluation of a functional computerized RF link simulation/analysis system for Space Station; and a study on design and evaluation of simulation system architecture. This report documents the results of these studies. In addition, a separate User's Manual on Space Communications Simulation System (SCSS) (Version 1) documents the software developed for the Space Station FDMA communications system simulation. The final report, SCSS user's manual, and the software located in the NASA JSC system analysis division's VAX 750 computer together serve as the deliverables from LinCom for this project effort

Performance Analysis of Energy-Detection-Based Massive SIMO

Recently, communications systems that are both energy efficient and reliable are under investigation. In this paper, we concentrate on an energy-detection-based transmission scheme where a communication scenario between a transmitter with one antenna and a receiver with significantly many antennas is considered. We assume that the receiver initially calculates the average energy across all antennas, and then decodes the transmitted data by exploiting the average energy level. Then, we calculate the average symbol error probability by means of a maximum a-posteriori probability detector at the receiver. Following that, we provide the optimal decision regions. Furthermore, we develop an iterative algorithm that reaches the optimal constellation diagram under a given average transmit power constraint. Through numerical analysis, we explore the system performance

Massive MIMO for Internet of Things (IoT) Connectivity

Massive MIMO is considered to be one of the key technologies in the emerging 5G systems, but also a concept applicable to other wireless systems. Exploiting the large number of degrees of freedom (DoFs) of massive MIMO essential for achieving high spectral efficiency, high data rates and extreme spatial multiplexing of densely distributed users. On the one hand, the benefits of applying massive MIMO for broadband communication are well known and there has been a large body of research on designing communication schemes to support high rates. On the other hand, using massive MIMO for Internet-of-Things (IoT) is still a developing topic, as IoT connectivity has requirements and constraints that are significantly different from the broadband connections. In this paper we investigate the applicability of massive MIMO to IoT connectivity. Specifically, we treat the two generic types of IoT connections envisioned in 5G: massive machine-type communication (mMTC) and ultra-reliable low-latency communication (URLLC). This paper fills this important gap by identifying the opportunities and challenges in exploiting massive MIMO for IoT connectivity. We provide insights into the trade-offs that emerge when massive MIMO is applied to mMTC or URLLC and present a number of suitable communication schemes. The discussion continues to the questions of network slicing of the wireless resources and the use of massive MIMO to simultaneously support IoT connections with very heterogeneous requirements. The main conclusion is that massive MIMO can bring benefits to the scenarios with IoT connectivity, but it requires tight integration of the physical-layer techniques with the protocol design.Comment: Submitted for publicatio

Forwarding strategies and optimal power allocation for coherent and noncoherent relay networks

In fading wireless channels, relays are used with the aim of achieving diversity and thus overall performance gain. In cooperative relay networks, various forwarding techniques like amplify and forward (AF) and decode and forward (DF) are used at the relay for better throughput and improved BER performance than traditional multihop systems. In a power constrained environment, the performance can be further improved by using an optimal power allocation strategy. The relative position of the relay with respect to the source and destination also has an immense effect on the efficacy of the relay.;We position the relay at various positions in a planar grid, with the position of source and destination being fixed, and we investigate the effect that the positioning of the relay has on a relaying system. We use our three terminal model to optimize the power allocation under total transmit power constraint, to maximize the instantaneous signal-to-noise ratio (SNR) at destination, and thus achieve improved throughput and BER performance, while using AF and DF protocols. We evaluate the performance of our system for both coherent and noncoherent modulation in a Rayleigh block fading channel. Quadrature phase shift keying (QPSK) is used in the coherent case and 4-Frequency shift keying (4-FSK) is used in the noncoherent case.;Previous works involving power allocation schemes have mainly concentrated on optimizing information theoretic quantities like capacity and outage probability. We derive expressions for instantaneous SNR using our model and optimize the power allocation based on that, with the final aim of achieving improved uncoded BER. Analytical expressions of the instantaneous SNR at the destination are derived for both AF and DF. These expressions are numerically optimized to obtain an optimum power allocation strategy for each position of the relay in both the AF and DF schemes using coherent or noncoherent detection.;We compare the performance of the AF and DF protocols based on their positional BER and throughput at different received SNR and notice that our power optimized schemes outperform existing power control schemes at certain areas. Finally we also identify the shape and area of the regions where relaying would provide performance gains for both the protocols at different received SNRs