Ashok B 6
Ashok B 6
PROJECT REPORT
ON
Two High-Performance Schemes of Transmit Antenna
Selection for Secure Spatial Modulation
A project report submitted in partial fulfillment of the Requirements for the award to the
degree of
BACHELOR OF TECHNOLOGY
In
Electronics and Communication Engineering
Submitted by
D.GOPI 19351A0412
K.NAGARJUNA 19351A0434
(2019-2023)
DR. SAMUEL GEORGE INSTITUTE OF ENGINEERING AND
TECHNOLOGY
(Affiliated to JNTUKAKINADA & An ISO 9001-2000 Certified institute)
MARKAPUR – 523316, Prakasam-(dist.), AP
BONAFIDE CERTIFICATE
This is to certify the project report entitles “Two High-Performance Schemes of Transmit Antenna
Selection for Secure Spatial Modulation “ submitted by by M.ASHOK KUMAR (19351AO402),
D.GOPI (19351A0412), K.NAGARJUNA (19351A0434), P.SASIDHAR REDDY (19351A0458),
K.VENKATA NAGA SAI KUMAR (19351A0486) in partial fulfilment of award to the degree of
BACHELOR OF TECHNOLOGY IN ELECTRONICS AND COMMUNICATION
ENGINEERING from Jawaharlal Nehru Technological University, Kakinada during the
academic year 2019-2023.
D. GOPI 19351A0412
K. NAGARJUNA 19351A0434
Abstract i
What is Mimo
Functions of Mimo
System Model
Chapter-6: Conclusion 28
References 29-30
Abstract
In this paper, a secure spatial modulation (SM) system with artificial noise (AN)-
aided is investigated. To achieve higher secrecy rate (SR) in such a system, two high-
performance schemes of transmit antenna selection (TAS), leakage-based and
maximum secrecy rate (Max-SR), are proposed and a generalized Euclidean distance-
optimized antenna selection (EDAS) method is designed. From simulation results and
analysis, the four TAS schemes have a decreasing order: Max-SR, leakage-based,
generalized EDAS, and random (conventional), in terms of SR performance. However,
the proposed Max-SR method requires the exhaustive search to achieve the optimal SR
performance, thus its complexity is extremely high as the number of antennas tends to
medium and large scale. The proposed leakage-based method approaches the Max-SR
method with much lower complexity. Thus, it achieves a good balance between
complexity and SR performance. In terms of bit error rate (BER), their performances are
in an increasing order: random, leakage-based, Max-SR, and generalized EDAS.
Index Terms—MIMO, secure spatial modulation, transmit antenna selection, signal-to-
leakage noise ratio, artificial noise.
(i)
Two High Performance Schemes of Transmit Antenna Selection for Secure Spatial Modulation 2019-2023
CHAPTER 1
INTRODUCTION
and higher complexity than COAS scheme. Therefore, some literature was intended to
reduce the computational and search complexity of the EDAS scheme [16]–[18]. To the
best of our knowledge, there is no research work concerning how to design TAS
methods for secure SM system. In this paper, we will focus on the aspect research and
make our effort to address this problem, our main contributions are summarized as
follows: 1) To reach the bound of SR, a maximum secrecy rate (Max-SR) method is
proposed with exhaustive search. In accordance with simulation results, it can achieve
the best SR performance in a large range of SNR compared to existing methods. 2) To
reduce the leakage power of the confidential messages for desired user to
eavesdropper, a leakage-based TAS method is proposed for secure SM system. Also, its
low complexity version, i.e., sorting-based solution, is presented to achieve the same SR
performance. Simulation results show that the proposed leakage-based method
provides a SR performance being close to that of the Max-SR method with far lower
complexity. 3) Finally, as a performance benchmark, we also generalize the
conventional EDAS method in non-secure SM systems and make it become a secure
EDAS for secure SM systems. Meanwhile, we analyze and compare the complexity for
the three TAS methods. The remainder is organized as follows. In Section II, we describe
secure SM system model and give a definition for its average SR. Subsequently, we
propose two TAS methods: leakage-based and Max-SR, and generalize the conventional
EDAS scheme to secure SM systems in Section III. In Section IV, numerical simulation
results are presented. Finally, we make our conclusions in Section V. Notation:
throughout the paper, matrices, vectors, and scalars are denoted by letters of bold
upper case, bold lower case, and lower case, respectively. Sign (·) −1 , and (·) H denote
inverse, and conjugate transpose, respectively. Notation E{·} stands for the expectation
operation. Matrix IN denotes the N × N identity matrix, and tr(·) denotes matrix trace
CHAPTER 2
LITERATURE SERVEY
Over the past few years, the popularity of smart phones, electronic tablets and video
streaming as well as the sharp rise in the number of service providers has led to an
explosive growth of data traffic in wireless networks. This increasing demand of
capacity in mobile broadband communications poses challenges for designing the next
generation of cellular networks (5G) in the near future [2]. Given this backdrop,
confidential and private transmission of data in the next generation of wireless
networks is of paramount importance. In this respect, physical layer security for 5G
wireless networks has gained significant attentions in recent years aiming for design of
reliable and secure transmission schemes [3], [4]. Unlike the traditional approaches
relying on cryptographic techniques [5], physical layer security provides secrecy by
exploiting the inherent characteristics of wireless channels. Although cryptographic
techniques employed in the upper layers of networks protect processed data securely,
physical layer security is a potential solution through the communication phase [6]
The basic model for physical layer security is the wiretap channel in which transmitted
messages to a legitimate receiver are being overheared by an eavesdropper. Wyner
demonstrated that secrecy is obtained in this setting as long as the legitimate receiver
communicates over a channel whose quality is better than the eavesdropper channel
[7]. Based on this framework, several techniques such as artificial noise generation [8],
[9] and cooperative jamming [10] were proposed for secrecy enhancement. The
extension of Wyner’s framework to MultipleInput Multiple-Output (MIMO) settings has
moreover shown a promising performance of such settings in the presence of
eavesdroppers [11]–[13]. In fact, in MIMO wiretap channels, also referred to as
Multiple-Input Multiple-Output MultipleEavesdropper (MIMOME) channels, the Base
Station (BS) can focus its main transmit beam to the legitimate terminals, and thus,
reduce the information leakage to the eavesdroppers. This technique in massive MIMO
settings [14] asymptotically cancels out passive malicious terminals in the network
making these settings robust against passive eavesdropping [15]. Despite promising
characteristics of massive MIMO systems, they are known to pose high Radio Frequency
(RF)-cost and complexity. In fact, employing a separate RF chain per antenna in massive
MIMO systems imposes a burden from the implementational point of view [16]. This
issue has introduced the antenna selection [17] along with other approaches such as
spatial modulation [18] and hybrid analog-digital precoding schemes [19], [20] as
prevalent strategies in massive MIMO. In antenna selection, only a subset of antennas is
set to be active in each coherence time. This subset is in general selected with respect to
some performance metric such as achievable transmission rate, outage probability or
bit error rate [17]. The optimal approaches to antenna selection however deal with an
exhaustive search which is not computationally feasible in practice. Alternatively,
several suboptimal, but complexity efficient, methods have been proposed in the
literature; see for example the approaches in [21]–[24]. The investigations have shown
that these suboptimal approaches do not impose a significant loss on the performance
for several MIMO settings [23], [25], [26]. In the context of massive MIMO systems,
recent studies have demonstrated that the large-system properties of these systems are
maintained even via simple antenna selection algorithms [27], [28]. In addition to
implementational complexity reduction, antenna selection was also observed to be
beneficial in MIMO systems with respect to some performance measures such as
secrecy rate [29], [30], energy efficiency [31] and effective rate [32] in some special
cases. For instance, it was shown in
[33] that single Transmit Antenna Selection (TAS), i.e., only one trannsmit antenna
being active, in a conventional MIMO setup can achieve high levels of security, especially
when the total number of transmit antennas increases. The study was later extended in
[34] to cases with multi-antenna eavesdroppers demonstrating that similar results hold
also in these settings. In [35], secure transmission in a general MIMOME channel was
investigated under single TAS. Such results were further extended in the literature for
other MIMOME settings. For example in [36], secure transmission was studied for
Nakagami-m fading channels under single TAS. The impacts of imperfect channel
estimation and antenna correlation were also investigated in [37]. The average secrecy
rate and secrecy diversity analysis for a simple single TAS scheme was moreover
studied in [38], [39]. In [40], TAS with outdated Channel State Information (CSI) was
analyzed for scenarios with single-antenna receivers. The effect of single TAS at the BS
in the presence of randomly located eavesdroppers with a fullduplex receiver was
moreover studied in [41]. In contrast to single TAS, the secrecy performance of
MIMOME channels under the multiple TAS, i.e., setting multiple transmit antennas to be
active, has not yet been addressed in the literature. In fact under multiple TAS, the
growth in the number of transmit antennas is beneficial to both the legitimate receiver
and the eavesdropper, and therefore, its effect on the overall secrecy performance is not
clear. This paper intends to study the impact of multiple TAS in massive MIMOME
settings. Contributions and Organization We study the secrecy performance of a
MIMOME channel in which the BS employs a computationally simple TAS algorithm to
select a fixed number of transmit antennas. For this setting, the distribution of the
instantaneous secrecy rate in the large-system limit, i.e., when the number of transmit
antennas grows large, is accurately approximated. This approximation is then utilized to
investigate the secrecy performance in two different scenarios: Scenario (A) in which
the eavesdropper’s CSI is available at transmit side, and Scenario (B) in which the BS
does not know the eavesdropper’s CSI. Our investigations demonstrate that in both
scenarios, there exist cases in which the secrecy performance is optimized when the
number active antennas are less than the total number of transmit antennas. In other
words, the growth in the number of selected antennas in some cases enhances the
secrecy performance up to an optimal value; however, it becomes destructive if the
number of the active antennas surpasses this optimal value. Invoking our large-system
results, we develop a framework to derive analyti
cally this optimal value. The consistency of our approach is then confirmed through
numerical investigations. The remaining parts of this manuscript is structured as
follows: Section II describes the system model. In Section III, we conduct analyses for
large dimensions. The impacts of TAS on the secrecy performance is investigated in
Section IV where we also give some numerical results and discussions. Finally, the
concluding remarks are given in Section VI. The proofs of the main theorems are
moreover provided in the appendices. Notations: Throughout the paper, scalars, vectors
and matrices are denoted by non-bold, bold lower case, and bold upper case letters,
respectively. C represents the complex plain. The Hermitian of H is indicated with HH,
and IN is the N × N identity matrix. The determinant of H and Euclidean norm of x are
shown by |H| and kxk, respectively. ⌊ x⌉ refers to the integer with minimum Euclidean
distance from x. The binary and natural logarithm are denoted by log (·) and ln (·),
respectively, and 1{·} represents the indicator function. E {·} is the mathematical
expectation, and Q(x) and φ(x) denote the standard Q-function and the zero-mean and
unit-variance Gaussian distribution, respectively.
CHAPTER-3
PROBLEM FORMULATION
We consider a Gaussian MIMOME wiretap setting in which the transmitter, the
legitimate receiver and the eavesdropper are equipped with multiple antennas
represented by M, Nr and Ne, respectively. The main channel, from the transmitter to
the legitimate receiver, and the eavesdropper channel, from the transmitter to the
eavesdropper, are assumed to be statistically independent and experience quasi-static
Rayleigh fading. The CSI of the both channels are considered to be available at the
receiving terminals. The transmitter is moreover assumed to know the CSI of the main
channel. In practice, the CSI is obtained at the respective terminals by performing
channel estimation which depends on the duplexing mode of the system. Massive MIMO
settings are usually considered to operate in the time division duplexing mode in which
it is sufficient to estimate the channel only in the uplink training mode due to the
channel reciprocity. More details on channel estimation in massive MIMO settings are
found in [42, Chapter 3]. Based on the availability of the eavesdropper’s CSI at the
transmitter, we consider two different scenarios in this paper: (A) The eavesdropper’s
CSI is available at the transmitter. (B) The transmitter does not know the
eavesdropper’s CSI.
extensive computer simulations that the proposed scheme can provide significant BER
performance improvements over classical MIMO-OFDM for several different
configurations. The following points remain unsolved in this study:
i) performance analysis,
iv) Implementation scenarios for high mobility. ErtugrulBasar et al. “On Multiple-
Input Multiple-Output OFDM with Index Modulation for Next Generation Wireless
Networks”, In this study, the recently proposed MIMO-OFDM-IM scheme has been
investigated for next generation 5G wireless networks. For the MIMO-OFDM-IM
scheme, new detector types such as ML, near-ML, simple MMSE, MMSE-LLR-OSIC
detectors have been proposed and their ABEP have been theoretically examined. It
has been shown via extensive computer simulations that MIMO-OFDM-IM scheme
provides an interesting trade-off between complexity, spectral efficiency and error
performance compared to classical MIMO-OFDM scheme and it can be considered as
a possible candidate for 5G wireless networks. The main features of MIMO-OFDM-IM
can be summarized as follows:
ii) flexible system design with variable number of active OFDM subcarriers and
iii) better compatibility to higher MIMO setups. However, interesting topics such
as diversity methods, generalized OFDM-IM cases, high mobility
implementation and transmit antenna indices selection still remain to be
investigated for the MIMO-OFDM-IM scheme.
BER performance over classical MIMO-OFDM using different type of detectors and
MIMO configurations.
CHAPTER 4
MULTI INPUT-MULTI OUTPUT
The demand of high bit rate has increased in recent wireless communication
networks. Theories by various engineers have proven that the Multiple Input Multiple
Output (MIMO) technology has the ability to improve the problem of traffic capacity in
the wireless networks. MIMO systems can be defined as the use of multiple antennas at
both the transmitting and receiving ends of a wireless communication network. The
systems take advantage of multipath transmission paths. Although various efforts have
been made by engineers to improve the data rate, the capacity is never enough for
users. Users of mobile wireless devices like to be able to use their devices in streaming
live programs, playing more online games and streaming an online movie which
involves a high data rates. Telecommunication companies and Internet Service
Providers (ISPs) as example in Africa find it difficult to provide high data rate Internet
services to their network users, especially mobile users, due to environmental factors.
The only option to most of these companies is to provide Internet with a high data rate
wirelessly. With the limited bandwidth in space, MIMO technology will be of great
benefit to these companies in providing high data rate Internet services to their
customers. Currently cellular systems, such as the third generation (3G) cellular system,
satellite communication systems and video broadcasting systems have experienced a
great increase in capacity in the implementation of MIMO channel technology. Access
point devices such as wireless local area networks (WLAN) routers have also
experienced a great change in transmission techniques, with a few using MIMO
technology. The main goal of this project is to explain and illustrate the operation of
MIMO channel technology.
The multiple input multiple output channel technology is aimed to increase the capacity
in the wireless communication network. With the invention of MIMO, the technology
seems to gain popularity as it is being implemented in the current commercial wireless
products and networks such as broadband wireless access systems, wireless local area
networks (WLAN), 3G networks, etc. Figure 1 shows a line of sight (LOS) antenna setup
of a MIMO system.
The main idea behind MIMO is that, the sampled signals in spatial domain at both the
transmitter and receiver end are combined so that they form effective multiple parallel
spatial data streams which increase the data rate. The occurrence of diversity also
improves the quality that is the bit-error rate (BER) of the communication
In communication systems, input discrete source symbols are mapped into a sequence
of channel symbols which are then transmitted through the wireless channel. The
transmission of channel symbols through the wireless channel is by nature random and
random noise is added to the channel symbols. The measure of how much information
that can be transmitted and received with minimum probability of error is called the
channel capacity. A Single Input Single Output system involves the use of one antenna
both at the transmitter and receiver end. To a telecommunications engineer, there exit a
limit at which reliable transmission of information is not possible for a given
transmission bandwidth and power. These limits where discovered by Claude Shannon
in 1948 when he established the principles of information and communication theory
on his various publications.
Shannon also established the conditions that enable the transmission of information
over a noisy channel at a given rate, for a given power of the signal and noise. These
limiting factors are the finite bandwidth and the S/N of the channel. This is because for a
communication channel to accommodate the signal spectrum, enough transmission
bandwidth is needed otherwise there will be distortion. “The higher data rate is to be
transmitted, the shorter digital pulses must be used and the shorter digital pulses are
used for transmission, the wider bandwidth is required”. For a deterministic channel
with a bandwidth (B) with additive noise, Shannon proved that information with a rate
of r bits per second (bps) can be transmitted with a small error probability provided
that the bit rate is less than the capacity of the channel r <C . The Shannon formulae that
can be applied to determine the maximum capacity C of the channel is of the form C =
Blog[1 +Τ ] [(bits s)/H Τ]
where S/N, the signal-to-noise ratio and B the bandwidth of the transmission channel.
The above Equation informs us of how power and bandwidth are related. Assuming we
have a channel with additive noise N and that we have some freedom of choosing the
average transmission power S, to set up a reliable transmission link to send r bits per
second. From the Shannon theorem, the data rate r cannot exceed capacity C, r < C as in
equation, but we still have one degree of freedom in the choice of bandwidth B and
power S. It can be realized that, for a given signal-to-noise ratio S/N, if we wish to
double C, we have to double the bandwidth B. On the other hand, if we double C, for a
given B we have to evaluate the S/N.
WHAT IS MIMO?
MIMO (multiple input, multiple output) is an antenna technology for wireless
communications in which multiple antennas are used at both the source (transmitter)
and the destination (receiver). The antennas at each end of the communications circuit
are combined to minimize errors and optimize data speed. MIMO is one of several forms
of smart antenna technology, the others being MISO (multiple input, single output)
and SIMO (single input, multiple output). In conventional wireless communications, a
single antenna is used at the source, and another single antenna is used at the
destination. In some cases, this gives rise to problems with multipath effects. When an
electromagnetic field (EM field) is met with obstructions such as hills, canyons,
buildings, and utility wires, the wavefronts are scattered, and thus they take many paths
to reach the destination. The late arrival of scattered portions of the signal causes
problems such as fading, cut-out (cliff effect), and intermittent reception (picket
fencing). In digital communications systems such as wireless Internet, it can cause a
reduction in data speed and an increase in the number of errors. The use of two or more
antennas, along with the transmission of multiple signals (one for each antenna) at the
source and the destination, eliminates the trouble caused by multipath wave
propagation, and can even take advantage of this effect.
supported speeds up to 600 Mbit/s (using four simultaneous data streams) and was
published in late 2009.
The first 4G cellular standard was proposed by NTT DoCoMo in 2004. Long term
evolution (LTE) is based on MIMO-OFDM and continues to be developed by the 3rd
Generation Partnership Project (3GPP). LTE specifies downlink rates up to 300 Mbit/s,
uplink rates up to 75 Mbit/s, and quality of service parameters such as low latency. LTE
Advanced adds support for picocells, femtocells, and multi-carrier channels up to
100 MHz wide. LTE has been embraced by both GSM/UMTS and CDMA operators.
The first LTE services were launched in Oslo and Stockholm by TeliaSonera in
2009. There are currently more than 360 LTE networks in 123 countries operational
with approximately 373 million connections (devices).
FUNCTIONS OF MIMO:
by multipath propagation. When the receiver has multiple antennas, the transmit
beamforming cannot simultaneously maximize the signal level at all of the receive
antennas, and precoding with multiple streams is often beneficial. Note that precoding
requires knowledge of channel state information (CSI) at the transmitter and the
receiver.
Diversity coding techniques are used when there is no channel knowledge at the
transmitter. In diversity methods, a single stream (unlike multiple streams in spatial
multiplexing) is transmitted, but the signal is coded using techniques called space-time
coding. The signal is emitted from each of the transmit antennas with full or near
orthogonal coding. Diversity coding exploits the independent fading in the multiple
antenna links to enhance signal diversity. Because there is no channel knowledge, there
is no beamforming or array gain from diversity coding. Diversity coding can be
combined with spatial multiplexing when some channel knowledge is available at the
transmitter.Electronic beam steering with greater efficiency is a vibrant feature of a
phased array antenna, but for all the range cells, it is fixed at a specific angle. To mitigate
this problem, frequency diverse array (FDA) antenna was proposed. This study presents
a review on the development of FDA technology in radar and navigation applications.
FDA is different from a conventional phased array antenna radar in a sense that it uses a
small frequency offset across the array, which helps to generate a range, angle and time-
dependent beam pattern. This pattern assures the energy transmission towards the
desired angle and range cell. In addition, this study also focuses the research on getting
range-angle uncoupled beam patterns along with diverse hybrid cognitive FDA design,
available in the literature, for improved radar performance. Radar systems provide an
important remote sensing capability, and are crucial to the layered sensing vision; a
concept of operation that aims to apply the right number of the right types of sensors, in
the right places, at the right times for superior battle space situational awareness. The
layered sensing vision poses a range of technical challenges, including radar, that are yet
to be addressed. To address the radar-specific design challenges, the research
community responded with waveform diversity; a relatively new field of study which
aims reduce the cost of remote sensing while improving performance. Early work
suggests that the frequency diverse array radar may be able to perform several remote
sensing missions simultaneously without sacrificing performance. With few techniques
available for modeling and characterizing the frequency diverse array, this research
aims to specify, validate and characterize a waveform diverse signal model that can be
used to model a variety of traditional and contemporary radar configurations, including
frequency diverse array radars. To meet the aim of the research, a generalized radar
array signal model is specified. A representative hardware system is built to generate
the arbitrary radar signals, then the measured and simulated signals are compared to
validate the model. Using the generalized model, expressions for the average transmit
signal power, angular resolution, and the ambiguity function are also derived. The
range, velocity and direction-of-arrival measurement accuracies for a set of signal
configurations are evaluated to determine whether the configuration improves
fundamental measurement accuracy.
Hence, for a MIMO system with NTX and MRX antennas using diversity at
transmitter and receiver end, the capacity of the system can be determined by the
formula means transpose-conjugate of H and H is the M x N channel matrix. IM indicates
Since the coefficient of the unknown in the channel matrix Wc and the number of
transmitted signal X is equal to the number of received signal Y, the equation can be
solved if the channel Wc is inversed which in this case a 2 x 2 matrix inversion.
In order to determine the characteristic of the channel, both the transmitted signal X
and the received signal Y have to be known. If the transmitted and received signals are
of the form. If the channel transfer matrix Wc can be determine, then it means the
transmitted signals can also be determine because the received signal Y is known. We
may write the expression between these vector signals as Y = X Wc. In order to
determine the transmitted signals, the channel transfer matrix, Wc -1 have to be
inverted and then multiplied with the received signal matrix Y. X = Y Wc -1 The channel
transfer matrix that we have to solve with the help of known training signal X and the
received signal Y has the form. The channel transfer matrix is calculated periodically
with the help of the known training signals and remains constant over information
transmission time. It is then recalculated when new information is being transmitted.
The channel characteristics in equation are defined for each signal path at discrete time
instants 1,2,...K. However, we need to derive Wc and this can be derived with the help of
the transmitted signals X and the corresponding known received signals Y measured at
the receiver. Equation expresses the channel matrix Wc which do not need to be a
square matrix. Because, for example if we have a 4x4 MIMO system with 100 samples,
we do not need to have a 100x100 channel matrix. However, 5 samples can be
transmitted from the four (4) antennas at a time. The next section explains the
procedures required in order to estimate the channel transfer matrix.
To model the transfer channel a common space matrix (orthonormal basis matrix Ux) is
first generated and then used to map both the transmitted and received signals that
vary in space (multiple antennas) and in time (samples in time). This common
orthonormal basis matrix is obtained by decomposing either the transmitted signal X or
the received signal Y. Hence, MIMO channel problem can be solved using four step
approach under a condition where there is no noise (N = 0) and if the transmitted
signals are orthogonal. These steps are summarized as follows:
(1) Finding an orthonormal basis Ux of the transmitted signal matrix X using the Gram-
Schmidt procedure.
(2) In the K-dimensional signal vector space spanned by Ux, we express the N column
vectors of the transmitted signal X by the projection onto the orthogonal axes of Ux. Wx
= Ux X.
(3) In the K-dimensional signal vector space spanned by Ux, we express the M column
vectors of the received signal matrix Y by their projection onto the orthogonal axes of
Ux. Wy = Ux Y (4.2.2)
(4) Calculate the inverse or the pseudo inverse of the Fourier coefficients of the
transmitted signal Wx and find an estimate of channel transfer matrix Oc = Wx -1 Wy or
Oc = Wx + Wy.
To be able to estimate the transfer channel matrix Oc, a common space matrix is
required to map both the transmitted signal X and the received signal Y together. The
orthonormal base matrix Ux serves as the common space matrix needed to map the
transmitted signal X to the received signal Y. It is important to know that, the
orthonormal basis needed for the mapping can be derived either using the transmitted
signal X or the received signal Y. Hence, the orthonormal basis Ux of the transmitted
signal X is calculated by taking the matrix Ux obtained from the decomposition of
transmitted signal X. In linear algebra, a matrix such as the transmitted signal X can be
decomposition into the product X= Ux R where Ux is an orthogonal matrix in this case
the orthonormal basis and R an upper triangular matrix. It should be noted that, the
format of the matrix X is K-by-N while the size of the orthonormal base matrix Ux is
always K-by-K. Gram-Schmidt procedure is one way to decompose a column rank
matrix and this procedure will be used in this project. There are also other methods of
decomposing a matrix such as QR-decomposition, LU decomposition, Cholesky
decomposition, etc. See appendix 1 for Gram-Schmidt process. Fourier coefficients of
transmitted signal Wx After determining the orthonormal basis Ux, we have to map the
known transmitted signal X to the orthonormal space matrix Ux and this is done by
calculating the generalized Fourier coefficients of the transmitted signal Wx. The
mapping of the transmitted signal X with respect to the orthonormal basis Ux is
expressed Wx = Ux X. The generalized Fourier coefficients are coefficients of any
orthogonal set of functions over which signals are split up. Therefore the generalized
Fourier coefficients of the transmitted signal Wx tell us how much each column (signal)
of the transmitted signal X contains each orthogonal column component in the
orthonormal base matrix Ux. In this case we are splitting the transmitted signal with the
help of the orthonormal basis Ux. It should be noted that the multiplication of UxUx T = I
where I is a K-by-K identity matrix and size of Wx is K-by-N.
required to estimate the transfer channel. Hence, Microsoft Excel is used to develop an
algorithm for Gram-Schmidt procedure to generate Ux, the Fourier coefficients of both
transmitted and received signals as well as the transfer channel. This algorithm can be
accessed from a compact disk (CD) attached to this project. The next chapter explains
with an example how to determine the orthonormal basis Ux using Gram-Schmidt
procedure by decomposing the transmitted signal X and applying this procedure to two
different scenarios. First the calculation of the orthonormal basis Ux in the case where
the transmitted signal X is a square matrix and in the second case where the transmitted
signals X is not a square matrix.
This section explains how to calculate the orthonormal basis Ux of a 2 x 2 MIMO system
with the help of the transmitted signal X. To demonstrate the steps in subchapter, we
will have a numerical example to explain how to generate the orthonormal basis Ux of a
full rank square matrix using linearly independent transmitted signals in X. The Gram-
Schmidt procedure will be used in the decomposition of the transmitted signal X. See
appendix 1 for Gram-Schmidt procedure. The equation to decomposed in our
calculation is of the form X = Ux R; R = Ux -1 X. In equation the transmitted signal X is
divided into two components, Ux the orthonormal basis and R the upper triangular
matrixes. The upper triangular matrix R is calculated by first finding the inverse of the
orthonormal basis matrix Ux and multiplying it with the transmitted signal X. However,
the upper triangular matrix R will is not needed in our analysis. The next very simple
example explains how Gram Schmidt procedure can be applied to generate orthonormal
base Ux of the transmitted signal X.
The transmitted known training signals are used in modelling the transfer channel Oc as
shown in examples. Therefore it is important to estimate the channel output if the
transmitted signals are transmitted. The next example derives the received signal U in
two different scenarios. In both scenarios, the transmitted signals are the same but
different transfer channels. This will help us estimate the received signals produced by
the different transfer channels.
To further understand the operational principles of MIMO channel, we extend the same
principles listed in subchapter 4.2 to a case of a 3 x 3 MIMO system where there are
three antennas at both transmit and receive ends. Assuming three column transmitted
signals and three column received signals each are observe over K uniformly spaced
discrete time instances The channel can be estimated by first calculating the common
signal space matrix (orthonormal base matrix). In the next example, the orthonormal
base of the transmitted signal X is calculated using Gram-Schmidt procedure
Based on the Gram Schmidt process, the orthonormal basis Ux matrix is an orthogonal
matrix. The column signals of the orthonormal base Ux in equation are orthogonal and
the inner product of any pair of the column vectors result zero. The column vectors are
orthonormal and the norm of every column vector signal result value 1. To prove that
the column signals of the orthonormal base Ux are orthogonal, the inner product of
theses column signals.
The results obtained from the inner product calculations prove that the column signals
of the orthonormal base Ux are really orthogonal. It should be noted that the results
obtained in example (5.3.2) are not exactly zero due to the rounding of values in
calculating the orthonormal basis matrix
The secrecy performances in Scenarios A and B are quantified via different metrics. In
Scenario A, since the BS knows the eavesdropper’s CSI, it transmits with rate Rs (S) in
each coherence time; thus, the secrecy performance is measured by the achievable
ergodic secrecy rate. When the eavesdropper’s CSI is not available at the BS, the
transmitter assumes the secrecy rate to be Ro. In this case, the secure transmission is
guaranteed as long as Rm − Re > Ro. Consequently, in Scenario B, the secrecy
performance is properly quantified by the secrecy outage capacity; see [44] for further
discussions. Based on above discussions, the performance of the setting in both
Scenarios A and B is described by statistics of Rs(S). We hence derive an accurate large-
system approximation for the distribution of Rs(S) in Theorem 1. Here by the
largesystem limit we mean M ↑ ∞. To state Theorem 1, we define the “asymmetrically
asymptotic regime of eavesdropping”. Definition 1 (asymmetrically asymptotic regime
of eavesdropping): The eavesdropper is said to overhear in the asymmetrically
asymptotic regime of eavesdropping when the number of eavesdropper’s antennas per
active antenna, defined as βe := Ne/L, reads either βe ≪ 1 or βe ≫ 1. In Definition 1, βe
≪ 1 describes scenarios in which the eavesdropper is a regular mobile terminal with
finite number of antennas. Moreover, βe ≫ 1 represents MIMOME settings with
sophisticated eavesdropping terminals such as portable stations in cellular networks. In
the sequel, we assume that the understudy setting operates in the asymmetrically
asymptotic regime of eavesdropping. However, our numerical investigations later
depict that the results are valid even when the system does not operate in this regime of
eavesdropping.
antenna arrays at the relay has been proposed to address this issue due to their ability
to suppress interference, provide large array and spatialmultiplexing gains, and in turn
to yield large improvements in spectral and energy efficiency. There has recently been
considerable research interest in multipair massive MIMO relaying systems. For
example, derived the ergodic rate of the system when maximum
ratiocombining/maximum ratio transmission (MRC/MRT) beamformingis employed
and showed that the energy efficiency gain scales with the number of relay antennas in
Rayleigh fading channels.
Then, extended the analysis to the Riceanfading case and obtained similar power scaling
behaviour. For full-duplex systems, analytically compared the performance of
MRC/MRT and zero-forcing reception/transmission and characterized the impact of the
number of user pairs on the spectral efficiency.All the aforementioned works are based
on the assumptionof perfect hardware. However, a large number of antennas at the
relay implies a very large deployment cost and significant energy consumption if a
separate RF chain is implemented for each antenna in order to maintain full beam
forming flexibility. In particular, the fabrication cost, chip area and power consumption
of the analog-to-digital converters (ADCs) and the digital-to-analog converters (DACs)
grow roughly exponentially with the number of quantization bits. Thecumulative cost
and power required to implement a relay witha very large array can be prohibitive, and
thus it is desirable to investigate the use of cheaper and more energy-efficient
components, such as low-resolution (e.g., one bit) ADCs and DACs. Fortunately, it has
been shown in that large arrays exhibit a certain resilience to RF hardware
impairmentsthat could be caused by such low-cost components.
tasks have been completed, and the user has been assigned a pilot sequence. Massive
MIMO automatically provides great gains in radiated energy efficiency. To achieve total
energy efficiency there has to be a commensurate reduction in internal power
consumption, for which there has been little incentive in the past. Massive MIMO relies
on favourable propagationV vector-valued channels to different users grow
asymptotically orthogonal with the increasing numbers of antennas. Experiments so far
support this hypothesis but many more experiments are required. Although there is a
great deal of theoretical and simulation evidence for the vast superiority of Massive
MIMO over 4G technology, public demonstrations of Massive MIMO on a sufficiently
large scale will be required to convince many people of its potential.
CHAPTER 5
EXISTING SYSTEM
EXPECTED RESULTS
SYSTEM MODEL:
A. Secure Spatial Modulation Consider a typical secure SM system as shown in Fig. 1. In
the system, there are a transmitter (Alice) equipped with N transmit antennas, a
desired user (Bob) with Nb receive antennas, and an eavesdropper (Eve) with Ne
receive antennas, respectively. Without loss of generality, it is assumed that N is not
a power of two, thus we have to select Nt = 2 ⌊ logN 2 ⌋ ,Nt> Nb, out of N transmit
antennas for mapping the bits to the antenna index. Notice that there are total Q = (
NNt ) patterns, represented as {Ω1, · · · , ΩQ}, where Ωk denotes the antennas set of
the kth pattern. After Alice chooses one pattern from pattern set and shares it with
Bob through a low speed forward link, she activates one of Nt transmit antennas to
emit M-ary APM symbol and uses the index of activated antenna to convey spatial
bits. As a result, the SE is log2MNt bits per channel use (bpcu). Referring to the
secure SM system model in [10], the transmit baseband signal with the aid of AN can
be expressed as x = β1 √ PSensm + β2 √ PSPAN n (1) where en is the nth column of
INt for n ∈ {1, 2, · · · ,Nt}, and sm denotes the input symbol equiprobably drawn from
discrete M-ary APM constellation for m∈ {1, 2, · · · , M}. We normalize the input
symbol power to unit, i.e., E|sm| 2 = 1. In (1), matrix PAN ∈ C Nt×Nt is the AN
projection matrix, n ∼ CN (0, INt ) is the random AN vector, PS is the total transmit
power, β1, and β2 are the power allocation factors with β 2 1 + β 2 2 = 1. Here, it is
particularly noted that all selected Nt transmit antennas are used to emit AN but
only one of them transmits APM symbol. Therefore, such secure SM system
alleviates the problems of ICI and IAS compared to conventional secure MIMO
systems.
CHAPTER-6: CONCLUSION
In this paper, we have made an extensive investigation of TAS methods in
secure SM systems. Then, two high performance TAS schemes: leakage-
based and Max-SR, have been proposed to improve the SR performance,
and the EDAS method has been generalized to provide a secure
transmission. From simulation results and complexity analysis, the
proposed Max-SR is the optimal TAS scheme among the three TAS methods
in terms of SR performance while the proposed leakage-based method
achieves a SR performance near to the proposed Max-SR method with far
lower complexity. By means of BER performance, the generalized EDAS
method substantially outperforms the remaining two methods due to its
main goal to maximize minimum Euclidean distance, which makes a direct
improvement on BER performance.
REFERENCES
[1] R. Y. Mesleh, H. Haas, and S. Sinanovic, “Spatial modulation,” IEEE Trans. Veh.
Technol., vol. 57, no. 4, pp. 2228–2241, 2008.
[2] J. Jeganathan, A. Ghrayeb, and L. Szczecinski, “Spatial modulation: optimal detection
and performance analysis,” IEEE Commun. Lett., vol. 12, no. 8, pp. 545–547, 2008.
[3] A. D. Wyner, “The wire-tap channel,” Bell System Tech. J., vol. 54, no. 8, pp. 1355–
1387, 1975.
[4] J. Hu, F. Shu, and J. Li, “Robust synthesis method for secure direc- tional modulation
with imperfect direction angle,” IEEE Commun. Lett., vol. 20, no. 6, pp. 1084–1087,
2016
[5] R. Y. Mesleh, H. Haas, and S. Sinanovic, “Spatial modulation,” IEEE Trans. Veh.
Technol., vol. 57, no. 4, pp. 2228–2241, 2008.
[6] J. Jeganathan, A. Ghrayeb, and L. Szczecinski, “Spatial modulation: optimal detection
and performance analysis,” IEEE Commun. Lett., vol. 12, no. 8, pp. 545–547, 2008.
[7] A. D. Wyner, “The wire-tap channel,” Bell System Tech. J., vol. 54, no. 8, pp. 1355–
1387, 1975.
[8] J. Hu, F. Shu, and J. Li, “Robust synthesis method for secure direc- tional modulation
with imperfect direction angle,” IEEE Commun. Lett., vol. 20, no. 6, pp. 1084–1087,
2016.
[9] X. Guan, Y. Cai, and W. Yang, “On the secrecy mutual information of spatial
modulation with finite alphabet,” International Conference on Wireless
Communications and Signal Processing, pp. 1–4, 2013.
[10] L. Wang, S. Bashar, Y. Wei, and R. Li, “Secrecy enhancement analysis against unknown
eavesdropping in spatial modulation,” IEEE Commun. Lett., vol. 19, no. 8, pp. 1351–
1354, 2015.
[11] F. Wu, L. L. Yang, W. Wang, and Z. Kong, “Secret precoding-aided spatial modulation,”
IEEE Commun. Lett., vol. 19, no. Science, pp. 1544–1547, 2015.
[12] F. Wu, R. Zhang, L. L. Yang, and W. Wang, “Transmitter precoding- aided spatial
modulation for secrecy communications,” IEEE Trans. Veh. Technol., vol. 65, no. 1,
pp. 467–471, 2016.
[13] S. R. Aghdam and T. M. Duman, “Physical layer security for space shift keying
transmission with precoding,” IEEE Wireless Commun. Lett., vol. 5, no. 2, pp. 180–
183, 2016.
[14] C. Liu, L. L. Yang, and W. Wang, “Secure spatial modulation with a full-duplex
receiver,” IEEE Wireless Commun. Lett., vol. PP, no. 99, pp. 1–1, 2017.
[15] R. Rajashekar, K. V. S. Hari, and L. Hanzo, “Antenna selection in spatial modulation
systems,” IEEE Commun. Lett., vol. 17, no. 3, pp. 521–524, 2013.
[16] K. Ntontin, M. D. Renzo, A. I. Perez-Neira, and C. Verikoukis, “A low- complexity
method for antenna selection in spatial modulation systems,” IEEE Commun. Lett.,
vol. 17, no. 12, pp. 2312–2315, 2013.
[17] J. Zheng and J. Chen, “Further complexity reduction for antenna selection in
spatial modulation systems,” IEEE Commun. Lett., vol. 19, no. 6, pp. 937–
940, 2015.
[18] Z. Sun, Y. Xiao, P. Yang, S. Li, and W. Xiang, “Transmit antenna selection