Search

This paper concerns the problem of defending against spoofing attacks without a secret key. We address the problem using the Physical-Layer-Authentication (PLA) because of its high security, low overhead, and high compatibility. However, many PLA schemes have the following limitations: quantization errors, local optimums, and performance loss due to the change in the communication environment. In this paper, two phase-noise-based PLA schemes are proposed to address the limitations of the prior schemes. We denote the first scheme as the Multiple Phase Noises PLA (MPP) scheme, which realizes the PLA by using multiple phase noise innovations. Note that since the MPP scheme avoids using any quantization algorithm, it outperforms the prior schemes on the authentication performance. We denote the second scheme as the Enhanced Multiple Phase Noises PLA (EMPP) scheme, which introduces an artificial random phase to the transmitted symbols at the transmitter to further improve the authentication performance. The theoretical analyses of the proposed schemes over fading channels are provided, where the closed-form expressions are derived. Theoretical comparisons between the proposed schemes and prior schemes are provided. The theoretical analyses and simulation results demonstrated the superiority of the proposed schemes. In comparison with the prior schemes, the MPP scheme achieves 13% authentication-performance gain without demodulation-performance loss, while the EMPP scheme achieves 42% authentication-performance gain with merely 16% demodulation-performance loss. [ABSTRACT FROM AUTHOR]

Cell-free massive MIMO is one of the key technologies for future wireless communications, in which users are simultaneously and jointly served by all access points (APs). In this paper, we investigate the minimum mean square error (MMSE) estimation of effective channel coefficients in cell-free massive MIMO systems with massive connectivity. To facilitate the theoretical analysis, only single measurement vector (SMV) based MMSE estimation is considered in this paper, i.e., the MMSE estimation is performed based on the received pilot signals at each AP separately. Inspired by the decoupling principle of replica symmetric postulated MMSE estimation of sparse signal vectors with independent and identically distributed (i.i.d.) non-zero components, we develop the corresponding decoupling principle for the SMV based MMSE estimation of sparse signal vectors with independent and non-identically distributed (i.n.i.d.) non-zero components, which plays a key role in the theoretical analysis of SMV based MMSE estimation of the effective channel coefficients in cell-free massive MIMO systems with massive connectivity. Subsequently, based on the obtained decoupling principle of MMSE estimation, likelihood ratio test and the optimal fusion rule, we perform user activity detection based on the received pilot signals at only one AP, or cooperation among the entire set of APs for centralized or distributed detection. Via theoretical analysis, we show that the error probabilities of both centralized and distributed detection tend to zero when the number of APs tends to infinity while the asymptotic ratio between the number of users and pilots is kept constant. We also investigate the asymptotic behavior of oracle estimation in cell-free massive MIMO systems with massive connectivity via random matrix theory. Moreover, in order to demonstrate the potential performance loss of SMV based MMSE estimation, which does not employ the correlation between the received pilot signals at different APs, the multiple measurement vector (MMV) based MMSE estimation, i.e., joint MMSE estimation with pilot signals from all APs, is analyzed via numerical results. Numerical analysis shows that the theoretical analyze with our decoupling principle for the SMV based MMSE estimation of sparse signal vectors with i.n.i.d. non-zero components matches well with the numerical results. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel state-space model to represent the behavior of sum-product algorithm (SPA) in the vicinity of a trapping set (TS) of a low-density parity-check (LDPC) code over the additive white Gaussian noise (AWGN) channel in the error floor region. The proposed model takes into account the non-linear behavior of SPA in the initial iterations using a quadratic approximation, and dynamically adjusts the operating point of the model in accordance to the statistical properties of TS messages. This is in contrast to the existing linear state-space models which linearly approximate the non-linear behavior of SPA at around the operating point of zero in all iterations. Simulation results are provided to demonstrate the higher accuracy of the proposed model in estimating the error floor of LDPC codes compared to the linear state-space model. We also make connections to the semi-analytical code-dependent technique proposed by Richardson for the error floor estimation of LDPC codes, and demonstrate that the proposed state-space model not only is a fully-analytical code-independent counterpart to that method, but also has less complexity and, in some cases, more accuracy. [ABSTRACT FROM AUTHOR]

Real-time monitoring has received considerable attention recently due to its potential in automatic driving, tele-surgery, and factory automation in the 6G era. In remote estimation or reconstruction of stochastic processes, the statistical properties of stochastic processes to be monitored play a central role. Among the stochastic processes interested by real-time applications, the Brownian motion, also known as the Wiener processes is a typical one. In this paper, we are interested in how to monitor Brownian motions efficiently, timely, and reliably. To achieve this goal, we reveal that the real-time estimation error is jointly determined by the quantization error and freshness of data samples. Based on this observation, we present an optimal joint sampling and quantization scheme that efficiently balances the quantization distortion and the age-of-information (AoI). Furthermore, we find that the error accumulation will lead to infinite distortion as monitoring time increases. To overcome this, a multi-layer error correction method is presented for infinite-time monitoring, in which bounded distortion can be achieved with limited data rate. Finally, to conquer the accumulation of transmission errors in unreliable channels, we present an error correction mechanism based on periodic feedback. Diffusion approximation is then adopted to determine the optimal feedback rate and interval. [ABSTRACT FROM AUTHOR]

Energy-efficient time synchronizations for wireless sensor networks (WSNs) have been put under the spotlight for years. A promising technique among which is the timestamp-free approach where no timestamps are required to establish the synchronization, thereby sparing the transmissions of the timing messages for conserving significant transmission energy. In this paper, we first investigate the feasibility of adopting timestamp-free time synchronization in practical resource-constrained WSNs; we then identify the issue of inaccuracy in maintaining the pre-defined response interval which affects the foundations of most existing timestamp-free schemes. Based on the investigation and our previously proposed reverse asymmetric time synchronization framework, we further propose an asymmetric timestamp-free time synchronization scheme with two estimation methods tailored for resource-constrained WSNs. We as well introduce the centralized and distributed multi-hop extension methods for the proposed scheme to cover diverse multi-hop scenarios. Experimental results on a real WSN testbed consisting of TelosB motes running TinyOS demonstrate that the proposed scheme achieves high energy efficiency while maintaining microsecond-level time synchronization accuracy compared to three other conventional schemes. [ABSTRACT FROM AUTHOR]

