Search

Channel estimation is challenging for the reconfigurable intelligent surface (RIS)-aided wireless communications. Since the number of coefficients of the cascaded channel among the base station (BS), the RIS, and the user equipment (UE), is the product of the number of BS antennas, the number of RIS elements, and the number of UEs, the pilot overhead can be prohibitively high. In this paper, we propose a two-timescale channel estimation framework to exploit the property that the BS-RIS channel is high-dimensional but quasi-static, while the RIS-UE channel is mobile but low-dimensional. Specifically, to estimate the quasi-static BS-RIS channel, we propose a dual-link pilot transmission scheme, where the BS transmits downlink pilots and receives uplink pilots reflected by the RIS. Then, we propose a coordinate descent-based algorithm to recover the BS-RIS channel. Since the quasi-static BS-RIS channel is estimated less frequently than the mobile channel is, the average pilot overhead can be reduced from a long-term perspective. Although the mobile RIS-UE channel has to be frequently estimated in a small timescale, the associated pilot overhead is low thanks to its low dimension. Simulation results show that the proposed two-timescale channel estimation framework can achieve accurate channel estimation with low pilot overhead. [ABSTRACT FROM AUTHOR]

Hardware impairment is inevitable in many wireless systems. It is particularly severe in low-cost applications due to the imperfect components used. In this paper, the channel estimation and non-coherent detection problems of hardware impaired signals are studied for a single-carrier, single-antenna and single-hop system. Specifically, three different cases are investigated: signals with additive distortion only, signals with in-phase and quadrature imbalance only, and signals with both impairments. The maximum likelihood and Gaussian approximation methods are used to derive the new non-coherent detectors for amplitude modulated signals, while the maximum likelihood and moment-based methods are employed to design the new channel estimators for all signals. Numerical results show that the new non-coherent detectors outperform the existing non-coherent detectors in the presence of hardware impairment. The performance gain can be as high as 8 dB. They also show that the new channel estimators have much higher accuracy than the existing estimator. In some conditions, the accuracy of the new estimator is about 100 times that of the existing estimator. [ABSTRACT FROM AUTHOR]

This paper focuses on the non-convex joint optimization with a dynamic resource of multi-user for an intelligent reflecting surface-enhanced mmWave system, where all users have individual rates or quality of service requirements. Firstly, the objective function of the above non-linear problem is converted into a quadratic programming form under the quality of service constraints. Further, a multi-blocks alternating optimization framework with dynamic power allocation is proposed to obtain the maximum sum-rate, where the relaxed ADMM algorithm is adopted to tackle the optimal full-digital precoder and the corresponding passive reflecting matrix is obtained by the gradient-projection. The numerical results verify that beam optimization should be emphasized in high SNR, but joint dynamic resource allocation can further improve system performance even if the hardware dimensions reaches the limit. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel unified framework to protect multi-function wireless systems from jamming attacks. Examples of such multi-function system include joint radar and communication (JRC) systems and simultaneous wireless information and power transfer (SWIPT) systems. By abstracting the system functionalities as a joint optimization problem of multiple queues, we achieve effective resistance against jammers for the multi-functions simultaneously. We incorporate different anti-jamming techniques into one framework. Deception mechanism is adopted to lure the jammer to attack and make its actions more predictable, and ambient backscatter technology is used to leverage the jamming signals. Since conventional Markov decision process (MDP) has only one decision epoch at every time slot, it cannot be used to model the deception strategy which needs two decision epochs to leverage the jamming signals. We therefore formulate the problem using an advanced two-step MDP. After that, a deep reinforcement learning algorithm with a prioritized double deep Q-Learning architecture is proposed to learn optimal strategies in different system states. We show that by jointly considering the multi-functions of the system with potential jamming attacks during design phase, significant improvement can be achieved for both of the system functionalities. [ABSTRACT FROM AUTHOR]

Radar radio source (RRS) recognition plays an important role in the fields of military electronic support systems (ESM) and civilian autonomous driving. The rapid development of machine learning technology, especially deep learning, has effectively and efficiently improved RRS intelligent recognition performances when operating in the increasingly complex electromagnetic environment. However, the data sampling limitation and computation cost are still severe challenges in real RRS recognition scenarios. In this paper, we propose a novel network based on meta-transfer learning, called RRSARNet, to achieve effective adaptive RRS recognition in the context of low signal-to-noise ratio (SNR). First, by using the short-time Fourier transform, a six-type small samples RRS simulation dataset with different SNR levels is constructed. Then, a novel RRSARNet, based on metric learning, is proposed, which consists of a four-layer embedding module and a four-layer relational module. Finally, the RRS dataset is divided into training, supporting and testing subsets, which are used to train and test the RRSARNet in a meta-transfer learning method. Experiments on the RRS dataset show that the proposed RRSARNet can achieve an overall accuracy (OA) above 96% and 99% when the SNR is above −15 dB and −10 dB, respectively. Even when the SNR is -30 dB, OA can reach more than 70%. For 5-way 1-shot and 5-way 5-shot experiments, the inference time of an image is about 0.043 and 0.140 milliseconds, respectively. Besides, experiments on the RRS simulation dataset and the two benchmark datasets, the RRSARNet performs better or more competitive than many existing state-of-the-art technologies in terms of recognition accuracy. [ABSTRACT FROM AUTHOR]

This paper proposes a new finite precision iterative decoder for low-density parity-check (LDPC) codes. The proposed decoder, named Sign-Preserving Min-Sum (SP-MS), significantly improves the decoding performance compared to the classical Offset Min-Sum (OMS) decoder when messages are quantized on $q=2$ , 3, or 4 bits. The particularity of the SP-MS decoder is that messages cannot take the 0 value, and can fully benefit from the $q$ bits of precision. The optimization of the SP-MS decoder is investigated in the asymptotic limit of the code length using density evolution (DE). Our study shows that 3-bit SP-MS decoders can achieve the same error-correcting performance as 5-bit OMS decoders, and 2-bit SP-MS decoders outperform 3-bit OMS decoders. The finite-length simulations confirm the conclusions of the DE analysis for several LDPC codes. Our SP-MS decoder shows a signal-to-noise ratio (SNR) gain up to 0.43 dB, with a memory/wire reduction of up to 40%, compared to the OMS decoder. Moreover, the SP-MS decoder converges faster and uses fewer iterations than the OMS decoder, with an improvement of up to 83.3% of the average decoding throughput. On an FPGA, the SP-MS decoder reduces resource utilization by up to 56% compared to the OMS decoder. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the performance of a full-duplex (FD) relay system where multi-antennas are exploited at source and destination. Unlike previous works, the impacts of imperfect channel state information (I-CSI), transceiver hardware noise (THN), and residual self-interference (RSI) are taken into account. We mathematically derive the exact closed-form expressions of the outage probability (OP), symbol error rate (SER), and ergodic capacity (EC) of the FD relay system with I-CSI, THN, and RSI over Nakagami- $m$ fading channels. From the derived expressions, the performance of the considered system under the effects of three negative factors (I-CSI, THN, and RSI) is compared with that system in the case of all ideal factors (perfect channel state information (P-CSI), perfect transceiver hardware (P-TH) and perfect self-interference cancellation (P-SIC)), two ideal factors (P-CSI and P-TH, P-CSI and P-SIC, P-TH and P-SIC), or one ideal factor (P-CSI or P-TH or P-SIC). Numerical results show a strong impact of three negative factors on the OP, SER, and EC of the considered FD relay system, especially when the data transmission rate of the system and signal-to-noise ratio (SNR) are high. In particular, OP, SER, and EC go to the floors in the high SNR regime due to the three negative factors. Therefore, when I-CSI, THNs, and RSI exist in the FD relay system, we should use suitable source and relay transmission power to obtain excellent performance while saving energy consumption. Moreover, when two of the three negative factors are large enough, the remaining factor’s impact becomes weaker and may be neglected in certain circumstances. [ABSTRACT FROM AUTHOR]

