Open Access

Unified tensor model for space-frequency spreading-multiplexing (SFSM) MIMO communication systems

EURASIP Journal on Advances in Signal Processing20132013:48

https://doi.org/10.1186/1687-6180-2013-48

Received: 20 June 2012

Accepted: 15 February 2013

Published: 15 March 2013

Abstract

This paper presents a unified tensor model for space–frequency spreading-multiplexing (SFSM) multiple-input multiple-output (MIMO) wireless communication systems that combine space- and frequency-domain spreadings, followed by a space–frequency multiplexing. Spreading across space (transmit antennas) and frequency (subcarriers) adds resilience against deep channel fades and provides space and frequency diversities, while orthogonal space–frequency multiplexing enables multi-stream transmission. We adopt a tensor-based formulation for the proposed SFSM MIMO system that incorporates space, frequency, time, and code dimensions by means of the parallel factor model. The developed SFSM tensor model unifies the tensorial formulation of some existing multiple-access/multicarrier MIMO signaling schemes as special cases, while revealing interesting tradeoffs due to combined space, frequency, and time diversities which are of practical relevance for joint symbol-channel-code estimation. The performance of the proposed SFSM MIMO system using either a zero forcing receiver or a semi-blind tensor-based receiver is illustrated by means of computer simulation results under realistic channel and system parameters.

Keywords

Blind receiverMIMO–OFDM communicationsParallel factor analysisSpace–frequency spreading-multiplexingTensor modeling

1 Introduction

Wireless communication systems employing multiple antennas at both ends of the link, commonly known as multiple-input multiple-output (MIMO) systems, are being considered as one of the key technologies to be deployed in current and upcoming wireless communication standards [1]. In this context, the integration of multiple-antenna systems with code-division multiple-access (CDMA) transmission and/or orthogonal frequency division multiplexing (OFDM) has also been the subject of several works over the past few years [24].

Different combinations of OFDM and CDMA have been reported in a number of works. Multi-carrier (MC)-CDMA performs spreading of the information symbols across the different subcarriers [5, 6], but suffers from limited frequency diversity gains like conventional CDMA systems. MC direct-sequence (MCDS)-CDMA differs from MC-CDMA by performing the spreading operation in the time-domain at each subcarrier [7]. For combating frequency-selective fading, MCDS-CDMA requires forward error-correction coding and frequency-domain interleaving. In [8], a hybrid of MC-CDMA and OFDM systems with orthogonal transmission in the frequency-domain was proposed, which ensures interference-free transmission/reception regardless of the multipath channel profile. A related approach, called multicarrier block-spread (MCBS)-CDMA, was introduced in [9] by capitalizing on redundant block spreading and frequency-domain linear precoding to preserve orthogonal multiple-accessing and to enable full multipath diversity gains. The receiver is based on a low-complexity single-user equalization.

By introducing the spatial dimension at the transmit processing, jointly with time and/or frequency dimensions, a number of different space–frequency MIMO transceivers were proposed to enable orthogonal multiple-access in multiuser systems combining OFDM and CDMA techniques. A spread spectrum-based transmission framework was proposed in [10], therein called multicarrier spread space spectrum multiple access (MC-SSSMA), with the idea of fully spreading each user symbol over space, time, and frequency. MC-SSSMA is a generalization of its single-carrier counterpart proposed in [11]. Despite the achieved spectral efficiency gains, the design of [10] was restricted to the case where the number of transmit and receive antennas is equal to the spreading gain. In [12], space–time–frequency spreading was proposed for MC-CDMA based on the concatenation of a space–time spreading code with a frequency-domain spreading code.

A common characteristic of all these works is the assumption of perfect channel knowledge at the receiver. When the channel is not known, as it is the case in practice, the receiver design is generally based on suboptimum (linear or nonlinear) filtering/equalization/signal separation structures that use training sequences for channel acquisition and tracking, before decoding the transmitted data. However, practical limitations such as the receiver complexity and the training sequence overhead (which implies a reduction of the information rate) may be too restrictive and prohibitive in some cases.

Recently, tensor modeling has successfully been applied to the design of MIMO transceivers based on spatial multiplexing and/or space–time coding [1319]. Relying on the use of spreading codes, the common feature of these works is the fact that the received signal can be modeled as a third-order tensor, the dimensions of which are associated with space, time, and code diversities [20]. Due to the uniqueness properties of tensor models, these tensor-based MIMO–CDMA transceivers afford blind multiuser detection and channel estimation under more relaxed conditions compared with conventional matrix-based receivers. The approach of [13] relies on pure spatial multiplexing by means of a parallel factor (PARAFAC) model [21]. The work of [14] deals with a multiple-access MIMO antenna system relying on a block tensor model [22]. In [15], a constrained “block-structured” PARAFAC model is proposed for allowing multiuser space–time spreading in the uplink. The multiuser downlink case is treated in [16]. More general tensor-based space–time spreading and multiplexing structures were also proposed relying on the constrained factor (CONFAC) model [17, 18] and on PARATUCK-type models [19, 23].

In this article, we present a unified tensor model for space–frequency spreading-multiplexing (SFSM) MIMO wireless communication systems combining both space and frequency spreadings along with a space–frequency multiplexing. On one hand, spreading across space (transmit antennas) and frequency (subcarriers) potentially provides robustness against frequency-selective fading and channel ill-conditioning while providing transmit diversity gains. On the other hand, an orthogonal space–frequency multiplexing enables interference-free multistream transmission. For this system, we adopt a tensorial formulation of the transmitted and received signals that jointly incorporates space, frequency, time, and code dimensions by means of a PARAFAC tensor model. From this tensorial formulation, we show how several existing multiple-antenna CDMA-based systems can be derived by making appropriate simplifications on the unified tensor model structure.

We also address the problem of joint symbol-channel-code estimation for the proposed system by capitalizing on the uniqueness properties of the PARAFAC model. By exploiting the space, time, frequency, and code diversities inherent to the unified SFSM tensor model, we obtain new results providing useful bounds on the required number of transmit and receive antennas, subcarriers, and spreading length for ensuring a unique recovery of users’ symbols, channels, and codes. A performance evaluation of the SFSM MIMO system is also carried out considering a zero forcing (ZF) receiver and a semi-blind alternating least squares (ALS) receiver that only requires a single pilot symbol per transmitted data stream in order to remove the scaling factor introduced by the estimation process.

The remainder of this article is organized as follows. In Section 2, the main building blocks of the SFSM transmitter are detailed and the transmitted signal model is formulated. In Section 3, we present the received signal model and also derive the proposed unifying tensor model and its special cases. A ZF receiver with joint block-decoding and equalization is formulated in Section 4. Section 5 is dedicated to the problem of joint symbol-channel-code estimation for the unified SFSM MIMO system, where bounds on the required numbers of transmit/receive antennas, subcarriers, spreading length, and the number of symbols per data stream are provided. The semi-blind ALS receiver is also presented in this section. In Section 6, the performance of the SFSM MIMO system is evaluated by means of computer simulations under different system parameter settings. The article is concluded in Section 7.

Notations: Some notations and properties are now defined. Scalars are denoted by lower-case letters (a,b,…), vectors are written as boldface lower-case letters (a,b,…), matrices as boldface capitals (A,B,…), and tensors as calligraphic letters ( A , , ) . We use a i,j =[A] i,j to denote the entry (i,j) of matrix A while a i,j,k,l refers to the entry (i,j,k,l) of the tensor A I × J × K × L . The i th row and j th column of A are denoted by A i. 1 × J and A .j I × 1 , respectively. A T ,A −1 and A stand for transpose, inverse, and pseudo-inverse of A, respectively. The operator diag(·) forms a diagonal matrix from its vector argument, while blockdiag(·) forms a block-diagonal matrix from its matrix arguments. The operator vecdiag(·) forms a column vector out of the main diagonal of its matrix argument, while 1 R denotes the “all-ones” vector of dimension R. The operator vec(·) forms a vector by stacking the columns of its matrix argument. D i (A) forms a diagonal matrix holding the i th row of A on its main diagonal. The Kronecker and the Khatri-Rao products are denoted by and , respectively:
A B = [ A · 1 B · 1 , , A · R B · R ] = B D 1 ( A ) B D I ( A ) IJ × R
(1)
with A = [ A · 1 A · R ] I × R , B = [ B · 1 B · R ] J × R . We shall make use of the following properties of the Khatri-Rao product:
vec A diag ( x ) B T = ( B A ) x ,
(2)
with A I × R , B J × R and x R , and
( A B ) H ( A B ) = A H A B H B ,
(3)

