Search

The diversity-multiplexing tradeoff (DMT) provides a fundamental performance metric for different multiple-input multiple-output (MIMO) schemes in wireless communications. In this paper, we explore the block fading optical wireless communication (OWC) channels and characterize the DMT in the presence of both optical peak- and average-power constraints. Three different fading distributions are considered, which reflect different channel conditions. In each channel condition, we obtain the optimal DMT when the block length is sufficiently large, and we also derive the lower and upper bounds of the DMT curve when the block length is small. These results are dramatically different from the existing DMT results in radio-frequency (RF) channels. These differences may be due to the fact that the optical input signal is real and bounded, while its RF counterpart is usually complex and unbounded.

We improve Gilbert-Varshamov bound by graph spectral method. Gilbert graph $G_{q,n,d}$ is a graph with all vectors in $\mathbb{F}_q^n$ as vertices where two vertices are adjacent if their Hamming distance is less than $d$. In this paper, we calculate the eigenvalues and eigenvectors of $G_{q,n,d}$ using the properties of Cayley graph. The improved bound is associated with the minimum eigenvalue of the graph. Finally we give an algorithm to calculate the bound and linear codes which satisfy the bound.

We derive a sphere-packing error exponent for coded transmission over discrete memoryless channels with a fixed decoding metric. By studying the error probability of the code over an auxiliary channel, we find a lower bound to the probability of error of mismatched decoding. The bound is shown to decay exponentially for coding rates smaller than a new upper bound to the mismatch capacity which is established in this paper. For rates higher than the new upper bound, the error probability is shown to be bounded away from zero. The new upper bound is shown to improve over previous upper bounds to the mismatch capacity.

Due to their flexibility and low cost deployment, unmanned aerial vehicles (UAV) will most likely act as base stations and backhaul relays in the next generation of wireless communication systems. However, these UAVs---in the untethered mode---can only operate for a finite time due to limited energy they carry in their batteries. In free-space optical communications, one solution is to transport both the data and the energy from the source to the UAV through the laser beam---a concept known as simultaneous lightwave information and power transfer (SLIPT). In this study, we have analyzed the SLIPT scheme for laser-powered decode-and-forward UAV relays in an optical wireless backhaul. The major goal of this study is to optimally allocate the received beam energy between the decoding circuit, the transmitting circuit and the rotor block of the relay in order to maximize a quality-of-service metric such as maximum achievable rate, outage or error probabilities. As expected, we note that the optimal power allocation depends heavily on the source-relay and relay-destination channel conditions. In the final part of this study, we have maximized the operational time of the UAV relay given that the maximum achievable rate stays above a certain threshold in order to meet a minimum quality-of-service requirement.

Decoding via sequentially guessing the error pattern in a received noisy sequence has received attention recently, and ORBGRAND has been proposed as one such decoding algorithm that is capable of utilizing the soft information embedded in the received noisy sequence. An information theoretic study is conducted for ORBGRAND, and it is shown that the achievable rate of ORBGRAND using independent and identically distributed random codebooks almost coincides with the channel capacity, for an additive white Gaussian noise channel under antipodal input. For finite-length codes, improved guessing schemes motivated by the information theoretic study are proposed that attain lower error rates than ORBGRAND, especially in the high signal-to-noise ratio regime.

This paper investigates the elliptic localization for moving object problem from time delay (TD) and Doppler frequency shift (DFS) measurements, where the transmitter position and velocity are unknown. The transmitter is not perfectly time syncronized such that unknown offsets exist in the TD and DFS measurements. We propose to jointly estimate the object and transmitter positions and velocities and the offsets. Using the TD and DFS measurements from both the indirect and direct paths between the transmitter and the receivers, we formulate a non-convex weighted least squares (WLS) problem. Local convergence may occur when solving the non-convex WLS problem, implying that good estimate is not guaranteed. Thus, we relax the non-convex WLS problem into a convex semidefinite program by applying semidefinite relaxation (SDR). Moreover, we theoretically show that the performance can be improved by using multiple transmitters as compared to that using single transmitter, although more unknown parameters are introduced. We then extend the proposed SDR method to handle the multiple transmitters case. Finally, the mean square error analysis is provided to show that the proposed WLS method reaches the Cramer-Rao lower bound accuracy under small Gaussian noise condition. Simulation results validate the theoretical analysis and show the superior performance over the existing methods.

To fully unlock the benefits of multiple-input multiple-output (MIMO) networks, downlink channel state information (CSI) is required at the base station (BS). In frequency division duplex (FDD) systems, the CSI is acquired through a feedback signal from the user equipment (UE). However, this may lead to an important overhead in FDD massive MIMO systems. Focusing on these systems, in this study, we propose a novel strategy to design the CSI feedback. Our strategy allows to optimally design variable length feedback, that is promising compared to fixed feedback since users experience channel matrices differently sparse. Specifically, principal component analysis (PCA) is used to compress the channel into a latent space with adaptive dimensionality. To quantize this compressed channel, the feedback bits are smartly allocated to the latent space dimensions by minimizing the normalized mean squared error (NMSE) distortion. Finally, the quantization codebook is determined with k-means clustering. Numerical simulations show that our strategy improves the zero-forcing beamforming sum rate by 17%, compared to CsiNetPro. The number of model parameters is reduced by 23.4 times, thus causing a significantly smaller offloading overhead. At the same time, PCA is characterized by a lightweight unsupervised training, requiring eight times fewer training samples than CsiNetPro., Accepted by IEEE for publication