In this paper, we consider a multi-user multiple-input multiple-output (MIMO) system aided by multiple intelligent reflecting surfaces (IRSs) that are deployed to increase the coverage and, possibly, the rank of the channel. We propose an optimization algorithm to configure the IRSs, which is aimed at maximizing the network sum-rate by exploiting only the statistical characterization of the locations of the mobile users. As a consequence, the proposed approach does not require the estimation of either instantaneous channel state information (CSI) or second-order channel statistics for IRS optimization, thus significantly relaxing (or even avoiding) the need of frequently reconfiguring the IRSs, which constitutes one of the most critical issues in IRS-assisted systems. Numerical results confirm the validity of the proposed approach. It is shown, in particular, that IRS-assisted wireless systems that are optimized based on statistical position information still provide large performance gains as compared to the baseline scenarios in which no IRSs are deployed. [ABSTRACT FROM AUTHOR]

This paper provides a deep analysis for millimeter-wave device-to-device (mm-wave D2D) underlaid cellular networks to investigate how the performance of individual users or link percentiles under constraints are affected by the interaction between D2D and cellular communication modes integrated with the salient mm-wave features. Under a general Nakagami fading model, we derive the upper bounds for the $b$ -moments of the conditional signal-to-interference-noise ratio (SINR) distributions for the two modes given the network realization, and further calculate the upper bounds of SINR meta distributions (MDs). Moreover, we extend the MD-based analysis to evaluate the fine-grained performance for the transmission effectiveness, through deriving the bounding results for the user-perceived rate MD and spatial rate capacity (SRC), the latter of which is defined as the effective density of users satisfying a given transmission rate requirement with a certain probability. Numerical results validate the tightness of the proposed bounds and reveal the different effects of the network configuration parameter associated with mm-wave on the link and network performances from the view of individual users. [ABSTRACT FROM AUTHOR]

In this paper, we propose primitive rateless (PR) codes. A PR code is characterized by the message length and a primitive polynomial over $\mathbf {GF}(2)$ , which can generate a potentially limitless number of coded symbols. We show that codewords of a PR code truncated at any arbitrary length can be represented as subsequences of a maximum-length sequence ($m$ -sequence). We characterize the Hamming weight distribution of PR codes and their duals and show that for a properly chosen primitive polynomial, the Hamming weight distribution of the PR code can be well approximated by the truncated binomial distribution. We further find a lower bound on the minimum Hamming weight of PR codes and show that there always exists a PR code that can meet this bound for any desired codeword length. We provide a list of primitive polynomials for message lengths up to 40 and show that the respective PR codes closely meet the Gilbert-Varshamov bound at various rates. Simulation results show that PR codes can achieve similar block error rates as their BCH counterparts at various signal-to-noise ratios (SNRs) and code rates. PR codes are rate-compatible and can generate as many coded symbols as required; thus, demonstrating a truly rateless performance. [ABSTRACT FROM AUTHOR]

This paper considers the application of widely linear (WL) receivers in an uplink multi-user system using real-valued modulation schemes, where the cellular base station (BS) with multiple antennas provides connectivity for randomly deployed single-antenna users. The targeted use case is massive machine type communication (mMTC) with grant-free access in the uplink, where the network is required to host a large number of low data rate devices transmitting in an uncoordinated fashion. Four types of WL receivers are investigated, namely the WL zero-forcing (ZF) and the WL minimum mean-squared error (MMSE) receivers, along with their enhanced versions employing successive interference cancellation (SIC) with channel-dependent ordering, i.e., the WL-ZF-SIC and WL-MMSE-SIC receivers. The outage performances of these receivers are analytically characterized in the high signal-to-noise ratio (SNR) regime and compared to those of conventional linear (CL) receivers using complex-valued modulation schemes. For the non-SIC receivers, we show that, when compared to the CL counterparts, the WL receivers yield a higher diversity gain when decoding the same number of users and have the same diversity gain but a decreased coding gain when the number of users is nearly doubled. The outage performance analysis of WL-SIC receivers is facilitated by the marginal distribution of ordered eigenvalues of a real-valued Wishart matrix. It is shown that the SIC operation with channel-dependent ordering brings no additional diversity gain to the WL receivers but instead increases the coding gain. Moreover, the coding gain of WL-SIC receivers grows as the number of users increases and even exceeds that of CL-SIC receivers under suitable conditions. For the mMTC scenario with grant-free transmission, it is demonstrated that the WL receivers outperform their CL counterparts in terms of offering a lower outage (and packet drop) probability and a higher system throughput for a given packet drop probability. [ABSTRACT FROM AUTHOR]

The problem of coding for informed receivers (IR) is considered, where a transmitter multicasts a bunch of messages to its associated receivers, each of which already has a subset of messages as side information. Which receiver has what side information is unknown to the transmitter. A family of polar codes for IR was proposed for binary-input channels in (Huang and Shieh, 2018), which was shown to provide excellent side information gain regardless of side information configuration and content. A trial extension of this scheme to high-order modulations, however, was unsatisfactory. In this paper, two families of systematic polar coded modulations for IR are proposed. In the first family, by building a connection between the message bits and modulated symbols under systematic polar codes, we leverage the bit assignments and labeling techniques such that receiver side information can be directly translated to a minimum distance gain. In the second family, a permutation operation is added before modulation such that the message bits can be properly reordered to further advance and balance the gains among different side information configurations. Simulations show that the proposed schemes provide large and balanced side information gains and significantly outperform the system directly adapted from (Huang and Shieh, 2018) onto high-order modulations. [ABSTRACT FROM AUTHOR]

