[FREE PDF sample] Data-Driven Wireless Networks: A Compressive Spectrum Approach Yue Gao ebooks
[FREE PDF sample] Data-Driven Wireless Networks: A Compressive Spectrum Approach Yue Gao ebooks
com
https://textbookfull.com/product/data-driven-wireless-
networks-a-compressive-spectrum-approach-yue-gao/
OR CLICK BUTTON
DOWNLOAD NOW
https://textbookfull.com/product/wireless-public-safety-
networks-2-a-systematic-approach-1st-edition-daniel-camara/
textboxfull.com
https://textbookfull.com/product/monitoring-multimode-continuous-
processes-a-data-driven-approach-marcos-quinones-grueiro/
textboxfull.com
https://textbookfull.com/product/data-visualisation-a-handbook-for-
data-driven-design-andy-kirk/
textboxfull.com
Data Visualisation: A Handbook For Data Driven Design Andy
Kirk
https://textbookfull.com/product/data-visualisation-a-handbook-for-
data-driven-design-andy-kirk-2/
textboxfull.com
https://textbookfull.com/product/spectrum-access-and-management-for-
cognitive-radio-networks-1st-edition-mohammad-a-matin-eds/
textboxfull.com
https://textbookfull.com/product/wireless-mems-networks-and-
applications-1st-edition-uttamchandani/
textboxfull.com
https://textbookfull.com/product/security-in-fixed-and-wireless-
networks-guenter-schaefer/
textboxfull.com
https://textbookfull.com/product/opportunistic-spectrum-utilization-
in-vehicular-communication-networks-1st-edition-nan-cheng/
textboxfull.com
SPRINGER BRIEFS IN
ELEC TRIC AL AND COMPUTER ENGINEERING
Yue Gao
Zhijin Qin
Data-Driven
Wireless
Networks
A Compressive
Spectrum
Approach
123
SpringerBriefs in Electrical and Computer
Engineering
Series editors
Woon-Seng Gan, School of Electrical and Electronic Engineering, Nanyang
Technological University, Singapore, Singapore
C.-C. Jay Kuo, University of Southern California, Los Angeles, CA, USA
Thomas Fang Zheng, Research Institute of Information Technology, Tsinghua
University, Beijing, China
Mauro Barni, Department of Information Engineering and Mathematics, University
of Siena, Siena, Italy
SpringerBriefs present concise summaries of cutting-edge research and practical
applications across a wide spectrum of fields. Featuring compact volumes of 50
to 125 pages, the series covers a range of content from professional to academic.
Typical topics might include: timely report of state-of-the art analytical techniques,
a bridge between new research results, as published in journal articles, and a
contextual literature review, a snapshot of a hot or emerging topic, an in-depth case
study or clinical example and a presentation of core concepts that students must
understand in order to make independent contributions.
Data-Driven Wireless
Networks
A Compressive Spectrum Approach
123
Yue Gao Zhijin Qin
School of Electronic Engineering School of Electronic Engineering
and Computer Science and Computer Science
Queen Mary University of London Queen Mary University of London
London, UK London, UK
This Springer imprint is published by the registered company Springer Nature Switzerland AG
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
How can wireless data influence the
compressive spectrum sensing in windband
cognitive radio and Internet of Things
networks?
Foreword
vii
Preface
ix
Acknowledgment
I would like to express my sincere gratitude to my current and former PhD students,
my collaborators, and all the colleagues who contributed to the work and projects
that lead to this book. I would like to thank the UK Engineering and Physical Sci-
ences Research Council (EPSRC) for funding my research projects, e.g., the EPSRC
Fellowship project (EP/R00711X/1).
I would also like to particularly thank our editor as well as all the editorial staff
from Springer in producing this book.
Finally, I would like to thank my family, including my wife, my daughter, and
my son. I cannot make it without their great support.
xi
Contents
Part I Background
1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.1 Motivations and Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.1.1 Data-Driven Compressive Spectrum Sensing . . . . . . . . . . . . . . . . . . 5
1.1.2 Robust Compressive Spectrum Sensing . . . . . . . . . . . . . . . . . . . . . . . . 5
1.1.3 Secure Compressive Spectrum Sensing . . . . . . . . . . . . . . . . . . . . . . . . 6
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
2 Sparse Representation in Wireless Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.1 Principles of Standard Compressive Sensing . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.1.1 Sparse Representation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
2.1.2 Projection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
2.1.3 Signal Reconstruction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
2.2 Reweighted Compressive Sensing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
2.3 Distributed Compressive Sensing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
2.4 Compressive Spectrum Sensing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
2.4.1 Spectrum Sensing Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
2.4.2 Spectrum Sensing Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
2.4.3 Compressive Wideband Spectrum Sensing . . . . . . . . . . . . . . . . . . . . . 17
2.5 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
xiii
xiv Contents
3.2.2
Non-iteratively Reweighted Least Square-Based
Compressive Sensing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
3.2.3 Proposed Wilkinson’s Method-Based DTT Location
Probability Calculation Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
3.3 Numerical Analyses. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
3.3.1 Numerical Analyses on Simulated Signals and Data . . . . . . . . . . 33
3.3.2 Numerical Analyses on Real-World Signals and Data . . . . . . . . . 38
3.4 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
4 Robust Compressive Spectrum Sensing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43
4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43
4.1.1 Related Work. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43
4.1.2 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44
4.2 Robust Compressive Spectrum Sensing at Single User . . . . . . . . . . . . . . . . 45
4.2.1 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
4.2.2 Computational Complexity and Spectrum Usage Analyses . . . 47
4.3 Numerical Analyses for Single User Case . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49
4.3.1 Analyses on Simulated Signals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49
4.3.2 Analyses on Real-World Signals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52
4.4 Matrix Completion-Based Robust Spectrum Sensing at
Cooperative Multiple Users . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
4.4.1 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
4.4.2 Denoised Cooperative Spectrum Sensing Algorithm . . . . . . . . . . 57
4.4.3 Computational Complexity and Performance Analyses . . . . . . . 58
4.5 Numerical Analyses for Cooperative Multiple Users Case . . . . . . . . . . . . 58
4.5.1 Analyses on Simulated Signals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58
4.5.2 Analyses on Real-World Signals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
4.6 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63
5 Secure Compressive Spectrum Sensing. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65
5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65
5.1.1 Related Work. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66
5.1.2 Motivations and Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67
5.2 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68
5.2.1 Networks Description . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68
5.2.2 Signal Processing Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70
5.3 Malicious User Detection Framework . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71
5.3.1 Proposed Malicious User Detection Algorithm . . . . . . . . . . . . . . . . 72
5.3.2 Rank Order Estimation Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
5.3.3 Malicious User Number Estimation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78
5.3.4 Analyses on Minimal Number of Active Secondary Users . . . . 79
5.4 Numerical Analyses. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80
5.4.1 Numerical Results Using Simulated Signals . . . . . . . . . . . . . . . . . . . 81
5.4.2 Numerical Results Using Real-World Signals. . . . . . . . . . . . . . . . . . 85
Contents xv
5.5 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87
xvii
xviii Acronyms and Nomenclature
Radio frequency (RF) spectrum is a valuable but tightly regulated resource due
to its unique and important role in wireless communications. The demand for
RF spectrum is increasing due to a rapidly expanding market of multimedia
wireless services, while the usable spectrum is becoming scarce due to current
rigid spectrum allocation policies. Specifically, according to reports from the
Federal Communications Commission (FCC) and the Office of Communications
(Ofcom), localized temporal and geographic spectrum utilization is extremely low
in reality (Kolodzy and Avoidance 2002; Ofc a). Cognitive radio (CR) has become
a promising solution to solve the spectrum scarcity problem, by allowing secondary
users (SUs) to opportunistically access a licensed band when the primary user
(PU) is absent (Mitola and Maguire 1999). Additionally, it is demonstrated that TV
spectrum, which is used to be allocated to analog TV signals, has been cleaned and
opened to access due to the digital switch-over (DSO) around the world (Kolodzy
and Avoidance 2002; Ofc a). These underutilized TV spectra are named as TV white
space (TVWS). Lately, FCC issued a report and order for permitting the cognitive
usage of TVWS spectrum (fcc). Most recently, Ofcom has enabled license exempt
use of TVWS to harness the benefits of such an innovative wireless technology (Ofc
b), which motivates the further research on the cognitive access to TVWS spectrum.
In order to avoid any harmful interference to the PUs in TVWS, SUs in CR
networks (CRNs) should be aware of the spectrum occupancy over TV band.
Spectrum sensing is the first and one of the most challenging tasks in CR, which is
performed to detect the spectrum holes over TV spectrum. As the radio environment
changes over time and space, an efficient spectrum sensing technique should be
capable of tracking these fast changes (Akyildiz et al. 2006). A good approach for
detecting the primary transmitters is to adopt the traditional narrowband sensing
algorithms, which include energy detection, matched-filtering, and cyclostationary
feature detection. Here, the term “narrowband” implies that the frequency range is
sufficiently narrow, such that the channel frequency response can be considered as
flat. In another word, the bandwidth of interest is less than the coherence bandwidth
of the channel (Sun et al. 2013).
While the present spectrum sensing algorithms have focused on exploiting
spectral opportunities over narrow frequency range, CRNs will eventually be
required to exploit spectral opportunities over wide frequency range from hundreds
of megahertz (MHz) to several gigahertz (GHz), in order to improve spectrum
efficiency and achieve higher opportunistic throughput. In wideband spectrum
sensing, as driven by the Nyquist sampling theory, a simple approach is to acquire
the wideband signal directly by a high-speed analog-to-digital converter (ADC).
So far, wideband spectrum sensing has been investigated in Tian and Giannakis
(2007), Farhang-Boroujeny (2008), Quan et al. (2009), Sun et al. (2010) with the
implementation of a high-speed ADC. However, the high-speed ADC is particularly
challenging or even unaffordable for energy-constrained devices, such as smart
phones or even battery-free devices in a wireless power transfer model (Qin et al.
2017). Subsequently, Landau (1967) demonstrated that sampling rate should be
no less than the measure of occupied part of the spectrum, with the purpose of
guaranteeing the stable reconstruction of multiband signals. However, the energy
consumption is still unaffordable for energy-constrained SUs in CRNs. Therefore,
revolutionary wideband spectrum sensing techniques become more than desired to
release the burden on high-speed ADCs.
Recent developments on compressive sensing (CS) theory inspire sub-Nyquist
sampling, by utilizing the sparse nature of signals (Candes 2006). Driven by the
inborn nature of the signal sparsity in wireless communications, e.g., the sparse
utilization of spectrum, CS theory is capable of enabling sub-Nyquist sampling
possible for wideband spectrum sensing. More particularly, CS theory has been
firstly applied to wideband spectrum sensing by Tian and Giannakis (2007), where
fewer compressed measurements are required on the basis of Nyquist sampling
theory. Subsequently, the application of CS theory on wideband spectrum sensing
in CRNs has attracted much attention.
Along with the developments on CS theory, this book spans the sub-Nyquist-
based wideband spectrum sensing with particular emphasis on CS technique.
These proposed algorithms are capable of improving the robustness and security
of CRNs, with low computational complexity at energy-constrained SUs. The
specific motivations and contributions of this book research are summarized in the
following.
1.1 Motivations and Contributions 5
With the use of CS at SUs, each SU would only collect compressed samples at
sub-Nyquist sampling rate. Subsequently, signal recovery would be performed at
SUs or a fusion center (FC), where the data from the spatially located SUs are
fused. It is noticed that the signal-to-noise ratio (SNR) of the CS measurements
would be decreased by 3 dB for every octave increasing in the subsampling factor
for acquisition of a noisy signal with fixed sparsity level (Treichler et al. 2009). This
makes the exact signal recovery more difficult for compressive spectrum sensing
under heavy channel noise. Therefore, a robust spectrum sensing algorithm based
on CS with low computational complexity is needed.
6 1 Introduction
Along with improving the robustness, adaption, and reducing the complexity
of compressive spectrum sensing algorithm, another challenge for CRNs comes
from the malicious users, which will send out dishonest data to degrade system
performance. In current CSS networks, all cooperative SUs are assumed to be honest
and genuine. However, the existence of malicious users would severely degrade the
performance of cooperative spectrum sensing (CSS) networks. Moreover, malicious
users can degrade the detection performance heavily in sub-Nyquist-based CSS
networks. If part of the compressed measurements are corrupted by malicious users,
signal recovery would be unstable at the FC.
In order to guarantee the security of CSS networks, a malicious user detection
framework is proposed by invoking the low-rank MC technique (Zhang et al. 2014;
Qin et al. 2018). More specifically, with the purpose of improving the detection
accuracy and reducing the costs of data acquisitions at SUs, the data corrupted by
malicious users are removed during the MC process at the FC. Additionally, in
order to avoid requiring any prior information of the CSS networks, a rank order
estimation algorithm and a malicious user number estimation strategy are proposed.
The proposed framework is tested on the real-world signals over TVWS after being
validated by the simulated TV signals. Numerical results show that the proposed
malicious user detection framework achieves higher detection accuracy with lower
costs of data acquisition at SUs or less number of active SUs.
References 7
References
Akyildiz, I. F., Lee, W.-Y., Vuran, M. C., & Mohanty, S. (2006). Next generation/dynamic spectrum
access/cognitive radio wireless networks: A survey. Computer Network, 50, 2127–2159.
Akyildiz, I. F., Lo, B. F., & Balakrishnan, R. (2011). Cooperative spectrum sensing in cognitive
radio networks: A survey. Physical Communication, 4, 40–62.
Candes, E. (2006). Compressive sampling. In Proceedings of the International Congress of
Mathematicians, Madrid, Spain (vol. 3, pp. 1433–1452)
Farhang-Boroujeny, B. (2008). Filter bank spectrum sensing for cognitive radios. IEEE Transac-
tions on Signal Processing, 56, 1801–1811.
Federal Communications Commission (FCC). (2008). Second report and order and memorandum
opinion and order in matter of unlicensed operation in the TV broadcast bands, additional
spectrum for unlicensed devices below 900 MHz and in the 3 GHz band, Document 08-260.
Gao, Y., Qin, Z., Feng, Z., Zhang, Q., Holland, O., & Dohler, M. (2016). Scalable and reliable
IoT enabled by dynamic spectrum management for M2M in LTE-A. IEEE Internet of Things
Journal, 3, 1135–1145.
Ghasemi, A., & Sousa, E. (2005). Collaborative spectrum sensing for opportunistic access in fading
environments. In Proceedings of the IEEE International Symposium on Dynamic Spectrum
Access Networks (DYSPAN), Baltimore, MD (pp. 131–136)
Kolodzy, P., & Avoidance, I. (2002). Spectrum policy task force. Federal Communications
Commission, Washington, DC, Rep. ET Docket.
Landau, H. (1967). Necessary density conditions for sampling and interpolation of certain entire
functions. Acta Mathematica, 117, 37–52.
Mitola, J., & Maguire, G. Q. (1999). Cognitive radio: Making software radios more personal. IEEE
Personal Communications, 6, 13–18.
Qin, Z., Gao, Y., & Parini, C. G. (2016a). Data-assisted low complexity compressive spectrum
sensing on real-time signals under sub-Nyquist rate. IEEE Transactions on Wireless Communi-
cations, 15, 1174–1185.
Qin, Z., Gao, Y., Plumbley, M., & Parini, C. (2014). Efficient compressive spectrum sensing
algorithm for M2M devices. In IEEE Global Conference on Signal and Information Processing
(GlobalSIP), Atlanta, GA (pp. 1170–1174).
Qin, Z., Gao, Y., & Plumbley, M. D. (2018). Malicious user detection based on low-rank matrix
completion in wideband spectrum sensing. IEEE Transactions on Signal Processing, 66, 5–17.
Qin, Z., Gao, Y., Plumbley, M. D., & Parini, C. G. (2016b). Wideband spectrum sensing on real-
time signals at sub-Nyquist sampling rates in single and cooperative multiple nodes. IEEE
Transactions on Signal Processing, 64, 3106–3117.
Qin, Z., Liu, Y., Gao, Y., Elkashlan, M., & Nallanathan, A. (2017). Wireless powered cognitive
radio networks with compressive sensing and matrix completion. IEEE Transactions on
Communications, 65, 1464–1476.
Qin, Z., Wei, L., Gao, Y., & Parini, C. (2015). Compressive spectrum sensing augmented by geo-
location database. In Proceedings of the International Workshop on Smart Spectrum at IEEE
Wireless Communications and Networking Conference (WCNC), New Orleans, LA (pp. 170–
175).
Quan, Z., Cui, S., Sayed, A. H., & Poor, H. V. (2009). Optimal multiband joint detection for
spectrum sensing in cognitive radio networks. IEEE Transactions on Signal Processing, 57,
1128–1140.
Sun, H., Laurenson, D. I., & Wang, C. X. (2010). Computationally tractable model of energy
detection performance over slow fading channels. IEEE Communications Letters, 14, 924–926.
Sun, H., Nallanathan, A., Wang, C.-X., & Chen, Y. (2013). Wideband spectrum sensing for
cognitive radio networks: A survey. IEEE Wireless Communications, 20, 74–81.
Tian, Z., & Giannakis, G. (2007). Compressed sensing for wideband cognitive radios. In IEEE
International Conference on Acoustics, Speech, and Signal Processing, Honolulu, HI (ICASSP)
(pp. 1357–1360).
8 1 Introduction
Treichler, J., Davenport, M., & Baraniuk, R. (2009). Application of compressive sensing to the
design of wideband signal acquisition receivers. In US/Australia Joint Work. Defense Apps of
Signal Processing (DASP) (vol. 5).
UK Office of Communications (Ofcom). (2009). Statement on cognitive access to interleaved
spectrum.
UK Office of Communications (Ofcom). (2015). Decision to make the wireless telegraphy (White
Space Devices).
Wang, Y., Tian, Z., & Feng, C. (2012). Collecting detection diversity and complexity gains in
cooperative spectrum sensing. IEEE Wireless Communications, 11, 2876–2883.
Zhang, X., Ma, Y., Gao, Y., & Zhang, W. (2018). Autonomous compressive sensing augmented
spectrum sensing. IEEE Transactions on Vehicular Technology, 67, 6970–6980.
Zhang, X., Qin, Z., & Gao, Y. (2014). Dynamic adjustment of sparsity upper bound in wideband
compressive spectrum sensing. In Proceedings of the IEEE Global Conference on Signal and
Information Processing (GlobalSIP), Atlanta, GA (pp. 1214–1218).
Chapter 2
Sparse Representation in Wireless
Networks
Sparse representation of signals has received extensive attention due to its capacity
for efficient signal modeling and related applications. The problem solved by the
sparse representation is to search for the most compact representation of a signal
in terms of a linear combination of the atoms in an overcomplete dictionary. In
the literature, three aspects of research on the sparse representation have been
focused:
1. Pursuit methods for solving the optimization problem, such as matching pursuit
and basis pursuit;
2. Design of the dictionary, such as the K-SVD method;
3. Applications of the sparse representation, such as wideband spectrum sensing,
channel estimation of massive MIMO, and data collection in WSNs.
General sparse representation methods, such as principal component analysis
(PCA) and independent component analysis (ICA), aim to obtain a representation
that enables sufficient reconstruction. It has been demonstrated that PCA and ICA
are able to deal with signal corruption, such as noise, missing data, and outliers. For
sparse signals without measurement noise, CS can recover the sparse signals exactly
with random measurements. Furthermore, the random measurements significantly
outperform measurements based on PCA and ICA for the sparse signals without
corruption (Chang et al. 2009b; Wright et al. 2010; Chang et al. 2009a).
Generally speaking, sparse signals contain much less information than their ambient
dimension suggests. Sparsity of a signal is defined as the number of non-zero
elements in the signal under a certain domain. Let f be an N -dimensional signal
of interest, which is sparse over the orthonormal transformation basis matrix Ψ ∈
RN ×N , and s be the sparse representation of f over the basis Ψ . Then f can be given
by
f = Ψ s. (2.1)
Apparently, f can be the time or space domain representation of a signal, and s is the
equivalent representation of f in the Ψ domain. For example, if Ψ is the inverse
Fourier transform (FT) matrix, then s can be regarded as the frequency domain
representation of the time domain signal, f. Signal f is said to be K-sparse in the Ψ
domain if there are only K (K N ) out of the N coefficients in s that are non-zero.
If a signal is able to be sparsely represented in a certain domain, the CS technique
can be invoked to take only a few linear and non-adaptive measurements.
2.1.2 Projection
When the original signal f arrives at the receiver, it is processed by the measurement
matrix Φ ∈ RP ×N with P < N, to get the compressed version of the signal, that is,
x = Φf = ΦΨ s=Θs, (2.2)
è è
æs ç æs ç
æs
è
ç
S = çs S = çç s
ç ç
ç ç ç
ç ç S =çs ç
ç0 æ ç0 æ
ç0
è è è
æ
s1 s1 s1
s3 s3 s3
è è è
æ1 −1 0 ÷ æ1 0 0 ÷ æ1 1 0 ÷
Θ1 = ÷ æ Θ 2 =÷ æ Θ3 = ÷ æ
è0 0 1 è0 0 1 è0 0 1
Fig. 2.1 Projection of a sparse signal with one non-zero component with different sensing
matrices Qin et al. (2018). (a) Worst projection. (b) Bad projection. (c) Good projection
110
space. When the sensing matrix is set to Θ3 = , as shown in Fig. 2.1c, the
001
signal s can be fully recorded as it falls into the plane spanned by the two row vectors
of Θ3 . Therefore, Θ3 results in a good projection and s can be exactly recovered by
its projection x in the two-dimensional space. Then it is natural to ask what type of
projection is good enough to guarantee the exact signal recovery?
The key of CS theory is to find out a stable basis Ψ or measurement matrix Φ to
achieve exact recovery of the signal with length N from P measurements. It seems
an undetermined problem as P < N. However, it has been proved in Candes et al.
(2006) that exact recovery can be guaranteed under the following conditions:
• Restricted isometry property (RIP): Measurement matrix Φ has the RIP of order
K if
Φf22
1 − δK ≤ ≤ 1 + δK (2.3)
f22
holds for all K-sparse signal f, where δK is the restricted isometry constant of a
matrix Φ.
• Incoherence property: Incoherence property requires that the rows of measure-
ment matrix Φ cannot sparsely represent the columns of the sparsifying matrix
Ψ and vice versa. More specifically, a good measurement will pick up a little bit
information of each component in s based on the condition that Φ is incoherent
with Ψ . As a result, the extracted information can be maximized by using the
minimal number of measurements.
It has been pointed out that verifying both the RIP condition and incoherence
property is computationally complicated but they could be achieved with a high
12 2 Sparse Representation in Wireless Networks
After the compressed measurements are collected, the original signal should be
reconstructed. Since most of the basis coefficients in s are negligible, the original
signal can be reconstructed by finding out the minimal set of coefficients that
matches the set of compressed measurements x, that is, by solving
0.8
0.6
Pd
0.4
0.2
Random demodulator
Gaussian distributed matrix
0
10-2 10-1 100
P/N
Fig. 2.2 Detection probability versus compression ratio with different measurement matrices. In
this case, the signal is one-sparse
where ·p is the p -norm and p = 0 corresponds to counting the number of non-
zero elements in s. However, the reconstruction problem in (2.4) is both numerically
unstable and NP-hard (Candes 2006) when 0 -norm is used.
So far, there are mainly two types of relaxations to problem (2.4) to find a
sparse solution. The first type is convex relaxation, where 1 -norm is used to
substitute 0 -norm in (2.4). Then (2.4) can be solved by standard convex solvers,
e.g., cvx. It has been proved that 1 norm results √
in the same solution as 0 norm
when RIP is satisfied with the constant δ2k < 2 − 1 (Cands 2008). Another
type of solution is to use a greedy algorithm, such as OMP (Tropp and Gilbert
2007), to find a local optimum in each iteration. In comparison with the convex
relaxation, the greedy algorithm usually requires lower computational complexity
and time cost, which makes it more practical for wireless communication systems.
Furthermore, the recent result has shown that the recovery accuracy achieved by
some greedy algorithms is comparable to the convex relaxation but requiring much
lower computational cost (Choi et al. 2017).
(Candes 2006) has been developed to enhance the signal recovery performance with
fewer compressed measurements by solving
N
ŝ = arg min wi si subject to Θs = x, (2.6)
s
i=1
(l−1) p−2 (l−1)
where wi = si is computed based on the result of the last iteration, si .
It is worth noting that (2.4) becomes non-convex when p < 1. The existing
algorithms cannot guarantee to reach a global optimum and may only produce local
minima. However, it has been proved (Chartrand 2007; Chartrand and Staneva 2008)
that under some circumstances the reconstruction in (2.4) will reach a unique and
global minimizer (Chartrand and Yin 2008), which is exactly ŝ = s. Therefore, we
can still exactly recover the signal in practice.
xm = Θm sm , ∀m ∈ M , (2.7)
where M is the set of nodes in the network. As stated in (2.2), Θm is the sensing
matrix deployed at the m-th node, and sm is a sparse signal of interest. DCS becomes
a standard CS when M = 1.
In the applications of standard CS, the signal received at the same node has its
sparsity property due to its intra-correlation. While for the networks with multiple
nodes, signals received at different nodes exhibit strong inter-correlation. The intra-
correlation and inter-correlation of signals from the multiple nodes lead to a joint
sparsity property. The joint sparsity level is usually smaller than the aggregate
over the individual signal’s sparsity level. As a result, the number of compressed
measurements required for exact recovery in DCS can be reduced significantly
compared to the case performing standard CS at each single node independently.
2.4 Compressive Spectrum Sensing 15
In DCS, there are two closely related concepts: distributed networks and
distributed CS solvers. The distributed networks refer to networks that different
nodes perform data acquisition in a distributed way and the standard CS can
be applied at each node individually to perform signal recovery. While for DCS
solver as proposed in Baron et al. (2009), the data acquisition process requires no
collaboration among sensors and the signal recovery process is performed at several
computational nodes, which can be distributed in a network or locally placed within
a multiple core processor. Generally, it is of interest to minimize both computation
cost and communication overhead in DCS. The most popular application scenario of
DCS is that all signals share the common sparse support but with different non-zero
coefficients.
The last decade has witnessed the rapid explosion of wireless devices all over the
world, which gives rise to the increasing demand for wireless spectral resource.
As reported by FCC and Ofcom (Kolodzy and Avoidance 2002; Ofc a), there are
significant temporal and spatial variations in the allocated spectrum. Given this
fact, CR has been proposed as an intelligent system to detect spectrum holes for
unlicensed usage (Mitola and Maguire 1999). More specifically, the basic idea of CR
is to match the requirements of higher layer applications or users with the available
resources. The available resources include available power, spectrum, and other
resources that can be utilized by unlicensed SUs. CR is a radio that is capable of
sensing the available resources and learning from the user behaviors and its previous
decisions and mistakes, in order to provide a better response to the new resource
request from SUs. So far, CR has been widely investigated.
In CR, spectrum sensing is one of the most challenging tasks, which allows SUs to
have the knowledge of spectrum occupancy. Once a spectrum hole is detected, SUs
can make use of it for data transmission. Spectrum sensing requires high accuracy
and low complexity for DSA (Nekovee 2008). There is an extensive research work
on spectrum sensing techniques being carried out. Many theoretical models for
spectrum sensing techniques have been proposed, such as matched filter detection,
cyclostationary feature detection, and energy detection. The matched filter detection
is an optimal detection method that requires the prior information of PUs (Bhargavi
and Murthy 2010). However, it requires SUs to have a dedicated sensing receiver
for each type of PU signals. Cyclostationary feature detection can distinguish the
PUs and noise by utilizing the periodicity in the received primary signal. However,
it requires high computational complexity and prior information of the primary
Exploring the Variety of Random
Documents with Different Content
Dowland shook his head. He could think about that when he had
more time. He'd lost—he looked at his watch—a little less than four
hours. In four hours, a large number of things might have happened
in the ranch area, with only the one partly attractive possibility
among them that somebody had managed to get into the laboratory
and shut off the YM flow.
Dowland was fifteen feet from the door, half running with both hands
on the rope, when something plucked at him. He strained awkwardly
sideways, feet almost lifting from the floor. Abruptly he was released,
went stumbling forward a few steps before the next invisible current
tugged at him, pulling him downward now. It was a very much
stronger pull, and for endless seconds it continued to build up. His
shoulders seemed ready to snap before he suddenly came free again.
The rest of the way to the platform remained almost undisturbed, but
Dowland was trembling with tensions before he reached it; he could
feel the drag of the AR field on his breathing. The steps to the
platform were a dozen feet to his right—too far from the rope.
Dowland put his weight on the rope, swung forward and up, let the
rope go and came down on the narrow walk between instrument
board and machine section. The panels shone with their own light; at
the far end he saw the flow-control wheel Trelawney had indicated, a
red pointer opposite the numeral "5." Dowland took two steps toward
it, grasped the wheel, and spun it down.
The pointer stopped at "1." He heard it click into position there.
Instantly, something slammed him sideways against the console, sent
him staggering along it, and over the low railing at the end of the
platform. The floor seemed to be shuddering as he struck it, and then
to tilt slowly. Dowland rolled over, came up on hands and knees,
facing back toward the platform. Daylight blazed again in the building
behind him, and the roar of a river that rolled through another time
filled his ears. He got to his feet, plunged back toward the whipping
rope above the platform. The light and the roaring cut off as he
grasped the rope, flashed back into the building, cut off again.
Somewhere somebody had screamed....
Dowland swung about on the rope, went handing himself along it,
back toward the door. His feet flopped about over the floor, unable to
get a stand there for more than an instant. It was a struggle now to
get enough air through the antiradiation field into his lungs. He saw
dust whip past the open door, momentarily obscuring it. The building
bucked with earthquake fury. And where was Trelawney?
He saw the red, wet thing then, lying by the wall just inside the door;
and sickness seized him because Trelawney's body was stretched out
too far to make it seem possible it had ever been that of a man. Dust
blasted in through the door as he reached it, and subsided, leaving a
choking residue trapped within the radiation screen. If he could only
cut off the field....
His gun lay too close to the sodden mess along the wall. Dowland
picked it up, was bending to snatch the climbing harness from the
floor when light flared behind him again. Automatically, he looked
back.
Once more the interior of the building seemed to have split apart.
Wider now. He saw the rushing white current below. To the right,
above the forest on the bank, the sun was a swollen red ball glaring
through layers of mist. And to the left, moving slowly over the river in
the blaze of long-dead daylight, was something both unmistakable
and not to be believed. But, staring at it in the instant before the
scene shivered and vanished again, Dowland suddenly thought he
knew what had happened here.
What he had seen was a spaceship.
He turned, went stumbling hurriedly out the door into the whistling
wind, saw Jill Trelawney standing there, white-faced, eyes huge,
hands to her mouth.
He caught her shoulder. "Come on! We've got to get away from
here."
She gasped, "It—tore him apart!"
"We can't help him...." Dust clouds were spinning over the back of
the mesa, concealing the upper slopes. Dowland glanced to the west,
winced at the towering mountain of darkness sweeping toward them
through the sky. He plunged up the slope, hauling her along behind
him. Jill cried out incoherently once, in a choking voice, but he didn't
stop to hear what she was trying to say. He shoved her into the
house, slammed the door shut behind them, hurried her on down the
hall and into the living room. As they came in, he switched off his AR
field and felt air fill his lungs easily again. It was like surfacing out of
deep water. The detector still hissed its thin warning, but it was
almost inaudible. They would have to risk radiation now.
"Out of your suit, quick! Whatever's happening in the lab has
whistled up a dust storm here. When it hits, that radiation field will
strangle you in a minute outdoors."
She stared at him dumbly.
"Get out of your suit!" Dowland shouted, his nerves snapping. "We're
going down the eastern wall. It's our only chance. But we can't get
down alive if we can't breathe...." Then, as she began unbuckling the
suit hurriedly with shaking fingers, he turned to the pile of camping
equipment beside the fireplace and pawed through it.
He found the communicator and was snapping it to the
mountaineering harness when the front door slammed. He wheeled
about, startled. Jill's radiation suit lay on the floor near the entry hall.
She was gone.
He was tearing the door open three seconds later, shouted, and saw
her through the dust forty feet away, running up toward the forest.
He mightn't have caught her if she hadn't stumbled and gone
headlong. Dowland was on top of her before she could get up. She
fought him in savage silence like an animal, tearing and biting, her
eyes bloodshot slits. There was a mechanical fury about it that
appalled him. But at last he got his right arm free, and brought his
fist up solidly to the side of her jaw. Jill's head flew back, and her
eyes closed.
A week later, Lieutenant Frank Dowland was shown into the office of
the chief of the Solar Police Authority. The chief introduced him to the
two other men there, who were left unidentified, and told him to be
seated.
"Lieutenant," he said, "these gentlemen have a few questions to ask
you. You can speak as openly to them as you would to me."
Dowland nodded. He had recognized one of the gentlemen
immediately—Howard Camhorn, the Coordinator of Research.
Reputedly one of the sharpest minds in the Overgovernment's top
echelons. The other one was unfamiliar. He was a few years younger
than Camhorn, around six inches shorter, chunky, with black hair,
brown eyes, an expression of owlish reflectiveness. Probably,
Dowland thought, wearing contact lenses. "Yes, sir," he said to the
chief, and looked back at the visitors.
"We've seen your report on your recent visit to Terra, Lieutenant
Dowland," Camhorn began pleasantly. "An excellent report,
incidentally—factual, detailed. What we should like to hear now are
the things that you, quite properly, omitted from it. That is, your
personal impressions and conclusions."
"For example," the other man took up, as Dowland hesitated, "Miss
Trelawney has informed us her uncles were attempting to employ the
Ym-400 they had acquired to carry out a time-shift to an earlier Earth
period—to the period known as the Pleistocene, to be somewhat
more exact. From what you saw, would you say they had succeeded
in doing it?"
"I don't know, sir," Dowland said. "I've been shown pictures
representing that period during the past few days. The scene I
described in the report probably might have existed at that time." He
smiled briefly. "However, I have the impression that the very large
flying creature I reported encountering that night is regarded as
being ... well, er ... ah...."
"A product of excited nerves?" the short man said, nodding. "Under
such extraordinary circumstances, that would be quite possible, you
know."
"Yes, sir, I know."
The short man smiled. "But you don't think it was that?"
"No, sir," Dowland said. "I think that I have described exactly what I
did hear and see."
"And you feel the Trelawneys established contact with some previous
Earth period—not necessarily the Pleistocene?"
"Yes, I do."
"And you report having seen a spaceship in that prehistorical
period...."
Dowland shook his head. "No, sir. At the moment I was observing it, I
thought it was that. What I reported was having seen something that
looked like a spaceship."
"What do you think it was?"
"A timeship—if there is such a word."
"There is such a word," Camhorn interrupted lazily. "I'm curious to
hear, lieutenant, what brought you to that conclusion."
"It's a guess, sir. But the thing has to fit together somehow. A
timeship would make it fit."
"In what way?"
"I've been informed," Dowland said, "that the Overgovernment's
scientists have been unable to make a practical use of YM because
something has invariably gone wrong when they did try to use it. I
also heard that there was no way of knowing in advance what would
happen to make an experiment fail. But something always would
happen, and frequently a number of people would get killed."
Camhorn nodded. "That is quite true."
"Well, then," Dowland said, "I think there is a race of beings who
aren't quite in our time and space. They have YM and use it, and
don't want anyone else to use it. They can tell when it's activated
here, and use their own YM to interfere with it. Then another
experiment suddenly turns into a failure.
"But they don't know yet who's using it. When the Trelawneys turned
on their machine, these beings spotted the YM stress pattern back
there in time. They went to that point and reinforced the time-
blending effect with their own YM. The Trelawneys hadn't intended a
complete contact with that first test. The aliens almost succeeded in
blending the two periods completely in the area near the laboratory."
"For what purpose?" Camhorn asked.
"I think they're very anxious to get us located."
"With unfriendly intentions?"
"The ones we ran into didn't behave in a friendly manner. May I ask a
question, sir?"
"Of course," Camhorn said.
"When the Trelawneys' machine was examined, was the supply of YM
adequately shielded?"
"Quite adequately," Camhorn said.
"But when I opened the door, the laboratory was hot. And Miguel
Trelawney died of radiation burns...."
Camhorn nodded. "Those are facts that give your theory some
substance, lieutenant. No question about it. And there is the
additional fact that after you shut off the YM flow in the laboratory,
nearly ten minutes passed before the apparent contact between two
time periods was broken. Your report indicates that the phenomena
you described actually became more pronounced immediately after
the shutoff."
"Yes, sir."
"As if the aliens might have been making every effort to retain
contact with our time?"
"Yes, sir," Dowland said. "That was my impression."
"It's quite plausible. Now, the indications are that Paul Trelawney
actually spent considerable time—perhaps twelve to fourteen hours,
at any rate—in that other period. He gave no hint of what he
experienced during those hours?"
"No, sir, except to say that it was night when he appeared there. He
may have told Miss Trelawney more."
"Apparently, he didn't," Camhorn said. "Before you and he went into
the laboratory, he warned her to watch for the approach of a creature
which answers the description of the gigantic things you encountered
twice. But that was all. Now, here again you've given us your
objective observations. What can you add to them—on a perhaps
more speculative basis?"
"Well, sir," Dowland said, "my opinions on that are, as a matter of
fact, highly speculative. But I think that Paul Trelawney was captured
by the aliens as soon as he appeared in the other time period, and
was able to escape from them a number of hours later. Two of the
aliens who were attempting to recapture him eventually followed him
out on Lion Mesa through another opening the YM stresses had
produced between the time periods, not too far away from the first."
Camhorn's stout companion said thoughtfully, "You believe the
birdlike creature you saw arrived by the same route?"
"Yes, sir," Dowland said, turning to him. "I think that was simply an
accident. It may have been some kind of wild animal that blundered
into the contact area and found itself here without knowing what had
occurred."
"And you feel," the other man went on, "that you yourself were
passing near that contact point in the night at the time you seemed
to be smelling a swamp?"
Dowland nodded. "Yes, sir, I do. Those smells might have been an
illusion, but they seemed to be very distinct. And, of course, there
are no swamps on the mesa itself."
"I think Trelawney realized this, and used a moment when his actions
were not being controlled to slip back into the suit. Then he was free
to act again. When they discovered he had escaped, some of them
were detailed to search for him, and two of those pursuers came out
here in our time on the mesa.
"As for Miss Trelawney—well, obviously she wasn't trying to get away
from me. Apparently, she wasn't even aware of what she was doing.
She was simply obeying physically the orders her mind began to
receive as soon as she stepped out of the radiation suit. They would
have been to come to the thing, wherever it was at the moment—
somewhere up to the north of the ranch area, judging from the
direction in which she headed."
There was silence for some seconds. Then Camhorn's companion
observed, "There's one thing that doesn't quite fit in with your theory,
lieutenant."
"What's that, sir?"
"Your report states that you switched off your AR field at the same
time you advised Miss Trelawney to get out of her suit. You should
have been equally subject to the alien's mental instructions."
"Well," Dowland said, "I can attempt to explain that, sir, though again
there is no way to prove what I think. But it might be that these
creatures can control, only one mind at a time. The alien may not
have realized that I had ... well ... knocked Miss Trelawney
unconscious and that she was unable to obey its orders, until it came
to the spot and saw us. My assumption is that it wasn't till that
moment that it switched its mental attack to me."
The stout man—his name was Laillard White, and he was one of
Research's ace trouble-shooters in areas more or less loosely related
to psychology—appeared morosely reflective as he and Camhorn left
Solar Police Authority Headquarters, and turned toward the adjoining
Overgovernment Bureau.
"I gather from your expression," Camhorn remarked, "that our
lieutenant was telling the truth."
White grunted. "Of course, he was—as he saw it."
"And he's sane?"
"Quite sane," White agreed absently.
Camhorn grinned. "Then what's the matter, Lolly? Don't you like the
idea of time-travel?"
"Naturally not. It's an absurdity."
"You're blunt, Lolly. And rash. A number of great minds differ with
you about that."
Laillard White said something rude about great minds in general. He
went on, "Was the machine these Trelawneys built found intact?"
Camhorn nodded. "In perfect condition. I found an opportunity to
look it over when it and the others the Freeholders had concealed on
Terra were brought in."
"And these machines are designed to make it possible to move
through time?"
"No question about that. They function in Riemann space, and are
very soundly constructed. A most creditable piece of work, in fact. It's
only regrettable that the Trelawney brothers were wasted on it. We
might have put their talents to better use. Though as it turned
out...." He shrugged.
White glanced over at him. "What are you talking about?" he asked
suspiciously.
"They didn't accomplish time-travel," Camhorn said, "though in
theory they should have. I know it because we have several
machines based on the same principles. The earliest was built almost
eighty years ago. Two are now designed to utilize the YM thrust. The
Trelawney machine is considerably more advanced in a number of
details than its Overgovernment counterparts, but it still doesn't
make it possible to move in time."
"Why not?"
"I'd like to know," Camhorn said. "The appearance of it is that the
reality we live in takes the same dim view of time-travel that you do.
Time-travel remains a theoretical possibility. But in practice—when,
for example, the YM thrust is applied for that purpose—the thrust is
diverted."
White looked bewildered. "But if Paul Trelawney didn't move through
time, what did he do?"
"What's left?" Camhorn asked. "He moved through space, of course."
"Where?"
Camhorn shrugged. "They penetrated Riemann space," he said,
"after harnessing their machine to roughly nineteen thousand times
the power that was available to us before the Ymir series of elements
dropped into our hands. In theory, Lolly, they might have gone
anywhere in the universe. If we'd had the unreasonable nerve to play
around with multikilograms of YM—knowing what happened when
fractional quantities of a gram were employed—we might have had a
very similar experience."
"I'm still just a little in the dark, you know," Laillard White observed
drily, "as to what the experience consisted of."
"Oh, Lieutenant Dowland's theory wasn't at all far off in that respect.
It's an ironic fact that we have much to thank the Trelawneys for.
There's almost no question at all now what the race of beings they
encountered were responsible for the troubles that have plagued us
in the use of YM. They're not the best of neighbors—neighbors in
Riemann space terms, that is. If they'd known where to look for us,
things might have become rather hot. They had a chance to win the
first round when the Trelawneys lit that sixty-eight kilogram beacon
for them. But they made a few mistakes, and lost us again. It's a
draw so far. Except that we now know about as much about them as
they've ever learned about us. I expect we'll take the second round
handily a few years from now."
Updated editions will replace the previous one—the old editions will
be renamed.
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
textbookfull.com