Search

In this paper, we study a quantized feedback scheme to maximize the goodput of a finite blocklength communication scenario over a quasi-static fading channel. It is assumed that the receiver has perfect channel state information (CSI) and sends back the CSI to the transmitter over a resolution-limited error-free feedback channel. With this partial CSI, the transmitter is supposed to select the optimum transmission rate, such that it maximizes the overall goodput of the communication system. This problem has been studied for the asymptotic blocklength regime, however, no solution has so far been presented for finite blocklength. Here, we study this problem in two cases: with and without constraint on reliability. We first formulate the optimization problems and analytically solve them. Iterative algorithms that successfully exploit the system parameters for both cases are presented. It is shown that although the achievable maximum goodput decreases with shorter blocklengths and higher reliability requirements, significant improvement can be achieved even with coarsely quantized feedback schemes. [ABSTRACT FROM AUTHOR]

Channel modeling is a challenging vital step towards the development of diffusion-based molecular communication networks (DMCNs). Analytical approaches for diffusion channel modeling are limited to simple and specific geometries and boundary conditions. Also, simulation- and experiment-driven methods are very time-consuming and computationally complex. In this paper, the channel model for DMCN employing the fundamental concentration Green’s function (CGF) is characterized. A general homogeneous boundary condition framework is considered that includes any linear reaction systems at the boundaries in the environment. To obtain the CGF for a general DMCN including multiple transmitters, receivers, and other objects with arbitrary geometries and boundary conditions, a semi-analytical method (SAM) is proposed. The CGF linear integral equation (CLIE) is analytically derived. By employing the numerical method of moments, the problem of CGF derivation from CLIE is transformed into an inverse matrix problem. Moreover, a sequential SAM is proposed that converts the inversion problem of a large matrix into multiple smaller matrices reducing the computational complexity. Particle-based simulator confirms the results obtained from the proposed SAM. The convergence and run time for the proposed method are examined. Further, the error probability of a simple diffusion-based molecular communication system is analyzed and examined using the proposed method. [ABSTRACT FROM AUTHOR]

In this article, we propose a three-dimensional (3D) multi-input multi-output (MIMO) channel model for air-to-ground (A2G) communications in unmanned aerial vehicles (UAV) environments, where the UAV transmitter and ground receiver are in motion in the air and on the ground, respectively. A novel angular estimation algorithm is proposed to estimate the real-time azimuth angle of departure (AAoD), elevation angle of departure (EAoD), azimuth angle of arrival (AAoA), and elevation angle of arrival (EAoA) based on the non-stationary nature of the channel model. In the model, we investigate the time-varying spatial cross-correlation functions (CCFs) and temporal auto-correlation functions (ACFs) with respect to the different moving directions and velocities of the UAV transmitter and ground receiver. Furthermore, we derive and study the Doppler power spectral densities (PSDs) and power delay profiles (PDPs) of the proposed channel model. Numerical results show that characteristics of the proposed channel model are very close to those of practical measurements, which provide a new and practical approach to evaluate the performance of next generation UAV-MIMO communication systems. [ABSTRACT FROM AUTHOR]

The design of communication systems capable of processing and exchanging information through molecules and chemical processes is a rapidly growing interdisciplinary field, which holds the promise to revolutionize how we realize computing and communication devices. While molecular communication (MC) theory has had major developments in recent years, more practical aspects in designing components capable of MC functionalities remain less explored. This paper designs chemical reactions-based microfluidic devices to realize binary concentration shift keying (BCSK) modulation and demodulation functionalities. Considering existing MC literature on information transmission via molecular pulse modulation, we propose a microfluidic MC transmitter design, which is capable of generating continuously predefined pulse-shaped molecular concentrations upon rectangular triggering signals to achieve the modulation function. We further design a microfluidic MC receiver capable of demodulating a received signal to a rectangular output signal using a thresholding reaction and an amplifying reaction. Our chemical reactions-based microfluidic molecular communication system is reproducible and its parameters can be optimized. More importantly, it overcomes the slow-speed, unreliability, and non-scalability of biological processes in cells. To reveal design insights, we also derive the theoretical signal responses for our designed microfluidic transmitter and receiver, which further facilitate the transmitter design optimization. Our theoretical results are validated via simulations performed through the COMSOL Multiphysics finite element solver. We demonstrate the predefined nature of the generated pulse and the demodulated rectangular signal together with their dependence on design parameters. [ABSTRACT FROM AUTHOR]

