IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 60, NO.
1, JANUARY 2012
Signal Detection in Antenna-Hopping Space-Division
Multiple-Access Systems With Space-Shift Keying
Modulation
Lie-Liang Yang, Senior Member, IEEE
Abstract—To take the advantages of the M
-ary space-shift
keying (MSSK) modulation invented recently, a MSSK
fast antenna-hopping space-division multiple-access (MSSK
FAH-SDMA) scheme is proposed and studied in this paper. In
addition to supporting multiple-access, the FAH is introduced
also to achieve transmit diversity by sending every MSSK symbol
over several time-slots under the control of a FAH pattern (ad-
dress). Associated with the MSSK FAH-SDMA, a range of linear
and nonlinear detection schemes are studied. Specifically, the
linear detection schemes considered include the matched-filtering
single-user detector (MF-SUD), zero-forcing multiuser detector
(ZF-MUD) and minimum mean-square error (MMSE)-MUD,
while the nonlinear detection schemes addressed include the
maximum likelihood (ML)-MUD and the receiver multiuser
diversity aided multi-stage MMSE (RMD/MS-MMSE) MUD. The
single-user pairwise error probability (SU-PEP) and bit error
rate (BER) union-bound of the single-user MSSK FAH-SDMA
systems employing ML detection are analyzed in detail. Based on
the SU-PEP, the minimum transmit diversity order of the MSSK
FAH-SDMA systems is specified. For the MSSK FAH-SDMA
systems with linear detection, we study two types of MSSK
demodulation schemes, which are referred to as the intrauser de-
tections (IUDs), named as the maximum likelihood (ML)-IUD and
direct (D)-IUD. For the MSSK FAH-SDMA systems employing
the RMD/MS-MMSE MUD, two types of reliability measurement
(RM) schemes are proposed, which are the maximum a-posteriori
(MAP)-RM and ratio test (RT)-RM. Finally, the BER performance
of the MSSK FAH-SDMA systems with various combinations of
the proposed techniques is studied, when assuming that the
channels from any transmit antennas to any receive antennas ex-
perience independent and identically distributed (i.i.d.) Rayleigh
fading.
Index Terms— -ary space-shift keying (MSSK), fast antenna
hopping, multiuser detection, optimum detection, SDMA, single-
user detection, spatial diversity, spatial modulation (SM), subop-
timum detection, transmit diversity.
I. INTRODUCTION
ECENTLY, space-based modulations have been pro-
R posed for alternative signal transmission in multiantenna
multiple-input multiple-output (MIMO) wireless systems
[1]–[23]. The studies show that space-based modulations em-
ploy some advantages over the conventional MIMO schemes,
Manuscript received March 24, 2011; revised August 05, 2011; accepted
September 30, 2011. Date of publication October 17, 2011; date of current
version December 16, 2011. The associate editor coordinating the review of
this manuscript and approving it for publication was Prof. David Love.
The author is with the School of Electronics and Computer Science, Univer-
sity of Southampton, SO17 1BJ, U.K. (e-mail: lly@ecs.soton.ac.uk).
Digital Object Identifier 10.1109/TSP.2011.2171955
1053-587X/$26.00 © 2011 IEEE
351
such as BLAST, space-time block coding (STBC), etc. [24],
[25]. As argued in [3]–[7], [10], due to activating only one
antenna for transmission of a symbol, spaced-based modula-
tions are capable of avoiding the interchannel interference and
reducing the complexity of detection. Furthermore, owing to
using single transmit antenna at any time, space-based modula-
tions do not require strict interantenna synchronization as done
in the BLAST and STBC systems.
The basic principle of space-based modulations is that in-
formation is conveyed from a transmitter to its corresponding
receiver with the aid of the degrees of freedom in space do-
main, such as the indexes of transmit antennas. According to
the configurations of transmitted signals, space-based modu-
lations have been termed in different ways reflected by their
different names. The first class of space-based modulations use
solely the indexes of transmit antennas to carry information,
which are usually referred to as the space shift keying (SSK)
modulation [1], [6]–[9], [26]. Specifically, in [1], the SSK
modulation using two transmit antennas to send binary bits has
been considered, where one antenna is activated to transmit
“0” and both antennas are activated to transmit “1.” Assuming
transmit antennas, the SSK scheme considered in [6]–[9]
is an -ary SSK (MSSK) modulation, where information is
carried by the index of one out of the transmit antennas.
Straightforwardly, the indexes of a subset of transmit antennas
may also be used to convey information, which is referred to
as the generalized SSK (GSSK) modulation [26]. The second
class of space-based modulations transmit information jointly
by a conventional amplitude-phase modulation (APM), such
as phase-shift keying (PSK), quadrature amplitude modulation
(QAM), etc., and the indexes of transmit antennas [2], [4], [5].
This class of schemes are broadly called the spatial modulation
(SM). Explicitly, the SSK modulation can be viewed a special
case of the more general SM scheme. Furthermore, in [10], a
so-called space-time shift keying (STSK) modulation has been
proposed, which makes use of the degrees of freedom in both
the space and time domains as well as the conventional APM
constellations. Additionally, in [20], a transmitter preprocessing
aided SM (PSM) scheme has been proposed, which conveys
information jointly by a conventional APM and a preprocessing
aided space shift keying (pre-SSK) modulation.
The SM systems have been investigated from different
perspectives, including transmitter/detector design, capacity
and spectral-efficiency, error performance analysis, etc., as
illustrated, e.g., in [1]–[23]. Detailed reviews in terms of the
history, studies and advancement of the SMs can be found in
352
[8], [9], [13], [14], etc., where the reader who is interested in
the details is referred to. From the references available, it can be
known that the researches in the context of the SMs have so far
been carried out mainly for single-user communications. The
two-user case has been considered in [23], where each user has
two transmit antennas and the base-station (BS) has one receive
antenna, and both the single-user and multiuser maximum like-
lihood (ML) detection are considered. In the above-mentioned
SM systems, typically, ML detection or its modified versions
have been employed for detection. Alternatively, matched-fil-
tering (MF) based detection may be applied, which usually
carries out two stages of detection, if both SSK modulation
and APM are employed [4], [11]. In the MF-based detection,
the SSK demodulation is implemented by first correlating the
received signal with all the possible spatial signatures, yielding
the decision variables, which may be the amplitudes or the real
parts of the MF’s outputs. Then, the maximum of the decision
variables is selected and its index is taken as the estimate of
the symbol transmitted by the SSK modulation. However, as
shown in Section III of this paper, the MF-based detection is
not optimum, even when the single-user case is considered.
Additionally, in the SMs, since transmit antennas are used as
the signal spaces for information extraction at the receiver, the
conventional SM schemes [2]–[9] usually do not yield transmit
diversity. For this sake, design of the SM schemes that are ca-
pable of achieving transmit diversity has drawn intensive in-
terest very recently, as seen, for example, in [13]–[20]. Specif-
ically, transmit diversity may be added to the SMs with the aid
of space-time coding (STC) [14], [16], [17], linear dispersion
coding [10], time-orthogonal-signal-design [13], [19] and its ex-
tension [16], open-loop space-time SSK (ST-SSK) as well as its
closed-loop enhanced versions [18], transmitter preprocessing
[20], etc.
Motivated by the above considerations, in this paper, we pro-
pose a MSSK FAH-SDMA system and the corresponding sig-
naling and detection schemes, in order to extend the SM princi-
ples to the multiuser scenarios and to achieve transmit diversity.
To be more specific, the novel contributions and main results of
this paper can be summarized as follows.
• A MSSK FAH-SDMA system is proposed and studied.
This system employs the MSSK modulation as that con-
sidered in [6]–[9]. Hence, information is only conveyed by
the indexes of transmit antennas, although the extension
to the more general SMs is straightforward. In our MSSK
FAH-SDMA system, FAH is introduced not only for sup-
porting multiple-access communications in the principles
of SDMA, but also for achieving transmit diversity. Both
multiple-access and transmit diversity are achieved by
transmitting each MSSK symbol over several time-slots
under the control of FAH patterns.
• A class of FAH patterns, which are conventionally sug-
gested for fast frequency-hopping (FFH) systems and, in
this case, are optimum [27], are adopted to support mul-
tiple-access and to achieve transmit diversity. Our studies
show that this class of FAH patterns guarantee the transmit
diversity order of at least or depending on being
even or odd, when given that every MSSK symbol is trans-
mitted over time-slots.
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 60, NO. 1, JANUARY 2012
• A range of well-known single-user detection (SUD) and
multiuser detection (MUD) schemes are extended for de-
tection of the MSSK FAH-SDMA signals. In detail, the
SUD scheme considered is the MF-SUD, while the MUD
schemes include the optimum maximum likelihood MUD
(ML-MUD), zero-forcing MUD (ZF-MUD) and minimum
mean-square error MUD (MMSE-MUD).
• The single-user pairwise error probability (SU-PEP) and
single-user bit error rate (BER) union-bound of the MSSK
FAH-SDMA systems employing ML detection are derived.
Based on the SU-PEP, the diversity order achievable by
a MSSK FAH-SDMA system employing transmit an-
tennas, receive antennas and transmitting every MSSK
symbol over time-slots is specified.
• As mentioned previously, in the existing SMs, ML detec-
tion has typically been employed, which has high com-
plexity when the signal space’s size is large. When con-
sidering the multiuser scenarios as in this paper, we refer
to the above (ML) detection aiming at MSSK demodula-
tion as the intrauser detection (IUD), in order to distinguish
it from the MUD, which usually motivates to suppress
the multiuser interference (MUI). In this paper, two IUD
schemes are investigated. The first one is the maximum
likelihood IUD (ML-IUD), which demodulates the MSSK
signals using the ML detection based on the signals pro-
vided by the MF-SUD, ZF-MUD, or MMSE-MUD, that is
carried out before the MSSK demodulation. By contrast,
the second IUD is the direct IUD (D-IUD), where the trans-
mitted information is directly extracted from the signals
provided by the MF-SUD, ZF-MUD, or MMSE-MUD,
without any further processing. Explicitly, the D-IUD has
lower complexity than the ML-IUD, but at some tradeoff
of BER performance, as shown in Section VII.
• In addition to extending the well-known conventional
SUD and MUD schemes to the MSSK FAH-SDMA
systems, a novel low-complexity MUD scheme, namely
the receiver multiuser diversity aided multistage MMSE
MUD (RMD/MS-MMSE MUD) [28], [37], is proposed
for detecting the MSSK FAH-SDMA signals. The
RMD/MS-MMSE MUD is operated in the principles of
MMSE associated with successive interference cancella-
tion (SIC), where signals are detected one-by-one from
the most reliable to the least reliable. In this paper, two
reliability measurement (RM) methods are proposed.
The first one measures the reliabilities in the maximum
a-posteriori (MAP) principles, which is hence referred to
as the MAP-RM. The second one is called the ratio test
(RT)-RM, which determines the reliability of a MSSK
demodulation based on the ratio between the second
maximum and the maximum of the decision variables
generated at the receiver. The MAP-RM may yield
slightly better BER performance than the RT-RM, but
it has much higher complexity than the RT-RM. Our
studies and performance results in Section VII show that
the RMD/MS-MMSE MUD is one of the high-efficiency
MUD schemes for the MSSK FAH-SDMA systems.
It has low-complexity, is capable of achieving the
near single-user BER performance, when the system is
YANG: SIGNAL DETECTION IN ANTENNA-HOPPING SPACE-DIVISION MULTIPLE-ACCESS SYSTEMS 353