Massive multiple-input multiple-output (MIMO) integrated with millimeter-wave (mmWave) can provide unprecedented performance improvement for realizing future wireless communications. However, acquiring accurate channel state information in wideband mmWave massive MIMO systems with hybrid transceiver architectures is even challenging, especially in high-mobility scenarios with severe Doppler effects. In this paper, we propose a tensor decomposition-based method to estimate the time-varying and frequency-selective (TVFS) mmWave MIMO channels. Specifically, by exploiting the sparse scattering nature of TVFS channels, we model the frequency-domain received signal as a third-order tensor that admits a canonical polyadic (CP) decomposition format. Then, we analyze the uniqueness condition of the proposed CP decomposition-based channel estimation problem and propose a novel estimator to acquire TVFS channel parameters including angle of departure/arrival (AoD/AoA), time delay, path gain, and the Doppler shift. To address the sophisticated coupling among unknown parameters, we further propose a joint AoD and Doppler shift estimation (JADE) algorithm that provides reliable initial and iteratively refined estimates. The derived analysis and simulation results verify that the proposed JADE algorithm achieves higher estimation accuracy and guarantees the superiority of the proposed TVFS channel estimator over existing schemes. [ABSTRACT FROM AUTHOR]

This paper presents a novel antenna configuration to measure directions of multiple signal sources at the receiver in a THz mobile network via a single channel measurement. Directional communication is an intrinsic attribute of THz wireless networks and the knowledge of direction should be harvested continuously to maintain link quality. Direction discovery can potentially impose an immense burden on the network that limits its communication capacity exceedingly. To utterly mitigate direction discovery overhead, we propose a novel technique called spectrum shaping capable of measuring direction, power, and relative distance of propagation paths via a single measurement. We demonstrate that the proposed technique is also able to measure the transmitter antenna orientation. We evaluate the performance of the proposed design in several scenarios and show that the introduced technique performs similar to a large array of antennas while attaining a much simpler hardware architecture. Results show that the spectrum shaping with only two antennas placed 0.5 mm, 5 mm, and 1 cm apart performs direction of arrival estimation similar to a much more complex uniform linear array equipped with 7, 60, and 120 antennas, respectively. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surface (RIS) is a revolutionary technology and can be used to assist communication systems by adaptively manipulating the wireless environment. In this paper, we propose a novel cascaded channel estimation algorithm for the RIS-assisted multiple-input multiple-output orthogonal frequency division multiplexing systems. Inspired by the channel compression idea, we can obtain a sub-sampled channel by turning off a fraction of RIS elements and then extrapolate it to the complete one, by which the pilot overhead is greatly reduced. The problem of channel extrapolation is transformed into recovering the physical parameters of the cascaded channel from the partial channel observations and is then formulated by the sparse Bayesian learning (SBL) framework. In order to circumvent the curse of high dimensional matrices inversion in the vector-matrix system, we further introduce the tensor structure into the SBL framework. Specially, by leveraging of the channel sparsity over the angle domain and delay domain, we derive the virtual channel expression in tensor form and model a Kronecker-structured prior distribution for the virtual channels. The multi-domain sparse properties of the virtual channel tensor can be effectively captured by a group of low-dimensional hyper-parameters, and thus reduce the computational complexity. In addition, the Cramer-Rao lower bound is derived for the proposed channel extrapolation. Simulation results show the superior performance of the proposed scheme. [ABSTRACT FROM AUTHOR]

Channel estimation is one of the main challenges for implementing reconfigurable intelligent surface (RIS)-aided communication system with a large number of antennas at the base station (BS) because RIS is equipped with many passive reflective elements without active transmitting/receiving and signal processing abilities. In this paper, we focus on the channel estimation in a general RIS-aided multi-user mmWave communication system. Specifically, a novel two-phase channel estimation scheme consisting of on-line and off-line phases is proposed to estimate the BS-RIS channel, RIS-user channel, and BS-user channel, respectively. Inspired by the characteristics of few scatterers in mmWave communication systems, the antenna domain channels are converted into the virtual angular domain channels by using the discrete Fourier transform (DFT) matrix. Thus, the estimation problem can be formulated as a compressed sensing (CS) problem, and solved by using efficient vector approximate message passing (VAMP) algorithm with expectation-maximization (EM) to learn unknown parameters and obtain the estimates simultaneously. Simulation results show that, the above algorithm with two choices of prior distributions in the proposed mmWave RIS-aided multi-user system has fast convergence speed and desirable estimation performance. [ABSTRACT FROM AUTHOR]

In this paper, we consider a mobile molecular communication (MC) system consisting of two mobile nanomachines, a transmitter and a receiver, propelled by a positive drift velocity and Brownian motion in a realistic blood-vessel-type flow regime. Considering the nonlinear movement of the nanomachines, an extended Kalman filter is employed to estimate the distance from the transmitter. Furthermore, based on the predicted distance, to keep the number of received molecules for bit 1 at a stable level, we employ power control on the number of transmitted molecules based on the distance between the transmitter and the receiver and the residual molecules in the channel from the previous transmission. Finally, the optimal detection threshold is obtained by minimizing the error probability. It is verified that a fixed optimal detection threshold can be effective for the power control scheme in the mobile MC. The bit error rate (BER) performance of our scheme is verified via simulation results. [ABSTRACT FROM AUTHOR]

In massive grant-free transmission, joint user activity detection (UAD) and channel estimation (CE) is essential for data recovery at the receiver, which has been extensively researched in frequency-flat fading scenarios. However, in practical orthogonal frequency division multiplexing (OFDM)-based systems, frequency-selective fading (FSF) leads to a significant increase in the number of channel coefficients to be estimated, imposing new challenges for the design of joint UAD and CE algorithms. Therefore, this paper investigates joint UAD and CE for OFDM-based massive grant-free transmission over FSF channels. Firstly, by employing the discrete cosine transform (DCT), the joint estimation problem is formulated as the compressed sensing (CS) problem with the reduced dimension of the DCT-domain channel response vector. Then, based on the low-dimension sparse channel model, we develop a hybrid message passing (HMP) algorithm under the constrained Bethe free energy (BFE) minimization framework to achieve efficient joint UAD and CE. To deal with the lack of the DCT-domain prior information in practical scenarios, we parameterize it as the Cauchy distribution or the Laplacian distribution and learn their parameters by the proposed HMP algorithm. Numerical results confirm the superior joint UAD and CE performance of the proposed algorithm over FSF channels. [ABSTRACT FROM AUTHOR]

As the requirements related to resolution or the data rate increase, most angle-of-arrival (AoA) estimation problems can be assumed to be under a broadband signal model. In this paper, AoA estimation using a nonuniform planar array (NUPA), which aims to resolve more signals and reduce mutual coupling, is considered under a broadband signal model. The analysis is conducted in both the space and frequency domains, and a broadband co-array is proposed to improve the performance of the AoA estimation. The broadband co-array is generated as follows: First, the received broadband signal is decomposed into several narrowband signals, and the samples from different frequency bins are transformed to space-domain samples to generate a virtual array. Then, the second-order statistics of the virtual array are used to generate the broadband co-array. The virtual array can decrease the number of element pairs with small interelement spacing to reduce mutual coupling in AoA estimations. With the help of the virtual array, the following broadband co-array can greatly increase the degrees of freedom, resulting in more resolvable signals and lower Cramer-Rao bounds of AoA estimation. An optimization method based on sparse recovery is proposed to locate the array. The simulation results confirm the AoA estimation performance achieved by the designed NUPA. [ABSTRACT FROM AUTHOR]