In order to satisfy the requirement of extremely high data rate in traffic hotspot regions, millimeter wave (mmWave) has attracted significant attention in wireless communication networks. While the coverage performance of mmWave networks based on the distribution of signal-to-interference-plus-noise ratio (SINR) has been widely studied, it provides only very limited information on the link reliability. In this paper, we provide a fine-grained performance analysis of the mmWave networks with hotspots. Specifically, we first establish a general and tractable framework to investigate the performance of mmWave networks using the Poisson cluster process integrated with several features of the mmWave band. Both open and closed association strategies are considered. To show what fraction of users in the networks achieves target reliability when the SINR is given, we derive the tier association probability and the moments of the conditional SINR distribution, based on which the exact meta distributions of SINR are given. Interestingly, in clustered mmWave networks, the widely used standard and generalized beta approximations do not work well when the blockage effect is severe. To resolve this issue, we provide a modified approximation by scaling the standard beta distribution, which is shown to be closer to the exact results. We conduct extensive simulations to study the impact of mmWave and deployment features on the performance of clustered mmWave networks. Numerical results reveal that the optimal scattering variance of mmWave base stations scales with the cluster size to maximize the number of concurrent reliable links, and increasing the antenna directivity results in more reliable communications than elevating the transmit power of mmWave base stations. [ABSTRACT FROM AUTHOR]

Multiple remote antenna units (RAUs) cooperate to serve a certain user in cell-free distributed massive multiple-input multiple-output (MIMO) systems. Due to the different distances between each RAU and the user, asynchronous reception effects will occur. This paper studies the impacts of asynchronous reception effects on cell-free distributed massive MIMO systems. We first derive the minimum-mean-square error (MMSE) channel estimation under the asynchronous reception effects. Given the estimated channel state information, we derive the closed-form expressions of the user achievable rates with maximum ratio transmission (MRT) and regularized zero-forcing (RZF) precoders, which are further used to analyze the impacts of asynchronous reception effects. The accuracy of the closed-form expressions are verified. Simulation results demonstrate that asynchronous reception effects cause a non-negligible drop on the system spectral efficiency. Moreover, the performance degradation is proportional to the subcarrier sequence number and even more serious with the increasing of signal-to-noise ratio (SNR) or the number of antennas per RAU. [ABSTRACT FROM AUTHOR]

When the wireless communication system evolves to massive multiple-input multiple-output (MIMO) system, the system becomes more and more complex. Hybrid beamforming architecture provides excellent trade-off between the system performance and the complexity for the massive MIMO system. Hybrid beamforming architecture can be classified as fully-connected (FC) and sub-connected (SC) architecture. Existing studies on the system performance comparison of the two architectures are limited. In this paper, we investigate the performance of the FC and SC architecture in the multi-user multiple-input single-output (MU-MISO) system. We derive the closed-form sum rate of two architectures under the same total transmission power constraint. From the results, we conclude that the system performance of FC architecture is always better than that of SC architecture. When the number of users is small or the signal noise ratio (SNR) is low, the performance difference between the FC and SC architecture is small. Our analysis can serve as a guideline of choosing hybrid beamforming architectures. [ABSTRACT FROM AUTHOR]

This paper presents a non-orthogonal multiple access (NOMA) scheme with group detection for uplink multiple-input multiple-output (MIMO) systems, for which an effective precoder design is developed. In the scheme, users are divided into groups in accordance with their locations for detection at the base station. The inter- and intra-group interferences are mitigated by successive interference cancellation (SIC) and transceivers, respectively. Based on a derived approximate signal-to-interference-plus-noise ratio (SINR) for using zero-forcing detection, an iterative power and beamforming update procedure is developed for obtaining the user precoders. The precoder design effectively mitigates the intra-group-inter-user correlation making the adopted approximate SINR represent the original SINR accurately. The proposed multi-group MIMO-NOMA scheme can work under more practical transmit-receive antenna configurations and is shown to outperform upon existing cluster-based MIMO-NOMA schemes in terms of total transmit power for various system configurations. The impact of SIC residuals on the multi-group MIMO-NOMA scheme is investigated. Feasibility conditions for the design under imperfect SIC based on the fractional cancellation error model are developed. [ABSTRACT FROM AUTHOR]

In this paper, the average achievable rate and error probability of a reconfigurable intelligent surface (RIS) aided systems is investigated for the finite blocklength (FBL) regime. The performance loss due to the presence of phase errors arising from limited quantization levels as well as hardware impairments at the RIS elements is also discussed. First, the composite channel containing the direct path plus the product of reflected channels through the RIS is characterized. Then, the distribution of the received signal-to-noise ratio (SNR) is matched to a Gamma random variable whose parameters depend on the total number of RIS elements, phase errors and the channels’ path loss. Next, by considering the FBL regime, the achievable rate expression and error probability are identified and the corresponding average rate and average error probability are elaborated based on the proposed SNR distribution. Furthermore, the impact of the presence of phase error due to either limited quantization levels or hardware impairments on the average rate and error probability is discussed. The numerical results show that Monte Carlo simulations conform to matched Gamma distribution to received SNR for sufficiently large number of RIS elements. In addition, the system reliability indicated by the tightness of the SNR distribution increases when RIS is leveraged particularly when only the reflected channel exists. This highlights the advantages of RIS-aided communications for ultra-reliable and low-latency systems. The difference between Shannon capacity and achievable rate in FBL regime is also discussed. Additionally, the required number of RIS elements to achieve a desired error probability in the FBL regime will be significantly reduced when the phase shifts are performed without error. [ABSTRACT FROM AUTHOR]

Terahertz (THz) frequency bands can be promising for data transmissions between the core network and access points (AP) for next-generation wireless systems. In this paper, we analyze the performance of a dual-hop THz-RF wireless system where an AP facilitates data transmission between a core network and user equipment (UE). We consider a generalized model for the end-to-end channel with independent and not identically distributed (i.ni.d.) fading model for THz and RF links using the $\alpha$ - $\mu$ distribution, the THz link with pointing errors, and asymmetrical relay position. We derive a closed-form expression of the cumulative distribution function (CDF) of the end-to-end signal to noise ratio (SNR) for the THz-RF link, which is valid for real-valued $\mu$ for a generalized performance analysis over THz fading channels. Using the derived CDF, we analyze the performance of the THz-RF relayed system using decode-and-forward (DF) protocol by deriving closed-form expressions of outage probability, moments of SNR, average BER, and a tight approximation of ergodic capacity in terms of system parameters. We develop asymptotic analysis on the ergodic capacity, outage probability, and average BER in the high SNR region and derive the diversity order of the system. We also analyze the considered system with an i.i.d. model and develop simplified performance to provide insight on the system behavior analytically under various practically relevant scenarios. Simulation and numerical analysis show a significant effect of fading parameters of the THz link and a nominal effect of normalized beam-width on the performance of the relay-assisted THz-RF system. [ABSTRACT FROM AUTHOR]