full-load, and still achieves promising BER performance, time-slots. The symbol is transmitted with the aid of the
even when the system is overload. following operations. First, is signatured by the th MT’s
• Performance of the MSSK FAH-SDMA systems em- FAH pattern according to the
ploying the various signaling and detection schemes as operation
proposed is investigated, when assuming that the chan-
nels from any transmit antennas to any receive antennas (2)
experience independent and identically distributed (i.i.d.)
where is an -length all-one column vector and + should be
Rayleigh fading. A wide range of results are provided for
read as the addition in the Galois field of [27]. Hence,
characterizing and comparing the achievable bit error rate
the elements of take integer values in .
(BER) performance of the MSSK FAH-SDMA systems
Then, according to the principles of MSSK [3], [4], [6], is
associated with different signaling and detection schemes.
conveyed to the BS using time-slots by activating one transmit
The reminder of the paper are structured as follows.
antenna during each time-slot according to the value of the cor-
Section II addresses the transmitter and receiver models of
responding element of . Specifically, for the th element ,
the MSSK FAH-SDMA systems. Section III considers the
the th transmit antenna of MT is activated, which transmits
optimum MUD, while, in Section IV, the linear MUDs as
a baseband signal using units of power. Therefore,
well as the corresponding IUDs are derived. Section V studies
considering that there are MTs, the received discrete-time
the RMD/MS-MMSE MUD as well as the RM rules. The
signal at BS can be written as
SU-PEP as well as the single-user BER union-bound are de-
rived in Section VI. Section VII demonstrates the results of
error performance and corresponding discussion. Finally, in (3)
Section VIII, a summary of conclusions is provided.
where is the th column of and is an -length
II. MSSK FAH-SDMA SYSTEM MODEL complex Gaussian noise vector, which is distributed with zero
The MSSK FAH-SDMA system concerned consists of one mean and a covariance matrix , where is an
BS supporting number of uplink users of mobile terminals identity matrix, with representing the
(MTs). The BS is assumed to have receive antennas, while received average SNR per symbol and denoting the received
each of the MTs employs transmit antennas. The channels average SNR per bit.
from the transmit antennas at the MTs to the receive antennas at Explicitly, (3) is not a form facilitating to derive the MUD
the BS are assumed to experience independent Rayleigh fading. algorithms, due to the on-off characteristics of the MSSK mod-
The MSSK FAH-SDMA signals are assumed to be transmitted ulation and the FAH operation. In order to derive conveniently
synchronously from the MTs to the BS. Furthermore, power- the various MUD algorithms, especially the linear MUDs, it is
control is assumed, yielding that the total average power re- desirable that the observation vectors
ceived from any of the MTs is constant and normalized to one are linearly dependent on the transmitted symbols of MTs.
unit, regardless of the number of transmit antennas, the number Below we provide the alternative forms of (3), which are suit-
of receive antennas and the number of time-slots per symbol du- able for achieving this objective.
ration, as detailed below in Sections II-A and II-B.
B. Representation of Discrete-Time MSSK FAH-SDMA Signals
A. Discrete-Time Transmitter/Receiver Models Linear representation of SM signals in the single-user case
Based on the above assumptions, it can be shown that the has been provided in [10], [15], [21]. Here we derive the linear
channel matrix from MT to the BS can be representation of the MSSK FAH-SDMA signals, which invoke
expressed as FAH to support multiple users. Note that, the representation de-
rived below shares some similarity as that shown in [29, pp.
406–411] for time-hopping multicarrier or FFH systems.
Let us define an -ary signal sets,
where is simply the th column of the identity matrix . Let

(4)
..
.
which is an one-to-one mapping with when .
Furthermore, let us define the
(1)
th MT’s number of FAH matrices of dimensional.
The FAH matrices have elements of ’0’ and ’1’, and are struc-
where are independent complex Gaussian random
tured as follows [29]1:
variables with zero mean and , the factor • Each column of , has one and only
of is due to the above-stated assumption that the total one element of ’1’; all the other elements are zero
average signal power received from a MT is one unit. elements;
Let , , be the -ary 1An example for showing the structure of this type of matrices can be found
symbol of bits to be transmitted by MT using on [29, p. 409].
354 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 60, NO. 1, JANUARY 2012