where denotes the Hadamard (element-wise) matrix product.

2 SFSM: transmitted signal model

We consider the uplink of a single-cell multicarrier multiuser MIMO system with Q active co-channel users transmitting data across the same set of F subcarriers. Each user terminal is equipped with M t transmit antennas and transmits R data streams. The base station is equipped with M r receive antennas. The proposed SFSM transmission structure is composed of three main operations: (i) space spreading, (ii) frequency spreading, and (iii) space–frequency block-coding. Figure 1 depicts the block diagram of the transmitter structure by focusing on the transmission of the n th symbol of the r th data stream. For notational simplicity, we begin by limiting ourselves to a single-user transmission model in order to facilitate the presentation. Later on, we show that the multiuser signal model is readily obtained with minor changes in notation.
Figure 1

SFSM transmitter block-diagram.

2.1 Space-domain spreading

The input symbol sequence is serial-to-parallel converted into R data streams, each one being constituted by N symbols. For the n th symbol period, let us define s n,r as the n th symbol of the r th data stream. The first operation is the space spreading, which consists in spreading each data stream on the M t transmit antennas using a different code. Let us define Ω [ Ω · 1 , , Ω · r , , Ω · R ] M t × R as the matrix collecting the code vectors of the R data streams. The space-domain spread signal is defined by the third-order tensor S ̄ M t × N × R , the (m t ,n,r)th element of which is given by
s ̄ m t , n , r = ω m t , r s n , r ,
(4)

and represents the n th space spread symbol of the r th data stream transmitted by the M t th antenna.

For the space-domain spreading matrix Ω, we choose a Vandermonde design with complex generators ρ m t = e ȷ 2 π ( m t 1 ) / max ( M t , R ) , m t =1,…,M t , i.e.
Ω ( ρ 1 , , ρ M t ) 1 M t 1 1 1 1 ρ 2 ρ 2 R 1 1 ρ M t ρ M t R 1 .
(5)

As shown in [24], the Vandermonde structure minimizes an upper bound of the pairwise error probability at high signal-to-noise ratios (SNRs). Moreover, this structure yields a good coding gain and makes the transmission more robust to ill-conditioned/rank-deficient MIMO channels [25].

2.2 Frequency-domain spreading

The second operation consists in jointly spreading and coding each component s ̄ m t , n , r in the frequency-domain. This operation is implemented by means of linear precoding, which adds transmit redundancy in the frequency-domain before the multicarrier modulation. Each data symbol is transmitted simultaneously (in parallel) on different subcarriers in a way similar to an MC-CDMA system with frequency-domain spreading [26]. In addition to provide frequency diversity gains, frequency-domain spreading adds resilience to symbol detection even in the presence of a deep channel fade over one or more subcarrier channels.

Let Θ [ Θ · 1 , , Θ · r , , Θ · R ] F × R be the frequency spreading matrix. The output of this frequency spreading operation is given by
s ~ f , m t , n , r = θ f , r s ̄ m t , n , r = θ f , r ω m t , r s n , r ,
(6)

which is the (f,m t ,n,r)th element of the fourth-order tensor S ~ F × M t × N × R representing the space–frequency spread signal s n,r associated with the n th symbol period and r th data stream.

The frequency spreading can be redundant (F>R) or not (FR). As for the space-domain spreading, here we also choose Θ as a Vandermonde matrix with complex generators ν f =e ȷ 2π(f−1)/max(F,R),f=1,…,F, i.e.
Θ ( ν 1 , , ν F ) 1 F 1 1 1 1 ν 2 ν 2 R 1 1 ν F ν F R 1 .
(7)

The reason for choosing the Vandermonde structure for the frequency spreading matrix follows that of the space spreading matrix. Some designs for Θ have been reported in the literature (we refer the interested reader to [27] for further details).

Note that spreading in the space-domain consists in multiplying the symbol s n,r by a complex code that depends on the transmit antenna number M t while spreading in the frequency-domain results in a multiplication of the same symbol by a complex code that depends on the frequency number f, as shown in (6).

2.3 Space-frequency multiplexing

The third operation of the SFSM transmitter consists in a multiplexing of the R space–frequency spread symbols. Using conventional direct sequence (DS) spreading, each space–frequency symbol s ~ f , m t , n , r is spread by a factor P using a specific spreading code. Due to spectrum spreading at the subcarrier level, each subcarrier signal constitutes a DS spread signal. Consequently, the frequency spectrum associated with each subcarrier is allowed to overlap in order to achieve high spectral efficiency.

Denote C [ C · 1 , , C · r , , C · R ] P × R as the spreading code matrix the columns/rows of which belong to a (possibly truncated) Walsh–Hadamard (WH) code matrix. When PR, we form C by selecting the P first rows of an R×R WH matrix. Each spreading code vector is applied with the chip period T c =T/P, where T corresponds to the OFDM symbol duration. The proposed space–frequency multiplexing operation consists in summing up R DS spread signals, each one of which being obtained by multiplying s ~ f , m t , n , r by the corresponding spreading code c p,r . Therefore, this operation yields a multi-stream signal tensor Z F × M t × N × P whose typical element is given by
z f , m t , n , p = r = 1 R s ~ f , m t , n , r c p , r .
(8)

2.4 Multicarrier modulation

Before being transmitted, the space–frequency multiplexed signal passes through the OFDM modulator. Considering a frequency selective wireless link between each transmit-receive antenna pair, define L max as the maximum length of the impulse response of all the channels, including the effects of the physical channel, and pre-/post-filtering at transmitter and receiver. An inverse fast Fourier transform (IFFT) is applied and a cyclic prefix (CP) of L max chips is appended to the resulting time-domain samples. Let Ξ = T cp F H J × F be a matrix representing the combined IFFT and CP-adding operation, where F F × F is an FFT matrix, with [F] k,f =e ȷ 2π(k−1)(f−1)/F , T cp = [ I cp T , I F ] T J × F is the CP-adding matrix, J=F+L max, and I cp is the matrix formed from the L max last rows of I F , the identity matrix of order F. The output of the IFFT+CP-adding block corresponding to the transmitted signal is given by the following tensor transformation:
x j , m t , n , p = k = 1 F ξ j , k z k , m t , n , p , j = 1 , , J.
(9)

where ξ j,k =[Ξ] j,k and x j , m t , n , p is a typical element of the transmitted signal tensor X J × M t × N × P .

3 SFSM: received signal model

The block diagram of the receiver is depicted in Figure 2. We adopt a discrete-time baseband equivalent model for the received signal in the SFSM MIMO system, assuming perfect chip- and symbol-level synchronization at the receiver. Following the tensor notation used in the previous section, the fourth-order tensor V J × M r × N × P representing the time-domain received signal in absence of noise1 is defined as:
v j , m r , n , p = m t = 1 M t j = 1 J h ̇ j j , m r , m t x j , m t , n , p = m t = 1 M t k = 1 F j = 1 J h ̇ j j , m r , m t ξ j , k z k , m t , n , p ,
(10)
Figure 2

Receiver block diagram.

where h ̇ j , m r , m t is an element of the tensor ̇ J × M r × M t , H ̇ · m r m t J × 1 being the impulse response of the channel linking the M r th receive antenna to the M t th transmit antenna.