Covert communication conceals the existence of the transmission from a watchful adversary. We consider the fundamental limits for covert communications via packet insertion over packet channels whose packet timings are governed by a renewal process of rate $\lambda $. Authorized transmitter Jack sends packets to authorized receiver Steve, and covert transmitter Alice wishes to transmit packets to covert receiver Bob without being detected by watchful adversaries Willie 1 and Willie 2. Willies cannot authenticate the source of the packets or collaborate. Hence, each Willie looks for statistical anomalies in the packet stream from Jack to Steve to attempt detection of unauthorized packet insertion. First, we consider a special case where the packet timings are governed by a Poisson process and we show that Alice can covertly insert $\mathcal {O}(\sqrt {\lambda T})$ packets for Bob in a time interval of length $T$ ; conversely, if Alice inserts $\omega (\sqrt {\lambda T})$ packets, she will be detected by Willie 1 or Willie 2 with high probability. Then, we extend our results to general renewal channels and show that in a stream of $N$ packets transmitted by Jack, Alice can covertly insert $\mathcal {O}(\sqrt {N})$ packets; if she inserts $\omega (\sqrt {N})$ packets, she will be detected by Willie 1 or Willie 2, with high probability. [ABSTRACT FROM AUTHOR]

A hybrid communication network with a common analog source signal and independent digital data streams at the transmitters of a multiple access network is considered. The receiver has to estimate the analog signal samples with a given fidelity, and decode the digital streams with a low error probability. The main goal of this paper is to characterize the optimal tradeoff between the mean-squared error distortion in source estimation and the data rates available to each user. To this end, we consider a Gaussian multiple access channel (GMAC) setup with additive state, where the state is nothing but a scaled version of the source process itself. The state process is assumed to be non-causally available to all the transmitting nodes. The problem now becomes that of the joint state estimation and message communication in a GMAC with state. We provide a complete characterization of the optimal distortion-rate tradeoff for an $N$ —sender GMAC. Our results show that, similar to the single-user results, it is optimal to amplify the state using uncoded transmissions, whereas the digital streams are superposed using appropriate Gaussian codebooks in conjunction with dirty paper coding (DPC). Since the variance of the additive state is controlled by a scaling factor in our model, we also recover the results for communicating a common source and independent messages over a GMAC without state as a special case. [ABSTRACT FROM AUTHOR]

In this paper, a simple memory limited transmitter for molecular communication is proposed, in which information is encoded in the emission rate of the molecules. Taking advantage of memory, the proposed transmitter reduces the ISI problem by properly adjusting its emission rate, which can be interpreted as water-filling on the expected interference. The error probability of the proposed scheme is derived and the result is compared with the error probability of the optimal transmitter obtained by dynamic programming methods. Furthermore, for the special case of channel with one symbol memory, a tight lower bound on error probability is derived. Numerical results show that the performance of introduced transmitter is near optimal. Simplicity is the key feature of the presented communication system: the transmitter follows a simple rule, the receiver is a simple threshold decoder, and only one type of molecule is used to convey the information. [ABSTRACT FROM AUTHOR]

Pre-rake ultra-wideband (UWB) systems are appealing for UWB communications applications which include devices with different processing capabilities so that signal processing complexity need to be shifted from the receiver of one or more devices to the transmitter of another. Recently, basic pre-rake schemes have been extended to include full pre-equalization, multiple-antenna, and multi-user interference processing. All these design approaches for pre-rake UWB systems have relied on the availability of accurate channel state information (CSI) at the transmitter. However, uncertainties in the acquisition of CSI can drastically affect the overall system performance. Therefore, in this paper, we present robust design methods for pre-equalization filters (PEFs) for pre-rake UWB systems that take CSI uncertainties into account. We treat the general case of a broadcast (i.e., multiuser) pre-rake UWB system, which includes single-user communication often considered in literature as a special case. For this general setting, we derive new PEF designs that improve system performance with imperfect CSI. Similar to the literature on robust filter designs for multiple-input multiple output (MIMO) systems, we consider two uncertainty models, namely stochastic and bounded uncertainty, which correspond to different performance optimization paradigms, and we adjust these according to channel estimation of UWB channels. As most of previous work on (pre-rake) UWB, we focus on binary transmission. We argue that widely linear filter design should be applied in this case and thus extend the robust filter design methodology accordingly. Our numerical results for typically UWB test channels demonstrate the efficacy of the proposed design procedures to achieve reliable communication in multiuser pre-rake UWB systems. [ABSTRACT FROM AUTHOR]