• For the th column of , where , the dispersion matrices used in SM or general MIMO systems
the position of the element ’1’ is located at . may be designed based on the classic theory for design of FH
It can be shown that has the property of patterns.
. With the aid of the above definitions, we
can show that in (3) can alternatively be represented as C. Design Consideration of Antenna Hopping Patterns
From the principles of MSSK modulation shown in
(5) Section II-A as well as in [3], [4], [6], the conventional MSSK
scheme is unable to attain transmit diversity, when without
The representation of (5) can be justified by the fact that invoking further processing in the space-, time-, frequency-do-
returns an -length column vector having one main, etc. Specifically, for the MSSK scheme considered in this
nonzero element ’1’ at the location , if the th paper, transmit diversity becomes available, when each MSSK
MT’s transmitted symbol is . Hence, right-multiplying symbol is transmitted using multiple time-slots by activating
on selects the th column of , i.e., . different transmit antennas. Hence, when designing the FAH
Therefore, (5) is the same as(3). patterns, our first objective is to maximize the achievable
Let us define transmit diversity through activating as many different transmit
antennas as possible to transmit every MSSK symbol. Second,
when the MSSK FAH-SDMA system serves multiple MTs, the
FAH patterns of the MTs need to be designed to minimize the
MUI, in addition to attaining the transmit diversity as high as
(6) possible. For minimizing the MUI, the FAH patterns can be
designed such that the cross-correlation between any two of the
where and are -length vectors, while is an spatial signatures, which are reflected by the columns of in
matrix. Then, it can be shown that we can represent the (9), is as low as possible. Furthermore, it is well-known [31]
observations over time-slots as that, when linear MUDs are invoked for detection, the capa-
bility of interference suppression enhances, when the rank of
increases. In this case, the FAH patterns may be designed to
(7) maximize the rank of . However, when SDMA is considered
and, as assumed in this contribution, when the channels from
any transmit antennas at the MTs to any of receive antennas at
where denotes the Kronecker product operation [30], the BS are independent, the cross-correlation existing among
is an block-diagonal matrix and the spatial signatures as well as the rank of are determined
is an matrix, which takes into by the time-varying spatial channels, which are beyond the
account of both the MIMO channels and the FAH operations in control of the FAH patterns.
terms of the th MT. Furthermore, let us define By contrast, in the case that the spatial channels of one MT
or of several MTs become correlated, or that one MT transmits
(8) simultaneously multiple symbols with the aid of a set of FAH
patterns, then the FAH patterns may be appropriately designed
Then, a more compact form for (7) is given by for improving the system performance by minimizing the cross-
correlation or maximizing the rank of , as aforementioned. In
(9) this contribution, the family of optimum FFH patterns [27] are
introduced for the FAH patterns. As our forthcoming discourses
which obeys the complex Gaussian distribution with a PDF [30] show, this class of FAH patterns can guarantee that the antennas
activated to transmit one symbol of a MT are different, hence,
yielding the maximal transmit diversity.
(10)
According to [27], a family of FAH patterns can be generated
as follows. Let be an element of assigned to MT
for given and . and be a fixed primitive element of . Then, number
Equations (7) and (9) share the same forms as those widely of FAH patterns can be generated by [27]
used for the conventional code-division multiple-access
(CDMA) and other MIMO systems [29], [31], [32]. Hence, (11)
there are a lot of detection algorithms designed for the con-
ventional CDMA and other MIMO systems, which may be Since there are number of elements in , based on
modified for the detection of MSSK FAH-SDMA signals, (11), we can know that the maximum number of FAH patterns
as shown in Sections III–V. Note furthermore that the FAH is . However, the element 0 of generates an all-
patterns considered in this contribution may be viewed as a zero FAH pattern, which makes the MSSK FAH-SDMA system
special class of dispersion matrices [10], [15], which have the achieve no transmit diversity. Hence, this FAH pattern will not
elements of ’1’s’ and ’0’s’. This observation also implies that be used.
YANG: SIGNAL DETECTION IN ANTENNA-HOPPING SPACE-DIVISION MULTIPLE-ACCESS SYSTEMS 355

1) Observation 1: When applied in association with the if was transmitted. In (15), since different test vectors of
MSSK FAH-SDMA systems, the family of FAH patterns have different length, we can be implied that the MF-based
defined by (11) have the properties: two-stage demodulation considered in [4] is not optimum. This
1) For the MSSK FAH-SDMA system with transmit an- observation is also reflected by the performance results shown
tennas, receive antennas and supporting one MT, if the in Section VII.
MT transmits in parallel symbols per symbol duration, From (13) and(14), we can realize that the complexity of both
then, the rank of is with proba- the MAP-MUD and ML-MUD is , which becomes ex-
bility one; treme, when the value of is relatively high. Below we con-
2) For the MSSK FAH-SDMA system supporting MTs sider the alternative detectors, which have much lower com-
with each MT transmitting one symbol per symbol dura- plexity than the optimum MAP-MUD and ML-MUD.
tion, the rank of is with probability
one. IV. LINEAR DETECTION
Proof: See Appendix A. In the linear detectors considered below, the detection con-
Note that, our FAH patterns in this contribution are designed sists of two stages: the first-stage attempts to suppress the MUI,
under the assumption of . In practice, however, it is while the second-stage carries out the MSSK demodulation with
possible for the MSSK FAH-SDMA systems to use , respect to each individual MT, which is referred to as the IUD.
for example, in order to support MTs. In this case, we
The linear detectors are operated during the above-mentioned
can design number of FAH patterns by exchanging and
first detection stage. For the second-stage of IUD, the detection
in (11), yielding
is nonlinear, as will be detailed in Section IV-D.
(12) Given the observation shown in (7) or (9), the decision vari-
ables produced by a (first-stage) linear detector can in general
where is an element of assigned to MT and be written as
is a fixed primitive element of . Since has
elements, we can obtain FAH patterns based on (12), (16)
after excluding the one generated by element 0.
The difference between the FAH patterns obtained based on where , which is an -length
(11) and that based on (12) is that, when and the FAH column vector, is an
patterns are designed based on (11), a MT activates transmit weight matrix determined by the specific linear detection
antennas for sending a symbol during time-slots. Hence, there scheme employed. In , , is responsible
are out of the transmit antennas not activated for for generating the -length decision variable vector , which
transmission of a symbol. By contrast, when and the is used for the (second-stage) IUD of the th MT’s symbol.
FAH patterns are designed based on (12), each MT activates In this paper, we approximate as the
transmit antennas for sending a symbol during time-slots. Gaussian distributed random vector with its mean vector and
Therefore, during one symbol duration, there are time- covariance matrix expressed as and , respec-
slots that a MT stays idle without sending any signals. tively. Note that, this Gaussian distribution will be required
for deriving the ML-IUD in Section IV-D-II and the MAP-RM
III. OPTIMUM MULTIUSER DETECTION (MUD) in Section V-A. We note furthermore that the validness of
The optimum MUD for the MSSK FAH-SDMA can be de- the Gaussian approximation for the linear detectors in the
rived based on (10). First, for the MAP-MUD, the estimates conventional code-division multiple-access (CDMA) systems
to the symbols transmitted by the MTs can be obtained by employing binary spreading sequences has been demonstrated
solving the optimization problem [29], [31] in a number of references, such as in [31], [33]. For the MSSK
FAH-SDMA systems, we may argue that the Gaussian property
(13) should be more declared for the decision variables, as the spa-
tial signatures generating MUI are Gaussian random vectors.
where denotes the a-priori probability of . If we as- In fact, the Gaussian approximation is also verified by our
sume that is the same for any candidate of , then the performance results shown in Section VII, since the ML-IUD
MAP-MUD is reduced to the ML-MUD, which finds the solu- and MAP-RM designed based on the approximate Gaussian
tions by solving the optimization problem [29], [31] distribution are highly effective.

A. Matched-Filtering Single-User Detection (MF-SUD)

When the MF-SUD is considered, the receiver detects the th
(14) MT’s transmitted signal by treating the signals received from the
other MTs as Gaussian noise. When the receiver employs both
Note that, when the case of single-user and is consid- the channel knowledge and the FAH pattern of the th
ered, then, the ML detection problem can be described as MT, then, based on (7), the decision variable vector can be
formed as
(15) (17)
356 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 60, NO. 1, JANUARY 2012