To achieve better connectivity in future communication networks, the deployment of different types of access points (APs) is underway. APs are expected to be equipped with self-organizing capabilities to reduce costs. Moreover, due to the spectrum crunch, frequency reuse among the deployed APs is inevitable, exacerbating the problem of inter-cell interference (ICI). Therefore, ICI mitigation in self-organizing networks (SONs) is commonly identified as a key radio resource management mechanism to enhance performance. To this end, this paper proposes a novel solution for the uncoordinated channel and power allocation problems. Based on the multi-armed bandits (MAB) framework, the proposed technique does not require any communication between the APs. The case of varying channel rewards across APs is considered. In contrast to previous work on channel allocation using the MAB framework, APs are permitted to choose multiple channels for transmission. Moreover, non-orthogonal multiple access is used, allowing multiple APs to access each channel simultaneously. This results in an MAB model with varying channel rewards, multiple plays and non-zero reward on collision. The proposed algorithm has an expected regret in the order of $\mathcal {O}(\log ^{2}T)$ , with extensive numerical results revealing it significantly outperforms a well-known baseline algorithm in terms of energy efficiency. [ABSTRACT FROM AUTHOR]

Intelligent reflecting surface (IRS) is deemed as a promising solution to improve the spectral and energy efficiency of wireless communications cost-effectively. In this paper, we consider a wireless network where multiple base stations (BSs) serve their respective users with the aid of distributed IRSs in the downlink communication. Specifically, each IRS assists in the transmission from its associated BS to user via passive beamforming, while in the meantime, it also randomly scatters the signals from other co-channel BSs, thus resulting in additional signal as well as interference paths in the network. As such, a new IRS-user/BS association problem arises pertaining to optimally balance the passive beamforming gains from all IRSs among different BS-user communication links. To address this new problem, we first derive a tractable lower bound of the average signal-to-interference-plus-noise ratio (SINR) at the receiver of each user, termed average-signal-to-average-interference-plus-noise ratio (ASAINR), based on which two ASAINR balancing problems are formulated to maximize the minimum ASAINR among all users by optimizing the IRS-user associations without and with BS transmit power control, respectively. We also characterize the scaling behavior of user ASAINRs with the increasing number of IRS reflecting elements to investigate the different effects of IRS-reflected signal versus interference power. Moreover, to solve the two ASAINR balancing problems that are both non-convex optimization problems, we propose an optimal solution to the problem without BS power control and low-complexity suboptimal solutions to both problems by applying the branch-and-bound method and exploiting new properties of the IRS-user associations, respectively. Numerical results verify our performance analysis and also demonstrate significant performance gains of the proposed solutions over benchmark schemes. [ABSTRACT FROM AUTHOR]

In this paper, we conduct rate-distortion and outage probability analyses for Wyner-Ziv (WZ) systems, where the information sequences from a source and a helper are transmitted to the destination over block Rayleigh fading multiple access channels (MACs). This work has been motivated by decision-making systems, where the aim is to make right decisions based on the observations. Hence, the most critical performance metric is the accuracy of decisions, even allowing distortion in wireless transmission. A sufficient condition for the successful transmissions is that the WZ and MAC regions intersect. For the ease of calculating the outage probability, we propose an approximated, yet accurate, WZ rate region. The outage probabilities of the WZ systems are then evaluated both in orthogonal and MAC transmissions. It is shown that the transmission efficiency of the system with MAC is significantly improved compared to orthogonal transmission. Furthermore, a helper-selection scheme is introduced to further reduce the outage probability of the WZ-MAC systems. The results show that the outage probability decreases, of which decay corresponds to the $(L+1)$ -order diversity with $L$ helpers in small value range of the average signal-to-noise ratio (SNR), while it converges into $L$ as the average SNR becomes large. [ABSTRACT FROM AUTHOR]

Power control is becoming increasingly essential for the fifth-generation (5G) and beyond systems. An example use-case, among others, is the unmanned-aerial-vehicle (UAV) communications where the nearly line-of-sight (LoS) radio channels may result in very low signal-to-interference-plus-noise ratios (SINRs). The authors in (Chiang et al., 2007) proposed to efficiently and reliably solve this kind of non-convex problem via a series of geometrical programmings (GPs) using condensation approximation. However, it is only applicable for a small-scale network with several communication pairs and practically infeasible with more (e.g., tens of) nodes to be jointly optimized. We therefore in this paper aim to provide new insights into this problem. By properly introducing auxiliary variables, the problem is transformed to an equivalent form which is simpler and more intuitive for condensation. A novel condensation method with linear complexity is also proposed based on the form. The enhancements make the GP-based power control feasible for both small- and especially large-scale networks that are common in 5G and beyond. The algorithm is verified via simulations. A preliminary case study of uplink UAV communications also shows the potential of the algorithm. [ABSTRACT FROM AUTHOR]

In this paper, the performance of an unmanned aerial vehicle (UAV)-based free-space optical relay system with amplify-and-forward relaying is analyzed. In particular, the statistical probability of end-to-end signal-to-noise ratio at the destination is obtained under a general condition that takes into account the effects of nonzero boresight pointing errors along with the effects of orientation and position fluctuations of the UAV relay, the UAV position with respect to the source and destination nodes, the optical beamwidth, turbulence strength of both source-to-relay and the relay-to-destination links. Subsequently, the closed-form expressions are derived for the bit-error rate and outage probability of the considered system. The accuracy of the analytical expressions is verified by performing extensive simulations. Analytical results are then utilized to study of the relationship between the optimal system parameters design and UAV's position in the sky. The results show that the optimal UAV's position that achieves a minimum outage probability highly depends on the optical beamwidth at the destination. Moreover, to achieve a minimum outage probability, the relay-to-destination link length must be shorter than source-to-destination (SR) link and by deceasing beamwidth at the destination, the optimal value for SR link length increases. [ABSTRACT FROM AUTHOR]

This paper studies the performance and key structural properties of the optimum location-based relay selection policy for wireless networks consisting of homogeneous Poisson distributed relays. The distribution of the channel quality indicator at the optimum relay location is obtained. A threshold-based distributed selective feedback policy is proposed for the discovery of the optimum relay location with finite average feedback load. It is established that the total number of relays feeding back obeys a Poisson distribution and an analytical expression for the average feedback load is derived. The analytical expressions for the average rate and outage probability with and without selective feedback are obtained for general path-loss models. It is shown that the optimum location-based relay selection policy outperforms other common relay selection strategies notably. It is also shown that utilizing location information from five relays on average is enough to achieve almost the same performance with the infinite feedback load case. As generalizations, isotropic Poisson point processes and heterogeneous source-to-relay and relay-to-destination links are also studied. [ABSTRACT FROM AUTHOR]

Reducing radiation dose in cardiac catheter-based X-ray procedures increases safety but also image noise and artifacts. Excessive noise and artifacts can compromise vital image information, which can affect clinical decision-making. Developing more effective X-ray denoising methodologies will be beneficial to both patients and healthcare professionals by allowing imaging at lower radiation dose without compromising image information. This paper proposes a framework based on a convolutional neural network (CNN), namely Ultra-Dense Denoising Network (UDDN), for low-dose X-ray image denoising. To promote feature extraction, we designed a novel residual block which establishes a solid correlation among multiple-path neural units via abundant cross connections in its representation enhancement section. Experiments on synthetic additive noise X-ray data show that the UDDN achieves statistically significant higher peak signal-to-noise ratio (PSNR) and structural similarity index measure (SSIM) than other comparative methods. We enhanced the clinical adaptability of our framework by training using normally-distributed noise and tested on clinical data taken from procedures at St. Thomas’ hospital in London. The performance was assessed by using local SNR and by clinical voting using ten cardiologists. The results show that the UDDN outperforms the other comparative methods and is a promising solution to this challenging but clinically impactful task. [ABSTRACT FROM AUTHOR]