Due to their ability to create favorable line-of-sight (LoS) propagation environments, intelligent reflecting surfaces (IRSs) are regarded as promising enablers for future millimeter-wave (mm-wave) wireless communication. In this paper, we investigate channel estimation for IRS-assisted mm-wave multiple-input multiple-output (MIMO) wireless systems. By leveraging the sparsity of mm-wave channels in the angular domain, we formulate the channel estimation problem as an $\ell _{1}$ -norm regularized optimization problem with fixed-rank constraints. To tackle the non-convexity of the formulated problem, an efficient algorithm is proposed by capitalizing on alternating minimization and manifold optimization (MO), which yields a locally optimal solution. To further reduce the computational complexity of the estimation algorithm, we propose a compressive sensing- (CS-) based channel estimation approach. In particular, a three-stage estimation protocol is put forward where the subproblem in each stage can be solved via low-complexity CS methods. Furthermore, based on the acquired channel state information (CSI) of the cascaded channel, we design a passive beamforming algorithm for maximization of the spectral efficiency. Simulation results reveal that the proposed MO-based estimation (MO-EST) and beamforming algorithms significantly outperform two benchmark schemes while the CS-based estimation (CS-EST) algorithm strikes a balance between performance and complexity. [ABSTRACT FROM AUTHOR]

The fact that the millimeter-wave (mmWave) multiple-input multiple-output (MIMO) channel has sparse support in the spatial domain has motivated recent compressed sensing (CS)-based mmWave channel estimation methods, where the angles of arrivals (AoAs) and angles of departures (AoDs) are quantized using angle dictionary matrices. However, the existing CS-based methods usually obtain the estimation result through one-stage channel sounding that have two limitations: (i) the requirement of large-dimensional dictionary and (ii) unresolvable quantization error. These two drawbacks are irreconcilable; improvement of the one implies deterioration of the other. To address these challenges, we propose, in this paper, a two-stage method to estimate the AoAs and AoDs of mmWave channels. In the proposed method, the channel estimation task is divided into two stages, Stage I and Stage II. Specifically, in Stage I, the AoAs are estimated by solving a multiple measurement vectors (MMV) problem. In Stage II, based on the estimated AoAs, the receive sounders are designed to estimate AoDs. The dimension of the angle dictionary in each stage can be reduced, which in turn reduces the computational complexity substantially. We then analyze the successful recovery probability (SRP) of the proposed method, revealing the superiority of the proposed framework over the existing one-stage CS-based methods. We further enhance the reconstruction performance by performing resource allocation between the two stages. We also overcome the unresolvable quantization error issue present in the prior techniques by applying the atomic norm minimization method to each stage of the proposed two-stage approach. The simulation results illustrate the substantially improved performance with low complexity of the proposed two-stage method. [ABSTRACT FROM AUTHOR]

Massive multiple-input-multiple-output (MIMO) and millimeter wave have been adopted as the enabling technologies for the 5G and beyond 5G (B5G) systems. A challenging problem introduced by the use of large antenna size and wide bandwidth is beam squint, i.e., spatial-wideband effect. Beam squint can significantly degrade the channel estimation performance for conventional channel estimators. Research effort on channel estimation under beam squint conditions has been very limited. For the few available work that attempts to address this problem, they require either all subcarriers or multiple symbols used as pilot for channel estimation, so large overhead becomes inevitable. Therefore, in this paper, we propose an efficient channel estimation method that only requires a small number of subcarriers. The channel estimation problem is formulated as a nonlinear least squares optimization problem. Initial parameter estimation is critical, which will affect the efficiency and convergence of the proposed algorithm. Using a densely-spaced antenna structure and consecutive subcarriers assignment approach, we can effectively avoid the aliasing effect and reduce the ambiguity during the initialization phase. A subcarrier assignment criterion is proposed to achieve the optimal performance. Closed-form expressions of the Cramér-Rao lower bound (CRLB) and the achievable rate are derived to evaluate the performance. Both simulation results and theoretical analysis show that even with a small number of subcarriers, the estimation error closely approaches the CRLB, and its effect is negligible compared with the noise when evaluating the signal-to-noise ratio with a simple linear detector. Furthermore, the number of pilot subcarriers has little impact on the achievable rate. [ABSTRACT FROM AUTHOR]

Extremely large-scale multiple-input-multiple-output (XL-MIMO) is promising to meet the high rate requirements for future 6G. To realize efficient precoding, accurate channel state information is essential. Existing channel estimation algorithms with low pilot overhead heavily rely on the channel sparsity in the angular domain, which is achieved by the classical far-field planar-wavefront assumption. However, due to the non-negligible near-field spherical-wavefront property in XL-MIMO, this channel sparsity in the angular domain is not achievable. Therefore, existing far-field channel estimation schemes will suffer from severe performance loss. To address this problem, in this paper, we study the near-field channel estimation by exploiting the polar-domain sparsity. Specifically, unlike the classical angular-domain representation that only considers the angular information, we propose a polar-domain representation, which simultaneously accounts for both the angular and distance information. In this way, the near-field channel also exhibits sparsity in the polar domain, based on which, we propose on-grid and off-grid near-field XL-MIMO channel estimation schemes. Firstly, an on-grid polar-domain simultaneous orthogonal matching pursuit (P-SOMP) algorithm is proposed to efficiently estimate the near-field channel. Furthermore, an off-grid polar-domain simultaneous iterative gridless weighted (P-SIGW) algorithm is proposed to improve the estimation accuracy. Finally, simulations are provided to verify the effectiveness of our schemes. [ABSTRACT FROM AUTHOR]

Limited access to available spectrum motivates new age radio frequency (RF) systems to co-exist and cooperate. In this paper, we consider a joint communication and radar system (labeled Comm-Radar), that is capable of receiving and decoding communication signals while simultaneously enabling radar functionalities. Traditionally, systems that leverage principles of spectrum convergence, deemed each functions to be detrimental to the others. This has led to successive interference cancellations strategies that effectively isolate each of the functionalities. Here, in the context of Comm-Radar processing structure, we show that ambient communication transmissions actually assist in radar estimation. The insight is that communications multipath reflects off radar targets (we denote these comm-target paths) in the environment, and can be processed at the receiver to extract extra information. In this work we characterize the fundamental performance limits of such a joint system.To demonstrate the radar performance gain achievable via the processing of extra comm-target paths, the closed-form Cramér-Rao Bound (CRB) for the estimation of direction, range and velocity of a target is derived, for both the general case, and practical radar and communication signalling schemes. Based on the CRB, joint outer bounds are obtained to characterize the trade off between estimation performance and communication rate. Finally, numerical results verify the advantages of utilizing the target reflections from the communication signal to bolster radar performance. [ABSTRACT FROM AUTHOR]