implying that , when comparing (17) with (16) and C. Minimum Mean-Square Error Multiuser Detection
considering specifically the th MT. (MMSE-MUD)
Upon applying and (7) into the above
equation, we obtain When the MMSE-MUD is considered, the weight matrix
(or ) is chosen such that the mean-square error (MSE) be-
(18) tween the transmitted vector (or ) and its estimate (or )
is minimized. Specifically, based on (9) and following the prin-
ciples of MMSE-MUD [29], [31], we can obtain the optimum
where includes both MUI and Gaussian noise, which is
solution in MMSE sense as
expressed as
(23)

where is the autocorrelation matrix of and is the cross-

(19)
correlation matrix between and , which can be expressed as
When the Gaussian approximation is employed to approxi-
mate as a Gaussian distributed vector, it can be shown that
its mean and covariance matrix are given by (24)

where, by definition, . Upon substi-

tuting them into (23), we can obtain

(25)

(20) Furthermore, with the aid of the matrix inverse lemma, an alter-
native solution to can be expressed as [29]
where the coefficient is yielded by . Note
that, the coefficient of explains that the MUI is lessened by (26)
the on-off characteristics of the MSSK modulation.
Note that, the MF-SUD has been employed, for example, From (25), (8), and , we can
in [4] and [11], for the single-user SM systems. Furthermore, readily know that the optimum solution for detecting MT in
as mentioned in Section III, the MF-SUD might not be op- MMSE sense is
timum, even for the single-user case. Specifically, as the perfor-
mance results in Section VII show, the MF-SUD with D-IUD (27)
is outperformed by the ML-MUD, when the single-user case is
considered. Substituting this weight matrix and (7) into the second equation
of(16) yields the decision variables
B. Zero-Forcing Multiuser Detection (ZF-MUD)
The ZF-MUD can be readily derived based on (9) by let-
ting in (16), where denotes the Moore-Pen- (28)
rose inverse. Let us assume that and define the
correlation matrix . Then, it can be shown that As demonstrated in [33], the MUI signals after the
[30]. When substituting this solution and (9) MMSE-MUD can usually be closely approximated as Gaussian
into(16), we obtain the decision variable vector for the MTs, random variables. In this case, , in (28)
which is is Gaussian distributed with its mean vector and covariance
matrix given by
(21)

which obeys the Gaussian distribution with the mean of and

the covariance matrix . Furthermore, it can be shown that
the decision variable vector for MT is Gaussian distributed
with its mean and covariance matrix given by

(22)
(29)
where is an matrix
formed by the elements of from row to row Having considered three types of linear detectors, namely the
and from column to column . MF-SUD, ZF-MUD and the MMSE-MUD, in the context of
YANG: SIGNAL DETECTION IN ANTENNA-HOPPING SPACE-DIVISION MULTIPLE-ACCESS SYSTEMS 357

the first-stage detection. Let us now analyze the (second-stage) However, from (30) and (32), we can readily know that the com-
IUD. plexity of the ML-IUD may be much higher than that of the
D-IUD.
D. Intra-User Detection (IUD)
The IUD stage makes the final decisions of the symbols trans- V. RMD/MS-MMSE MUD
mitted by the MTs. Specifically for MT , the IUD is only In the field of MUD, the family of decision feedback MUDs
based on the decision variables in , which is provided by [29], [31] have drawn a lot of research, especially, in the con-
the first-stage linear detection, as analyzed in Sections IV-A– C. text of the V-BLAST systems [34] in recent years. Among the
In this section, two IUD schemes are considered, which are the various decision feedback MUDs, the SIC-MUDs constitute a
direct IUD (D-IUD) and the ML-IUD. class of detectors, which are capable of achieving the sum ca-
1) D-IUD: In the context of the D-IUD, the transmitted pacity [35] and, in principle, approximate the ML-MUD [31].
symbol of MT , is directly decided by In [28] and [37], a MMSE-SIC algorithm referred to as the
choosing the largest from the decision variables in RMD/MS-MMSE MUD has been proposed, which makes it
and mapping its index to a possible to achieve near-optimum BER performance with lin-
corresponding -ary symbol. This can be described as early dependent detection complexity[28], [37]. Therefore, in
this section, we extend the RMD/MS-MMSE MUD considered
in [28], [37] to the MSSK FAH-SDMA systems. Correspond-
(30) ingly, two novel reliability measurement (RM) schemes are pro-
posed for ordering the MSSK FAH-SDMA signals to be de-
The above D-IUD becomes optimum only when the decision tected. Let us first consider the RM.
variables, , are independent. However, for
the MF-SUD, ZF-MUD, and the MMSE-MUD, these decision A. Reliability Measurement
variables are more or less correlated. Hence, the D-IUD is not When the RMD/MS-MMSE MUD is employed, the MSSK
optimum. The optimum IUD should take into account of the FAH-SDMA signals are detected one-by-one in the order from
correlation existing among . the most reliable one to the most unreliable one based on the
2) ML-IUD: In summary, after the Gaussian approximation, reliabilities measured using certain RM schemes [28], [37]. In
the decision variable vector provided by the linear detectors this paper, two RM schemes are proposed for the MSSK FAH-
obeys the Gaussian distribution with the mean and covariance SDMA employing RMD/MS-MMSE MUD. The first one is the
matrix given by and , respectively. Hence, the MAP-RM, which measures the reliabilities in MAP sense [36].
PDF of can be expressed as The second one is the RT-based RM (RT-RM), which measures
the reliabilities in the principles of Ratio Threshold Test (RTT),
a RM scheme previously proposed for errors-and-erasures de-
(31) coding [38]–[40].
Let us specifically consider the th MT, where .
where and are given by (20) for the MF-SUD, The decision variable vector is , which is provided by
by(22) for the ZF-MUD and by(29) for the MMSE-MUD. With the MF-SUD, ZF-MUD, or MMSE-MUD, as derived in
the aid of(31), the ML-IUD finds the solution to of the Sections IV-A, -B or -C. In the context of the MAP-RM, the
symbol transmitted by MT , , according to the reliability of MT can be measured in the sense of MAP
optimization problem by [38]

(33)

where are the a-priori probabilities and

(32)
Although the ML-IUD of (32) is not necessary optimum—as
is only approximately Gaussian distributed, the ML-IUD
outperforms the D-IUD in terms of the BER performance, as
shown in Section VI. This becomes more explicit in the situa-
tions when the number of receive antennas is relatively low.
the PDF of is given by (31). The detection
of is believed more reliable, when the value of is
larger. Upon assuming the equal a-priori probabilities and ap-
plying (31) into the above equation, we obtain (34), shown at the
bottom of the page. Note that, as discussed in [36],
is in fact the symbol error probability of detection. Hence, the
MAP-RM strategy is also optimum in the sense of minimum

(34)
358 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 60, NO. 1, JANUARY 2012