The time-domain samples v j , m r , n , p pass through the combined FFT and CP-removal (CPR) block, represented here by Ξ ̄ = FR cp F × J , where R cp = [ 0 F × L max , I F ] F × J is the CPR matrix. This yields the following received signal tensor Y F × M r × N × P :
y f , m r , n , p = j = 1 J ξ ̄ f , j v j , m r , n , p .
(11)
Using (10), we can rewrite (11) as
y f , m r , n , p = m t = 1 M t k = 1 F j = 1 J j = 1 J ξ ̄ f , j h ̇ j j , m r , m t ξ j , k h f , k , m r , m t z k , m t , n , p ,
(12)
where h f , k , m r , m t corresponds to the end-to-end (frequency-domain) channel tensor F × F × M r × M t that results from the combined FFT+CPR and IFFT+CP transformations at the receiver and transmitter, respectively. Note that h f , k , m r , m t is zero for all fk. In matrix notation, this can be seen by noting that the matrix slice H ̈ · · m r , m t F × F of ̈ , defined by [ H ̈ · · m r , m t ] f , k h f , k , m r , m t , has a diagonal structure [28]. Consequently, we can simplify (12) by eliminating the summation over index k, yielding
y f , m r , n , p = m t = 1 M t h f , f , m r , m t z f , m t , n , p .
(13)
Finally, using (6) and (8), we can rewrite (13) as:
y f , m r , n , p = m t = 1 M t r = 1 R h f , f , m r , m t θ f , r ω m t , r s n , r c p , r .
(14)

In the next section, we show how the tensor model (14) satisfied by the received signals can be cast into a PARAFAC model by contracting the first two modes of the transmitted and received signal tensors. Our motivation behind the use of PARAFAC modeling comes from the possibility of studying identifiability by resorting to the well-known results available in the literature.

3.1 PARAFAC model formulation

In its general form, the PARAFAC decomposition amounts to decomposing the third-order tensor X I 1 × I 2 × I 3 into a sum of R rank-one third-order tensors [21]. It has the following scalar representation
x i 1 , i 2 , i 3 = r = 1 R a i 1 , r ( 1 ) a i 2 , r ( 2 ) a i 3 , r ( 3 )
(15)

where a i n , r ( n ) is the entry (i n ,r) of the n th mode matrix factor A ( n ) I n × R , n=1,2,3. When R is minimal, it is called the rank of X .

Starting from the space–frequency block-coded signal (8), let us contract the first two modes of the coded signal tensor Z F × M t × N × P as m=(f−1)M t +m t , with M=F M t , and define the space–frequency spreading matrix U M × R such as
u m , r = ω m t , r θ f , r U · r = Θ · r Ω · r U = Θ Ω .
(16)
Then, Equations (6), (8), and (16) lead to the following contracted signal tensor:
z ̄ m , n , p = r = 1 R u m , r s n , r c p , r ,
(17)

which corresponds to a third-order PARAFAC model for the transmitted signal tensor Z ̄ M × N × P , with matrix factors (U,S,C).

Following the same reasoning, let us now contract the first two modes of the received signal tensor Y F × M r × N × P by defining i=(f−1)M r +m r , with I=F M r . Combining this contraction with the one introduced for the transmitted signal tensor Z ̄ M × N × P and using (17), we get the following contracted received signal tensor Y ̄ I × N × P :
y ̄ i , n , p = m = 1 M h ̄ i , m z ̄ m , n , p = r = 1 R m = 1 M h ̄ i , m u m , r s n , r c p , r ,
(18)
where H ̄ I × M is a channel matrix obtained from a double contraction of the end-to-end channel tensor F × F × M r × M t such as [ H ̄ ] i , m = [ H ̄ ] ( f 1 ) M r + m r = h ( f 1 ) M t + m r = h f , f , m r , m t . Defining G C I × R with element g i , r = m = 1 M h ̄ i , m u m , r as the effective MIMO channel linking the R multiplexed data streams at the transmitter to the I=F M r equivalent subchannel outputs at the receiver, the tensor Y ̄ can be rewritten element-wise as
y ̄ i , n , p = r = 1 R g i , r s n , r c p , r ,
(19)
which corresponds to a third-order PARAFAC model for the contracted received signal tensor Y ̄ . The final step is to determine an adequate expression for the factorization of the effective MIMO channel matrix G. From the definition of g i,r and the expression (16) of U, we get
G = H ̄ U = H ̄ ( Θ Ω ) I × R .
(20)

Note that the contracted received signal tensor Y ̄ I × N × P given by (19) follows a PARAFAC model with matrix factors ( H ̄ ( Θ Ω ) , S, C). In fact, models (17) and (19) for the transmitted and received signal tensors, respectively, differ only in their first-mode matrix factors, which are related by (20).

For the model (19), we have the following matrix representations:
Y ̄ 1 = ( C G ) S T C PI × N ,
(21)
Y ̄ 2 = ( G S ) C T C IN × P ,
(22)
Y ̄ 3 = ( S C ) G T C NP × I ,
(23)

where [ Y ̄ 1 ] ( p 1 ) I + i , n = [ Y ̄ 2 ] ( i 1 ) N + n , p = [ Y ̄ 3 ] ( n 1 ) P + p , i = y ̄ i , n , p .

3.2 Multiuser case

The extension of the transmitted and received signal models to the multiuser MIMO case is straightforward. Let us assume that Q users are transmitting to the base station (uplink transmission) and that all users have the same number M t of transmit antennas, M r denoting the number of receive antennas at the base station. The multiuser signal model follows that of the single-user case by considering a block-partitioned notation. In the multiuser case, the total number of transmitted data streams (summed over all the users) is equal to R=R (1)++R (Q), where R (q) denotes the number of space–frequency spread data streams transmitted by the q th user. With these definitions, the received signal model (19) can be rewritten as follows
y ̄ i , n , p = q = 1 Q r ( q ) = 1 R ( q ) g i , r ( q ) ( q ) s n , r ( q ) ( q ) c p , r ( q ) ( q ) .
(24)
In this case, the mode-1 unfolded matrix representation of (24) is given by
Y ̄ 1 = q = 1 Q ( C ( q ) G ( q ) ) S ( q ) T = C ( 1 ) G ( 1 ) , , C ( Q ) G ( Q ) S ( 1 ) T S ( Q ) T = ( C G ) S T ,
(25)

where S = [ S ( 1 ) , , S ( Q ) ] N × R , C = [ C ( 1 ) , , C ( Q ) ] P × R , G = [ G ( 1 ) , , G ( Q ) ] I × R . Therefore, the PARAFAC model (17) is equally valid for the multiuser case by simply interpreting its factor matrices as block-matrices.

3.3 Special cases

The proposed structured PARAFAC model (19) of the received signal is general in the sense that it incorporates several existing multiple-access/multiple-antenna signaling schemes. By making appropriate assumptions, the proposed model can gradually be simplified, so that we obtain different tensor-based transceiver models as special cases:

  • Space–time spreading CDMA (STS-CDMA): For F=1, which corresponds to a single-carrier transmission over a flat-fading channel, we can abandon the frequency-dependent index and eliminate the frequency spreading matrix Θ = 1 R T , so that G = H ̄ Ω . Thus, the trilinear model (21) reduces to classical space–time spreading using multiple spreading codes and can be written as:
    Y ̄ 1 = ( C H ̄ Ω ) S T P M r × N .
    (26)
  • This model is valid for modeling the multiple-antenna transmission systems proposed in [25, 29].

  • Spatial multiplexing CDMA (SM-CDMA): In SM-CDMA systems, the space spreading operation (which is responsible for spreading R data streams across M t transmit antennas) is eliminated. In other words, each data stream is transmitted by a different transmit antenna. Still considering F=1, in this case we have R=M t , Ω = I M t , and Θ = 1 R T , which implies G = H ̄ , and model (21) becomes:
    Y ̄ 1 = ( C H ̄ ) S T P M r × N .
    (27)
  • This model covers a spatial multiplexing/multiple-access CDMA system using a different spreading code per transmit antenna [2], and is the same as the PARAFAC-CDMA model proposed in the seminal paper [20]. It also coincides with the Khatri-Rao space–time (KRST) coding model of [13].

  • Multicarrier CDMA systems (MCBS-CDMA /MCDS-CDMA/ MC-CDMA): We consider the transmission model of a MCDS-CDMA system where frequency-domain spreading and orthogonal multiplexing take place (e.g. see [26, 30]). This is a single-input single-output (SISO) antenna system (M r =M t =1), which means that the channel matrix H ̄ reduces to an F×F diagonal matrix, and we can eliminate the space spreading matrix Ω = 1 R T so that G = H ̄ Θ C F × R . Consequently, the general PARAFAC model (21) becomes:
    Y ̄ 1 = ( C H ̄ Θ ) S T PF × N .
    (28)
  • It is worth noting that this special model can be interpreted as the tensorial formulation of the MCBS-CDMA system proposed in [9]. In particular, if frequency-domain spreading is not used, we have Θ=I R so that (28) reduces to a PARAFAC model for a MCDS-CDMA system with direct-sequence spectrum spreading at the subcarrier level [7]. In the SISO case, where H ̄ F × F is diagonal, if space–frequency block-coding is not used (P=1 and C = 1 R T ), then (28) reduces to traditional MC-CDMA, and we have:
    Y ̄ 1 = H ̄ Θ S T F × N .
    (29)
  • Conventional spatial multiplexing: This is the well-known single-user single-carrier MIMO system with spatial multiplexing (such as the V-BLAST system of [31]). Then, we have F=P=1, R=M t , and C = Θ = 1 R T , Ω = I M t . In this case, the general PARAFAC model (21) simplifies to the conventional matrix-based model:
    Y ̄ 1 = H ̄ S T M r × N .
    (30)