Terahertz (THz) communications are regarded as a pillar technology for the 6G systems, by offering multi-ten-GHz bandwidth. To overcome the huge propagation loss while reducing the hardware complexity, THz ultra-massive (UM) MIMO systems with hybrid beamforming are proposed to offer high array gain. Notably, the adjustable-phase-shifters considered in most existing hybrid beamforming studies are power-hungry and difficult to realize in the THz band. Moreover, due to the ultra-massive antennas, full channel-state-information (CSI) is challenging to obtain. To address these practical concerns, in this paper, an energy-efficient dynamic-subarray with fixed-phase-shifters (DS-FPS) architecture is proposed for THz hybrid beamforming. To compensate for the spectral efficiency loss caused by the fixed-phase of FPS, a switch network is inserted to enable dynamic connections. In addition, by considering the partial CSI, we propose a row-successive-decomposition (RSD) algorithm to design the hybrid beamforming matrices for DS-FPS. A row-by-row (RBR) algorithm is further proposed to reduce computational complexity. Extensive simulation results show that, the proposed DS-FPS architecture with the RSD and RBR algorithms achieves much higher energy efficiency than the existing architectures. Moreover, the DS-FPS architecture with partial CSI achieves 97% spectral efficiency of that with full CSI., Comment: 30 pages, 10 figures