Employing multi-antenna rate-splitting (RS) at the transmitter and successive interference cancellation (SIC) at the receivers, has emerged as a powerful transceiver strategy for multi-antenna networks. In this paper, we design RS precoders for an overloaded multicarrier multigroup multicast downlink system, and analyse the error performance. RS splits each group message into degraded and designated parts. The degraded parts are combined and encoded into a degraded stream, while the designated parts are encoded in designated streams. All streams are precoded and superimposed in a non-orthogonal fashion before being transmitted over the same time-frequency resource. We first derive the optimized RS-based precoder, where the design philosophy is to achieve a fair user group rate for the considered scenario by solving a joint max-min fairness and sum subcarrier rate optimization problem. Comparing with other precoding schemes including the state-of-the-art multicast transmission scheme, we show that the RS precoder outperforms its counterparts in terms of the fairness rate, with Gaussian signalling, i.e., idealistic assumptions. Then we integrate the optimized RS precoder into a practical transceiver design for link-level simulations (LLS), with realistic assumptions such as finite alphabet inputs and finite code block length. The performance metric becomes the coded bit error rate (BER). In the system under study, low-density parity-check (LDPC) encoding is applied at the transmitter, and iterative soft-input soft-output detection and decoding are employed at the successive interference cancellation based receiver, which completes the LLS processing chain and helps to generate the coded error performance results which validate the effectiveness of the proposed RS precoding scheme compared with benchmark schemes, in terms of the error performance. More importantly, we unveil the corresponding relations between the achievable rate in the idealistic case and coded BER in the realistic case, e.g., with finite alphabet input, for the RS precoded multicarrier multigroup multicast scenario. [ABSTRACT FROM AUTHOR]

In Multimedia Broadcast/Multicast Service(MBMS), Multicast/Broadcast Single Frequency Network (MBSFN) and Single-cell Point-to-multipoint Network (SC-PTM) are two essential ways to organize networks to provide multicast services. MBSFN shows its unique advantage of enhancing signals at the boundary of two cells, however, highly requiring synchronization of symbols. SC-PTM shows the advantage of the flexibility on the network deployment. The comparison and complementarity of these two modes are explored. In this paper, we analyze the reception performance of MBSFN and SC-PTM from multiple perspectives. We first compare the successful transmission probability (STP) of MBSFN with that of SC-PTM. Then, we consider optimal power control problems in MBSFN and SC-PTM. The corresponding power control optimization problems are with fraction and max-min forms and solved by the Dinkelbach algorithm. Furthermore, we propose a joint mode-selection and power-control method in the hybrid mode of MBSFN and SC-PTM, where each cell could select the multicast mode from MBSFN and SC-PTM. This is a mixed-integer nonlinear programming (MINLP) problem and solved by the concave-convex procedure (CCCP) and the Dinkelbach algorithm. To further improve the throughput, the appropriate successful reception proportion is selected under the opportunistic multicast. Finally, the numerical simulations show the performance of our algorithms and compare the throughput of two modes, which verify our analysis. [ABSTRACT FROM AUTHOR]

In this paper, we address the problem of the decoding of variable length physical layer header (PLH) codes. We take as a case study the DVB-S2X standard, and, after selecting a suitable PLH code with variable codeword length, we propose two alternative noncoherent decoding strategies. The proposed decoding strategies allow to estimate the length of the transmitted PLH field, which is unknown at the receiver, jointly with the decoding of the PLH code. We demonstrate that it is possible to achieve an excellent decoding performance while significantly reducing the overhead due to the transmission of the PLH field with respect to a standard fixed-length PLH. [ABSTRACT FROM AUTHOR]

Slotted Aloha provides a simple way for accommodating the massive access of Machine-to-Machine (M2M) communications. Yet, the delay performance of slotted Aloha has long been observed to significantly deteriorate as the network size grows. It is therefore important to study how to optimize the delay performance of slotted Aloha in a large-scale network. This paper focuses on the optimization of access delay of a buffered slotted Aloha network, where $n$ nodes transmit to a common receiver in fading channels. Specifically, by deriving the closed-form expressions of the network steady-state points in both unsaturated and saturated conditions, the first and second moments of access delay of each packet are obtained as explicit functions of system parameters, and minimized by optimizing the transmission probability of each node. The analysis shows that to achieve the minimum mean access delay, the transmission probability of each node should be reduced as the network size increases, leading to a diminishing node data rate unless the information encoding rate is jointly optimized. The minimum mean access delay for a given data rate requirement is further characterized, and effects of key parameters such as the minimum required data rate for each node, the mean received signal-to-noise ratio of each packet and the number of nodes on the rate-constrained minimum mean access delay are discussed. The practical insights of the analysis are also demonstrated by taking the example of an LTE-M system with smart grid applications. [ABSTRACT FROM AUTHOR]

This paper proposes unprecedented Expectation Propagation (EP)-based receivers for Circular Faster-Than-Nyquist (CFTN) signaling. This concept yields a Minimum Mean-Square-Error equalizer for InterSymbol Interference (ISI) processing combined with a block which we call Constellation Matcher in charge of the symbol estimates realignment with the constellation. From this framework, we explore different scheduling strategies leading to iterative EP-based receivers with our without decision feedback. Then, by extending the family of the EP process to a subset of non-circular Gaussian distributions results in a Widely Linear (WL) equalization. This new WL-EP receiver best fits the CFTN model, allowing enhanced performance at the cost of a slightly increased complexity. Also, we propose to restrict the Gaussian family to circular Gaussian distributions with identity covariance matrices up to a scaling factor. Combined with CFTN, this particular family allows a low-complexity Frequency-Domain processing of the equalization without requiring any cyclic prefix. The proposed EP-based receivers for CFTN are then evaluated for different spectral efficiencies and computational complexities. Our simulations show that they completely handle the ISI up to 5 bits/s/Hz and double the spectral efficiency compared to Nyquist signaling with almost no performance loss. [ABSTRACT FROM AUTHOR]

In this paper, we consider a reconfigurable intelligent surface (RIS)-assisted two-way relay network, in which two users exchange information through the base station (BS) with the help of an RIS. By jointly designing the phase shifts at the RIS and beamforming matrix at the BS, our objective is to maximize the minimum signal-to-noise ratio (SNR) of the two users, under the transmit power constraint at the BS. We first consider the single-antenna BS case, and propose two algorithms to design the RIS phase shifts and the BS power amplification parameter, namely the SNR-upper-bound-maximization (SUM) method, and genetic-SNR-maximization (GSM) method. When there are multiple antennas at the BS, the optimization problem can be approximately addressed by successively solving two decoupled subproblems, one to optimize the RIS phase shifts, the other to optimize the BS beamforming matrix. The first subproblem can be solved by using SUM or GSM method, while the second subproblem can be solved by using optimized beamforming or maximum-ratio-beamforming method. The proposed algorithms have been verified through numerical results with computational complexity analysis. [ABSTRACT FROM AUTHOR]