This paper studies the joint estimation of channel fading and user activity for the uplink of a grant-free massive machine-type communication system. Comparing with previous studies, we consider more practical aspects of the system, including non-i.i.d. signature matrices, low-resolution quantization, and random users activated by an unknown sparse rate. A new estimation algorithm, termed hybrid decentralized generalized expectation consistent (HyDeGEC), is then derived based on a hybrid network that applies scalar message passing for the prior inference and vector message passing for the likelihood inference. This new algorithm outperforms many state-of-the-art techniques in terms of robustness (to non-i.i.d. signatures), complexity (in computation per iteration), and/or estimation accuracy (of the channel and the activity rate). The state evolution of the algorithm is also analyzed, which, as validated by simulations, can capture precisely the algorithm’s per-iteration behavior in MSE. Summing up, the algorithm we propose here is practically effective, computationally efficient, and theoretically analyzable. [ABSTRACT FROM AUTHOR]

Over-the-air computation (AirComp) is a disruptive technique for fast wireless data aggregation in Internet of Things (IoT) networks via exploiting the waveform superposition property of multiple-access channels. However, the performance of AirComp is bottlenecked by the worst channel condition among all links between the IoT devices and the access point. In this paper, a reconfigurable intelligent surface (RIS) assisted AirComp system is proposed to boost the received signal power and thus mitigate the performance bottleneck by reconfiguring the propagation channels. With an objective to minimize the AirComp distortion, we propose a joint design of AirComp transceivers and RIS phase-shifts, which however turns out to be a highly intractable non-convex programming problem. To this end, we develop a novel alternating minimization framework in conjunction with the successive convex approximation technique, which is proved to converge monotonically. To reduce the computational complexity, we transform the subproblem in each alternation as a smooth convex-concave saddle point problem, which is then tackled by proposing a Mirror-Prox method that only involves a sequence of closed-form updates. Simulations show that the computation time of the proposed algorithm can be two orders of magnitude smaller than that of the state-of-the-art algorithms, while achieving a similar distortion performance. [ABSTRACT FROM AUTHOR]

Passive source positioning is of great interest due to the numerous applications. Energy based localization methods are popular because of their low cost and simplicity. In this paper, source localization with unknown transmit power is considered based on received signal strength difference (RSSD) measurements. An efficient three stage estimator is presented. First, a nonlinear RSSD-based model is formulated and the corresponding Fisher information for Gaussian distributed noise is derived. Next, a mean squared error (MSE) estimator is developed based on an unknown linear bias and Fisher information minimization. This results in a nonlinear optimization problem to minimize the MSE directly considering the linear bias. Finally, semidefinite relaxation is employed to transform this nonconvex problem into a convex minimization problem. This can be solved efficiently to obtain the optimal solution of the corresponding semidefinite programming (SDP) problem. Necessary and sufficient conditions for the optimality of the proposed RSSD based linear biased MSE SDP method (RLBM-SDP) are derived. Further, the corresponding bias sensitivity is formulated which yields an extension of the proposed method to a bounded RLBM-SDP (BRLBM-SDP) algorithm that includes a new constraint on the norm of the bias sensitivity. The computational complexity of the proposed methods is evaluated. Performance results are presented which confirm the efficiency of the proposed methods for sufficiently large signal to noise ratios. [ABSTRACT FROM AUTHOR]

This paper presents an estimation approach within the framework of uplink massive machine-type-communications (mMTC) that considers the energy limitations of the devices. We focus on a scenario where a group of sensors observe a set of parameters and send the measured information to a collector node (CN). The CN is responsible for estimating the original observations, which are spatially correlated and corrupted by measurement and quantization noise. Given the use of Gaussian sources, the minimum mean squared error (MSE) estimation is employed and, when considering temporal evolution, the use of Kalman filters is studied. Based on that, we propose a device selection strategy to reduce the number of active sensors and a quantization scheme with adjustable number of bits to minimize the overall payload. The set of selected sensors and quantization levels are, thus, designed to minimize the MSE. For a more realistic analysis, communication errors are also included by averaging the MSE over the error decoding probabilities. We evaluate the performance of our strategy in a practical mMTC system with synthetic and real databases. Simulation results show that the optimization of the payload and the set of active devices can reduce the power consumption without compromising the estimation accuracy. [ABSTRACT FROM AUTHOR]

This paper studies the impact of additional pilot overhead for covariance matrix estimation in a time-division duplexed (TDD) massive multiple-input multiple-output (MIMO) system. We choose average uplink (UL) and downlink (DL) spectral efficiencies (SEs) as performance metrics for the massive MIMO system, and derive closed form expressions for them in terms of the additional pilot overhead. The expressions are derived by considering linear minimum mean squared error (LMMSE)-type and element-wise LMMSE-type channel estimates that represent LMMSE and element-wise LMMSE with estimated covariance matrices, respectively. Using these expressions, a detailed theoretical analysis of SE behavior as a function of pilot overhead for both LMMSE-type and element-wise LMMSE-type channel estimation are presented, followed by simulations, which also demonstrate and validate theoretical results. [ABSTRACT FROM AUTHOR]

Channel covariance matrix (CCM) is one critical parameter for designing the communications systems. In this paper, a novel framework of the deep learning (DL) based CCM estimation is proposed that exploits the perception of the transmission environment without any channel sample or the pilot signals. Specifically, as CCM is affected by the user’s movement, we design a deep neural network (DNN) to predict CCM from user location and user speed, and the corresponding estimation method is named as ULCCME. A location denoising method is further developed to reduce the positioning error and improve the robustness of ULCCME. For cases when user location information is not available, we propose an interesting way that uses the environmental 3D images to predict the CCM, and the corresponding estimation method is named as SICCME. Simulation results show that both the proposed methods are effective and will benefit the subsequent channel estimation. [ABSTRACT FROM AUTHOR]

The orthogonal frequency-division multiplexing (OFDM) is a widely used modulation scheme in modern digital communication systems. An OFDM signal can be susceptible to channel nonlinearities due to its high peak-to-average power ratio (PAR). This makes estimation and compensation of nonlinear channels particularly vital for OFDM systems. In this paper, we consider identifying cubically nonlinear channels in baseband OFDM systems using minimally sampled input and output signals. Unlike nonlinear channels in bandpass OFDM systems, which can be modeled by a complex baseband equivalent Volterra series with only odd order terms, the nonlinear channel in a baseband OFDM system requires a real Volterra series with both even and odd order terms. The minimally sampled input and output signals of the baseband OFDM system are used to estimate the frequency-domain Volterra kernels of the nonlinear channel. Due to the possible spectral regrowth caused by the channel nonlinearities, the minimally sampled output signal could be aliased. Nevertheless, by conducting higher-order statistical analyses on the OFDM signals, we show that closed form expressions of the Volterra kernels can still be derived. As a result of the closed form expressions, a simple estimate for the Volterra kernels is attained. Furthermore, the derived Volterra kernel estimate is shown to achieve the minimum mean square error (MMSE). Therefore, the proposed approach indeed provides an efficient yet accurate way to estimate nonlinear channels in baseband OFDM systems. [ABSTRACT FROM AUTHOR]