Degree-of-freedom (DoF)-based models have been proven to be highly successful in modeling and analysis of MIMO systems. Among existing DoF-based models, the number of DoFs used for interference cancellation (IC) is solely based on the number of interfering data streams. However, from both experimental and simulation results, we find that signal strengths of an interference link vary significantly in different directions in the eigenspace. In this paper, we exploit the difference in interference signal strengths in the eigenspace and perform IC with DoFs only on those directions with strong signals. To differentiate interference signal strengths on an interference link, we introduce a novel concept called ‘`effective rank threshold.’' Based on this threshold, DoFs are consumed only to cancel strong interferences in the eigenspace while weak interferences are treated as noise in throughput calculation. To better understand the benefits of this approach, we study a fundamental trade-off between network throughput and effective rank threshold for an MU-MIMO network. Our simulation results show that network throughput under optimal rank threshold is significantly higher than that under existing DoF IC models. To ensure the new DoF IC model is feasible at PHY layer, we propose an algorithm to set the weights for all nodes that can offer our desired DoF allocation.

This letter considers the reconfigurable intelligent surface (RIS)-aided unmanned aerial vehicle (UAV) communication systems in urban areas under the general Rician fading channel. A hybrid offline-online design is proposed to improve the system performance by leveraging both the statistical channel state information (S-CSI) and instantaneous channel state information (I-CSI). For the offline phase, we aim to maximize the expected average achievable rate based on the S-CSI by jointly optimizing the RIS's phase-shift and UAV trajectory. The formulated stochastic optimization problem is difficult to solve due to its non-convexity. To tackle this problem, we propose an efficient algorithm by leveraging the stochastic successive convex approximation (SSCA) techniques. For the online phase, the UAV adaptively adjusts the transmit beamforming and user scheduling according to the effective I-CSI. Numerical results verify that the proposed hybrid design performs better than various bechmark schemes, and also demonstrate a favorable trade-off between system performance and CSI overhead.

This work gives a blind beamforming strategy for intelligent reflecting surface (IRS), aiming to boost the received signal-to-noise ratio (SNR) by coordinating phase shifts across reflective elements in the absence of channel information. While the existing methods of IRS beamforming typically first estimate channels and then optimize phase shifts, we propose a conditional sample mean based statistical approach that explores the wireless environment via random sampling without performing any channel estimation. Remarkably, the new method just requires a polynomial number of random samples to yield an SNR boost that is quadratic in the number of reflective elements, whereas the standard random-max sampling algorithm can only achieve a linear boost under the same condition. Moreover, we gain additional insight into blind beamforming by interpreting it as a least squares problem. Field tests demonstrate the significant advantages of the proposed blind beamforming algorithm over the benchmark algorithms in enhancing wireless transmission., Comment: 16 pages, 15 figures

In this paper, we propose two reconfigurable intelligent surface-aided $M$-ary frequency-modulated differential chaos shift keying (RIS-$M$-FM-DCSK) schemes. In scheme I, the RIS is regarded as a transmitter at the source to incorporate the $M$-ary phase-shift-keying ($M$-PSK) symbols into the FM chaotic signal and to reflect the resultant $M$-ary FM chaotic signal toward the destination. The information bits of the source are carried by both the positive/negative state of the FM chaotic signal and the $M$-PSK symbols. In scheme II, the RIS is treated as a relay so that both the source and relay can simultaneously transmit their information bits to the destination. The information bits of the source and relay are carried by the positive/negative state of the FM chaotic signal and $M$-PSK symbols generated by the RIS, respectively. The proposed RIS-$M$-FM-DCSK system has an attractive advantage that it does not require channel state information for detection, thus avoiding complex channel estimation. Moreover, we derive the theoretical expressions for bit error rates (BERs) of the proposed RIS-$M$-FM-DCSK system with both scheme I and scheme II over multipath Rayleigh fading channels. Simulations results not only verify the accuracy of the theoretical derivations, but also demonstrate the superiority of the proposed system. The proposed RIS-$M$-FM-DCSK system is a promising low-cost, low-power, and high-reliability alternative for wireless communication networks.

This paper studies the feasibility of deploying intelligent reflecting surfaces (IRSs) in massive MIMO (multiple-input multiple-output) systems to improve the performance of users in the service dead zone. To reduce the channel training overhead, we advocate a novel protocol for the uplink communication in the IRS-assisted massive MIMO systems. Under this protocol, the IRS reflection coefficients are optimized based on the channel covariance matrices, which are generally fixed for many coherence blocks, to boost the long-term performance. Then, given the IRS reflecting coefficients, the BS beamforming vectors are designed in each coherence block based on the effective channel of each user, which is the superposition of its direct and reflected user-IRS-BS channels, to improve the instantaneous performance. Since merely the user effective channels are estimated in each coherence block, the training overhead of this protocol is the same as that in the legacy wireless systems without IRSs. Moreover, in the asymptotic regime that the numbers of IRS elements and BS antennas both go to infinity with a fixed ratio, we manage to first characterize the minimum mean-squared error (MMSE) estimators of the user effective channels and then quantify the closed-form user achievable rates as functions of channel covariance matrices with channel training overhead and estimation error taken into account. Interestingly, it is shown that the properties of channel hardening and favorable propagation still hold for the user effective channels, and satisfactory user rates are thus achievable even if simple BS beamforming solutions, e.g., maximal-ratio combining, are employed. Finally, thanks to the rate characterization, we design a low-complexity algorithm to optimize the IRS reflection coefficients based on channel covariance matrices., Comment: submitted to IEEE journal for possible publication

Neuromorphic computing is an emerging computing paradigm that moves away from batched processing towards the online, event-driven, processing of streaming data. Neuromorphic chips, when coupled with spike-based sensors, can inherently adapt to the "semantics" of the data distribution by consuming energy only when relevant events are recorded in the timing of spikes and by proving a low-latency response to changing conditions in the environment. This paper proposes an end-to-end design for a neuromorphic wireless Internet-of-Things system that integrates spike-based sensing, processing, and communication. In the proposed NeuroComm system, each sensing device is equipped with a neuromorphic sensor, a spiking neural network (SNN), and an impulse radio transmitter with multiple antennas. Transmission takes place over a shared fading channel to a receiver equipped with a multi-antenna impulse radio receiver and with an SNN. In order to enable adaptation of the receiver to the fading channel conditions, we introduce a hypernetwork to control the weights of the decoding SNN using pilots. Pilots, encoding SNNs, decoding SNN, and hypernetwork are jointly trained across multiple channel realizations. The proposed system is shown to significantly improve over conventional frame-based digital solutions, as well as over alternative non-adaptive training methods, in terms of time-to-accuracy and energy consumption metrics., Comment: Published on IEEE Transactions on Cognitive Communications and Networking

Coordinated weighted sum-rate maximization in multicell MIMO networks with intra- and intercell interference and local channel state at the base stations is recognized as an important yet difficult problem. A classical, locally optimal solution is obtained by the weighted minimum mean squared error (WMMSE) algorithm which facilitates a distributed implementation in multicell networks. However, it often suffers from slow convergence and therefore large communication overhead. To obtain more practical solutions, the unrolling/unfolding of traditional iterative algorithms gained significant attention. In this work, we demonstrate a complete unfolding of the WMMSE algorithm for transceiver design in multicell MU-MIMO interference channels with local channel state information. The resulting architecture termed GCN-WMMSE applies ideas from graph signal processing and is agnostic to different wireless network topologies, while exhibiting a low number of trainable parameters and high efficiency w.r.t. training data. It significantly reduces the number of required iterations while achieving performance similar to the WMMSE algorithm, alleviating the overhead in a distributed deployment. Additionally, we review previous architectures based on unrolling the WMMSE algorithm and compare them to GCN-WMMSE in their specific applicable domains., Comment: 15 pages, 5 figures. Accepted version. Accepted in IEEE Journal on Selected Areas in Communications

The Maximum Likelihood Decoding Problem (MLD) is known to be NP-hard and its complexity is strictly related to the security of some post-quantum cryptosystems, that is, the so-called code-based primitives. Analogously, the Multivariate Quadratic System Problem (MQ) is NP-hard and its complexity is necessary for the security of the so-called multivariate-based primitives. In this paper we present a closed formula for a polynomial-time reduction from any instance of MLD to an instance of MQ, and viceversa. We also show a polynomial-time isomorphism between MQ and MLD, thus demonstrating the direct link between the two post-quantum cryptographic families., Accepted for publication in Annali di Matematica Pura ed Applicata (1923 -)

We consider an ensemble of constant composition codes that are subsets of linear codes: while the encoder uses only the constant-composition subcode, the decoder operates as if the full linear code was used, with the motivation of simultaneously benefiting both from the probabilistic shaping of the channel input and from the linear structure of the code. We prove that the codebook mismatch can be fully compensated by using a mismatched additive decoding metric that achieves the random coding error exponent of (non-linear) constant composition codes. As the coding rate tends to the mutual information, the optimal mismatched metric approaches the maximum a posteriori probability (MAP) metric, showing that codebook mismatch with mismatched MAP metric is capacity-achieving for the optimal input assignment., Comment: 25 pages, one figure, submitted for publication

Recursive list decoding of Reed-Muller (RM) codes, with moderate list size, is known to approach maximum-likelihood (ML) performance of short length $(\leq 256)$ RM codes. Recursive decoding employs the Plotkin construction to split the original code into two shorter RM codes with different rates. In contrast to the standard approach which decodes the lower-rate code first, the method in this paper decodes the higher-rate code first. This modification enables an efficient permutation-based decoding technique, with permutations being selected on the fly from the automorphism group of the code using soft information from a channel. Simulation results show that the error-rate performance of the proposed algorithms, enhanced by a permutation selection technique, is close to that of the automorphism-based recursive decoding algorithm with similar complexity for short RM codes, while our decoders perform better for longer RM codes. In particular, it is demonstrated that the proposed algorithms achieve near-ML performance for short RM codes and for RM codes of length $2^m$ and order $m - 3$ with reasonable complexity., Comment: Accepted for Publication in IEEE Transactions on Information Theory. This paper has been presented in part at the 2021 IEEE International Symposium on Information Theory (ISIT)

In density functional theory (DFT) based total energy studies, the van der Waals (vdW) and zero-point vibrational energy (ZPVE) correction terms are included to obtain energy differences between polymorphs. We propose and compute a new correction term to the total energy, due to electron-phonon interactions (EPI). We rely on Allen's general formalism, which goes beyond the Quasi-Harmonic Approximation (QHA), to include the free energy contributions due to quasiparticle interactions. We show that, for semiconductors and insulators, the EPI contributions to the free energies of electrons and phonons are the corresponding zero-point energy contributions. Using an approximate version of Allen's formalism in combination with the Allen-Heine theory for EPI corrections, we calculate the zero-point EPI corrections to the total energy for cubic and hexagonal polytypes of Carbon, Silicon and Silicon Carbide. The EPI corrections alter the energy differences between polytypes. In SiC polytypes, the EPI correction term is more sensitive to crystal structure than the vdW and ZPVE terms and is thus essential in determining their energy differences. It clearly establishes that the cubic SiC-3C is metastable and hexagonal SiC-4H is the stable polytype. Our results are consistent with the experimental results of Kleykamp. Our study enables the inclusion of EPI corrections as a separate term in the free energy expression. This opens the way to go beyond the QHA by including the contribution of EPI on all thermodynamic properties., Comment: 30 pages and 2 figures

Large array systems use a massive number of antenna elements and clever precoder designs to achieve an array gain at the user location. These precoders require linear front-ends, and more specifically linear power amplifiers (PAs), to avoid distortion. This reduces the energy efficiency since PAs are most efficient close to saturation, where they generate most nonlinear distortion. Moreover, the use of conventional precoders can induce a coherent combining of distortion at the user locations, degrading the signal quality. In this work, novel linear precoders, simple to compute and to implement, are proposed that allow working close to saturation, while cancelling the third-order nonlinearity of the PA without prior knowledge of the signal statistics and PA model. Their design consists in saturating a single or a few antennas on purpose together with an negative gain with respect to all other antennas to compensate for the overall nonlinear distortion at the user location. The performance gains of the designs are significant for PAs working close to saturation, as compared to maximum ratio transmission (MRT) precoding and perfect per-antenna digital pre-distortion (DPD) compensation., Comment: arXiv admin note: text overlap with arXiv:2110.07891

Consider n nodes communicating over an unreliable broadcast channel. Each node has a single packet that needs to be communicated to all other nodes. Time is slotted, and a time slot is long enough for each node to broadcast one packet. Each broadcast reaches a random subset of nodes. The objective is to minimise the time until all nodes have received all packets. We study two schemes, (i) random relaying, and (ii) random linear network coding, and analyse their performance in an asymptotic regime in which n tends to infinity. Simulation results for a wide range of n are also presented., Submitted to IEEE Transactions on Information Theory

A novel Log periodic patch with circular slot antenna has been presented here, the perturbation of shape of antenna has been done by combining a triangular shape with a semicircular shape. The antenna proposed here is with a DGS structure on its ground plane and its effects on band width and gain enhancement of the antenna is analyzed. The substrate of FR-epoxy material with length, breadth and height 170 mm, 50 mm and 1.6 mm, respectively is taken for implementation of the antenna on it. This proposed antenna operates at 12 GHz to 18 GHz that includes Ku-band with return loss below-10 dB. The parameters of antenna like S-parameters, antenna gain, directivity, VSWR, surface current distribution and radiation efficiency are determined one by one to ascertain its better performance. The simulation as well as the measurement results are comparatively analyzed.

Massive multiple-input multiple-output (MIMO) is a key technology for emerging next-generation wireless systems. Utilizing large antenna arrays at base-stations, massive MIMO enables substantial spatial multiplexing gains by simultaneously serving a large number of users. However, the complexity in massive MIMO signal processing (e.g., data detection) increases rapidly with the number of users, making conventional hand-engineered algorithms less computationally efficient. Low-complexity massive MIMO detection algorithms, especially those inspired or aided by deep learning, have emerged as a promising solution. While there exist many MIMO detection algorithms, the aim of this magazine paper is to provide insight into how to leverage deep neural networks (DNN) for massive MIMO detection. We review recent developments in DNN-based MIMO detection that incorporate the domain knowledge of established MIMO detection algorithms with the learning capability of DNNs. We then present a comparison of the key numerical performance metrics of these works. We conclude by describing future research areas and applications of DNNs in massive MIMO receivers., Comment: 7 pages, 5 figures, Accepted to IEEE Wireless Communications Magazine

Cooperating radios can extend their communication range by adjusting their signals to ensure coherent combining at a destination radio. This technique is called distributed transmit beamforming. Beamforming (BF) relies on the BF radios having frequency synchronized carriers and phases adjusted for coherent combining. Both requirements are typically met by exchanging preambles with the destination. However, since BF aims to increase the communication range, the individually transmitted preambles are typically at low SNR and their lengths are constrained by the channel coherence time. These noisy preambles lead to errors in frequency and phase estimation, which result in randomly changing BF gains. To build reliable distributed BF systems, the impact of estimation errors on the BF gains need to be considered in the design. In this work, assuming a destination-led BF protocol and Kalman filter for frequency tracking, we optimize the number of BF radios and the preamble lengths to achieve reliable BF gain. To do that, we characterize the relations between the BF gains distribution, the channel coherence time, and design parameters like the SNR, preamble lengths, and the number of radios. The proposed relations are verified using simulations and via experiments using software-defined radios in a lab and on UAVs.

Decoding sequences that stem from multiple transmissions of a codeword over an insertion, deletion, and substitution channel is a critical component of efficient deoxyribonucleic acid (DNA) data storage systems. In this paper, we consider a concatenated coding scheme with an outer nonbinary low-density parity-check code or a polar code and either an inner convolutional code or a time-varying block code. We propose two novel decoding algorithms for inference from multiple received sequences, both combining the inner code and channel to a joint hidden Markov model to infer symbolwise a posteriori probabilities (APPs). The first decoder computes the exact APPs by jointly decoding the received sequences, whereas the second decoder approximates the APPs by combining the results of separately decoded received sequences and has a complexity that is linear with the number of sequences. Using the proposed algorithms, we evaluate the performance of decoding multiple received sequences by means of achievable information rates and Monte-Carlo simulations. We show significant performance gains compared to a single received sequence. In addition, we succeed in improving the performance of the aforementioned coding scheme by optimizing both the inner and outer codes., This paper has been accepted for publication in the IEEE Transactions on Information Theory

This paper evaluates outage probability (OP) and intercept probability (IP) of physical-layer security based MIMO networks adopting cooperative jamming (Coop-Jam). In the considered scenario, a multi-antenna source communicates with a multi-antenna destination employing transmit antenna selection (TAS)/ selection combining (SC), in presence of a multi-antenna eavesdropper using SC. One of jammers appearing near the destination is selected for generating jamming noises on the eavesdropper. Moreover, the destination supports the wireless energy for the chosen jammer, and cooperates with it to remove the jamming noises. We consider two jammer selection approaches, named RAND and SHORT. In RAND, the destination randomly selects the jammer, and in SHORT, the jammer, which is nearest to the destination, is chosen. We derive exact and asymptotic expressions of OP and IP over Rayleigh fading, and perform Monte-Carlo simulations to verify the correction of our derivation. The results present advantages of the proposed RAND and SHORT methods, as compared with the corresponding one without using Coop-Jam.

We consider the multiuser detection (MUD) problem, i.e., how to separate and decode colliding data streams, in the uplink of massive Machine Type Communications (mMTC) at millimeter wave (mmWave). Operating on factor-graphs by passing messages, the sum-product algorithm and its variants are widely applied in many other scenarios. However, in this paper, we find that their performance in mMTC at mmWave could be dramatically degraded due to the ill-conditioned MUD channel gain matrix and the existence of enormous short cycles in their corresponding factor-graphs, which are caused by the limited scattering of mmWave and the sharing of a same codebook for error correction among densely located user equipments. Assuming LDPC codes are used for error correction, we further propose a novel sum-product based approach to dealing with the MUD problem in mMTC at mmWave. It first leverages the propagation characteristics of mmWave to optimize the factor-graph for MUD by removing short cycles based on node-split and node-contraction, and then takes a dynamic-programming based method to approximate the messages passing on the resulted factor-graph, which can achieve a higher decoding accuracy. Extensive simulation results show that our approach outperforms the state-of-the-art sum-product based approaches significantly.

Motivated by the need to provide differentiated quality-of-service (QoS) in grant-free uplink transmissions in 5G networks and beyond, we extend the probabilistic analysis of coded Poisson receivers (CPR) to the setting with multiple classes of users and receivers. For such a CPR system, we prove (under certain technical conditions) that there is a region, called the stability region in this paper. Each transmitted packet can be successfully received with probability 1 when the offered load to the system is within the stability region. On the other hand, if the offered load is outside the stability region, there is a nonzero probability that a packet will fail to be received. We then extend the stability region to the $\epsilon$-stability region for CPR systems with decoding errors. We also demonstrate the capability of providing differentiated QoS in such CPR systems by comparing the stability regions under various parameter settings., Comment: 15 pages, 7 figures

This paper introduces a novel information-theoretic approach for studying the effects of mutual coupling (MC), between the transmit and receive antennas, on the overall performance of single-input-single-output (SISO) near-field communications. By incorporating the finite antenna size constraint using Chu's theory and under the assumption of canonical-minimum scattering, we derive the MC between two radiating volumes of fixed sizes. Expressions for the self and mutual impedances are obtained by the use of the reciprocity theorem. Based on a circuit-theoretic two-port model for SISO radio communication systems, we establish the achievable rate for a given pair of transmit and receive antenna sizes, thereby providing an upper bound on the system performance under physical size constraints. Through the lens of these findings, we shed new light on the influence of MC on the information-theoretic limits of near-field communications using compact antennas.

Index modulation (IM) reduces the power consumption and hardware cost of the multiple-input multiple-output (MIMO) system by activating part of the antennas for data transmission. However, IM significantly increases the complexity of the receiver and needs accurate channel estimation to guarantee its performance. To tackle these challenges, in this paper, we design a deep learning (DL) based detector for the IM aided MIMO (IM-MIMO) systems. We first formulate the detection process as a sparse reconstruction problem by utilizing the inherent attributes of IM. Then, based on greedy strategy, we design a DL based detector, called IMRecoNet, to realize this sparse reconstruction process. Different from the general neural networks, we introduce complex value operations to adapt the complex signals in communication systems. To the best of our knowledge, this is the first attempt that introduce complex valued neural network to the design of detector for the IM-MIMO systems. Finally, to verify the adaptability and robustness of the proposed detector, simulations are carried out with consideration of inaccurate channel state information (CSI) and correlated MIMO channels. The simulation results demonstrate that the proposed detector outperforms existing algorithms in terms of antenna recognition accuracy and bit error rate under various scenarios.

In this paper, we propose two novel cooperative-non-orthogonal-multiple-access (C-NOMA) and cooperative-rate-splitting-multiple-access (C-RSMA) schemes for uplink user cooperation. At the first mini-slot of these schemes, each user transmits its signal and receives the transmitted signal of the other user in full-duplex mode, and at the second mini-slot, each user relays the other user's message with amplify-and-forward (AF) protocol. At both schemes, to achieve better spectral efficiency, users transmit signals in the non-orthogonal mode in both mini-slots. In C-RSMA, we also apply the rate-splitting method in which the message of each user is divided into two streams. In the proposed detection schemes for C-NOMA and C-RSMA, we apply a combination of maximum-ratio-combining (MRC) and successive-interference-cancellation (SIC). Then, we derive the achievable rates for C-NOMA and C-RSMA, and formulate two optimization problems to maximize the minimum rate of two users by considering the proportional fairness coefficient. We propose two power allocation algorithms based on successive-convex-approximation (SCA) and geometric-programming (GP) to solve these non-convex problems. Next, we derive the asymptotic outage probability of the proposed C-NOMA and C-RSMA schemes, and prove that they achieve diversity order of two. Finally, the above-mentioned performance is confirmed by simulations., Comment: 32 pages, 13 figures

An upper bound on the capacity of multiple-input multiple-output (MIMO) Gaussian fading channels is derived under peak amplitude constraints. The upper bound is obtained borrowing concepts from convex geometry and it extends to MIMO channels notable results from the geometric analysis on the capacity of scalar Gaussian channels. Relying on a sphere packing argument and on the renowned Steiner's formula, the proposed upper bound depends on the intrinsic volumes of the constraint region, i.e., functionals defining a measure of the geometric features of a convex body. The tightness of the bound is investigated at high signal-to-noise ratio (SNR) for any arbitrary convex amplitude constraint region, for any channel matrix realization, and any dimension of the MIMO system. In addition, two variants of the upper bound are proposed: one is useful to ensure the feasibility in the evaluation of the bound and the other to improve the bound's performance in the low SNR regime. Finally, the upper bound is specialized for two practical transmitter configurations, either employing a single power amplifier for all transmitting antennas or a power amplifier for each antenna., Comment: Submitted to IEEE Transactions on Information Theory. Part of this work was presented at the 2020 IEEE Information Theory Workshop

A decoding algorithm is essential to any fault-tolerant quantum-computing architecture. In this perspective we explore decoding algorithms for the surface code; a prototypical quantum low-density parity-check code that underlies many of the leading efforts to demonstrate scalable quantum computing. Central to our discussion is the minimum-weight perfect-matching decoder. The decoder works by exploiting underlying structure that arises due to materialised symmetries among surface-code stabilizer elements. By concentrating on these symmetries, we begin to address the question of how a minimum-weight perfect-matching decoder might be generalised for other types of code. We approach this question first by investigating examples of matching decoders for other codes. These include decoding algorithms that have been specialised to correct for noise models that demonstrate a particular structure or bias with respect to certain types of code. In addition to this, we propose a systematic way of constructing a minimum-weight perfect-matching decoder for codes with certain characteristic properties. The properties we make use of are common among topological codes. We discuss the broader applicability of the proposal, and we suggest some questions we can address that may show us how to design a generalised matching decoder for arbitrary stabilizer codes., Perspective article; 11 pages, 7 figures, comments welcome

Massive multiple-input multiple-output (MIMO) and full-duplex (FD) are promising candidates for achieving the spectral efficiency to meet the needs of 5G communications. One essential key to realizing practical FD massive MIMO systems is how to effectively mitigate the self-interference (SI). Conventionally, however, the performance comparison of different SI methods by reflecting the actual channel characteristics was insufficient in the literature. Accordingly, this paper presents a performance analysis of SI cancellation (SIC) methods in FD massive MIMO systems. Analytical and numerical results confirm that, in an imperfect channel-estimation case, the ergodic rates performance of the spatial suppression in the uplink outperforms those of the SI subtraction, due to the correlation between the precoder and the estimation error of the SI channel. In addition, we discuss which method performs better under different given system constraints such as uplink and downlink sum rates, the total transmit power, and the power scaling law., Comment: 15 pages, 8 figures, (under revision) submitted to IEEE Transactions on Wireless Communications

Massive MIMO opens up attractive possibilities for next generation wireless systems with its large number of antennas offering spatial diversity and multiplexing gain. However, the fronthaul link that connects a massive MIMO Remote Radio Head (RRH) and carries IQ samples to the Baseband Unit (BBU) of the base station can throttle the network capacity/speed if appropriate data compression techniques are not applied. In this paper, we propose an iterative technique for fronthaul load reduction in the uplink for massive MIMO systems that utilizes the convolution structure of the received signals. We use an alternating minimisation algorithm for blind deconvolution of the received data matrix that provides compression ratios of 30-50. In addition, the technique presented here can be used for blind decoding of OFDM signals in massive MIMO systems., Comment: 7 pages, 3 figures

The most important variables to consider in the design of antennas for RFED applications and effective communications are low cost, low profile, and reduced size. The dipole antenna, often known as a dipole aerial, is the most basic and widely used type of antenna. Among other antennas, this is one of the most straightforward antenna layouts. It may be achieved by applying a sinusoidal voltage differential between two thin metallic rods. The dipole antenna is a particularly important type of RF antenna that is frequently used for radio transmission and reception. For many types of antennas, this antenna can be employed as a radiating or driving element. This Dipole antenna may be used in the radio frequency spectrum sections HF, VHF and UHF. The major advantage of a dipole antenna is that it can serve as both a broadcast transmitter and receiver. So, to obtain the most crucial factors, we'll design an antenna in COMSOL Multi Physics and display the results as Radiation patterns.

This article focuses on the development of integrated sensing and communications (ISAC) from a multiple access (MA) perspective, where the idea of non-orthogonal multiple access (NOMA) is exploited for harmoniously accommodating the sensing and communication functionalities. We first reveal that the developing trend of ISAC is from \emph{orthogonality} to \emph{non-orthogonality}, and introduce the fundamental models of the downlink and uplink ISAC while identifying the design challenges from the MA perspective. (1) For the downlink ISAC, we propose two novel designs, namely \emph{NOMA-empowered} downlink ISAC and \emph{NOMA-inspired} downlink ISAC to effectively coordinate the inter-user interference and the sensing-to-communication interference, respectively. (2) For the uplink ISAC, we first propose a \emph{pure-NOMA-based} uplink ISAC design, where a fixed communication-to-sensing successive interference cancellation order is employed for distinguishing the mixed sensing-communication signal received over the fully shared radio resources. Then, we propose a general \emph{semi-NOMA-based} uplink ISAC design, which includes the conventional orthogonal multiple access-based and pure-NOMA-based uplink ISAC as special cases, thus being capable of providing flexible resource allocation strategies between sensing and communication. Along each proposed NOMA-ISAC design, numerical results are provided for showing the superiority over conventional ISAC designs., 7 pages, 5 figures

In the wideband regime, the performance of many of the popular modulation schemes such as code division multiple access and orthogonal frequency division multiplexing falls quickly without channel state information. Obtaining the amount of channel information required for these techniques to work is costly and difficult, which suggests the need for schemes which can perform well without channel state information. In this work, we present one such scheme, called wideband time frequency coding, which achieves rates on the order of the additive white Gaussian noise capacity without requiring any channel state information. Wideband time frequency coding combines impulsive frequency shift keying with pulse position modulation, which allows for information to be encoded in both the transmitted frequency and the transmission time period. On the detection side, we propose a non-coherent decoder based on a square-law detector, akin to the optimal decoder for frequency shift keying based signals. The impacts of various parameters on the symbol error probability and capacity of wideband time frequency coding are investigated, and the results show that it is robust to shadowing and highly fading channels. When compared to other modulation schemes such as code division multiple access, orthogonal frequency division multiplexing, pulse position modulation, and impulsive frequency shift keying without channel state information, wideband time frequency coding achieves higher rates in the wideband regime, and performs comparably in smaller bandwidths.

In a time-varying massive multiple-input multipleoutput (MIMO) system, the acquisition of the downlink channel state information at the base station (BS) is a very challenging task due to the prohibitively high overheads associated with downlink training and uplink feedback. In this paper, we consider the hybrid precoding structure at BS and examine the antennatime domain channel extrapolation. We design a latent ordinary differential equation (ODE)-based network under the variational auto-encoder (VAE) framework to learn the mapping function from the partial uplink channels to the full downlink ones at the BS side. Specifically, the gated recurrent unit is adopted for the encoder and the fully-connected neural network is used for the decoder. The end-to-end learning is utilized to optimize the network parameters. Simulation results show that the designed network can efficiently infer the full downlink channels from the partial uplink ones, which can significantly reduce the channel training overhead., Comment: 5 pages, 5 figures

We propose a novel interference alignment (IA) technique with receive antenna partitioning (RAP) for simultaneous wireless information and power transfer (SWIPT)-enabled downlink fog radio access networks (F-RANs). The basic idea of the proposed scheme is to apply a generalized downlink IA for each access point (AP) and to divide receive antennas at each user into two groups for information decoding (ID) and energy harvesting (EH), respectively. With the proposed scheme, an optimal receive antenna configuration at each user is obtained to maximize the weighted sum of achievable rate and the sum of harvested energy of the network. Also we develop an antenna configuration selection algorithm to obtain near-optimal performance with low computational complexity. Through extensive computer simulations, it is shown that the proposed scheme significantly improves a rate-energy region compared with existing techniques.

In wireless communication, the performance of the network highly relies on the accuracy of channel state information (CSI). On the other hand, the channel statistics are usually unknown, and the measurement information is lost due to the fading phenomenon. Therefore, we propose a channel estimation approach for downlink communication under channel uncertainty. We apply the Tobit Kalman filter (TKF) method to estimate the hidden state vectors of wireless channels. To minimize the maximum estimation error, a robust minimax minimum estimation error (MSE) estimation approach is developed while the QoS requirements of wireless users is taken into account. We then formulate the minimax problem as a non-cooperative game to find an optimal filter and adjust the best behavior for the worst-case channel uncertainty. We also investigate a scenario in which the actual operating point is not exactly known under model uncertainty. Finally, we investigate the existence and characterization of a saddle point as the solution of the game. Theoretical analysis verifies that our work is robust against the uncertainty of the channel statistics and able to track the true values of the channel states. Additionally, simulation results demonstrate the superiority of the model in terms of MSE value over related techniques.

Broadcast/multicast communication systems are typically designed to optimize the outage rate criterion, which neglects the performance of the fraction of clients with the worst channel conditions. Targeting ultra-reliable communication scenarios, this paper takes a complementary approach by introducing the conditional value-at-risk (CVaR) rate as the expected rate of a worst-case fraction of clients. To support differential quality-of-service (QoS) levels in this class of clients, layered division multiplexing (LDM) is applied, which enables decoding at different rates. Focusing on a practical scenario in which the transmitter does not know the fading distribution, layer allocation is optimized based on a dataset sampled during deployment. The optimality gap caused by the availability of limited data is bounded via a generalization analysis, and the sample complexity is shown to increase as the designated fraction of worst-case clients decreases. Considering this theoretical result, meta-learning is introduced as a means to reduce sample complexity by leveraging data from previous deployments. Numerical experiments demonstrate that LDM improves spectral efficiency even for small datasets; that, for sufficiently large datasets, the proposed mirror-descent-based layer optimization scheme achieves a CVaR rate close to that achieved when the transmitter knows the fading distribution; and that meta-learning can significantly reduce data requirements., Comment: 31 pages, 8 figures, submitted for possible journal publication

The channel state information (CSI) is essential for the base station (BS) to schedule user equipments (UEs) and efficiently manage the radio resources. Hence, the BS requests UEs to regularly feed back the CSI. However, frequent CSI reporting causes large signaling overhead. To reduce the feedback overhead, we propose two machine learning-based approaches to adjust the CSI feedback interval. We use a deep neural network and reinforcement learning (RL) to decide whether an UE feeds back the CSI. Simulation results show that the RL-based approach achieves the lowest mean squared error while reducing the number of CSI feedback transmissions.

We consider a coded compressed sensing approach for the unsourced random access and replace the outer tree code proposed by Amalladinne et al. with the list recoverable code capable of correcting t errors. A finite-length random coding bound for such codes is derived. The numerical experiments in the single antenna quasi-static Rayleigh fading MAC show that transition to list recoverable codes correcting t errors improves the performance of coded compressed sensing scheme by 7-10 dB compared to the tree code-based scheme. We propose two practical constructions of outer codes. The first is a modification of the tree code. It utilizes the same code structure, and a key difference is a decoder capable of correcting up to t errors. The second is based on the Reed-Solomon codes and Guruswami-Sudan list decoding algorithm. The first scheme provides an energy efficiency very close to the random coding bound when the decoding complexity is unbounded. But for the practical parameters, the second scheme is better and improves the performance of a tree code-based scheme when the number of active users is less than 200.

An improved Singleton-type upper bound is presented for the list decoding radius of linear codes, in terms of the code parameters [n,k,d] and the list size L. L-MDS codes are then defined as codes that attain this bound (under a slightly stronger notion of list decodability), with 1-MDS codes corresponding to ordinary linear MDS codes. Several properties of such codes are presented; in particular, it is shown that the 2-MDS property is preserved under duality. Finally, explicit constructions for 2-MDS codes are presented through generalized Reed-Solomon (GRS) codes., Comment: Main changes from v1: replaced Theorem 4 by a stronger result and added Corollary 5, Lemma 8, and Corollary 9

We study the list decodability of different ensembles of codes over the real alphabet under the assumption of an omniscient adversary. It is a well-known result that when the source and the adversary have power constraints $ P $ and $ N $ respectively, the list decoding capacity is equal to $ \frac{1}{2}\log\frac{P}{N} $. Random spherical codes achieve constant list sizes, and the goal of the present paper is to obtain a better understanding of the smallest achievable list size as a function of the gap to capacity. We show a reduction from arbitrary codes to spherical codes, and derive a lower bound on the list size of typical random spherical codes. We also give an upper bound on the list size achievable using nested Construction-A lattices and infinite Construction-A lattices. We then define and study a class of infinite constellations that generalize Construction-A lattices and prove upper and lower bounds for the same. Other goodness properties such as packing goodness and AWGN goodness of infinite constellations are proved along the way. Finally, we consider random lattices sampled from the Haar distribution and show that if a certain number-theoretic conjecture is true, then the list size grows as a polynomial function of the gap-to-capacity., Comment: Significantly revised

This correspondence paper studies a network integrated sensing and communication (ISAC) system that unifies the interference channel for communication and distributed radar sensing. In this system, a set of distributed ISAC transmitters send individual messages to their respective communication users (CUs), and at the same time cooperate with multiple sensing receivers to estimate the location of one target. We exploit the coordinated power control among ISAC transmitters to minimize their total transmit power while ensuring the minimum signal-to-interference-plus-noise ratio (SINR) constraints at individual CUs and the maximum Cram\'{e}r-Rao lower bound (CRLB) requirement for target location estimation. Although the formulated coordinated power control problem is non-convex and difficult to solve in general, we propose two efficient algorithms to obtain high-quality solutions based on the semi-definite relaxation (SDR) and CRLB approximation, respectively. Numerical results show that the proposed designs achieve substantial performance gains in terms of power reduction, as compared to the benchmark with a heuristic separate communication-sensing design., Comment: 5 pages, 4 figures

International audience; The Goppa Code Distinguishing (GD) problem asks to distinguish efficiently a generator matrix of a Goppa code from a randomly drawn one. We revisit a distinguisher for alternant and Goppa codes through a new approach, namely by studying the dimension of square codes. We provide here a rigorous upper bound for the dimension of the square of the dual of an alternant or Goppa code, while the previous approach only provided algebraic explanations based on heuristics. Moreover, for Goppa codes, our proof extends to the non-binary case as well, thus providing an algebraic explanation for the distinguisher which was missing up to now. All the upper bounds are tight and match experimental evidence. Our work also introduces new algebraic results about products of trace codes in general and of dual of alternant and Goppa codes in particular, clarifying their square code structure. This might be of interest for cryptanalysis purposes.

In this paper, we propose a wideband Full Duplex (FD) Multiple-Input Multiple-Output (MIMO) communication system comprising of an FD MIMO node simultaneously communicating with two multi-antenna UpLink (UL) and DownLink (DL) nodes utilizing the same time and frequency resources. To suppress the strong Self-Interference (SI) signal due to simultaneous transmission and reception in FD MIMO systems, we propose a joint design of Analog and Digital (A/D) cancellation as well as transmit and receive beamforming capitalizing on baseband Orthogonal Frequency-Division Multiplexing (OFDM) signal modeling. Considering practical transmitter impairments, we present a multi-tap wideband analog canceller architecture whose number of taps does not scale with the number of transceiver antennas and multipath SI components. We also propose a novel adaptive digital cancellation based on truncated singular value decomposition that reduces the residual SI signal estimation parameters. To maximize the FD sum rate, a joint optimization framework is presented for A/D cancellation and digital beamforming. Finally, our extensive waveform simulation results demonstrate that the proposed wideband FD MIMO design exhibits higher SI cancellation capability with reduced complexity compared to existing cancellation techniques, resulting in improved achievable rate performance., 32 pages, 10 figures, Under Review for Publication in the IEEE Transactions on Wireless Communications

A novel permuted fast successive-cancellation list decoding algorithm with fast Hadamard transform (FHT-FSCL) is presented. The proposed decoder initializes $L$ $(L\ge1)$ active decoding paths with $L$ random codeword permutations sampled from the full symmetry group of the codes. The path extension in the permutation domain is carried out until the first constituent RM code of order $1$ is visited. Conventional path extension of the successive-cancellation list decoder is then utilized in the information bit domain. The simulation results show that for a RM code of length $512$ with $46$ information bits, by running $20$ parallel permuted FHT-FSCL decoders with $L=4$, we reduce $72\%$ of the computational complexity, $22\%$ of the decoding latency, and $84\%$ of the memory consumption of the state-of-the-art simplified successive-cancellation decoder that uses $512$ permutations sampled from the full symmetry group of the code, with similar error-correction performance at the target frame error rate of $10^{-4}$., Submitted to an IEEE journal for possible publication