In this paper, we consider non-coherent detection schemes for molecular communication systems in the presence of inter-symbol-interference. In particular, we study non-coherent detectors based on memory-bits-based thresholds in order to achieve low bit-error-ratio (BER) transmission. The main challenge of realizing detectors based on memory-bits-based thresholds is to obtain the channel state information based only on the received signals. We tackle this issue by reformulating the thresholds through intermediate variables, which can be obtained by clustering multi-dimensional data from the received signals, and by using the K-means clustering algorithm. In addition to estimating the thresholds, we show that the transmitted bits can be retrieved from the clustered data. To reduce clustering errors, we propose iterative clustering methods from one-dimensional to multi-dimensional data, which are shown to reduce the BER. Simulation results are presented to verify the effectiveness of the proposed methods. [ABSTRACT FROM AUTHOR]

This paper studies the problem of developing an efficient signal sampling framework for distributed blind spectrum sensing, together with the corresponding local cognitive radio (CR) decision and fusion rules. A novel collaborative sampling and binary output (CSBO) generating scheme is proposed to overcome the disadvantage of traditional energy detectors for blind spectrum sensing, in which the signal-to-noise ratio (SNR) and level of noise power at the CRs are unknown and thus the decision threshold of local energy detectors cannot be specified. In designing the fusion rule in conjunction with the proposed CSBO scheme, both fixed-sample-size tests and sequential tests are considered. It is theoretically shown that the proposed CSBO scheme outperforms traditional blind cooperative energy detectors with uniform sampling schemes in terms of its ability to increase the amount of information acquired under a given number of samples. Simulation results confirm the theoretical analyses, and demonstrate that, compared with the fixed-sample-size test, the sequential test requires fewer observations on average to achieve comparable detection performance. The reduction in the expected sample size needed in the sequential CSBO test when compared to the fixed-sample-size CSBO can reach 50% when primary signal is present. [ABSTRACT FROM AUTHOR]

This paper proposes a new transmitter precoding approach for co-existence between multiple-input multiple-output (MIMO) radar and multi-user MIMO communication systems employing phase shift keying (PSK) modulation. To enable the satisfactions of radar communication functionalities, the common practice is to suppress the mutual interferences, while our proposed scheme is to use the known interferences existing already in radar and communications systems and make the most of them: selectively reverse the destructive interferences to the negative direction while retaining the interferences which are beneficial to the desired signal. The resulting interferences are always kept constructive and can contribute to the power of the useful signal. Numerical results validate that the effective signal to noise ratio (SNR) can be enhanced by 7 dB with no additional power-peruser investment. [ABSTRACT FROM AUTHOR]

In this paper, we concern the uplink of a massive single-input multiple-output enabled ultra-reliable low-latency communication system, in which a single-antenna transmitter aims to timely and reliably send data to a receiver equipped with a large number of antennas over Rayleigh fading channels. For such a scenario, to eliminate the considerable overhead caused by channel estimation, we adopt a noncoherent maximum-likelihood (ML) receiver, which is known to be optimal in terms of average symbol-error rate for equiprobable discrete input signals. We propose a two-dimensional noncoherent constellation design framework to enhance the reliability of the considered system. Specifically, our design principle is to maximize the minimum Kullback-Leibler divergence between the conditional distributions induced by different transmitted signals under average power constraint for any given transmission rate. The resulting optimization problem is shown to be a challenging mixed discrete-continuous problem. We manage to solve the problem by deliberately designing optimal bit allocation and optimal constellation structure as a function of signal-to-noise ratios. We then unveil that the proposed constellation can facilitate efficient ML detection with low computational complexity. Finally, simulation results illustrate that the proposed scheme has a superior error performance than conventional training-based schemes and existing energy detection designs. [ABSTRACT FROM AUTHOR]

In this paper, by considering the average mean squared error (AMSE) of channel estimation, we primarily obtain the closed-from expressions of the probability density function (PDF) and cumulative distribution function of AMSE for the least squares (LS)/minimum mean squared error (MMSE) estimation method as the line-of-sight (LOS) component is known, where the asymptotic analysis is executed in Rayleigh fading and strong LOS conditions. Secondly, the closed-form expressions for the expectation of AMSE (Expamse) and variance of AMSE (Varamse) are acquired, where Varamse is inversely proportional to the number of antennas (M). As M becomes infinite, the PDF of AMSE at Expamse has an order of root M. When the pilot power decreases with M in a power law, the LS case keeps deteriorating while the MMSE case converges to a constant which basically depends on the Rician K-factor. Next, the spectral efficiency is investigated by considering AMSE. When Expamse accelerates, the spectral efficiency of the LS method keeps dropping and that of the MMSE method firstly is degraded and then is improved to a constant except Rayleigh fading. Finally, all results are validated via simulations. [ABSTRACT FROM AUTHOR]

This paper derives the distribution of the maximum end-to-end (e2e) signal to noise ratio (SNR) in an opportunistic relay selection based cooperative relaying network having a large number of non-identical relay links. The source is simultaneous wireless information and power transfer enabled, and the relays are capable of both time splitting (TS) and power splitting (PS) based energy harvesting (EH). Contrary to the majority of literature in communication, which uses extreme value theory (EVT) to derive the statistics of extremes of sequences of independent and identically distributed random variables (RVs), we demonstrate how EVT can be used to derive the maximum statistics of sequences of independent and non-identically distributed normalised SNR and hence the distribution of the maximum SNR. Using these results, we derive simple expressions for evaluating the outage capacity, and achievable throughput at the destination. Finally, we present the utility of the results for deciding the optimum TS and PS factors of the hybrid EH relays that maximise outage capacity, and achievable throughput at the destination. Furthermore, we establish the stochastic ordering of the e2e SNR, which in turn allows the characterisation of the variations in the e2e performance with respect to the variations in different system parameters. [ABSTRACT FROM AUTHOR]

We consider two users A and B wanting to exchange their messages MA and MB via a relay in a wireless communication network. To this aim, we have two methods: direct forward (DF) and computation and forward (CAF). In the first method, after an orthogonal multiple access (OMA) or non-orthogonal multiple access (NOMA) phase, the receiver decodes the two messages. In the second method, after a NOMA phase, the receiver decodes only the (modulo) sum. In the latter case the capacity region (computation region) is not known. This paper compares the two methods. To such aim, we propose a unified coding framework and identify a lower bound of achievable computation rates. We consider three constellations for the symmetric two-user Gaussian channel with Eisenstein constellation showing highest performance. We also show that a minimum signal-to-noise ratio is required for our CAF method to outperform DF, and we obtain the numerical values of such minimum ratios for the three constellations. Finally, we show achievability of our bounds, which is proved to require affine codes for computation, which has not been proved before. Overall, our results are useful for communication system designers towards practical implementation of multiple access methods in integrated wireless systems. [ABSTRACT FROM AUTHOR]