Table 1 summarizes the different special cases covered by the proposed tensor model. It allows us to deduce how the proposed tensor model parameters and the structure of the associated matrix factors are adjusted to model different existing systems in a tensorial form.
Table 1

Equivalent tensorial formulation for different systems

Systems

( F,M t , R,M r )

Θ

Ω

Rx signal

Matrix factors

STS-CDMA [25, 29]

(1,M t ,R,M r )

1 R T

Full

Y M r × N × P

( H ̄ Ω , S , C )

SM-CDMA [2]/KRST [13]

(1,M t ,M t ,M r )

1 R T

I M t

Y M r × N × P

( H ̄ , S , C )

MCBS-CDMA [9]

(F,1,R,1)

Full

1 R T

Y F × N × P

( H ̄ Θ , S , C ) a

MCDS-CDMA [7]

(F,1,R,1)

I R

1 R T

Y F × N × P

( H ̄ , S , C ) a

MC-CDMAb[5]

(F,1,R,1)

Full

1 R T

Y ̄ 1 F × N

( H ̄ Θ , S , 1 R T ) a

Spatial multiplexingb[31]

(1,M t ,M t ,M r )

1 R T

I M t

Y ̄ 1 M r × N

( H ̄ , S , 1 R T )

aTensor models with diagonal channel matrix H ̄ F × F .

bSystems in which the received signal model is reduced to a matrix (bilinear) decomposition.

Remark 1 (subcarrier grouping)

In order to reduce the complexity of the receiver, we can resort to subcarrier grouping [32, 33]. It consists in dividing the set of F subcarriers into μ nonintersecting subsets of K equispaced subcarriers, where K can be chosen equal to the number of independent multipaths. Since both F and K can be viewed as system design parameters, we choose them so that μ=F/K is an integer. Information recovery can be carried out independently within each subcarrier group at the receiver (after FFT demodulation). This low-complexity detection strategy will be considered later in our simulations. We have chosen to not explicitly model subcarrier grouping in order to avoid unnecessary complicated mathematical notation in the formulation of the transmitted and received signal models.

4 ZF receiver

Assuming that the channel ( H ¯ ), code (C), and spreading (Ω,Θ) matrices are known at the receiver, we propose a ZF receiver that simultaneously estimates all the R transmitted data streams by means of a joint block-decoding and an equalization without de-spreading. The ZF receiver is based on Equation (21). It minimizes the least squares (LS) criterion Y ̄ 1 ( C G ) S T 2 with respect to the symbol matrix, giving a simultaneous estimate of the R data streams as:
S ̂ T = W Y ̄ 1 ,
(31)
where
W = ( C G ) R × PF M r .
(32)

Since C G PF M r × R must be full column-rank to be left-invertible, the ZF receiver requires that P M r FR.

From the structure of (32), we can observe that the ZF receiver does not require code-orthogonality to jointly estimate the transmitted signals. In Section 5, we propose a PARAFAC-based receiver that can blindly operate, i.e. without a priori knowledge of the space–frequency MIMO channel.

4.1 Space–frequency linear combiner

Note that, under the condition PR, the column-orthonormality of C turns the ZF receiver into a simpler space–frequency linear combiner that avoids matrix inversion and decodes each transmitted data stream separately. Indeed, if C has orthonormal columns, we have C H C=I R . By expanding W in (32) and using property (3), we get
W = ( C G ) H ( C G ) 1 ( C G ) H = C H C G H G 1 ( C G ) H = ( I R G H G ) 1 ( C G ) H
Since the Hadamard product I R G H G eliminates the off-diagonal elements of G H G, we have
W = G · 1 H G · 1 γ 1 G · R H G · R γ R 1 ( C G ) H ,
(33)
so that
S ̂ · r T = 1 γ r ( C · r G · r ) H Y ̄ 1 , r = 1 , , R.
(34)

5 Semi-blind ALS receiver

The goal of the base station receiver is to separate the co-channel transmissions while recovering the data transmitted by each user. In our proposed SFSM MIMO system, co-channel transmissions are represented by the R data streams accessing simultaneously the space, time, and frequency channel resources. We are interested in a semi-blind receiver that neither requires prior knowledge, or estimation, of channel and antenna array responses, nor relies on statistical independence between the transmitted signals. These properties are distinguishing features of the PARAFAC modeling and constitute the main motivation for using the unified tensor model.

Moreover, the proposed receiver is called semi-blind in the sense that it relies only on a single pilot symbol inserted at the beginning of each data stream. This pilot symbol is used to remove the scaling factor introduced by the estimation process.

We now study the joint symbol-code-channel recovery by capitalizing on the fundamental uniqueness property of the PARAFAC model (19). This property allows to establish several practical corollaries, which provide lower bounds on the required number of transmit/receive antennas, subcarriers, symbol periods, and the spreading length for ensuring a semi-blind symbol-code-channel estimation. They also clearly illustrate the underlying tradeoffs involving space, frequency, and code diversities.

Let us rewrite the three unfolded matrices of the received signal in (21), (22), and (23), in the following manner
Y ̄ 1 = Z ( c , g ) S T , Y ̄ 2 = Z ( g , s ) C T , Y ̄ 3 = Z ( s , c ) H ̄ T ,
(35)
where Z ( c , g ) = C G PF M r × R , Z ( g , s ) = G S F M r N × R , and Z ( s , c ) = ( S C ) ( Θ Ω ) T NP × F M t , where we have used the factorization of G defined in (20). Identifiability of the symbol, code, and channel matrices in the LS sense from factorizations (35) requires that Z (c,g), Z (g,s), and Z (s,c) be full column-rank, which implies
min ( PF M r , F M r N ) R , and NP R F M t .
(36)

The first inequality comes from the full column-rank requirement of CG and GS, while the second one comes from the full column-rank requirement of (SC)(ΘΩ) T . These necessary conditions are useful when one is interested in eliminating system configurations leading to a non-identifiable model. We emphasize that conditions (36) do not imply model identifiability since it is not a sufficient condition.

In the following, we start from the Kruskal’s condition for the essential uniqueness of the PARAFAC decomposition [34] and then deduce simplified conditions by considering different special cases of practical interest. Directly applied to model (19), Kruskal’s condition states that G, S, and C can uniquely be estimated up to column permutation and scaling ambiguities2 from the received data tensor Y ̄ if
k G + k S + k C 2 R + 2 ,
(37)

where k (·) denotes the Kruskal-rank3 of a matrix.

Assume that G = H ̄ U is full rank. If the number N of symbols is large enough compared to the number R of data streams, the symbol matrix S is likely to be full rank. Note also that the space–frequency multiplexing matrix C has orthogonal columns and is full rank by definition. Taking these considerations into account, Kruskal’s condition can be written as [34, 35]:
rank ( G ) + rank ( S ) + rank ( C ) 2 R + 2 .
(38)

We now use the fact that G = H ̄ U , with U given in (16) and consider particular cases leading to simplifications of (38) which are of practical relevance for the unified SFSM MIMO system. Interesting tradeoffs for joint symbol-channel-code estimation can explicitly be obtained.