Sensor networks are an indispensable part of the Internet of Things (IoT), where sensors perform data acquisition and information processing tasks to obtain the parameters of interest so that IoT-based monitoring, diagnosis and other systems respond quickly to the changing conditions, instantaneous faults, etc. Distributed estimation algorithms are usually employed to estimate the parameters of interest in these IoT-based applications. However, when sensor networks have highly correlated input signals and nonstationary behavior in which the parameters of interest are time-varying, conventional distributed estimation algorithms suffer from severely degraded learning performance due to the large eigenvalue spread in the covariance matrix of the input signals and the random perturbation of the parameters of interest. To address these problems, this paper proposes two diffusion Bayesian subband adaptive filter (DBSAF) algorithms from a Bayesian learning perspective. As the highly-correlated input signal is whitened in a multiband structure and an estimate of the uncertainty in the parameters of interest is obtained by performing Bayesian inference, the proposed DBSAF algorithms are able to achieve better learning performance in comparison with the competing diffusion algorithms. The transient and steady-state mean square error performance of the proposed DBSAF algorithms are analyzed, and are verified by numerical simulations. A lower bound on the time-varying step-size is derived to maintain the optimal steady-state performance in nonstationary scenarios. A new method for the estimation of the noise variance is also proposed. Numerical simulations demonstrate the excellent learning performance of the proposed algorithms in comparison with benchmark algorithms. [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]

In this paper, a novel training beam sequence design for multiuser millimeter wave tracking systems is proposed. For each receiver, a single-path channel model is firstly investigated, where we introduce a maximum a posteriori (MAP) criterion to estimate the time-varying angle of departure (AoD), followed by an extended Kalman filter to update the stale complex path gain. We then employ training beam sequence design to minimize the estimated AoD’s average mean squared error (AMSE), which however has no explicit expression. We firstly derive a closed-form upper bound for the AMSE and then simplify this upper bound into a tractable form, based on which a nonlinear optimization problem (NLP) is formulated. By solving this NLP optimally using its corresponding Karush-Kuhn-Tucker conditions, we obtain an efficient training beam sequence. The proposed MAP criterion and its associated training beam sequence design are further extended to multi-path scenarios, where a joint estimation of the multiple paths is firstly discussed, followed by a sequential estimation as a low-complexity alternative. Numerical results demonstrate the superiority of our proposed scheme over the existing benchmark methods, especially in the case when the receivers’ channels change rapidly. [ABSTRACT FROM AUTHOR]

In this paper, we devise a highly efficient machine learning-based channel estimation for orthogonal frequency division multiplexing (OFDM) systems, in which the training of the estimator is performed online. A simple learning module is employed for the proposed learning-based estimator. The training process is thus much faster and the required training data is reduced significantly. Besides, a training data construction approach utilizing least square (LS) estimation results is proposed so that the training data can be collected during the data transmission. The feasibility of this novel construction approach is verified by theoretical analysis and simulations. Based on this construction approach, two alternative training data generation schemes are proposed. One scheme transmits additional block pilot symbols to create training data, while the other scheme adopts a decision-directed method and does not require extra pilot overhead. Simulation results show the robustness of the proposed channel estimation method. Furthermore, the proposed method shows better adaptation to practical imperfections compared with the conventional minimum mean-square error (MMSE) channel estimation. It outperforms the existing machine learning-based channel estimation techniques under varying channel conditions. [ABSTRACT FROM AUTHOR]

In this paper, improved channel gain delay estimation strategies are investigated when practical pulse shapes with finite block length and transmission bandwidth are employed. Pilot-aided channel estimation with an augmented atomic norm based approach is proposed to promote the low rank structure of the time-varying narrowband leaked channel. All the channel parameters, i.e., delays, Doppler shifts, and channel gains are recovered. Design choices which ensure unique estimates of channel parameters for rectangular, Gaussian, and root-raised-cosine pulse shapes are examined in the noiseless case, respectively. Furthermore, a perturbation analysis is conducted to measure the impact of noise and further design choices for parameters are proposed to mitigate the effects of noise. Finally, numerical results verify the theoretical analysis and show performance improvements over the previously proposed method. [ABSTRACT FROM AUTHOR]

Recently, convolutional neural network (CNN)-based channel estimation (CE) for massive multiple-input multiple-output communication systems has achieved remarkable success. However, complexity even needs to be reduced, and robustness can even be improved. Meanwhile, existing methods do not accurately explain which channel features help the denoising of CNNs. In this paper, we first compare the strengths and weaknesses of CNN-based CE in different domains. When complexity is limited, the channel sparsity in the angle-delay domain improves denoising and robustness whereas large noise power and pilot contamination are handled well in the spatial-frequency domain. Thus, we develop a novel network, called dual CNN, to exploit the advantages in the two domains. Furthermore, we introduce an extra neural network, called HyperNet, which learns to detect scenario changes from the same input as the dual CNN. HyperNet updates several parameters adaptively and combines the existing dual CNNs to improve robustness. Experimental results show improved estimation performance for the time-varying scenarios. To further exploit the correlation in the time domain, a recurrent neural network framework is developed, and training strategies are provided to ensure robustness to the changing of temporal correlation. This design improves channel estimation performance but its complexity is still low. [ABSTRACT FROM AUTHOR]

Recently, machine learning-based channel estimation has attracted much attention. The performance of machine learning-based estimation has been validated by simulation experiments. However, little attention has been paid to the theoretical performance analysis. In this paper, we investigate the mean square error (MSE) performance of machine learning-based estimation. Hypothesis testing is employed to analyze its MSE upper bound. Furthermore, we build a statistical model for hypothesis testing, which holds when the linear learning module with a low input dimension is used in machine learning-based channel estimation, and derive a clear analytical relation between the size of the training data and performance. Then, we simulate the machine learning-based channel estimation in orthogonal frequency division multiplexing (OFDM) systems to verify our analysis results. Finally, the design considerations for the situation where only limited training data is available are discussed. In this situation, our analysis results can be applied to assess the performance and support the design of machine learning-based channel estimation. [ABSTRACT FROM AUTHOR]