In the near future, it is envisioned that cellular networks will have to cope with extensive internet of things (IoT) devices. Therefore, a required feature of cellular IoT will be the capability to serve simultaneously a large number of devices with heterogeneous demands and qualities of channel state information at the transmitter (CSIT). In this paper, we focus on an overloaded multiple-input single-output (MISO) broadcast channel (BC) with two groups of CSIT qualities, namely, one group of users (representative of high-end devices) for which the transmitter has partial knowledge of the CSI, the other group of users (representative of IoT devices) for which the transmitter only has knowledge of the statistical CSI (i.e., the distribution information of the user channels). We introduce rate-splitting multiple access (RSMA), a new multiple access based on multi-antenna rate-splitting (RS) technique for cellular IoT. Two strategies are proposed, namely, time partitioning–RSMA (TP–RSMA) and power partitioning–RSMA (PP–RSMA). The former independently serves the two groups of users over orthogonal time slots while the latter jointly serves the two groups of users within the same time slot in a non-orthogonal manner. We first show at high signal-to-noise ratio (SNR) that PP–RSMA achieves the optimal degrees-of-freedom (DoF) in an overloaded MISO BC with heterogeneous CSIT qualities. We then show at finite SNR that PP–RSMA achieves explicit sum rate gain over TP–RSMA and all baseline schemes by marrying the benefits of PP and RSMA. Furthermore, PP–RSMA is robust to CSIT inaccuracy and flexible to cope with quality of service (QoS) rate constraints of all users. The DoF and rate analysis helps us in drawing the conclusion that PP–RSMA is a powerful framework for cellular IoT with a large number of devices. [ABSTRACT FROM AUTHOR]

Orthogonal frequency division multiplexing with subcarrier number modulation (OFDM-SNM) has been recently proposed to improve the spectral efficiency (SE) of the traditional OFDM system. In this paper, we propose a joint-mapping OFDM-SNM (JM-OFDM-SNM) scheme to transmit the signal vector with a constant length of information bits by jointly considering the subcarrier activation patterns and constellation symbols. A low-complexity detection scheme based on log-likelihood ratio criterion is proposed to relieve the high computational complexity of the maximum-likelihood detection at the cost of a negligible performance loss. Upper-bounded bit error rate (BER) and lower-bounded achievable rate are both derived in closed-form to evaluate the performance of JM-OFDM-SNM. To suit different application scenarios, we further propose two enhanced schemes, named adaptive JM-OFDM-SNM (AJM-OFDM-SNM) and JM-OFDM with in-phase/quadrature SNM (JM-OFDM-IQ-SNM), where the former adjusts the constellation orders for different numbers of active subcarriers, and the latter extends the indexing to in-phase and quadrature domains. Simulation results corroborate the tightness of the derived BER expression in the high signal-to-noise ratio region and show that (A)JM-OFDM-SNM improves the performance of OFDM-SNM, while both AJM-OFDM-SNM and JM-OFDM-IQ-SNM schemes perform better than JM-OFDM-SNM at the same SE. [ABSTRACT FROM AUTHOR]

Terahertz (THz) wireless technology is envisioned to enable terabit-per-second (Tbps) and secure transmissions in sixth-generation (6G) communication networks and has attracted attention from academia and industry in recent years. Because the transmission range of THz radios is restricted compared to that of microwave radios, frequency reuses in the THz band become much more flexible and even possible among transceiver pairs in close proximity. However, without appropriate spatial arrangement and coordination, the frequency reuse in the THz band can also lead to severe co-channel interference and result in a low signal-to-interference-plus-noise ratio (SINR) or a signal-to-interference ratio (SIR), which finally degrades signal detection and network reliability. To thoroughly study the co-channel interference in the THz band, we model the co-channel interference by the compound channel model and analyze it in detail. The adopted channel model captures the key features of THz communication, such as, spreading loss, molecular absorption loss, and dynamic shadowing, which is much different and complicated than those used in the low-frequency band. The resulted SINR and SIR are investigated by approximating the sum of co-channel interference as a gamma distribution. The generalized analytical results are also reduced to specialized forms for two special cases, i.e., the single-interferer case and the case of multiple independent and identically distributed (i.i.d.) interferers. Due to the generalized nature of the THz interference model constructed in this paper, the results play a meaningful role in practical implementation and can be easily extended to advanced performance analyses for THz communication systems. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surfaces (RIS) is considered as a revolutionary technique to improve the wireless system performance by reconfiguring the radio wave propagation environment artificially. Motivated by the potential of RIS in vehicular networks, we analyze the secrecy outage performance of RIS-aided vehicular communications in this paper. More specifically, two vehicular communication scenarios are considered, i.e., a vehicular-to-vehicular (V2V) communication where the RIS acts as a relay and a vehicular-to-infrastructure (V2I) scenario where the RIS functions as the receiver. In both scenarios, a passive eavesdropper is present attempting to retrieve the transmitted information. Closed-form expressions for the secrecy outage probability (SOP) are derived and verified. The results demonstrate the potential of improving secrecy with the aid of RIS under both V2V and V2I communications. [ABSTRACT FROM AUTHOR]

In this paper, we propose a mixture gamma distribution based analytical framework for NOMA wireless systems over composite fading channels. We analyze the outage probability (OP), delay-limited throughput (TP) and effective capacity (EC) in uplink NOMA with imperfect successive interference cancellation (SIC) due to the presence of residual hardware impairments and delay constraints. A mixture gamma distribution is used to approximate the probability density functions of fading channels. Based on this, we obtain closed-form expressions in terms of Meijer-G functions for the OP, the TP and the EC. We also perform asymptotic analysis of these metrics to characterize system behaviors at the high signal-to-noise ratio regime. Moreover, upper-bounds for the EC is derived. Efficacy of NOMA over orthogonal multiple access is analytically examined. Unlike the existing works, our analytical expressions hold for NOMA systems with an arbitrary number of users per cluster over a wide range of channel models, including lognormal-Nakagami−m, KG, η−μ, Nakagami−q (Hoyt), κ−μ, Nakagami-n (Rician), Nakagami−m, and Rayleigh fading channels. This unified analysis facilitates evaluations of impacts of the residual interference, the power allocation among users, the delay quality-of-service exponent as well as the shadowing and small-scale fading parameters on the performance metrics. Simulation results are provided to validate theoretical analysis. [ABSTRACT FROM AUTHOR]