5.1 Single-carrier transmission (F=1)

  1. 1.
    M r M t ̲
    . We have G = H ̄ Ω . Assuming that H ̄ is full column-rank and Ω is full rank due to its Vandermonde structure, it follows that rank(G)=rank(Ω)=min(M t ,R), and (38) becomes:
    min ( M t , R ) + min ( N , R ) + min ( P , R ) 2 R + 2 .
    (39)
     
  2. 2.
    R M t ̲
    . In this case Ω is full row-rank due to its Vandermonde structure. Assuming that H ̄ is modeled by i.i.d entries (which corresponds to scattering-rich propagation) and thus is full rank, it follows that rank ( G ) = rank ( H ̄ ) = min ( M r , M t ) , which implies:
    min ( M r , M t ) + min ( N , R ) + min ( P , R ) 2 R + 2 .
    (40)
     
These two conditions (39) and (40) have interesting practical corollaries. Assuming that the number of symbols and the code spreading factors are large enough (i.e., both S and C are full column-rank), they become, respectively,
min ( M t , R ) 2 , ( M r M t )
(41)
and
min ( M r , M t ) 2 , ( R M t ) ,
(42)

and can be interpreted in the following way.

Corollary 1

For M r M t , spreading across M t =2 transmit antennas is sufficient for joint symbol-code-channel recovery, regardless of the number R≥2 of data streams, for large enough number of symbols and code spreading factors.

Corollary 2

For RM t , M r =2 receive antennas are sufficient for joint symbol-code-channel recovery, regardless of the number M t ≥2 of transmit antennas, for large enough number of symbols and code spreading factors.

5.2 Single-antenna transmission (M t =1)

In this case, H ̄ F M r × F is full column-rank, and we have G = H ̄ Θ . Moreover, considering that Θ is full rank due to its Vandermonde structure, we have rank(G)=rank(Θ)=min(F,R), which implies:
min ( F , R ) + min ( N , R ) + min ( P , R ) 2 R + 2 .
(43)
Now, assuming that S and C are full column-rank (i.e., NR and PR), condition (43) is equivalent to:
min ( F , R ) 2
(44)

and we obtain:

Corollary 3

For M t =1, spreading across F=2 subcarriers is sufficient for joint symbol-code-channel recovery, regardless of the number R≥2 of data streams, for large enough number of symbols and code spreading factors.

Note that this condition is independent on the number M r of receive antennas, which means that joint symbol-code-channel recovery is achieved even with one receive antenna. This clearly illustrates the tradeoff between frequency diversity and space diversity at the receiver, which is inherent to this trilinear PARAFAC model.

5.3 Small spreading lengths (P<R)

A different interpretation of (39) and (40) arises if S is full column rank, but P<R, i.e., the spreading length is smaller than the number R of data streams. This is a challenging situation, since most of the multiuser receivers (as well as the single-user one) need PR in order to achieve multiuser interference rejection or de-spreading. In this case, for single-carrier transmissions (F=1), conditions (39) and (40) reduce, respectively, to the following ones:
min ( M t , R ) + P R + 2 ,
(45)
and
min ( M r , M t ) + P R + 2 .
(46)

The simplified condition (45) results in the following corollary:

Corollary 4

For M r M t R, spreading across P=2 chips is sufficient for joint symbol-code-channel recovery, regardless of the number R≥2 of data streams and receive antennas.

This condition establishes a tradeoff between code diversity (spreading length) and space diversity afforded by the proposed trilinear PARAFAC modeling.

Remark 2

When subcarrier grouping is used, receiver processing is parallelized into μ independent detection “layers”, each one associated with K=F/μ subcarriers. For this reason, identifiability can be studied group-wise (i.e., what matters for identifiability is K and not F) since the results obtained for a given subcarrier group are equally valid for all the other groups.

It is worth mentioning that uniqueness conditions more relaxed than Kruskal’s one have been reported in [36, 37], and can be applied to our PARAFAC model. For instance, it is common to assume that the symbol matrix S is full column-rank for sufficiently large N. In this case, applying the sufficient condition derived in [37] to model (19) gives the following uniqueness condition:
PF M r ( P 1 ) ( F M r 1 ) 2 R ( R 1 ) .
(47)

Note that this condition is more relaxed than Kruskal’s condition (37). In connection with [36], it is shown in [37] that this condition is valid if G and C are randomly sampled from an (F M r +P)R-dimensional continuous distribution. In a recent work [38], a mathematical proof is provided to the case of non-random G and C matrices.

5.4 Receiver algorithm

The symbol-code-channel recovery is carried out by estimating each one of the three matrix factors S, C, and G of the trilinear PARAFAC model (19) through the minimization of the following nonlinear cost function:
f ( G , S , C ) = n = 1 N p = 1 P i = 1 F M r y ̄ i , n , p r = 1 R g i , r s n , r c p , r 2 .
(48)
In this study, we propose the use of the ALS algorithm [20, 39, 40], which is the classical solution to minimize this cost function. It exploits the Khatri-Rao factorizations (21)–(23) of the unfolded matrix representations of the received signal tensor, by alternating among the estimation of G, S, and C. These estimates are found by, respectively, optimizing the three following LS criteria:
S ̂ = argmin S Y ~ 1 ( C G ) S T F 2 ,
(49)
C ̂ = argmin C Y ~ 2 ( G S ) C T F 2 ,
(50)
G ̂ = argmin G Y ~ 3 ( S C ) G T F 2 ,
(51)

where Y ~ i = Y ̄ i + B i , i=1,2,3, is the noisy version of Y ̄ i , and B i is a matrix representing the additive complex-valued white Gaussian noise.4 We can rely on the knowledge of the space and frequency spreading matrices Θ and Ω to directly obtain an LS estimate of H ̄ ̂ , provided that the second inequality of (36) is satisfied, i.e., if RF M t . From (51), and using (20), we have H ̄ ̂ T = ( S C ) ( Θ Ω ) T Y ~ 3 . On the other hand, if R<F M t , a unique estimation of H ̄ is not guaranteed, although we can still estimate S, C and G from (49), (50), and (51), respectively.

The ALS algorithm always monotonically converges to (at least) a local minimum. Convergence to the global minimum can sometimes be slow if all the matrix factors H ̄ , S, and C are unknown. Several alternative algorithms have been proposed in the literature to alleviate the slow convergence problems caused by a random initialization of the algorithm. For instance, an eigenanalysis solution based on compression of the tensor dimensions can be used [20]. The study of [37] proposes a generalization of the eigenanalysis solution by means of simultaneous matrix diagonalization. The convergence can also be improved by means of enhanced line search [41, 42] or, using a nonlinear optimization algorithm such as the Levenberg–Marquardt algorithm [43]. The ALS algorithm rapidly converges when one of the three matrix factors of the model is known. This is typically the case in the SFSM MIMO system when relying on the knowledge of the code and spreading matrices (C,Ω,Θ).

After convergence of the ALS algorithm, the estimated matrix factors S ̂ , C ̂ , and H ̄ ̂ are affected by unknown scaling factors. In order to eliminate the scaling ambiguity from the columns of S ̂ , thus leading to an unambiguous symbol recovery, we assume that “all ones” pilot symbols are introduced at the beginning of the transmission, i.e., at the first symbol of all the data streams. Mathematically speaking, this means that the first row of the symbol matrix is given by S 1 · = [ 1 1 1 ] 1 × R . A final estimate of the symbol matrix is therefore obtained in the following manner:
S ̂ ̂ = S ̂ D 1 ( S ̂ ) 1 ,

where D 1 ( S ̂ ) is the diagonal matrix formed from the first row of S ̂ .

In principle, the ALS receiver is capable of processing a higher number of users as long as condition (38) is satisfied. Regarding the computation complexity, three matrix inverses are performed at each iteration of the algorithm. The asymptotic complexity is therefore O(R 3) per iteration. Consequently, a joint detection of a very large number of users can be prohibitive. This is generally a common limitation of multiuser detection receivers. Note that the computational complexity can be reduced if users’ codes are mutually orthogonal. In this case, their symbol matrices can be estimated separately using (34).

6 Simulation results