symbol error probability. However, we note that this does not 5) Weight update:
imply that the MAP-RM is always optimal, as is only ap- The weight matrix is updated to for the
proximately Gaussian. next stage detection.
In the context of the RT-RM, given the decision variable Note that, at Step 3 of the above algorithm, when the
vector , the reliability of detection of is given by [38] MAP-RM is employed, the symbol transmitted by MT is
directly detected associated with the RM, which can be readily
understood by referring to (33). As shown in(33), in order to
(35) compute the reliability of , the corresponding term
of should first be found. The
index of this term represents the estimate of the symbol trans-
where and represent respectively the max-
mitted by MT . By contrast, when the RT-RM is employed,
imum and second maximum of the real values involved.
the symbol can either directly detected or detected by a
In other words, the detection of is rendered more reliable,
further detection stage. First, when the reliability of MT
when the value of becomes larger. When comparing
is measured based on (35), the index of the maximum of the
Equation (34) with Equation (35), we can readily know that
invoked decision variables is already known from the RM
the MAP-RM has much higher complexity than the RT-RM.
stage. Hence, the symbol transmitted by the th MT can
In return, as shown in Section VII, the MAP-RM is capable of
be directly detected as the index of this maximum decision
yielding (slightly) better error performance than the RT-RM. Let
variable. However, as argued previously in Section IV-D,
us now state the RMD/MS-MMSE MUD algorithm.
the D-IUD might degrade the error performance, due to the
correlation existing among the decision variables. In this
B. Detection Algorithm case, a more advanced detector, such as the ML-IUD, may
The RMD/MS-MMSE MUD for the MSSK FAH-SDMA be employed, which outperforms the aforementioned D-IUD.
represents the extension of that considered in [28], [37], which Specifically, when the ML-IUD is considered, the symbol
is for the multiantenna SDMA or DS-CDMA systems. The can be detected based on (32).
detection procedure includes the following steps. Additionally, the RMD/MS-MMSE MUD requires to update
Initialization: the weight matrix to , as shown at Step 5) of the
algorithm. Let us express the channel/FAH dependent matrix at
(36) the th detection stage as . Explicitly, can be formed
from by removing the columns corresponding to
where is given by (9), and is the solution of the of MT . Furthermore, we have
MMSE-MUD given by (23).
Detection: for , execute
1) MMSE-MUD:
(40)
(37)
where (see (24)) is the autocorrelation matrix
2) Determining the most reliable: of and is a permutation matrix formed from by
Let be expressed as deleting the columns corresponding to the detected MTs.
. Then, for the From (39), we know that
MTs indexed by , which have
not been detected, the reliabilities are computed (41)
according to (34), when the MAP-RM is employed,
or according to (35), when the RT-RM is employed. Upon substituting (41) into(40) and applying the matrix inverse
Furthermore, the most reliable is determined as lemma [41], we arrive at

(38)

3) Detection of the most reliable:

The most reliable MT is detected, yielding the
estimate to of the symbol transmitted by
MT .
4) Interference cancellation:
(42)
(39)
YANG: SIGNAL DETECTION IN ANTENNA-HOPPING SPACE-DIVISION MULTIPLE-ACCESS SYSTEMS 359

TABLE I
NUMBER OF OPERATIONS REQUIRED FOR DETECTING ONE USER, WHEN THE MSSK FAH-SDMA SYSTEMS EMPLOY VARIOUS DETECTION SCHEMES

detection, based on which we further analyze the diversity capa-

bility of the MSSK FAH-SDMA. Note that, the SU-PEP and the
single-user BER union-bound represent, respectively, the lower-
bound and upper-bound of the BER achieved by the single-user
MSSK FAH-SDMA using ML-IUD. Furthermore, as known
from [42] and also Fig. 2, the single-user BER union-bound
can be used as the approximate BER of the single-user MSSK
FAH-SDMA system employing ML-IUD.
The analysis of the SU-PEP starts with(14). Let us assume
that is transmitted with the aid of the FAH address .
Then, the SU-PEP of that is received is given
by

(43)
Fig. 1. Number of operations required for detecting one user, when various
detection schemes are employed. From the characteristics of the MSSK FAH-SDMA, as analyzed
in Section II-B, we can know that is just an -length
vector, which is constituted by the columns of arranged
where, from the first equation to the second, under the control of the FAH sequence and the data symbol
and are ap- transmitted by the th MT. Therefore, let
and , both of which are -length vectors obeying
plied. Note that, is simply the columns of
the complex Gaussian distribution with zero mean and covari-
corresponding to the th MT.
ance matrix . Then, (43) can be rewritten as
So far, a range of detection schemes have been considered,
which are summarized in Table I associated with their detec-
tion complexity. Note that, the number of operations shown in
Table I includes multiplications, additions and comparisons. If (44)
only multiplications are counted, the terms shown in the table
need to be multiplied by a scaling factor of about 0.5. Cor- Upon substituting the received signal in the form of
responding to Table I, Fig. 1 illustrates the number of opera- into the above equation and doing some rearrangement, we can
tions required by the various detection schemes to detect one express the SU-PEP as
MT, when the MSSK FAH-SDMA systems have the parame-
ters and . From Table I as well as
Fig. 1, we can see that, given and , the complexity
of the ML-MUD increases exponentially, while the MF-SUD is (45)
not dependent on . The complexity of the ZF-, MMSE-, and
RMD/MS-MMSE MUDs increases with the number of users,
Given and , it can be shown that
all as a function of , as seen in Table I.
obeys the Gaussian distribution with zero mean and variance
, where . Using these result into (45), we
VI. SINGLE-USER ERROR PROBABILITY (SU-PEP) ANALYSIS
can obtain
OF MAXIMUM LIKELIHOOD DETECTION

In this section, we analyze the SU-PEP and single-user BER

(46)
union-bound of the MSSK FAH-SDMA systems employing ML
360 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 60, NO. 1, JANUARY 2012

where is the Gaussian -function, which, when , Furthermore, let us express the nonzero
can be defined [29] as . Hence, (46) eigenvalues of . Then, (49) can be represented as
can alternatively be expressed as

(50)
which shows that, once the FAH address of MT , and are
(47) given, or in other words, once the matrix of correlation coef-
ficients is known, the average SU-PEP can be readily evaluated
The average SU-PEP can be obtained by the integration of by (50).
with respect to the distribution of , Dividing by and deriving the
where some elements of may be correlated with some of limit with respect to , we obtain
. However, when the FAH addresses defined by (11) are em-
ployed, and have the properties: a) all the elements in (51)
or in are independent; b) the real part of any element
is independent of the imaginary part of any element in or which explains that, when the optimum ML detection is consid-
and, vice versa, the imaginary part of any element is in- ered, the MSSK FAH-SDMA system is capable of achieving
dependent of the real part of any element in or ; c) For orders of diversity. Finally, when various transmitted symbols
, the th element in is independent of and various FAH patterns are considered, the average SU-PEP
the element in . In fact, the reason behind that is corre- can be expressed as 2
lated with is that the same column of may be activated
by different data symbols transmitted by MT . However, when
optimal FAH addresses are employed, the activation orders of (52)
the columns in are different for different values of data sym-
bols. Let us define Furthermore, the average single-user pairwise bit error proba-
bility (PBEP) can be expressed as [42] .
(48) Additionally, the average BER union-bound is given by

Then, based on the above properties and facts, it can be shown

