Qingqing Wu, Liang Liu, Rui Zhang
The use of unmanned aerial vehicles (UAVs) as aerial communication platforms is of high practical value for future wireless systems such as 5G, especially for swift and on-demand deployment in temporary events and emergency situations. Compared to traditional terrestrial base stations (BSs) in cellular network, UAV-mounted aerial BSs possess stronger line-of-sight (LoS) links with the ground users due to their high altitude as well as high and flexible mobility in three-dimensional (3D) space, which can be exploited to enhance the communication performance. On the other hand, unlike terrestrial BSs that have reliable power supply, aerial BSs in practice have limited on-board energy, but require significant propulsion energy to stay airborne and support high mobility. Motivated by the above new considerations, this article aims to revisit some fundamental tradeoffs in UAV-enabled communication and trajectory design. Specifically, it is shown that communication throughput, delay, and (propulsion) energy consumption can be traded off among each other by adopting different UAV trajectory designs, which sheds new light on their traditional tradeoffs in terrestrial communication. Promising directions for future research are also discussed.
Yitao Han, Liang Liu, Lingjie Duan, Rui Zhang
In the existing cellular networks, it remains a challenging problem to communicate with and control an unmanned aerial vehicle (UAV) swarm with both high reliability and low latency. Due to the UAV swarm's high working altitude and strong ground-to-air channels, it is generally exposed to multiple ground base stations (GBSs), while the GBSs that are serving ground users (occupied GBSs) can generate strong interference to the UAV swarm. To tackle this issue, we propose a novel two-phase transmission protocol by exploiting cellular plus device-to-device (D2D) communication for the UAV swarm. In Phase I, one swarm head is chosen for ground-to-air channel estimation, and all the GBSs that are not serving ground users (available GBSs) transmit a common control message to the UAV swarm simultaneously, using the same cellular frequency band, to combat the strong interference from occupied GBSs. In Phase II, all the UAVs that have decoded the common control message in Phase I further relay it to the other UAVs in the swarm via D2D communication, by exploiting the less interfered D2D frequency band and the proximity among UAVs. In this paper, we aim to characterize the reliability performance of the above two-phase protocol, i.e., the expected percentage of UAVs in the swarm that can decode the common control message, which is a non-trivial problem due to the complex system setup and the intricate coupling between the two phases. Nevertheless, we manage to obtain an approximated expression of the reliability performance of interest, under reasonable assumptions and with the aid of the Pearson distributions. Numerical results validate the accuracy of our analytical results and show the effectiveness of our protocol over other benchmark protocols. We also study the effect of key system parameters on the reliability performance, to reveal useful insights on the practical system design.
Liang Liu, Shuowen Zhang, Rui Zhang
Unmanned aerial vehicles (UAVs) are expected to be an important new class of users in the fifth generation (5G) and beyond 5G cellular networks. In particular, there are emerging UAV applications such as aerial photograph and data relaying that require high-speed communications between the UAVs and the ground base stations (GBSs). Due to the high UAV altitude, the strong line-of-sight (LoS) links generally dominate the channels between the UAVs and GBSs, which brings both opportunities and challenges in the design of future wireless networks supporting both terrestrial and aerial users. Although each UAV can associate with more GBSs for communication as compared to terrestrial users thanks to the LoS-dominant channels, it also causes/suffers more severe interference to/from the terrestrial communications in the uplink/downlink. This paper studies the uplink communication from a multi-antenna UAV to a set of GBSs within its signal coverage by considering a practical yet challenging scenario when the number of antennas at the UAV is smaller than that of co-channel GBSs. To achieve high-rate transmission yet avoid interfering with any of the existing terrestrial communications at the co-channel GBSs, we propose a novel multi-beam transmission strategy by exploiting the non-orthogonal multiple access (NOMA) technique. Specifically, the UAV sends each data stream to a selected subset of the GBSs, which can decode the UAV's signals and then cancel them before decoding the messages of their served terrestrial users, and in the meanwhile nulls its interference at the other GBSs via zero-forcing (ZF) beamforming. To draw essential insight, we first characterize in closed-form the degrees-of-freedom (DoF) under the proposed strategy. Then, we propose an efficient algorithm to maximize the UAV's transmit rate subject to the interference avoidance constraints for protecting the terrestrial users.
Liang Liu, Ya-Feng Liu, Pratik Patil, Wei Yu
Uplink-downlink duality refers to the fact that under a sum-power constraint, the capacity regions of a Gaussian multiple-access channel and a Gaussian broadcast channel with Hermitian transposed channel matrices are identical. This paper generalizes this result to a cooperative cellular network, in which remote access-points are deployed as relays in serving the users under the coordination of a central processor (CP). In this model, the users and the relays are connected over noisy wireless links, while the relays and the CP are connected over noiseless but rate-limited fronthaul links. Based on a Lagrangian technique, this paper establishes a duality relationship between such a multiple-access relay channel and broadcast relay channel, under the assumption that the relays use compression-based strategies. Specifically, we show that under the same total transmit power constraint and individual fronthaul rate constraints, the achievable rate regions of the Gaussian multiple-access and broadcast relay channels are identical, when either independent compression or Wyner-Ziv and multivariate compression strategies are used. The key observations are that if the beamforming vectors at the relays are fixed, the sum-power minimization problems under the achievable rate and fronthaul constraints in both the uplink and the downlink can be transformed into either a linear programming or a semidefinite programming problem depending on the compression technique, and that the uplink and downlink problems are Lagrangian duals of each other. Moreover, the dual variables corresponding to the downlink rate constraints become the uplink powers; the dual variables corresponding to the downlink fronthaul constraints become the uplink quantization noises. This duality relationship enables an efficient algorithm for optimizing the downlink transmission and relaying strategies based on the uplink.
Qipeng Wang, Liang Liu, Shuowen Zhang, Francis C. M. Lau
This paper considers the joint device activity detection and channel estimation problem in a massive Internet of Things (IoT) connectivity system, where a large number of IoT devices exist but merely a random subset of them become active for short-packet transmission in each coherence block. In particular, we propose to leverage the temporal correlation in device activity, e.g., a device active in the previous coherence block is more likely to be still active in the current coherence block, to improve the detection and estimation performance. However, it is challenging to utilize this temporal correlation as side information (SI), which relies on the knowledge about the exact statistical relation between the estimated activity pattern for the previous coherence block (which may be imperfect with unknown error) and the true activity pattern in the current coherence block. To tackle this challenge, we establish a novel SI-aided multiple measurement vector approximate message passing (MMV-AMP) framework. Specifically, thanks to the state evolution of the MMV-AMP algorithm, the correlation between the activity pattern estimated by the MMV-AMP algorithm in the previous coherence block and the real activity pattern in the current coherence block is quantified explicitly. Based on the well-defined temporal correlation, we further manage to embed this useful SI into the denoiser design under the MMV-AMP framework. Specifically, the SI-based soft-thresholding denoisers with binary thresholds and the SI-based minimum mean-squared error (MMSE) denoisers are characterized for the cases without and with the knowledge of the channel distribution, respectively. Numerical results are given to show the significant gain in device activity detection and channel estimation performance brought by our proposed SI-aided MMV-AMP framework.
Liang Liu, Haixin Guan, Jinlong Ma, Wei Dai, Guangyong Wang, Shaowei Ding
In speech enhancement, the lack of clear structural characteristics in the target speech phase requires the use of conservative and cumbersome network frameworks. It seems difficult to achieve competitive performance using direct methods and simple network architectures. However, we propose the MFNet, a direct and simple network that can not only map speech but also map reverse noise. This network is constructed by stacking global local former blocks (GLFBs), which combine the advantages of Mobileblock for global processing and Metaformer architecture for local interaction. Our experimental results demonstrate that our network using mapping method outperforms masking methods, and direct mapping of reverse noise is the optimal solution in strong noise environments. In a horizontal comparison on the 2020 Deep Noise Suppression (DNS) challenge test set without reverberation, to the best of our knowledge, MFNet is the current state-of-the-art (SOTA) mapping model.
Seunghyun Lee, Liang Liu, Rui Zhang
This paper studies the simultaneous wireless information and power transfer (SWIPT) in a multiuser wireless system, in which distributed transmitters send independent messages to their respective receivers, and at the same time cooperatively transmit wireless power to the receivers via energy beamforming. Accordingly, from the wireless information transmission (WIT) perspective, the system of interest can be modeled as the classic interference channel, while it also can be regarded as a distributed multiple-input multiple-output (MIMO) system for collaborative wireless energy transmission (WET). To enable both information decoding (ID) and energy harvesting (EH) in SWIPT, we adopt the low-complexity time switching operation at each receiver to switch between the ID and EH modes over scheduled time. Based on this hybrid model, we aim to characterize the achievable rate-energy (R-E) trade-offs in the multiuser SWIPT system under various transmitter-side collaboration schemes. Specifically, to facilitate the collaborative energy beamforming, we propose a new signal splitting scheme at the transmitters, where each transmit signal is generally composed of an information signal component and an energy signal component for WIT and WET, respectively. With this new scheme, first, we study the two-user SWIPT system and derive the optimal mode switching rule at the receivers and the corresponding transmit signal optimization to achieve various R-E trade-offs over the fading channel. We also compare the R-E performance of our proposed scheme with transmit energy beamforming and signal splitting against two existing schemes with partial or no cooperation of the transmitters, and show remarkable gains over these baseline schemes. Finally, the general case of SWIPT systems with more than two users is studied, for which we propose and compare two practical transmit collaboration schemes.
Hong Xing, Liang Liu, Rui Zhang
Simultaneous wireless information and power transfer (SWIPT) has recently drawn significant interests for its dual use of radio signals to provide wireless data and energy access at the same time. However, a challenging secrecy communication issue arises as the messages sent to the information receivers (IRs) may be eavesdropped by the energy receivers (ERs), which are presumed to harvest energy only from the received signals. To tackle this problem, we propose in this paper an artificial noise (AN) aided transmission scheme to facilitate the secrecy information transmission to IRs and yet meet the energy harvesting requirement for ERs, under the assumption that the AN can be cancelled at IRs but not at ERs. Specifically, the proposed scheme splits the transmit power into two parts, to send the confidential message to the IR and an AN to interfere with the ER, respectively. Under a simplified three-node wiretap channel setup, the transmit power allocations and power splitting ratios over fading channels are jointly optimized to minimize the outage probability for delay-limited secrecy information transmission, or to maximize the average rate for no-delay-limited secrecy information transmission, subject to a combination of average and peak power constraints at the transmitter as well as an average energy harvesting constraint at the ER. Both the secrecy outage probability minimization and average rate maximization problems are shown to be non-convex, for each of which we propose the optimal solution based on the dual decomposition as well as suboptimal solution based on the alternating optimization. Furthermore, two benchmark schemes are introduced for comparison. Finally, the performances of proposed schemes are evaluated by simulations in terms of various trade-offs for wireless (secrecy) information versus energy transmissions.
Liang Liu, Zhenxiang Xi, Shaoyuan Wu, Charles Davis, Scott V. Edwards
Jan 15, 2015·q-bio.PE·PDF As researchers collect increasingly large molecular data sets to reconstruct the Tree of Life, the heterogeneity of signals in the genomes of diverse organisms poses challenges for traditional phylogenetic analysis. A class of phylogenetic methods known as "species tree methods" have been proposed to directly address one important source of gene tree heterogeneity, namely the incomplete lineage sorting or deep coalescence that occurs when evolving lineages radiate rapidly, resulting in a diversity of gene trees from a single underlying species tree. Although such methods are gaining in popularity, they are being adopted with caution in some quarters, in part because of an increasing number of examples of strong phylogenetic conflict between concatenation or supermatrix methods and species tree methods. Here we review theory and empirical examples that help clarify these conflicts. Thinking of concatenation as a special case of the more general model provided by the multispecies coalescent can help explain a number of differences in the behavior of the two methods on phylogenomic data sets. Recent work suggests that species tree methods are more robust than concatenation approaches to some of the classic challenges of phylogenetic analysis, including rapidly evolving sites in DNA sequences, base compositional heterogeneity and long branch attraction. We show that approaches such as binning, designed to augment the signal in species tree analyses, can distort the distribution of gene trees and are inconsistent. Computationally efficient species tree methods that incorporate biological realism are a key to phylogenetic analysis of whole genome data.
Liang Liu, Wei Yu
There are two fundamentally different fronthaul techniques in the downlink communication of cloud radio access network (C-RAN): the data-sharing strategy and the compression-based strategy. Under the former strategy, each user's message is multicast from the central processor (CP) to all the serving remote radio heads (RRHs) over the fronthaul network, which then cooperatively serve the users through joint beamforming; while under the latter strategy, the user messages are first beamformed then quantized at the CP, and the compressed signal is unicast to the corresponding RRH, which then decompresses its received signal for wireless transmission. Previous works show that in general the compression-based strategy outperforms the data-sharing strategy. This paper, on the other hand, point s out that in a C-RAN model where the RRHs are connected to the CP via multi-hop routers, data-sharing can be superior to compression if the network coding technique is adopted for multicasting user messages to the cooperating RRHs, and the RRH's beamforming vectors, the user-RRH association, and the network coding design over the fronthaul network are jointly optimized based on the techniques of sparse optimization an d successive convex approximation. This is in comparison to the compression-based strategy, where information is unicast over the fronthaul network by simple routing, and the RRH's compression noise covariance and beamforming vectors, as well as the routing strategy over the fronthaul network are jointly optimized based on the successive convex approximation technique. The observed gain in overall network throughput is due to that information multicast is more efficient than information unicast over the multi-hop fronthaul of a C-RAN.
Liu Liang, Qian Shengbang, BOONRUCKSAR Soonthornthum, Zhu Liying, He Jiajia, J. -Z. Yuan
Mar 10, 2011·astro-ph.SR·PDF TX Cnc is a member of the young open cluster NGC 2632. In the present paper, four CCD epochs of light minimum and a complete V light curve of TX Cnc are presented. A period investigation based on all available photoelectric or CCD data showed that it is found to be superimposed on a long-term increase ($dP/dt=+3.97\times{10^{-8}}$\,days/year), and a weak evidence suggests that it includes a small-amplitude period oscillation ($A_3=0.^{d}0028$; $T_3=26.6\,years$). The light curves in the V band obtained in 2004 were analyzed with the 2003 version of the W-D code. It was shown that TX Cnc is an overcontact binary system with a degree of contact factor $f=24.8%(\pm0.9%)$. The absolute parameters of the system were calculated: $M_1=1.319\pm0.007M_{\odot}$, $M_2=0.600\pm0.01M_{\odot}$; $R_1=1.28\pm0.19R_{\odot}$, $R_2=0.91\pm0.13R_{\odot}$. TX Cnc may be on the TRO-controlled stage of the evolutionary scheme proposed by Qian (2001a, b; 2003a), and may contains an invisible tertiary component ($m_3\approx0.097M_{\odot}$). If this is true, the tertiary component has played an important role in the formation and evolution of TX Cnc by removing angular momentum from the central system(Pribulla & Rucinski, 2006). In this way the contact binary configuration can be formed in the short life time of a young open cluster via AML.
Liang Liu, Wei Yu
As one indispensable use case for the 5G wireless systems on the roadmap, ultra-reliable and low latency communications (URLLC) is a crucial requirement for the coming era of wireless industrial automation. This paper aims to develop communication techniques for making such a paradigm shift from the conventional human-type broadband communications to the emerging machine-type URLLC. One fundamental task for URLLC is to deliver a short command from the controller to each actuator within the stringent delay requirement and also with high-reliability in the downlink. Motivated by the geographic feature in industrial automation that in the factories many tasks are assigned to different groups of devices who work in close proximity to each other and thus can form clusters of reliable device-to-device (D2D) networks, this paper proposes a novel two-phase transmission protocol for achieving the above goal. Specifically, in the first phase within the latency requirement, the multi-antenna base station (BS) combines the messages of each group together and multicasts them to the corresponding groups; while in the second phase, the devices that have decoded the messages successfully, who are defined as the leaders, help relay the messages to the other devices in their groups. Under this protocol, we further design an innovative leader selection based beamforming strategy at the BS by utilizing the sparse optimization technique, which leads to the desired sparsity pattern in user activity, i.e., at least one leader exists in each group, in the first phase, thus making full utilization of the reliable D2D networks in the second phase. Simulation results are provided to show that the proposed two-phase transmission protocol considerably improves the reliability of the whole system within the stringent latency requirement as compared to other existing schemes for URLLC such as Occupy CoW.
Liu Liang, Zhang Rui
Cloud radio access network (C-RAN) with centralized baseband processing is envisioned as a promising candidate for the next-generation wireless communication network. However, the joint processing gain of C-RAN is fundamentally constrained by the finite-capacity fronthaul links between the central unit (CU) where joint processing is implemented and distributed access points known as remote radio heads (RRHs). In this paper, we consider the downlink communication in a C-RAN with multi-antenna RRHs and single-antenna users, and investigate the joint RRH beamforming and user-RRH association problem to maximize the minimum signal-to-interference-plus-noise ratio (SINR) of all users subject to each RRH's individual fronthaul capacity constraint. The formulated problem is in general NP-hard due to the fronthaul capacity constraints and thus is difficult to be solved optimally. In this paper, we propose a new iterative method for this problem which decouples the design of beamforming and user association, where the number of users served by each RRH is iteratively reduced until the obtained beamforming and user association solution satisfies the fronthaul capacity constraints of all RRHs. A monotonic convergence is proved for the proposed algorithm, and it is shown by simulation that the algorithm achieves significant performance improvement over other heuristic solutions.
Liang Liu, Lili Yu
The hierarchy of classical Chinese poetry has been broadly acknowledged by a number of studies in Chinese literature. However, quantitative investigations about the evolutionary linkages of classical Chinese poetry are limited. The primary goal of this study is to provide quantitative evidence of the evolutionary linkages, with emphasis on character usage, among different period genres of classical Chinese poetry. Specifically, various statistical analyses are performed to find and compare the patterns of character usage in the poems of nine period genres, including shi jing, chu ci, Han shi , Jin shi, Tang shi, Song shi, Yuan shi, Ming shi, and Qing shi. The result of analysis indicates that each of nine period genres has unique patterns of character usage, with some Chinese characters that are preferably used in the poems of a particular period genre. The analysis on the general pattern of character preference implies a decreasing trend in the use of Chinese characters that rarely occur in modern Chinese literature along the timeline of dynastic types of classical Chinese poetry. The phylogenetic analysis based on the distance matrix suggests that the evolutionary linkages of different types of classical Chinese poetry are congruent with their chronological order, suggesting that character frequencies contain phylogenetic information that is useful for inferring evolutionary linkages among various types of classical Chinese poetry. The estimated phylogenetic tree identifies four groups (shi jing, chu ci), (Han shi, Jin shi), (Tang shi, Song shi, Yuan shi), and (Ming shi, Qing shi). The statistical analyses conducted in this study can be generalized to analyze the data sets of general Chinese literature. Such analyses can provide quantitative insights about the evolutionary linkages of general Chinese literature.
Weifeng Zhu, Junyuan Gao, Shuowen Zhang, Meixia Tao, Liang Liu
This paper investigates the cell-free multi-user integrated sensing and communication (ISAC) system, where multiple base stations collaboratively track the users and detect their signals. Moreover, reconfigurable intelligent surfaces (RISs) are deployed to serve as additional reference nodes to overcome the line-of-sight blockage issue of mobile users for accomplishing seamless sensing. Due to the high-speed user mobility, the multi-user tracking and signal detection performance can be significantly deteriorated without elaborated online user kinematic state updating principles. To tackle this challenge, we first manage to establish a probabilistic signal model to comprehensively characterize the interdependencies among user states, transmit signals, and received signals during the tracking procedure. Based on the Bayesian problem formulation, we further propose a novel hybrid variational message passing (HVMP) algorithm to realize computationally efficient joint estimation of user states and transmit signals in an online manner, which integrates VMP and standard MP to derive the posterior probabilities of estimated variables. Furthermore, the Bayesian Cramer-Rao bound is provided to characterize the performance limit of the multi-user tracking problem, which is also utilized to optimize RIS phase profiles for tracking performance enhancement. Numerical results demonstrate that the proposed algorithm can significantly improve both tracking and signal detection performance over the representative Bayesian estimation counterparts.
Liang Liu
MicroBooNE is a liquid argon time projection chamber (LArTPC) neutrino detector located along the Fermilab Booster Neutrino Beam and 8 degrees off-axis to the Neutrinos at the Main Injector beam. MicroBooNE collected data from both beams accumulating a large neutrino-argon scattering dataset containing hundreds of thousands of events. Understanding neutrino-argon interactions is crucial for the next generation of neutrino oscillation experiments including DUNE. MicroBooNE has developed pioneering methodologies and novel reconstruction tools in order to benchmark models at very high sensitivity across the interaction phase space, including for ultra-rare channels. This proceeding presents an overview of the most recent MicroBooNE neutrino interaction results. These measurements span inclusive, CC0$π$, and rare channels including $Λ$, $K^+$ and $η$ production, providing invaluable datasets for constraining backgrounds and improving the modeling of neutrino scattering critical for the broader LArTPC neutrino physics program.
Liang Liu, Jiangning Zhang, Ruifei He, Yong Liu, Yabiao Wang, Ying Tai, Donghao Luo, Chengjie Wang, Jilin Li, Feiyue Huang
Unsupervised learning of optical flow, which leverages the supervision from view synthesis, has emerged as a promising alternative to supervised methods. However, the objective of unsupervised learning is likely to be unreliable in challenging scenes. In this work, we present a framework to use more reliable supervision from transformations. It simply twists the general unsupervised learning pipeline by running another forward pass with transformed data from augmentation, along with using transformed predictions of original data as the self-supervision signal. Besides, we further introduce a lightweight network with multiple frames by a highly-shared flow decoder. Our method consistently gets a leap of performance on several benchmarks with the best accuracy among deep unsupervised methods. Also, our method achieves competitive results to recent fully supervised methods while with much fewer parameters.
Liang Liu, Ya-Feng Liu
A great amount of endeavour has recently been devoted to the joint device activity detection and channel estimation problem in massive machine-type communications. This paper targets at two practical issues along this line that have not been addressed before: asynchronous transmission from uncoordinated users and efficient algorithms for real-time implementation in systems with a massive number of devices. Specifically, this paper considers a practical system where the preamble sent by each active device is delayed by some unknown number of symbols due to the lack of coordination. We manage to cast the problem of detecting the active devices and estimating their delay and channels into a group LASSO problem. Then, a block coordinate descent algorithm is proposed to solve this problem globally, where the closed-form solution is available when updating each block of variables with the other blocks of variables being fixed, thanks to the special structure of our interested problem. Our analysis shows that the overall complexity of the proposed algorithm is low, making it suitable for real-time application.
Rui Wang, Liang Liu, Shuowen Zhang, Changyuan Yu
Channel estimation is the main hurdle to reaping the benefits promised by the intelligent reflecting surface (IRS), due to its absence of ability to transmit/receive pilot signals as well as the huge number of channel coefficients associated with its reflecting elements. Recently, a breakthrough was made in reducing the channel estimation overhead by revealing that the IRS-BS (base station) channels are common in the cascaded user-IRS-BS channels of all the users, and if the cascaded channel of one typical user is estimated, the other users' cascaded channels can be estimated very quickly based on their correlation with the typical user's channel \cite{b5}. One limitation of this strategy, however, is the waste of user energy, because many users need to keep silent when the typical user's channel is estimated. In this paper, we reveal another correlation hidden in the cascaded user-IRS-BS channels by observing that the user-IRS channel is common in all the cascaded channels from users to each BS antenna as well. Building upon this finding, we propose a novel two-phase channel estimation protocol in the uplink communication. Specifically, in Phase I, the correlation coefficients between the channels of a typical BS antenna and those of the other antennas are estimated; while in Phase II, the cascaded channel of the typical antenna is estimated. In particular, all the users can transmit throughput Phase I and Phase II. Under this strategy, it is theoretically shown that the minimum number of time instants required for perfect channel estimation is the same as that of the aforementioned strategy in the ideal case without BS noise. Then, in the case with BS noise, we show by simulation that the channel estimation error of our proposed scheme is significantly reduced thanks to the full exploitation of the user energy.
Runnan Liu, Liang Liu, Dazhi He, Wenjun Zhang, Erik G. Larsson
The knowledge of channel covariance matrices is of paramount importance to the estimation of instantaneous channels and the design of beamforming vectors in multi-antenna systems. In practice, an abrupt change in channel covariance matrices may occur due to the change in the environment and the user location. Although several works have proposed efficient algorithms to estimate the channel covariance matrices after any change occurs, how to detect such a change accurately and quickly is still an open problem in the literature. In this paper, we focus on channel covariance change detection between a multi-antenna base station (BS) and a single-antenna user equipment (UE). To provide theoretical performance limit, we first propose a genie-aided change detector based on the log-likelihood ratio (LLR) test assuming the channel covariance matrix after change is known, and characterize the corresponding missed detection and false alarm probabilities. Then, this paper considers the practical case where the channel covariance matrix after change is unknown. The maximum likelihood (ML) estimation technique is used to predict the covariance matrix based on the received pilot signals over a certain number of coherence blocks, building upon which the LLR-based change detector is employed. Numerical results show that our proposed scheme can detect the change with low error probability even when the number of channel samples is small such that the estimation of the covariance matrix is not that accurate. This result verifies the possibility to detect the channel covariance change both accurately and quickly in practice.