We simulated a system operating at a transmission rate of R c =1/T c =4.096×106 chips per second (cps), using a total of F=64 subcarriers divided into μ groups of K subcarriers each. Note that F=64 is a fixed parameter, while K is a transmission design parameter (now representing the frequency spreading length) that will be varied in our simulations. Due to subcarrier grouping, at each symbol period, R symbols belonging to R different data streams are transmitted using μ groups of K subcarriers. In all simulations, we assume the transmission of N=10 symbols per data stream. In order to avoid interference between adjacent subcarriers, a guard interval in the form of a CP is appended to each OFDM symbol [5]. Perfect time and frequency synchronization is assumed. Table 2 summarizes the SFSM MIMO system parameters.
Table 2

System parameters

Chip rate

4.096 ×106 cps

Number of subcarriers (F)

64

Number of subcarriers per group (K)

2 or 4

Number of subcarriers groups (μ)

32 or 16

CP length

5 (Chan. A)/20 (Chan. B)

Number of symbols per data stream (N)

10

Modulation

QPSK

At each run, the transmitted symbols are randomly drawn from a quaternary phase shift keying (QPSK) alphabet. The channel is assumed quasi-static, which means that the channel impulse responses do not change during the N symbol periods. Each plotted bit error rate (BER) curve is shown as a function of an overall SNR measure, given by
SNR = 10 log 10 Y F 2 F 2

where F × M r × N × P is the additive noise tensor, whose entries are circularly symmetric complex Gaussian random variables. Note that this SNR measure takes all the received signal dimensions into account, i.e., the number F of subcarriers, the number M r of receive antennas, the number N of symbol periods, and the spreading length P. At each run, the additive noise power is generated according to this SNR measure. The BER curves represent the performance averaged over the R transmitted data streams and 1,000 independent Monte Carlo runs.

We adopt two frequency selective channel models for modeling the channel between each pair of transmit and receive antennas. Both are ITU’s outdoor-to-indoor models, and are valid for typical urban propagation environments: (i) the 4-ray pedestrian channel A and (ii) the 6-ray pedestrian channel B [44]. The channel parameters are summarized in Tables 3 and 4. Note that, for channel A, the maximum multipath delay is τ max=410 ns, so that the maximum channel impulse response memory is L max=τ max/T c =2 chip samples. We chose a CP length of 5 chips when considering channel A. For channel B, the maximum multipath delay is τ max=3700 ns, so that maximum channel impulse response memory has L max=τ max/T c =15 chip samples. We chose a CP length of 20 chips when the channel B is simulated.
Table 3

Parameters of the ITU pedestrian channel A

Path

Excess delay (ns)

Average relative power (dB)

1

0

0

2

110

−9.7

3

190

−19.2

4

410

−22.8

Table 4

Parameters of the ITU pedestrian channel B

Path

Excess delay (ns)

Average relative power (dB)

1

0

0

2

200

−0.9

3

800

−4.9

4

1200

−8.0

5

2300

−7.8

6

3700

−23.9

In the following simulation results, the maximum number of iterations allowed for the ALS algorithm is fixed to 1000. Thus, for each Monte Carlo run, we assume that the algorithm has converged at the t th iteration when |e (t)e (t−1)|10−4 for t≤1000, where e(t) is the error between the received signal tensor and its reconstructed version obtained from the estimated matrices S ̂ ( t ) , C ̂ ( t ) , and H ̄ ̂ ( t ) . By exploiting the knowledge of the spreading codes, convergence is typically achieved within a few iterations. In a more challenging situation where the spreading codes are unknown, the convergence speed is much slower. In this situation, we make use of eigenanalysis to initialize the ALS algorithm [20], and we have discarded 1% of the total number of runs for the BER calculation, corresponding to inevitable non-convergent runs, typical in ALS-type algorithms due to their sensitivity to initialization [40]. As an illustrative example, we have simulated a system with M t =M r =2,K=2,P=8,N=10,R=Q=8 (i.e., R (q)=1,q=1,…,Q) and SNR = 30 dB. For this system configuration, Figure 3 depicts an histogram of the required number of iterations for convergence of the ALS algorithm. The histogram was based on 100 Monte Carlo runs. In this example, 92% of the runs have converged within the first 1,000 iterations.
Figure 3

ALS algorithm: histogram of the number of iterations for convergence.

6.1 Semi-blind ALS versus ZF receivers

The following simulation results illustrate the performance of the SFSM MIMO system using the ALS receiver described in Section 5.4. The main objectives are
  1. 1.

    To compare the performance of the semi-blind ALS receiver with that of the perfect ZF receiver;

     
  2. 2.

    To compare the SFSM MIMO system with other CDMA–MIMO systems when ALS estimation is used;

     
  3. 3.

    To evaluate the channel estimation accuracy as a function of the SNR.

     

All the simulations were performed assuming F=64 subcarriers divided into groups of K=2 or K=4 subcarriers.

As a reference for comparison, in Figure 4, we compare the performance of the semi-blind ALS receiver with that of the ZF receiver described in Section 4, which assumes perfect channel and code knowledge. Our aim is to determine the performance loss due to semi-blind receiver processing in the SFSM MIMO system. We assume M t =M r =2, K=2, P=8, N=10, Q=4, and R (q)=2, q=1,…,4. We can observe that the performance loss of the proposed receiver in comparison with the perfect ZF receiver is around 5 dB for channel A and 2 dB for channel B, for a BER equal to 10−3. In particular, the slope of the BER curves is approximately the same, which means that the proposed receiver presents the same BER improvement as the ZF receiver as a function of the SNR. Also, both receivers perform better with channel B due to the increased multipath diversity.
Figure 4

Comparison between semi-blind ALS and ZF receivers.

6.2 Performance for different system loads

The next results illustrate the performance of the proposed receiver for different system loads. From now on, the ITU channel B is considered in all the simulations. We assume M t =2,K=2,P=16, and N=20 while the number of users is varied (Q=4,6, and 8). Each user transmits two data streams (R (q)=2, q=1,…,Q). We assume M r =1 or 2. Note that these configurations are challenging in terms of receiver spatial diversity, since M r is always smaller than Q. Our aim is, therefore, to show that joint symbol-channel-code estimation is still possible in this situation thanks to the joint use of SFSM and PARAFAC modeling. Note that the sufficient uniqueness condition (38) is satisfied in the chosen configurations. In fact, as can be observed from Figure 5, semi-blind recovery of symbol, channel, and codes is achieved even when M r =1. For instance, with M r =2 receive antennas, increasing the number of users from Q=4 to Q=6, or from Q=6 to Q=8, implies nearly a 2-dB increase in the required SNR for a target BER of 10−2. We can also note that the BER performance is more sensitive to a variation in the system load when M r =2 receive antennas are used.
Figure 5

BER versus SNR with semi-blind ALS receiver(different system loads).

6.3 Comparison with the MCDS-CDMA system

The MCDS-CDMA system is a multicarrier extension of the classical DS-CDMA to frequency-selective channels, by performing the spreading operation in the time-domain at each subcarrier [7]. As shown in Section 3.3, the PARAFAC modeling is also valid to model the MCDS-CDMA system, which is a special case of the proposed SFSM MIMO system, where space and frequency spreadings are not used (i.e., M t =1 and K=1). We now compare the performance of both systems using the same PARAFAC-based ALS receiver with knowledge of the spreading codes. The perfect ZF receiver was also simulated for both systems as a reference for comparison. By comparing SFSM with MCDS-CDMA, we can verify the impact of space and frequency spreadings as a distinguishing feature of the SFSM MIMO system. Here, we assume M r =2,P=8,N=50, and Q=8, each user transmitting a single data stream (i.e., R (q)=1, q=1,…,8). Figure 6 shows the substantial performance gain obtained with the proposed system, which corroborates the advantages of space and frequency spreadings. We can also note that the gap between ALS and ZF receivers is smaller when SFSM MIMO is used.
Figure 6

SFSM versus MCDS-CDMA (ALS versus ZF receivers).

6.4 Comparison with the SSSMA system