that is a complex Gaussian random vector with zero mean
and, when the FAH address of MT , , and are given, a (53)
fixed covariance matrix of dimen-
sions, where contains the correlation coefficients among the According to the above analysis of the SU-PEP, we can prove
elements of . Note that, from the above mentioned proper- the following observations for the MSSK FAH-SDMA system
ties and facts, we can know that contains possibly the el- employing the FAH addresses designed based on (11).
ements 1, 0, and with all the diagonal elements being Observation 2: When the FAH addresses defined by (11) are
1’s. However, as Observation 2 at the end of this section shows, employed
the possible elements are only 1, 0 and . For example, let 1) the correlation matrix contains only the elements ,0
us assume that and and 1;
. Then, we have 2) The achievable diversity orders are at least , if is
an even number, or at least , if is an odd
number.
Proof: See the proof in Appendix B.
In the next section, we provide a range of results to char-
acterize the achievable error performance of the MSSK FAH-
SDMA systems employing the various detection algorithms.
where is an matrix of all-zeros. From this example,
we can deduce that has a rank of , which VII. PERFORMANCE RESULTS
explains that orders of diversity is achievable.
In this section, we present the error performance results of the
Consequently, after integrating of (47) with
MSSK FAH-SDMA systems, when various detection schemes
respect to the distribution of by following the ap-
derived in the previous sections are considered. The cases of
proach shown in [43] and [29, pp. 270–272, 219–221], the av-
and are specifically addressed.
erage SU-PEP can be expressed as
In the first set of BER performance results shown in Figs. 2–5,
we assume that the MSSK FAH-SDMA systems support only
2Among the M M0
possible FAH addresses, there are ( 1) addresses with
(49) nonzero elements. The all-zero address generates lower diversity gain and is
usually not used.
YANG: SIGNAL DETECTION IN ANTENNA-HOPPING SPACE-DIVISION MULTIPLE-ACCESS SYSTEMS
Fig. 2. PBEP, BER, and BER union bound for the MSSK FAH-SDMA systems
K=1
using ML-MUD to support MT.
Fig. 3. BER versus average SNR per bit performance of MSSK FAH-SDMA
K=1
systems using MF detection to support MT.
single user, in order to investigate the effect of FAH, ML, MF,
ZF, or MMSE detection as well as D-IUD or ML-IUD on the
BER performance. Furthermore, in Fig. 2, the average PEP and
BER union-bound are also provided. Explicitly, the average PEP
represents one of the BER lower-bounds of the considered sys-
tems employing ML-IUD. By contrast, the BER union-bound
can be used as the approximate BER, which becomes closer
to the simulated BER as the SNR increases. From the results
of Figs. 2, 3, 4, and 5, we observe that, when the ML-IUD is
employed, the MF, ZF, and MMSE detectors achieve the same
BER performance as the ML detection. In other words, the MF,
ZF, and MMSE operations all give the sufficient statistics for
detection. However, when the low-complexity D-IUD is em-
ployed, the MF, ZF, and MMSE detectors are usually unable
to achieve the single-user BER performance as the ML detector
or the corresponding MF, ZF, and MMSE detectors followed
by the ML-IUD. The reason for this observation is that the
spatial signatures for generating the decision variables are
361
Fig. 4. BER versus average SNR per bit performance of MSSK FAH-SDMA
K=1
systems using ZF detection to support MT.
Fig. 5. BER versus average SNR per bit performance of MSSK FAH-SDMA
K=1
systems using MMSE detection to support MT.
not orthogonal, but interfere with each other. Due to the nonop-
timum D-IUD, the MF, ZF, and MMSE detectors followed by
the D-IUD cannot make full use of the statistics of the spatial
sequences, resulting in the worse BER performance than the
ML-MUD or the corresponding MF, ZF, and MMSE detectors
followed by the ML-IUD. From the results of Figs. 3, 4, and 5,
we observe that the MMSE detection always achieves the best
BER performance among these three detection schemes. We can
see from Fig. 4 that the ZF detection suffers from noise ampli-
fication, resulting in that its BER performance is outperformed
by that of the MF detection within the low SNR region. Fur-
thermore, when the value of is one or two, the MF detection
outperforms the ZF detection, even when the SNR is relatively
high. Additionally, as seen in Figs. 2, 3, 4, and 5, when the value
of increases, transmit diversity gain is attainable for all the
detection schemes considered, and significant transmit diversity
gain is declared for the MF, ZF, and MMSE detectors associated
with the D-IUD.
362 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 60, NO. 1, JANUARY 2012

Fig. 6. BER versus average SNR per bit performance of MSSK FAH-SDMA Fig. 8. BER versus average SNR per bit performance of MSSK FAH-SDMA
systems supporting multiple MTs associated with using MF-SUD, as well as systems supporting multiple MTs associated with using MMSE-MUD, as well
D-IUD or ML-IUD. as D-IUD or ML-IUD.

Fig. 7. BER versus average SNR per bit performance of MSSK FAH-SDMA
Fig. 9. BER versus average SNR per bit performance of MSSK FAH-SDMA
systems supporting multiple MTs associated with using ZF-MUD, as well as
systems supporting multiple MTs associated with using RMD/MS-MMSE
D-IUD or ML-IUD.
MUD with RT- or MAP-RM.

The second set of results include Figs. 6–10, where the BER
performance of the MSSK FAH-SDMA systems with
, and supporting multiple MTs is investigated,
when the MF, ZF, MMSE, and RMD/MS-MMSE MUDs are,
respectively, employed. Note that, in Figs. 8 and 9, the cases
of are considered. In this cases, the MSSK
FAH-SDMA systems are overload. Furthermore, in Fig. 10, the
BER performance of these detectors is compared for the full-
load cases. The results of these figures show that
the MUI imposes a big impact on the BER performance. As
shown in Figs. 6, 7, and 8, the BER performance degrades ex-
plicitly as the number of MTs increases. Although the ZF-MUD
is capable of removing the MUI, it however amplifies noise, re-
sulting in that it does not have any performance advantage over
the MF detector within the SNR range of interest, as seen in
Fig. 10. By contrast, the MMSE-MUD considered in Fig. 8 sig-
nificantly outperforms both the MF-SUD and ZF-MUD. Fur- Fig. 10. Comparison of BER performance of the MSSK FAH-SDMA systems
thermore, the MMSE-MUD can be operated in the overload sce- employing various detection schemes.
YANG: SIGNAL DETECTION IN ANTENNA-HOPPING SPACE-DIVISION MULTIPLE-ACCESS SYSTEMS
Fig. 11. BER versus average SNR per bit performance of MSSK FAH-SDMA
systems supporting multiple MTs associated with using MF-SUD, as well as
D-IUD or ML-IUD.
Fig. 12. BER versus average SNR per bit performance of MSSK FAH-SDMA
systems supporting multiple MTs associated with using MMSE-MUD, as well
as D-IUD or ML-IUD.
narios, although, in this case, the BER performance degrades
significantly as the number of MTs increases, due to the diver-
sity/multiplexing tradeoff.
From the results of Figs. 3–10, we can observe that the
ML-IUD always outperforms the D-IUD. However, as the
value of increases, the BER performance achieved by the
ML-IUD and D-IUD becomes closer. This observation is
more declared for the MSSK FAH-SDMA systems employing
MMSE detection. This observation implies that, when a suf-
ficient number of time-slots are used for transmitting one
MSSK symbol, the D-IUD is capable of achieving the BER
performance near that of the ML-IUD, but with much lower
complexity.
In comparison with the linear MF, ZF, and MMSE detectors,
the RMD/MS-MMSE MUD can achieve much better BER per-
formance. First, as seen in Fig. 10, the RMD/MS-MMSE MUD
significantly outperforms the other detection schemes, when the
363
Fig. 13. BER versus average SNR per bit performance of MSSK FAH-SDMA
systems supporting multiple MTs associated with using RMD/MS-MMSE
MUD with RT- or MAP-RM.
the MSSK FAH-SDMA systems are full-load. Second, for the
cases of , the RMD/MS-MMSE MUD is capable of
achieving the near single-user BER performance bound, when
either the RT-RM or MAP-RM is applied, although the BER
achieved by the MAP-RM is slightly lower than that achieved
by the RT-RM3. Hence, the RMD/MS-MMSE MUD is capable
of achieving the BER performance similar to the ML-MUD. Fi-
nally, as Fig. 9 shows, the RMD/MS-MMSE MUD is still highly
efficient, when operated in the overload scenarios. Even for the
overloading factor of , the SNR per bit required to in-
crease from the case is typically within 1 dB at the BER
of 0.01. Specifically, as seen in Fig. 9, at the BER of 0.01, the
increase of SNR per bit for the RT-RM is about 1 dB, and that
for the MAP-RM is only about 0.4 dB.
The final set of results, including Figs. 11–14, show the BER
performance of the MSSK FAH-SDMA systems with
and , which employ the MF-SUD, MMSE-MUD,
and RMD/MS-MMSE MUD to support various number of MTs.
From the results of these figures, similar conclusions drawn
from the previous results associated with and
can be obtained. Specifically, we would like to em-
phasize Fig. 13, where the loading factor reaches as high as
. From the results of this figure, we are implied that the
RMD/MS-MMSE MUD is a highly promising MUD scheme
for MSSK FAH-SDMA systems. When the number of MTs sup-
ported is or fewer for the RT-RM and is or fewer
for the MAP-RM, the achieved BER performance is close to the
single-user BER bound. However, even when MTs
are supported, reasonable BER performance can be achieved
by both the RT-RM and the MAP-RM, especially, when the
SNR per bit is relatively low, resulting in a BER of about 0.01.
Hence, we can be implied that, as the ML-MUD, the MSSK
FAH-SDMA systems employing the RMD/MS-MMSE MUD
3When comparing the BER of the MAP-RM assisted RMD/MS-MMSE
MUD shown in Fig. 10 with that of the 8-ary orthogonal signaling over
Gaussian channels [42], we can find that the SNR achieving the BER of 10
in Fig. 10 is only about 1 dB away from the Gaussian single-user bound.
364
Fig. 14. Comparison of BER performance of the MSSK FAH-SDMA systems
employing various detection schemes.
are capable of achieving the full transmit/receive diversity, while
simultaneously suppressing the MUI4.
VIII. SUMMARY AND CONCLUDING REMARKS
A MSSK FAH-SDMA system has been proposed, which
takes the advantages of the SM, and supports multiuser commu-
nications as well as achieves transmit diversity. A class of FAH
patterns have been proposed in order to support multiple-access
communications and to achieve transmit diversity. A range
of linear and nonlinear detection schemes have been inves-
tigated in association with the MSSK FAH-SDMA systems.
Specifically, the linear detection schemes considered include
the MF-SUD, ZF-MUD, and MMSE-MUD, while the non-
linear detection schemes addressed include the ML-MUD and
RMD/MS-MMSE MUD. The SU-PEP and BER union-bound
of the single-user MSSK FAH-SDMA system with ML detec-
tion have been derived in details. Based on the SU-PEP, the
minimum diversity order achievable by the MSSK FAH-SDMA
systems has been analyzed, showing that, given time-slots
per symbol duration and receive antennas, the minimum di-
versity order achievable is , when is even, and , PROOF OF OBSERVATION 2
when is odd. Associated with the linear detection schemes,
two IUD schemes, namely the ML-IUD and D-IUD, have been
studied, which show that the ML-IUD may achieve better BER
performance than the D-IUD, but demands much higher com-
plexity than the D-IUD. Furthermore, the BER performance
gap between the ML-IUD and D-IUD becomes smaller, as
the product of the number of receive antennas and the number
of time-slots per symbol duration, i.e., , increases. In the
context of the RMD/MS-MMSE MUD, two types of RM rules,
namely the MAP-RM and RT-RM, have been proposed and
studied. It can be shown that, in terms of the BER performance,
the MAP-RM slightly outperforms the RT-RM. However,
4When comparing the BER of the MAP-RM assisted RMD/MS-MMSE
MUD shown in Fig. 14 with that of the 16-ary orthogonal signaling over
Gaussian channels [42], we can find that the SNR achieving the BER of 10
in Fig. 14 is now only about 0.5 dB away from the Gaussian single-user bound.
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 60, NO. 1, JANUARY 2012
the RT-RM has much lower complexity than the MAP-RM,
especially, when the signal space determined by the value of
is relatively large.
Considering the tradeoff between the implementation com-
plexity and BER performance, we may have the following
suggestions. First, when linear SUD/MUD is employed, if the
value of is relatively small, the ML-IUD may be employed
in order to obtain the best BER performance. However, if the
value of is large, the D-IUD may be preferred for the
sake of reducing the complexity, since, in this case, the BER
performance should not be the main concern due to the high
diversity order. Second, when the RMD/MS-MMSE MUD is
employed, if the number of transmit antennas, , is low, the
MAP-RM may be used to motivate the best BER performance.
By contrast, when the value of is relatively high, the RT-RM
can be employed to benefit from its low complexity. Note that,
the above suggestions are general and suitable for the conven-
tional MSSK scheme supporting single-user or point-to-point
communications.
APPENDIX A
PROOF OF OBSERVATION 1
According to [27], when transmitted over time-slots, two
signals signatured by two distinct FAH addresses from (11) co-
incide in at most one time-slot. Hence, for a MSSK FAH-SDMA
system supporting one MT that transmits symbols in parallel,
first, if , the probability that one column of is a linear
combination of the other columns is zero. Therefore, in this case,
the rank of is . Second, if , there
are chances that a column of is a linear combination of the
other columns. This happens when there are signals, each
of which coincides in one time-slot with the considered one. In
this case, the rank of is with probability one.
When considering both the above cases, we have the rank of
equaling to with probability one.
By contrast, when a MSSK FAH-SDMA system supports
separate MTs with their channels are independent with each
other, the rank of is not affected by the FAH patterns. Hence,
the rank of is with probability one.
APPENDIX B
Let us consider the th MT whose FAH address is given by
(11). Let the two symbols being considered be and . Then,
the indexes of the transmit antennas activated for transmitting
and are
(54)
Correspondingly, the channel vectors obtained at the receiver
are
(55)
The correlation matrix is given by
(56)
YANG: SIGNAL DETECTION IN ANTENNA-HOPPING SPACE-DIVISION MULTIPLE-ACCESS SYSTEMS 365