This paper investigates the impact of realistic propagation conditions on the achievable secrecy performance of multiple-input multiple-output systems in the presence of an eavesdropper (Eve). Specifically, we concentrate on the κ−μ shadowed fading model because its physical underpinnings capture a wide range of propagation conditions, while, at the same time, it allows for a much better tractability than other state-of-the-art fading models. By considering transmit antenna selection and maximal ratio combining reception at the legitimate (Bob) and Eve's receiver sides, we study two relevant scenarios: 1) the transmitter knows Bob's channel state information (CSI) but not Eve's CSI, and 2) the transmitter is aware of the CSI of both Bob and Eve channels. For this purpose, we first obtain novel and tractable expressions for the statistics of the maximum of independent and identically distributed (i.i.d.) variates related to the legitimate channel. Based on these results, we derive novel closed-form expressions of the two aforementioned scenarios to assess the secrecy performance of the underlying system. Specifically, for cases: 1) the secrecy outage probability (SOP), the probability of strictly positive secrecy capacity (SPSC), and 2) the average secrecy capacity (ASC). Moreover, we develop analytical asymptotic expressions of the SOP and ASC in the high signal-to-noise ratio regime. In all instances, secrecy performance metrics are characterized in closed-form, without requiring the evaluation of Meijer-G or Fox-H functions. Some useful insights on how the different propagation conditions and the number of antennas impact the secrecy performance are also provided. [ABSTRACT FROM AUTHOR]

Since the intra-group co-channel interference is introduced intentionally by the non-orthogonal multiple access (NOMA) technique, the reliability of NOMA based networks is limited by far users, while the sum-rate is mainly contributed by near users. In this paper, a NOMA based multiband scheduling policy is proposed to overcome this problem. Unlike conventional NOMA where all users are served in a single frequency band, the proposed scheme divides the entire band into multiple sub-bands, and accommodates the near and far users in different manners by exploring the sub-bands. Particularly, the far users employ repetition-based transmission in all sub-bands, and the maximum ratio combination (MRC) is integrated with successive interference cancellation (SIC) to jointly decode their intended symbols. Closed-form expression of the achievable sum-rate of the proposed scheme is derived, and the outage performance is characterized by the derived upper-bounded outage probability. Numerical results show that the proposed scheme enables NOMA systems to achieve both high reliability and high sum-rate. [ABSTRACT FROM AUTHOR]

In this paper, a mixture Gamma shadowed (MGS) model is proposed as a unified composite distribution via representing the shadowing impact by an inverse Nakagami- $m$. The exact expression and the asymptotic behaviour at high average signal-to-noise ratio (SNR) regime of the fundamental statistics of a MGS distribution are derived first. These statistics are then applied to analyze the performance of the wireless communication systems over double shadowed $\kappa$ - $\mu$ fading channels. In particular, the outage probability (OP), average bit error probability (ABEP), average channel capacity (ACC), effective capacity (EC) and average area under the receiver operating characteristics curve (AUC) of energy detection (ED) are provided. The numerical and simulation results as well as a comparison with previous exact works are presented to verify the validation of our analysis. [ABSTRACT FROM AUTHOR]

Non-orthogonal multiple access (NOMA) is an enabling and key wireless technology for the next generation of mobile communications. Generally, previous works focus on the performance in NOMA networks, based on some assumptions. For instance, the number of users in a NOMA group, is two-category: 1) only two users; 2) any number of users without restriction. And just a certain factor of channel gain, e.g., the propagation path loss or the small scale fading, is subjectively considered to be dominant. Besides, there is lack of the closed-form expression for the probability density function (PDF) of ordered channel gain. In this paper, we investigate a downlink cellular NOMA network with the directional beamforming and the upper limit for user number (ULFUN) in a NOMA group. Meanwhile, the path loss and the Rayleigh fading are taken into account as a whole for ordering channel gains. Based on the derived closed-form PDF of ordered channel gain, we analyze the performance for an arbitrary user in the network and derive closed-form expressions for the outage probability, the approximate meta distribution of conditional success probability (CSP) and the ergodic data rate. The provided simulations demonstrate that the proposed analytical results are accurate and reasonable. Moreover, it illustrates that the existence of ULFUN can have a positive impact on the performance gain in low SINR environments, while in terms of the outage probability, ULFUN would become a non-negligible and negative factor in the improvement of performance for high SINR environments. [ABSTRACT FROM AUTHOR]

Line spectral estimation is a classical signal processing problem that aims to estimate the line spectra from their signal which is contaminated by deterministic or random noise. Despite a large body of research on this subject, the theoretical understanding of this problem is still elusive. In this paper, we introduce and quantitatively characterize the two resolution limits for the line spectral estimation problem under deterministic noise: one is the minimum separation distance between the line spectra that is required for exact detection of their number, and the other is the minimum separation distance between the line spectra that is required for a stable recovery of their supports. The quantitative results imply a phase transition phenomenon in each of the two recovery problems, and also the subtle difference between the two. We further propose a sweeping singular-value-thresholding algorithm for the number detection problem and conduct numerical experiments. The numerical results confirm the phase transition phenomenon in the number detection problem. [ABSTRACT FROM AUTHOR]

In this paper, we develop an innovative approach to quantitatively characterize the performance of ultra-dense wireless networks in a plethora of propagation environments. The proposed framework has the potential of simplifying the cumbersome procedure of analyzing the coverage probability and allowing the unification of single- and multi-antenna networks through compact analytical representations. By harnessing this key feature, we develop a novel statistical machinery to study the scaling laws of wireless networks densification considering general channel power distributions including small-scale fading and shadowing as well as associated beamforming and array gains due to the use of multiple antenna. We further formulate the relationship between network density, antenna height, antenna array seize and carrier frequency showing how the coverage probability can be maintained with ultra-densification. From a system design perspective, we show that, if multiple antenna base stations are deployed at higher frequencies, monotonically increasing the coverage probability by means of ultra-densification is possible, and this without lowering the antenna height. Simulation results substantiate performance trends leveraging network densification and antenna deployment and configuration against path loss models and signal-to-noise plus interference thresholds. [ABSTRACT FROM AUTHOR]

Alternating direction method of multipliers (ADMM) is an efficient implementation of linear programming (LP) decoding for low-density parity-check (LDPC) codes. By adding penalty terms to the objective function of the LP decoding model, ADMM variable node (VN) penalized decoding can suppress the non-integral solutions and improve the frame error rate (FER) performance in the low signal-to-noise ratio (SNR) region. In this paper, we propose a novel ADMM check node (CN) penalized decoding algorithm. Codeword solutions which satisfy all parity-check equations will have smaller penalty values than non-codeword solutions, including the non-integral solutions. We discuss the required properties of CN-penalty functions, propose a few functions that satisfy those properties, and study their performance/complexity trade-offs. We also investigate the convergence properties of the proposed algorithm and prove that its performance is independent of the transmitted codeword. Using Monte Carlo simulations and instanton analysis, we then demonstrate that the proposed CN-penalized decoder outperforms ADMM VN penalized decoders in both waterfall and error floor regions. This comes at the expense of some increase in the decoding complexity. [ABSTRACT FROM AUTHOR]