In [10], an MC-SSSMA system was proposed to provide space and frequency diversities in the forward link of a MIMO wireless system. The space–frequency spreading model proposed therein is a generalization of [45] to frequency-selective channels. The multicarrier SSSMA system has some similarity with the proposed SFSM MIMO system in the sense that space and frequency-domain spreadings are performed. In [10], a joint space–time spreading is used by means of Hadamard codes (its structure is detailed in [11]), while our approach uses separate space and frequency spreadings using Vandermonde codes. In Figure 7, the performances of SSSMA and SFSM MIMO are compared. We assume M t =2 transmit antennas, M r =1 or 2, F=64 and K=2. For a fair comparison, we adjust the transmit parameters and the modulation to keep the same data rate for both systems. The SSSMA scheme assumes R=8, P=2, and BPSK. For the proposed SFSM scheme we have R=4, P=4, and 16-QAM. In this case, both schemes have a rate of 2 bits per channel use. For the SSSMA system, a ZF receiver with perfect channel knowledge is used. For the proposed SFSM MIMO system, a semi-blind estimation without channel knowledge is used. The spreading codes are assumed to be known at the receiver for both systems. Note that for M r =1, SSSMA exhibits a poor performance. This is due to the fact that multiuser detection in the SSSMA system requires M r M t . This constraint is not necessary in the SFSM MIMO system that makes an efficient use of the frequency diversity to separate the transmitted data streams when spatial diversity is not available at the receiver. For M r =2, SSSMA outperforms SFSM MIMO over the low-to-medium SNR range. For higher SNR values, the proposed system has superior performance. The slope of the BER curves indicates that the proposed SFSM scheme has a higher diversity gain.
Figure 7

SFSM MIMO (semi-blind receiver) versus SSSMA (perfect channel knowledge).

6.5 Channel estimation performance

The channel estimation accuracy of the semi-blind ALS receiver is now evaluated from a root mean square error (RMSE) measure obtained from 100 Monte Carlo runs. The overall RMSE is calculated using the following formula:
RMSE = 1 100 M t M r i = 1 100 H ̄ ̂ ( i ) H ̄ F 2 ,
where H ̄ ̂ ( i ) is the channel matrix estimated at the i th Monte Carlo simulation. The following system configuration is considered for the SFSM MIMO system: Q=1, M t =2, P=K=2, R=4, N=10, and M r =1 or 2. We can observe from Figure 8 that the RMSE has a linear decrease as a function of the SNR in both cases. Using M r =2 antennas provides a performance gain of 3 dB over the single receive antenna case. Such a gain obviously comes from the increased receiver spatial diversity that helps the separation of the data streams, despite the larger number of parameters to estimate.
Figure 8

RMSE of the estimated channel.

7 Conclusion

We have proposed a unified tensor model for MIMO communication systems with SFSM. The proposed model unifies several existing multiple-access/multiple-antenna communication systems. We have shown that the received signal can be formulated as a trilinear PARAFAC model, and capitalizing on its uniqueness property we have put in evidence lower bounds on the design parameters (number of transmit/receive antennas, subcarriers, symbols per data stream, and spreading length) for a joint symbol-code-channel recovery. The obtained conditions help the understanding of the existing tradeoffs involving space, frequency, and code diversities that are inherent to the SFSM MIMO system. The performance of the proposed receiver using a semi-blind ALS algorithm has been illustrated by means of computer simulations under realistic channel models and system parameters, and a comparison with other multiple-antenna CDMA-based systems has been made. Perspectives of this work include an investigation of the impact of different transmit antenna, spreading code, and subcarrier allocation schemes on the design and performance of the proposed tensor-based receiver. We believe that these features could be integrated into the SFSM system by modeling the received signals using a CONFAC tensor model [18]. In this case, identifiability can be investigated using the recently established results on the partial uniqueness of constrained tensor decompositions [46, 47]. The impact of non-perfect users’ synchronization on the receiver performance is also a subject for a future work.

Endnotes

1 For notational convenience, we omit the noise terms in the following developments. They will be added later, when the receiver algorithm is presented.

2 This means that any alternative triplet { G ~ , S ~ , C ~ } satisfying model (19) is related to the true triplet {G,S,C} by the following equalities: G ~ = G Π Δ 1 , S ~ = S Π Δ 2 , C ~ = C Π Δ 3 , where Π is a permutation matrix and Δ i , i=1,2,3, are diagonal (scaling) matrices such that Δ 1 Δ 2 Δ 3=I R .

3 The Kruskal-rank of A is equal to κ if every subset of κ columns of A is linearly independent.

4 See [20, 40] for further details about the ALS algorithm.

Declarations

Acknowledgements

This study was supported by the Ericsson Research and Development Centre, Ericsson Telecommunications S.A., Brazil. André L. F. de Almeida is partially supported by the CNPq and FUNCAP funding agencies.

Authors’ Affiliations

(1)
Department of Teleinformatics Engineering, Federal University of Ceará
(2)
I3S Laboratory, University of Nice-Sophia Antipolis, CNRS