Frequency-hopping (FH) MIMO radar is recently introduced as an underlying system for realizing dual-function radar-communication (DFRC), increasing communication symbol rates to multiples of the radar pulse repetition frequency. As a newly conceived DFRC system, many realistic issues, such as channel estimation and synchronization, are not effectively solved yet. In this paper, we develop a multi-antenna receiver-based downlink communication scheme for the FH-MIMO DFRC, addressing the above issues in multi-path channels. By exploring the unique FH-MIMO radar waveform, we suppress both inter-antenna and inter-hop interference, and introduce minimal constraints on the radar waveform to facilitate DFRC. We then develop accurate estimation methods for timing offset and channel parameters. These methods are further employed to design reliable demodulation methods. We also derive performance bounds for the proposed estimation methods and embedded communications. Simulation results validate the efficacy of our receiving scheme, showing that the performance of estimators and data communications approaches analytical bounds. [ABSTRACT FROM AUTHOR]

This paper proposes a novel convolutional neural network (CNN) based joint classification method to characterize the signal-to-noise power ratio (SNR) and Doppler shift using spectrogram images, in order to enable efficient adaptive modulation and coding (AMC) designs. It is necessary to maintain high communication performances even in stringent environments where transceivers move at high speed due to the diversification of wireless applications. To optimize the transmission rate in such dynamic environments, AMC scheme is known to be effective. AMC is generally designed based on feedback information (FBI) such as the SNR and Doppler shift acquired on the receiving side. Here, the challenge is an increase in calculation burden, processing delay and estimation accuracy of the FBI. We focused on the spectrogram which is composed of power values in the time and frequency domains. Its two-dimensional fluctuation represents the Doppler shift as well as noise values. In the proposed method, such key information for AMC can be simultaneously extracted from a single spectrogram via a trained CNN. Therefore it is expected to contribute to reducing the computational burden and speeding up the signal processing. Simulation results are presented to demonstrate that the proposed method achieves better performance than traditional methods. [ABSTRACT FROM AUTHOR]

Channel estimation is crucial to modern wireless systems and becomes more and more challenging with the growth of user throughput in sub-6 GHz multiple input multiple output configuration. Plenty of literature spends great efforts in improving the estimation accuracy, while the interpolation schemes are overlooked. To deal with this challenge, we exploit the super-resolution image recovery scheme to model the non-linear interpolation mechanisms. Moreover, in order to extend the estimation scheme into the non-stationary environment which is especially attractive in the coming 6G, we utilize the recurrent network structure to approximate the non-linear channel statistic correlation to model the non-stationary behavior which is difficult to accomplish in the theoretical way. To make it more practical, we offline generate numerical channel coefficients according to the statistical channel models to train the neural networks and directly apply them in different environments. As shown in this paper, the proposed unified super-resolution based channel estimation scheme can outperform the conventional approaches in both stationary and non-stationary scenarios, which we believe can significantly change the current channel estimation method in the near future. [ABSTRACT FROM AUTHOR]

Orthogonal time frequency space (OTFS) has shown to be a promising modulation technology that achieves the robust wireless transmission in high-mobility environments. The high mobility incurred Doppler effect in OTFS system, is represented as a continuous and relatively large band in the Doppler frequency. It yields the equivalent channel responses (ECRs) in the system change significantly within one symbol block, posing a challenge to channel estimation (CE) or tracking. In order to tackle this issue, in this paper, a set of transform-domain basis functions is designed to span a low-dimensional subspace for modeling the OTFS channel. Then, the CE can be performed by estimating a few projection coefficients of ECRs in the developed subspace, with training pilots. According to the individual transmission characteristic of OTFS signal, we propose a corner-inserted pilot pattern, which targets the low pilot overhead and satisfactory CE performance. Moreover, an OTFS signal detector, leveraging the time-domain channel equalization, linear-complexity interference cancellation and delay-Doppler domain maximal ratio combining detection, is developed to retrieve the transmitted data symbols. The simulations show the precisely estimated ECRs enable the detector to ideally demodulate 256-ary quadrature amplitude modulation signaling, under a velocity of 550 km/h at 5.9 GHz carrier frequency. [ABSTRACT FROM AUTHOR]

A generalized framework of spectrum sensing disruption for a power-limited adversary is proposed in this paper. In the literature, a conventional sensing attack typically assumes that the adversary has perfect knowledge of the spectral usage status. The framework in this paper considers a more general case where there are uncertainties in the estimates at the adversary. These uncertainties are modeled utilizing the probability of detection and the probability of false alarm. Then, the sum of the conditional probabilities of false detection at the secondary within the spectral range of interest, conditioned on the adversary’s estimated spectrum usage status, is maximized. It is shown that the optimal sensing attack, given perfect estimation is a special case of the proposed framework. When the adversary has perfect spectrum usage information, this framework reduces to a previously demonstrated optimal sensing disruption. When the adversary has imperfect information on the spectral status, the proposed framework is significantly more robust than conventional sensing attacks. Further, when the adversary’s power budget increases, it asymptotically approaches the sensing disruption performance upper bound. [ABSTRACT FROM AUTHOR]

Reconfigurable Intelligent Surfaces (RISs) have been recently considered as an energy-efficient solution for future wireless networks due to their fast and low-power configuration, which has increased potential in enabling massive connectivity and low-latency communications. Accurate and low-overhead channel estimation in RIS-based systems is one of the most critical challenges due to the usually large number of RIS unit elements and their distinctive hardware constraints. In this paper, we focus on the uplink of a RIS-empowered multi-user Multiple Input Single Output (MISO) uplink communication systems and propose a channel estimation framework based on the parallel factor decomposition to unfold the resulting cascaded channel model. We present two iterative estimation algorithms for the channels between the base station and RIS, as well as the channels between RIS and users. One is based on alternating least squares (ALS), while the other uses vector approximate message passing to iteratively reconstruct two unknown channels from the estimated vectors. To theoretically assess the performance of the ALS-based algorithm, we derived its estimation Cramér-Rao Bound (CRB). We also discuss the downlink achievable sum rate computation with estimated channels and different precoding schemes for the base station. Our extensive simulation results show that our algorithms outperform benchmark schemes and that the ALS technique achieves the CRB. It is also demonstrated that the sum rate using the estimated channels always reach that of perfect channels under various settings, thus, verifying the effectiveness and robustness of the proposed estimation algorithms. [ABSTRACT FROM AUTHOR]

Path fading and non-line-of-sight (NLOS) signals constitute serious problems in the wireless localization process. These problems cause unpredictable degradation in the localization precision. In this paper, a novel wireless localization approach, which is based on twice receiving array signal spectra fusions and asymmetric second-order stochastic resonance (ASSR) networks, is proposed. By combining and repetitively processing the above two techniques, the receiving signal-to-noise ratio (SNR) can be enhanced. Additionally, the receiving array signal without the line-of-sight (LOS) component can be determined and removed from the spectra fusion process. The theoretical analyses presented verify the unbiasedness and asymptotic efficiency of the proposed twice receiving spectra fusion approach. Computer simulations demonstrate that the fused spectra can significantly improve the wireless localization precision compared with conventional and up-to-date localization methods, especially under low SNR conditions. [ABSTRACT FROM AUTHOR]