where is a constant. Explicitly, for a proper value of , the th [4] R. Y. Mesleh, H. Haas, S. Sinanovic, C. W. Ahn, and S. Yun, “Spatial
diagonal block of is given by modulation,” IEEE Trans. Veh. Technol., vol. 57, no. 4, pp. 2228–2241,
Jul. 2008.
[5] J. Jeganathan, A. Ghrayeb, and L. Szczecinski, “Spatial modulation:
Optimum detection and performance analysis,” IEEE Commun. Lett.,
vol. 12, no. 8, pp. 545–547, Aug. 2008.
(57) [6] J. Jeganathan, A. Ghrayeb, L. Szczecinski, and A. Ceron, “Space
shift keying modulation for MIMO channels,” IEEE Trans. Wireless
Remembering that the channel vectors in the context of the dif- Commun., vol. 8, no. 7, pp. 3692–3703, Jul. 2009.
[7] M. D. Renzo and H. Haas, “Improving the performance of space shift
ferent transmit antennas are independent, we can express the keying (SSK) modulation via opportunistic power allocation,” IEEE
th block of as Commun. Lett., vol. 14, no. 6, pp. 500–502, Jun. 2010.
[8] M. D. Renzo and H. Haas, “A general framework for performance
analysis of space shift keying (SSK) modulation for miso correlated
m
nakagami— fading channels,” IEEE Trans. Commun., vol. 58, no. 9,
Sep. 2010.
(58) [9] M. D. Renzo and H. Haas, “Space shift keying (SSK) modulation with
partial channel state information: Optimal detector and performance
analysis over fading channels,” IEEE Trans. Commun., vol. 58, no. 11,
where and . Let us consider pp. 3196–3210, Nov. 2010.
the first term of . If , it equals . Otherwise, [10] S. Sugiura, S. Chen, and L. Hanzo, “Coherent and differential
, if , which means space-time shift keying: A dispersion matrix approach,” IEEE Trans.
Commun., vol. 58, no. 11, pp. 3219–3230, Nov. 2010.
, giving [11] C. Xu, S. Sugiura, S. Ng, and L. Hanzo, “Reduced-complexity non-
coherently detected differential space-time shift keying,” IEEE Trans.
Signal Process., vol. 18, no. 3, pp. 153–156, Mar. 2011.
(59) [12] E. Basar, U. Aygolu, E. Panayirci, and H. Poor, “New trellis code de-
sign for spatial modulation,” IEEE Trans. Wireless Commun., to be pub-
Now let us consider the second term of (58). We have lished.
[13] M. Renzo and H. Haas, “Space shift keying (SSK-) MIMO over
correlated Rician fading channels: Performance analysis and a new
method for transmit-diversity,” IEEE Trans. Commun., vol. 59, no. 1,
pp. 116–129, Jan. 2011.
(60) [14] E. Basar, U. Aygolu, E. Panayirci, and H. Poor, “Space-time block
coded spatial modulation,” IEEE Trans. Commun., vol. 59, no. 3, pp.
Hence, if , we can deduce from this equation that 823–832, Mar. 2011.
[15] S. Sugiura, S. Chen, and L. Hanzo, “Generalized space-time shift
and the second term of is . By contrast, if we have keying designed for flexible diversity, multiplexing-, and com-
, using (59) into (60), we can obtain and, plexity-tradeoffs,” IEEE Trans. Wireless Commun., vol. 10, no. 4, pp.
1144–1153, Apr. 2011.
hence, have . Consequently, is [16] M. Renzo and H. Haas, “Space shift keying (SSK) modulation: On the
either or , meaning that contains only the elements of transmit-diversity/multiplexing trade-off,” Proc. IEEE ICC’2011, Jun.
, 0 and 1. This ends the proof of the first part of Observation 2011.
[17] M. Renzo and H. Haas, “Transmit-diversity for spatial modulation
2. (SM): towards the design of high-rate spatially-modulated space-time
For the second part of Observation 2, let us assume that, for block codes,” Proc. IEEE ICC’2011, Jun. 2011.
given , and , there is an satisfying (59), meaning that [18] D. Yang, C. Xu, L.-L. Yang, and L. Hanzo, “Transmit-diversity-assisted
space-shift keying for co-located and distributed/cooperative MIMO
. The value of can be readily obtained by solving elements,” IEEE Trans. Veh. Technol., vol. 60, no. 6, pp. 2864–2869,
(59). Since, for different exponents , the Jul. 2011.
values of are different, there is hence one and only one [19] M. Renzo and H. Haas, “Performance comparison of different spa-
tial modulation schemes in correlated fading channels,” Proc. IEEE
satisfying (59). Furthermore, when is considered, ICC’2010, May 2010.
there is at most one in , which satisfies (59). [20] L.-L. Yang, “Transmitter preprocessing aided spatial modulation for
It can be shown that, for any given , and , whenever there multiple-input multiple-output systems,” Proc. IEEE VTC’11-Spring,
May 2011.
is an in that satisfies (59), the diversity [21] A. Younis, M. Renzo, R. Mesleh, and H. Haas, “Sphere decoding for
orders reduce . However, for of the spatial modulation,” Proc. IEEE ICC’2011, Jun. 2011.
[22] M. Renzo and H. Haas, “On the performance of SSK modulation over
cases, there are only , if is even, or
of this kind, due to the fact that and
, if is odd, values
occur
m
correlated Nakagami- fading channels,” Proc. IEEE ICC’2010, May
2010.
simultaneously, as above-illustrated. Therefore, the achievable [23] M. Renzo and H. Haas, “On the performance of SSK modulation
over multiple-access Rayleigh fading channels,” in Proc. IEEE
diversity orders are at least , if is even, or GLOBECOM, Dec. 2010.
, if is odd. [24] G. J. Foschini, “Layered space-time architecture for wireless commu-
nication in a fading environment when using multiple antennas,” Bell
Labs Tech. J., pp. 41–59, 1996.
REFERENCES [25] V. Tarokh et al., “Space-time codes for high data rate wireless com-
munication: Performance criteria in the presence of channel estimation
[1] Y. A. Chau and S. H. Yu, “Space modulation on wireless fading chan- errors, mobility, and multiple paths,” IEEE Trans. Commun., vol. 47,
nels,” IEEE VTC’01 (Fall), pp. 1668–1671, Sep. 2001. no. 2, pp. 199–207, Feb. 1999.
[2] S. Ganesan, R. Mesleh, H. Haas, C. W. Ahn, and S. Yun, “On the [26] J. Jeganathan, A. Ghrayeb, and L. Szczecinski, “Generalized
performance of spatial modulation of OFDM,” in Proc. 40th Asilomar space shift keying modulation for MIMO channels,” Proc. IEEE
Conf. Signals, Syst. Comput., Nov. 1, 2006, pp. 1825–1829. PIMRC’2008, Sep. 2008.
[3] R. Mesleh, H. Haas, C. W. Ahn, and S. Yun, “Spatial modulation—a [27] G. Einarsson, “Address assignment for a time-frequency-coded,
new low-complexity spectral efficiency enhancing technique,” Chi- spread-spectrum system,” Bell Syst. Tech. J., vol. 59, no. 7, pp.
nacom’2006, pp. 1–5, Oct. 2006. 1241–1255, Sep. 1980.
366
[28] L.-L. Yang, “Receiver multiuser diversity aided multi-stage minimum
mean-square error detection for heavily loaded DS-CDMA and SDMA
systems,” IEEE Trans. Commun., vol. 58, no. 12, pp. 3397–3404, Dec.
2010.
[29] L.-L. Yang, Multicarrier Communications. Chichester, U.K.: Wiley,
2009.
[30] H. L. V. Trees, Optimum Array Processing. New York: Wiley In-
tersci., 2002.
[31] S. Verdu, Multiuser Detection. Cambridge, U.K.: Cambridge Univ.
Press, 1998.
[32] I. E. Telatar, “Capacity of multiantenna Gaussian channels,” Eur.
Trans. Telecommun., vol. 10, no. 6, pp. 585–595, Nov./Dec. 1999.
[33] H. V. Poor and S. Verdu, “Probability of error in MMSE multiuser
detection,” IEEE Trans. Inf. Theory, vol. 43, no. 3, pp. 858–871, May
1997.
[34] G. Foschini, G. Golden, R. Valenzuela, and P. Wolniansky, “Simpli-
fied processing for high spectral efficiency wireless communication
employing multi-element arrays,” IEEE J. Sel. Areas Commun., vol.
17, no. 11, pp. 1841–1851, Nov. 1999.
[35] S. S. Shitz and S. Verdu, “The impact of frequency-flat fading on the
spectral efficiency of CDMA,” IEEE Trans. Inf. Theory, vol. 47, no. 4,
pp. 1302–1327, May 2001.
[36] C. W. Baum and M. B. Pursley, “Bayesian methods for erasure inser-
tion in frequency-hop communication system with partial-band inter-
ference,” IEEE Trans. Commun., vol. 40, no. 7, pp. 1231–1238, Jul.
1992.
[37] L.-L. Yang, “Receiver multiuser diversity aided multi-stage MMSE
multiuser detection for DS-CDMA and SDMA systems employing I-Q
modulation,” Proc. IEEE VTC’10 (Fall), pp. 6–9, Sep. 2010.
[38] A. J. Viterbi, “A robust ratio-threshold technique to mitigate tone
and partial band jamming in coded MFSK systems,” in Proc. IEEE
MILCOM’82, Oct. 1982, pp. 22.4.1–22.4.5.
[39] L.-L. Yang and L. Hanzo, “Performance analysis of coded M-ary or-
thogonal signaling using errors-and-erasures decoding over frequency-
selective fading channels,” IEEE J. Sel. Areas Commun., vol. 19, no. 2,
Feb. 2001.
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 60, NO. 1, JANUARY 2012
[40] L. L. Yang and L. Hanzo, “Low complexity erasure insertion in
RS-coded SFH spread-spectrum communications with partial-band
m
interference and Nakagami- fading,” IEEE Trans. Commun., vol.
50, no. 6, pp. 914–925, Jun. 2002.
[41] H. Lutkepohl, Handbook of Matrices. Chichester, U.K.: Wiley, 1996.
[42] J. G. Proakis, Digital Communications, 3rd ed. New York: McGraw-
Hill, 1995.
[43] P. R. Krishnaiah and M. M. Rao, “Remarks on a multivariate gamma
distribution,” Amer. Math. Monthly, vol. 68, no. 4, pp. 342–346, Apr.
1961.
Lie-Liang Yang (M’98–SM’02) received the
B.Eng. degree in communications engineering from
Shanghai TieDao University, Shanghai, China, in
1988, and the M.Eng. and Ph.D. degrees in commu-
nications and electronics from Northern (Beijing)
Jiaotong University, Beijing, China, in 1991 and
1997, respectively.
From June 1997 to December 1997, he was a vis-
iting scientist with the Institute of Radio Engineering
and Electronics, Academy of Sciences of the Czech
Republic. Since December 1997, he has been with
the University of Southampton, U.K., where he is a Professor of wireless com-
munications, School of Electronics and Computer Science. His research has
covered a wide range of topics in wireless communications, networking, and
signal processing. He has published more than 260 research papers in journals
and conference proceedings, authored/co-authored three books and also pub-
lished several book chapters. The details about his publications can be found at
http://www-mobile.ecs.soton.ac.uk/lly/.
Dr. Yang is currently an Associate Editor to the IEEE TRANSACTIONS ON
VEHICULAR TECHNOLOGY, Journal of Communications and Networks (JCN),
and the Security and Communication Networks (SCN) Journal.