References

  1. Paulraj AJ, Gore DA, Nabar RU, Bolcskei H: An overview of MIMO communications: a key to gigabit wireless. Proc. IEEE 2004, 92(2):198-218. 10.1109/JPROC.2003.821915View ArticleGoogle Scholar
  2. Huang H, Viswanathan H, Foschini GJ: Multiple antennas in cellular CDMA systems: transmission, detection, and spectral efficiency. IEEE Trans. Wirel. Commun 2002, 1(3):383-392. 10.1109/TWC.2002.800537View ArticleGoogle Scholar
  3. Stuber GR, Barry JR, Mclaughlin SW, Li Y, Ingram MA, Pratt TG: Broadband MIMO-OFDM wireless communications. Proc. IEEE 2004, 92(2):271-294.View ArticleGoogle Scholar
  4. Doostnejad R, Lim TJ, Sousa E: Space-time multiplexing for MIMO, multiuser downlink channels. IEEE Trans. Wirel. Commun 2006, 5(7):1726-1734.View ArticleGoogle Scholar
  5. Hara S, Prasad R: Overview of multicarrier CDMA. IEEE Commun. Mag 1997, 35(12):126-133. 10.1109/35.642841View ArticleGoogle Scholar
  6. Tulino AM, Li L, Verdú S: Spectral efficiency of MC-CDMA. IEEE Trans Inf. Theory 2005, 51(2):479-505. 10.1109/TIT.2004.840875View ArticleMATHGoogle Scholar
  7. DaSilva VM, Sousa ES: Multicarrier orthogonal CDMA signals for quasi-synchronous communication systems. IEEE J. Sel. Areas Commun 1994, 12(5):842-852. 10.1109/49.298058View ArticleGoogle Scholar
  8. Giannakis GB, Wang Z, Scaglione A, Barbarossa S: AMOUR-generalized multicarrier transceivers for blind CDMA regardless of multipath. IEEE Trans. Commun 2000, 48(12):2064-2076. 10.1109/26.891217View ArticleGoogle Scholar
  9. Petré F, Leus G, Moonen M, De Man H: Multi-carrier block-spread CDMA for broadband cellular downlink. EURASIP J. Adv. Signal Process 2004, 2004(10):1568-1584. 10.1155/S1110865704401048View ArticleGoogle Scholar
  10. Ng BK, Sousa ES: Multicarrier spread space-spectrum multiple access for the MIMO forward link transmission. In IEEE International Symposium on, Personal Indoor and Mobile Radio Communication (PIMRC). Lisbon, Portugal; 2002:1300-1304.View ArticleGoogle Scholar
  11. Ng BK, Sousa ES: SSSMA for multiuser MIMO systems. IEEE Microwave Mag 2004, 5: 61-71. 10.1109/MMW.2004.1306838View ArticleGoogle Scholar
  12. Yang L-L, Hanzo L: Broadband MC DS-CDMA using space-time and frequency-domain spreading. In IEEE Vehicular Technology, Conference (VTC Fall). Vancouver, Canada, 2002); 1632-1636.Google Scholar
  13. Sidiropoulos ND, Budampati R: Khatri-Rao space-time codes. IEEE Trans. Signal Process 2002, 50(10):2377-2388.MathSciNetView ArticleGoogle Scholar
  14. de Baynast A, De Lathauwer L, Aazhang B: Blind PARAFAC receivers for multiple access-multiple antenna systems. In IEEE Vehicular Technology, Conference (VTC) Fall Edition. Orlando, USA; 2003:1128-1132.Google Scholar
  15. de Almeida ALF, Favier G, Mota JCM: Multiuser MIMO system using block space-time spreading and tensor modeling. Elsevier Signal, Process 2008, 88(10):2388-2402. 10.1016/j.sigpro.2008.03.020View ArticleMATHGoogle Scholar
  16. de Almeida ALF, Favier G, Mota JCM: Space-time spreading MIMO-CDMA, downlink system using constrained tensor modeling. Elsevier Signal, Process 2008, 88(10):2403-2416. 10.1016/j.sigpro.2008.03.022View ArticleMATHGoogle Scholar
  17. de Almeida ALF, Favier G, Mota JCM: Constrained tensor modeling approach to blind multiple-antenna CDMA schemes. IEEE Trans. Signal Process 2008, 56(6):2417-2428.MathSciNetView ArticleGoogle Scholar
  18. de Almeida ALF, Favier G, Mota JCM: A constrained factor decomposition with application to MIMO antenna systems. IEEE Trans. Signal Process 2008, 56(6):2429-2442.MathSciNetView ArticleGoogle Scholar
  19. de Almeida ALF, Favier G, Mota JCM: Space-time spreading-multiplexing for MIMO wireless communication systems using the PARATUCK-2 tensor model. Elsevier Signal, Process 2009, 89(11):2103-2116. 10.1016/j.sigpro.2009.04.028View ArticleMATHGoogle Scholar
  20. Sidiropoulos ND, Giannakis GB, Bro R: Blind PARAFAC receivers for DS-CDMA systems. IEEE Trans. Signal Process 2000, 48(3):810-822. 10.1109/78.824675View ArticleGoogle Scholar
  21. Harshman RA: Foundations of the PARAFAC procedure: model and conditions for an “explanatory" multi-mode factor analysis. UCLA Working Papers in Phonetics; 1970.Google Scholar
  22. Nion D, De Lathauwer L: A block component model-based blind DS-CDMA receiver. IEEE Trans. Signal Process 2008, 56(11):5567-5579.MathSciNetView ArticleGoogle Scholar
  23. Favier G, da Costa MN, de Almeida ALF, Romano JMT: Tensor space-time (TST) coding for MIMO wireless communication systems. Elsevier Signal, Process 2012, 92(4):1079-1092. 10.1016/j.sigpro.2011.10.021View ArticleGoogle Scholar
  24. Sampath H, Paulraj A: Linear precoding for space-time coded systems with known fading correlations. IEEE Commun. Lett 2002, 6(6):239-241.View ArticleGoogle Scholar
  25. Mudulodu S, Paulraj AJ: A simple multiplexing scheme for MIMO systems using multiple spreading codes. In 34th ASILOMAR Conference on, Signals, Systems and Computers. Pacific Grove, USA; 2000:769-774.Google Scholar
  26. Yang L-L, Hua W, Hanzo L: Multiuser detection assisted time- and frequency-domain spread multicarrier code-division multiple-access. IEEE Trans. Veh. Technnol 2006, 55(1):397-405. 10.1109/TVT.2005.861177View ArticleGoogle Scholar
  27. Wang Z, Giannakis GB: Complex-field coding for OFDM over fading wireless channels. IEEE Trans. Inf. Theory 2003, 49(3):707-Ű720. 10.1109/TIT.2002.808101MathSciNetView ArticleMATHGoogle Scholar
  28. Goldsmith A: Wireless Communications. Cambridge University Press; 2005.View ArticleGoogle Scholar
  29. Damen MO, Abed-Meraim K, Safavi A: On CDMA with space-time codes over multi-path fading channels. IEEE Trans. Wirel. Commun 2003, 2(1):11-19. 10.1109/TWC.2002.806356View ArticleGoogle Scholar
  30. You CW, Hong DS: Multicarrier CDMA systems using time-domain and frequency-domain spreading codes. IEEE Trans. Commun 2003, 51(1):17-21. 10.1109/TCOMM.2002.807630View ArticleGoogle Scholar
  31. Foschini GJ: Layered space-time architecture for wireless communications in a fading environment when using multiple antennas. Bell Labs, Techn. J 1996, 1(2):41-59.View ArticleGoogle Scholar
  32. Liu Z, Xin Y, Giannakis G: Linear constellation precoding for OFDM with maximum multipath diversity and coding gains. IEEE Trans. Commun 2003, 51(3):416-427. 10.1109/TCOMM.2003.809791View ArticleGoogle Scholar
  33. Tran N, Nguyen H, Le-Ngoc T: Subcarrier grouping for ofdm with linear constellation precoding over multipath fading channels. IEEE Trans. Veh. Technol 2007, 56(6):3607-3613.View ArticleGoogle Scholar
  34. Kruskal JB: Three-way arrays: rank and uniqueness of trilinear decompositions, with applications to arithmetic complexity and statistics. Linear Algeb. Appl 1977, 18: 95-138. 10.1016/0024-3795(77)90069-6MathSciNetView ArticleMATHGoogle Scholar
  35. Stegeman A, Sidiropoulos ND: On Kruskal’s uniqueness condition for the Candecomp/Parafac decomposition. Linear Algeb. Appl 2007, 420: 540-552. 10.1016/j.laa.2006.08.010MathSciNetView ArticleMATHGoogle Scholar
  36. Jiang T, Sidiropoulos ND: Kruskal’s permutation lemma and the identification of CANDECOMP/PARAFAC and bilinear models with constant modulus constraints. IEEE Trans. Signal Process 2004, 52(9):2625-2636. 10.1109/TSP.2004.832022MathSciNetView ArticleGoogle Scholar
  37. De Lathauwer L: A link between the canonical decomposition in multilinear algebra and simultaneous matrix diagonalization. SIAM J. Matrix Anal. Appl 2006, 28(3):642-666. 10.1137/040608830MathSciNetView ArticleMATHGoogle Scholar
  38. Stegeman AW: On uniqueness conditions for Candecomp/Parafac and Indscal with full column rank in one mode. Linear Algeb. Appl 2009, 431: 211-227. 10.1016/j.laa.2009.02.025MathSciNetView ArticleMATHGoogle Scholar
  39. Bro R: PARAFAC: tutorial and applications. Chemometrics Intell. Lab. Syst 1997, 38: 149-171. 10.1016/S0169-7439(97)00032-4View ArticleGoogle Scholar
  40. Smilde A, Bro R, Geladi P: Multi-way Analysis. Applications in the Chemical Sciences. Wiley, Chichester, UK; 2004.View ArticleGoogle Scholar
  41. Rajih M, Comon P: Enhanced line search: a novel method to accelerate PARAFAC. In European Signal Processing Conference EUSIPCO. Antalya, Turkey; 2005:1-5.Google Scholar
  42. Nion D, De Lathauwer L: Line search computation of the block factor model for blind multi-user access in wireless communications. In IEEE 7th Workshop on, Signal Processing in Advances in Wireless Communication (SPAWC). Cannes, France; 2006:1-5.Google Scholar
  43. Nion D, De Lathauwer L: Levenberg-Marquardt computation of the block factor model for blind multi-user access in wireless communications. In European Signal Processing Conference (EUSIPCO). Florence, Italy; 2006.Google Scholar
  44. ITU-R recommendation M.1225: Guidelines for Evaluation of Radio Transmission Technologies for IMT-2000. 1997.Google Scholar
  45. Ng BK, Sousa ES: A novel spread space-spectrum multiple access scheme for the forward link. In IEEE Wireless Communications and, Networking Conference (WCNC). Orlando, USA; 2002:723-727.Google Scholar
  46. Stegeman A, de Almeida ALF: Uniqueness conditions for constrained three-way factor decompositions with linearly dependent loadings. SIAM J. Matrix Anal. Appl 2009, 31(3):1469-1490.MathSciNetView ArticleMATHGoogle Scholar
  47. Guo X, Miron S, Brie D: A Stegeman, Uni-mode and partial uniqueness conditions for CANDECOMP/PARAFAC of three-way arrays with linearly dependent loadings. SIAM J. Matrix Anal. Appl 2012, 33(1):111-129. 10.1137/110825765MathSciNetView ArticleMATHGoogle Scholar

Copyright

© de Almeida and Favier; licensee Springer. 2013

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.