Preamble collision is a bottleneck that impairs the performance of random access (RA) user equipment (UE) in grant-free RA (GFRA). In this paper, by leveraging distributed massive multiple input multiple output (mMIMO) together with machine learning, a novel machine learning based framework solution is proposed to address the preamble collision problem in GFRA. The key idea is to identify and employ the neighboring access points (APs) of a collided RA UE for its data decoding rather than all the APs, so that the mutual interference among collided RA UEs can be effectively mitigated. To this end, we first design a tailored deep neural network (DNN) to enable the preamble multiplicity estimation in GFRA, where an energy detection (ED) method is also proposed for performance comparison. With the estimated preamble multiplicity, we then propose a K-means AP clustering algorithm to cluster the neighboring APs of collided RA UEs and organize each AP cluster to decode the received data individually. Simulation results show that a decent performance of preamble multiplicity estimation in terms of accuracy and reliability can be achieved by the proposed DNN, and confirm that the proposed schemes are effective in preamble collision resolution in GFRA, which are able to achieve a near-optimal performance in terms of uplink achievable rate per collided RA UE, and offer significant performance improvement over traditional schemes. [ABSTRACT FROM AUTHOR]

Millimeter-wave massive multiple-input multiple-output (MIMO) can use a lens antenna array to considerably reduce the number of radio frequency (RF) chains, but channel estimation is challenging due to the number of RF chains is much smaller than that of antennas. By exploiting the sparsity of beamspace channels, the beamspace channel estimation can be formulated as a sparse signal recovery problem, which can be solved by the classical iterative algorithm named approximate message passing (AMP), and its corresponding version learned AMP (LAMP) realized by a deep neural network (DNN). However, these existing schemes cannot achieve satisfactory estimation accuracy. To improve the channel estimation performance, we propose a prior-aided Gaussian mixture LAMP (GM-LAMP) based beamspace channel estimation scheme in this paper. Specifically, based on the prior information that beamspace channel elements can be modeled by the Gaussian mixture distribution, we first derive a new shrinkage function to refine the AMP algorithm. Then, by replacing the original shrinkage function in the LAMP network with the derived Gaussian mixture shrinkage function, a prior-aided GM-LAMP network is developed to estimate the beamspace channel more accurately. Simulation results by using both the theoretical channel model and the ray-tracing based channel dataset show that, the proposed GM-LAMP network can achieve better channel estimation accuracy than existing schemes. [ABSTRACT FROM AUTHOR]

The distributed power control algorithms available in this paper assume perfect estimation of interference power at the receivers and often, the availability of perfect local channel state information (CSI). However, perfect estimation of interference power or acquisition of channel information is impractical. In this paper, we consider a generic class of distributed power control algorithms and analyze the resulting performance loss when faced with errors in CSI and/or interference level estimation. We approximate such power control algorithms with linearized state space dynamics wherein the errors in the estimation of received interference or the CSI, can be modeled as additive observation noise. Based on the proposed model, we derive lower bounds on the norm of the errors in the transmit power vector and receive signal-to-interference-plus-noise ratio (SINR) vector. Our analysis suggests that when the target SINR vector approaches the Pareto-optimal bound, the errors in the transmit vectors could grow without bound. As a consequence, to maintain a performance loss within an acceptable range, either much longer estimation times or lower target SINRs are required. Our numerical results confirm the validity of our analysis and the validity of the proposed bounds. [ABSTRACT FROM PUBLISHER]

IEEE 1588, built on the classical two-way message exchange scheme, is a popular clock synchronization protocol for packet-switched networks. Due to the presence of random queuing delays in a packet-switched network, the joint recovery of the clock skew and offset from the timestamps of the exchanged synchronization packets can be treated as a statistical estimation problem. In this paper, we address the problem of clock skew and offset estimation for IEEE 1588 in the presence of possible unknown asymmetries between the deterministic path delays of the forward master-to-slave path and reverse slave-to-master path, which can result from incorrect modeling or cyber-attacks. First, we develop lower bounds on the mean square estimation error for a clock skew and offset estimation scheme for IEEE 1588 assuming the availability of multiple master-slave communication paths and complete knowledge of the probability density functions (pdf) describing the random queuing delays. Approximating the pdf of the random queuing delays by a mixture of Gaussian random variables, we then present a robust iterative clock skew and offset estimation scheme that employs the space alternating generalized expectation-maximization (SAGE) algorithm for learning all the unknown parameters. Numerical results indicate that the developed robust scheme exhibits a mean square estimation error close to the lower bounds. [ABSTRACT FROM AUTHOR]

In this paper, we present a computationally efficient method for estimating error floors of low-density parity-check (LDPC) codes over the binary symmetric channel (BSC) without any prior knowledge of its trapping sets (TSs). Given the Tanner graph $G$ of a code, and the decoding algorithm $\mathcal {D}$ , the method starts from a list of short cycles in $G$ , and expands each cycle by including its sufficiently large neighborhood in $G$. Variable nodes of the expanded sub-graphs $\mathcal {G}_{\text{EXP}}$ are then corrupted exhaustively by all possible error patterns, and decoded by $\mathcal {D}$ operating on $\mathcal {G}_{\text{EXP}}$. Union of support of the error patterns for which $\mathcal {D}$ fails on each $\mathcal {G}_{\text{EXP}}$ defines a subset of variable nodes that is a TS. The knowledge of the minimal error patterns and their strengths in each TSs is used to compute an estimation of the frame error rate. This estimation represents the contribution of error events localized on TSs, and therefore serves as an accurate estimation of the error floor performance of $\mathcal {D}$ at low BSC cross-over probabilities. We also discuss trade-offs between accuracy and computational complexity. Our analysis shows that in some cases the proposed method provides a million-fold improvement in computational complexity over standard Monte-Carlo simulation. [ABSTRACT FROM AUTHOR]

Localization is particularly challenging when the environment has mixed line-of-sight (LOS) and non-LOS paths and even more challenging if the anchors’ positions are also uncertain. In the situations in which the parameters of the LOS-NLOS propagation error model and the channel states are unknown and uncertainties for the anchors exist, the likelihood function of a localizing node is computationally intractable. In this paper, assuming the knowledge of the prior distributions of the error model parameters and that of the channel states, we formulate the localization problem as the maximization problem of the posterior distribution of the localizing node. Then we apply variational distributions and importance sampling to approximate the true posterior distributions and estimate the target’s location using an asymptotic minimum mean-square-error (MMSE) estimator. Furthermore, we analyze the convergence and complexity of the proposed variational Bayesian localization (VBL) algorithm. Computer simulation results demonstrate that the proposed algorithm can approach the performance of the Bayesian Cramer-Rao bound (BCRB) and outperforms conventional algorithms. [ABSTRACT FROM AUTHOR]

In order to glean benefits from orthogonal frequency division multiplexing combined with index modulation (OFDM-IM) in the presence of strong Phase-Noise (PHN), in this paper, low-complexity joint PHN estimation and decoding methods are developed in the framework of message passing on a factor graph. Both the Wiener process and the truncated discrete cosine transform (DCT) expansion model are considered for approximating the PHN variation. Then based on these a factor graph is constructed for explicitly representing the joint estimation and detection problem. Taking full account of the sparse and structured a priori information arriving from the soft-in soft-out (SISO) decoder of a turbo receiver, a modified generalized approximate message passing (GAMP) algorithm is invoked for decoupling the frequency-domain symbols. In the decoupling step, mean field (MF) approximation is employed for solving the unknown nonlinear transform matrix problem imposed by PHN. Furthermore, merged belief propagation and MF (BP-MF) methods amalgamated both with sequential and parallel message passing schedules are introduced and compared to the proposed GAMP based algorithms in terms of their bit error ratio (BER) vs. complexity. Our simulation results demonstrate the efficiency of the proposed algorithms in the presence of both perfect and imperfect channel state information. [ABSTRACT FROM AUTHOR]

This paper considers the uplink of a single-cell multiuser massive multiple-input multiple-output system. Each receiver antenna of the base station (BS) is assumed to be equipped with a pair of analog-to-digital converters to quantize the real and imaginary part of the received signal. We propose a novel clipping-aware receiver (CA-MMSE), which performs minimum mean square error (MMSE) reconstruction only on the clipped received samples, while the granular samples are left unchanged after the quantization. On this basis, we present an iterative algorithm to implement the CA-MMSE receiver and derive a sufficient condition for its geometrical convergence to a fixed point. We show that as long as the number of BS antennas or the quantization resolution is sufficiently high, then, the performance of the CA-MMSE is as good as the optimal MMSE receiver which reconstructs all quantized received symbols. Additionally, we propose a novel Bussgang-based weighted zero-forcing (B-WZF) receiver which distinguishes the clipping and granular distortion and it is shown that as long as the received training symbols per antenna are correlated, the CA-MMSE brings significant improvements compared to conventional receivers in the literature while for users that do not experience deep large-scale fading the simpler B-WZF is near to the CA-MMSE for sufficiently high signal-to-noise ratio and quantization resolution. [ABSTRACT FROM AUTHOR]

In this paper, we study joint antenna activity detection, channel estimation, and multiuser detection for massive multiple-input multiple-output (MIMO) systems with general spatial modulation (GSM). We first establish a double-sparsity massive MIMO model by considering the channel sparsity of the massive MIMO channel and the signal sparsity of GSM. Based on the double-sparsity model, we formulate a blind detection problem. To solve the blind detection problem, we develop message-passing based blind channel-and-signal estimation (BCSE) algorithm. The BCSE algorithm basically follows the affine sparse matrix factorization technique, but with critical modifications to handle the double-sparsity property of the model. We show that the BCSE algorithm significantly outperforms the existing blind and training-based algorithms, and is able to closely approach the genie bounds (with either known channel or known signal). In the BCSE algorithm, short pilots are employed to remove the phase and permutation ambiguities after sparse matrix factorization. To utilize the short pilots more efficiently, we further develop the semi-blind channel-and-signal estimation (SBCSE) algorithm to incorporate the estimation of the phase and permutation ambiguities into the iterative message-passing process. We show that the SBCSE algorithm substantially outperforms the counterpart algorithms including the BCSE algorithm in the short-pilot regime. [ABSTRACT FROM AUTHOR]

Multi-panel MIMO is a promising technology in millimeter wave communications. Due to its partially hybrid structure and non-uniform antenna array, existing channel estimation cannot be directly applied to multi-panel MIMO. In this paper, we study channel estimation for multi-panel mmWave MIMO. We firstly model channel estimation of multi-panel MIMO as a block-sparse signal recovery problem. Then, according to maximum likelihood criterion, we propose an orthogonal projection method to firstly detect the support of the sparse channel response vector and then perform least square estimation, based on which we also propose a low-complexity greedy support detection in order to reduce computational complexity. Finally, through analyzing pairwise error probability of support detection, we verify the performance gain of joint multi-panel channel estimation over single panel channel estimation, and we further find that joint multi-panel channel estimation with independently generated random combining matrices outperforms that with identically generated combining matrices. Numerical results verify the superiority of our proposed joint multi-panel orthogonal projection based channel estimation over existing schemes. [ABSTRACT FROM AUTHOR]

Low-complexity overhead and very small side information (SI) are virtues of the low peak-to-average-power ratio (PAPR) filter bank multicarrier [Low PAPR FBMC (LP-FBMC in short)], which has been recently proposed. However, the SI is an annoying burden because it needs a complicated system design, irrespective of its size. In this paper, we propose an SI-embedded LP-FBMC that does not separately transmit SI but embeds it in the transmitted signal in a specific way while preserving the PAPR and bit error rate (BER) performance. The approach is motivated by a property of the LP-FBMC where demodulation by even an incorrect SI does not change the signal constellation. We embed the SI in the intentional phase rotation of the constellation without additional energy or bandwidth. The phase rotation differs according to the SI and is common to all data symbols in each LP-FBMC subframe. In the receiver, we remove data symbol-dependent phase terms of the decision variables (DVs) by taking the fourth power and detect the SI embedded in the remaining phase term. Simulation results reveal that the BER of the SI-embedded LP-FBMC is almost the same as that of the perfect SI case when there are an acceptable number of data symbols for SI estimation. We also devised a complexity-reduced implementation for the additional processing required for the proposed SI embedding and detection schemes. [ABSTRACT FROM AUTHOR]

In this paper, we consider a passive radar system that estimates the positions and velocities of multiple moving targets by using OFDM signals transmitted by a totally un-coordinated and un-synchronizated illuminator and multiple receivers. It is assumed that data demodulation is performed separately based on the direct-path signal, and the error-prone estimated data symbols are made available to the passive radar receivers, which estimate the positions and velocities of the targets in two stages. First, we formulate a problem of joint estimation of the delay-Doppler of reflectors and the demodulation errors, by exploiting two types of sparsities of the system, namely, the numbers of reflectors (i.e., targets and clutters) and demodulation errors are both small. This problem is non-convex and a conjugate gradient descent method is proposed to solve it. Then in the second stage we determine the positions and velocities of targets based on the estimated delay-Doppler in the first stage. For the second stage, two methods are proposed: the first is based on numerically solving a set of nonlinear equations, while the second is based on the neural network, which is more efficient. The performance of the proposed algorithms is evaluated through extensive simulations. [ABSTRACT FROM AUTHOR]