- Research Article
- Open Access

# Secured Communication over Frequency-Selective Fading Channels: A Practical Vandermonde Precoding

- Mari Kobayashi
^{1}Email author, - Mérouane Debbah
^{2}and - Shlomo Shamai (Shitz)
^{3}

**2009**:386547

https://doi.org/10.1155/2009/386547

© Mari Kobayashi et al. 2009

**Received:**2 February 2009**Accepted:**16 June 2009**Published:**3 August 2009

## Abstract

We study the frequency-selective broadcast channel with confidential messages (BCC) where the transmitter sends a confidential message to receiver 1 and a common message to receivers 1 and 2. In the case of a block transmission of symbols followed by a guard interval of symbols, the frequency-selective channel can be modeled as a Toeplitz matrix. For this special type of multiple-input multiple-output channels, we propose a practical Vandermonde precoding that projects the confidential messages in the null space of the channel seen by receiver 2 while superposing the common message. For this scheme, we provide the achievable rate region and characterize the optimal covariance for some special cases of interest. Interestingly, the proposed scheme can be applied to other multiuser scenarios such as the -user frequency-selective BCC with confidential messages and the two-user frequency-selective BCC with two confidential messages. For each scenario, we provide the secrecy degree of freedom (s.d.o.f.) region of the corresponding channel and prove the optimality of the Vandermonde precoding. One of the appealing features of the proposed scheme is that it does not require any specific secrecy encoding technique but can be applied on top of any existing powerful encoding schemes.

## Keywords

- Toeplitz Matrix
- Broadcast Channel
- Secrecy Rate
- Secrecy Capacity
- Equal Power Allocation

## 1. Introduction

We consider a secured medium such that the transmitter wishes to send a confidential message to its receiver while keeping the eavesdropper, tapping the channel, ignorant of the message. Wyner [1] introduced this model named the wiretap channel to model the degraded broadcast channel where the eavesdropper observes a degraded version of the receiver's signal. In this model, the confidentiality is measured by the equivocation rate, that is, the mutual information between the confidential message and the eavesdropper's observation. For the discrete memoryless degraded wiretap channel, Wyner characterized the capacity-equivocation region and showed that a nonzero secrecy rate can be achieved [1]. The most important operating point on the capacity-equivocation region is the secrecy capacity, that is, the largest reliable communication rate such that the eavesdropper obtains no information about the confidential message (the equivocation rate is as large as the message rate). The secrecy capacity of the Gaussian wiretap channel was given in [2]. Csiszár and Körner considered a more general wiretap channel in which a common message for both receivers is sent in addition to the confidential message [3]. For this model known as the broadcast channel with confidential (BCC) messages, the rate-tuple of the common and confidential messages was characterized.

Recently, a significant effort has been made to opportunistically exploit the space/time/user dimensions for secrecy communications (see, e.g., [4–14] and references therein). In [4], the secrecy capacity of the ergodic slow fading channels was characterized and the optimal power/rate allocation was derived. The secrecy capacity of the parallel fading channels was given [6, 7] where [7] considered the BCC with a common message. Moreover, the secrecy capacity of the wiretap channel with multiple antennas has been studied in [8–13, 15] and references therein. In particular, the secrecy capacity of the multiple-input multiple-output (MIMO) wiretap channel has been fully characterized in [5, 11, 12, 14] and more recently its closed-form expressions under a matrix covariance constraint have been derived in [15]. Furthermore, a large number of recent works have considered the secrecy capacity region for more general broadcast channels. In [16], the authors studied the two-user MIMO Gaussian BCC where the capacity region for the case of one common and one confidential message was characterized. The two-user BCC with two confidential messages, each of which must be kept secret to the unintended receiver, has been studied in [17–20]. In [18], Liu and Poor characterized the secrecy capacity region for the multiple-input single-output (MISO) Gaussian BCC where the optimality of the secret dirty paper coding (S-DPC) scheme was proved. A recent contribution [19] extended the result to the MIMO Gaussian BCC. The multireceiver wiretap channels have been also studied in [21–26] (and reference therein) where the confidential messages to each receiver must be kept secret to an external eavesdropper. It has been proved that the secrecy capacity region of the MIMO Gaussian multireceiver wiretap channels is achieved by S-DPC [24, 26].

However, very few work have exploited the frequency selectivity nature of the channel for secrecy purposes [27] where the zeros of the channel provide an opportunity to "hide" information. This paper shows the opportunities provided by the broad-band channel and studies the frequency-selective BCC where the transmitter sends one confidential message to receiver 1 and one common message to both receivers 1 and 2. The channel state information (CSI) is assumed to be known to both the transmitter and the receivers. We consider the quasistatic frequency-selective fading channel with paths such that the channel remains fixed during an entire transmission of blocks for an arbitrary large . It should be remarked that in general the secrecy rate cannot scale with signal-to-noise ratio (SNR) over the channel at hand, unless the channel of receiver 2 has a null frequency band of positive Lebesgue measure (on which the transmitter can "hide'' the confidential message). In this contribution, we focus on the realistic case where receiver 2 has a full frequency band (without null subbands) but operates in a reduced dimension due to practical complexity issues. This is typical of current orthogonal frequency division multiplexing (OFDM) standards (such as IEEE802.11a/WiMax or LTE [28–30]) where a guard interval of symbols is inserted at the beginning of each block to avoid the interblock interference and both receivers discard these symbols. We assume that both users have the same standard receiver, in particular receiver 2 cannot change its hardware structure. Studying secure communications under this assumption is of interest in general and can be justified since receiver 2 is actually a legitimate receiver which can receive a confidential message in other communication periods. Of course, if receiver 2 is able to access the guard interval symbols, it can extract the confidential message and the secrecy rate falls down to zero. Although we restrict ourselves to the reduced dimension constraint in this paper, other constraints on the limited capability at the unintended receiver such as energy consumption or hardware complexity might provide a new paradigm to design physical layer secrecy systems.

In the case of a block transmission of symbols followed by a guard interval of symbols discarded at both receivers, the frequency-selective channel can be modeled as an MIMO Toeplitz matrix. In this contribution, we aim at designing a practical linear precoding scheme that fully exploits the degrees of freedom (d.o.f.) offered by this special type of MIMO channels to transmit both the common message and the confidential message. To this end, let us start with the following remarks. On one hand, the idea of using OFDM modulation to convert the frequency-selective channel represented by the Toeplitz matrix into a set of parallel fading channel turns out to be useless from a secrecy perspective. Indeed, it is known that the secrecy capacity of the parallel wiretap fading channels does not scale with SNR [7]. On the other hand, recent contributions [5, 11, 12, 14, 15] showed that the secrecy capacity of the MIMO wiretap channel grows linearly with SNR, that is, where denotes the secrecy degree of freedom (s.d.o.f.) (to be specified). In the high SNR regime, the secrecy capacity of the MISO/MIMO wiretap channel is achieved by sending the confidential message in the null space of the eavesdropper's channel [10, 11, 14, 15, 18, 19]. Therefore, OFDM modulation is highly suboptimal in terms of the s.d.o.f.

Inspired by these remarks, we propose a linear Vandermonde precoder that projects the confidential message in the null space of the channel seen by receiver 2 while superposing the common message. Thanks to the orthogonality between the precoder of the confidential message and the channel of receiver 2; receiver 2 obtains no information on the confidential message. This precoder is regarded as a single-antenna frequency beamformer that nulls the signal in certain directions seen by receiver 2. The Vandermonde structure comes from the fact that the frequency beamformer is of the type where is one of the roots of the channel seen by receiver 2. Note that Vandermonde matrices [31] have already been considered for cognitive radios [32] and CDMA systems [33] to reduce/null interference but not for secrecy applications. One of the appealing aspects of Vandermonde precoding is that it does not require a specific secrecy encoding technique but can be applied on top of any classical capacity achieving encoding scheme.

For the proposed scheme, we characterize its achievable rate region, the rate-tuple of the common message, the confidential message, respectively. Unfortunately, the optimal input covariances achieving their boundary are generally difficult to compute due to the nonconvexity of the weighted sum rate maximization problem. Nevertheless, we show that there are some special cases of interest such as the secrecy rate and the maximum sum rate point which enable an explicit characterization of the optimal input covariances. In addition, we provide the achievable d.o.f. region of the frequency-selective BCC, reflecting the behavior of the achievable rate region in the high SNR regime, and prove that the Vandermonde precoding achieves this region. More specifically, it enables to simultaneously transmit streams of the confidential message and streams of the common message for simultaneously over a block of dimensions. Interestingly, the proposed Vandermonde precoding can be applied to multiuser secure communication scenarios: (a) a -user frequency-selective BCC with confidential messages and one common message, (b) a two-user frequency-selective BCC with two confidential messages and one common message. For each scenario, we characterize the achievable s.d.o.f. region of the corresponding frequency-selective BCC and show the optimality of the Vandermonde precoding.

The paper is organized as follows. Section 2 presents the frequency-selective fading BCC. Section 3 introduces the Vandermonde precoding and characterizes its achievable rate region as well as the optimal input covariances for some special cases. Section 4 provides the application of the Vandermonde precoding to the multiuser secure communications scenarios. Section 5 shows some numerical examples of the proposed scheme in the various settings, and finally Section 6 concludes the paper.

*Notation.* In the following, upper (lower boldface) symbols will be used for matrices (column vectors) whereas lower symbols will represent scalar values,
will denote transpose operator,
conjugation, and
hermitian transpose.
,
represent the
identity matrix,
zero matrix.
denote a determinant, rank, trace of a matrix
, respectively.
denotes the sequence
.
,
,
,
,
,
denote the realization of the random variables
,
,
,
,
,
. Finally, "
'' denotes less or equal to in the positive semidefinite ordering between positive semidefinite matrices, that is, we have
if
is positive semidefinite.

## 2. System Model

We assume that the channel matrices , remain constant for the whole duration of the transmission of blocks and are known to all terminals. At each block , we transmit symbols by appending a guard interval of size larger than the delay spread, which enables to avoid the interference between neighbor blocks.

which is the normalized entropy of the confidential message conditioned on the received signal at receiver 2 and available CSI.

In this paper, we focus on the perfect secrecy case where receiver 2 obtains no information about the confidential message , which is equivalent to . In this setting, an achievable rate region of the general BCC (expressed in bit per channel use per dimension) is given by [3]

where denotes s.d.o.f. which corresponds precisely to the number of the generalized eigenvalues greater than one in the high SNR.

## 3. Vandermonde Precoding

For the frequency-selective BCC specified in Section 2, we wish to design a practical linear precoding scheme which fully exploits the d.o.f. offered by the frequency-selective channel. We remarked previously that for a special case when only the confidential message is sent to receiver 1 (without a common message), the optimal strategy consists of beamforming the confidential signal into the null subspace of receiver 2. By applying this intuitive result to the special Toeplitz MIMO channels
,
while including a common message, we propose a linear precoding strategy named *Vandermonde precoding*. Prior to the definition of the Vandermonde precoding, we provide some properties of a Vandermonde matrix [31].

Property 1.

and if are all different.

It is well known that as the dimension of and increases, the Vandermonde matrix becomes ill-conditioned unless the roots are on the unit circle. In other words, the elements of each column either grow in energy or tend to zero [31]. Hence, instead of the brut Vandermonde matrix (14), we consider a unitary Vandermonde matrix obtained either by applying the Gram-Schmidt orthogonalization or singular value decomposition (SVD) on .

Definition 1.

We let
be a unitary Vandermonde matrix obtained by orthogonalizing the columns of
. We let
be a unitary matrix in the null space of
such that
. The common message
, the confidential message
, is sent along
,
, respectively. We call
*Vandermonde precoder*.

Further, the precoding matrix for the confidential message satisfies the following property.

Lemma 2.

Proof.

Appendix A.

satisfy the power constraint (2). We let denote the feasible set satisfying (18).

Theorem 3.

where denotes the convex hull and we let , , .

Proof.

Plugging these expressions to (8), we obtain (19).

Lemma 4.

The optimal , solution of (23), is given by one of the three solutions.

Case 1.

and satisfies .

Case 2.

and satisfies .

Case 3.

and satisfies for some .

where , , and are unitary, contain positive singular values , , respectively. Following [7, Theorem 3], one applies Lemma 4 to solve the weighted sum rate maximization.

Theorem 5.

The set of the optimal covariances , achieving the boundary of the achievable rate region of the Vandermonde precoding, corresponds to one of the following three solutions.

Case 1.

where with a positive semidefinite for , is determined such that , and we let .

Case 2.

if the following fulfills .

where is determined such that .

Case 3.

where with a positive semidefinite for , is determined such that .

Proof.

Appendix B.

Remark 6.

Due to the non-concavity of the underlying weighted sum rate functions, it is generally difficult to characterize the boundary of the achievable rate region except for some special cases. The special cases include the corner points, in particular, the secrecy rate for the case of sending only the confidential message ( ), as well as the maximum sum rate point for the equal weight case ( ). It is worth noticing that under equal weight the objective functions in three cases are all concave in , since is concave if and is concave if and .

The maximum sum rate point can be found by applying the following greedy search [7].

Greedy Search to Find the Maximum Sum Rate Point

( ) Find , maximizing and check . If yes stop. Otherwise go to (2).

( ) Find , maximizing and check . If yes stop. Otherwise go to (3).

( ) Find , maximizing and check for some .

For the special case of , Theorem 5 yields the achievable secrecy rate with the Vandermonde precoding.

Corollary 7.

where the last equality is obtained by applying SVD to and plugging the power allocation of (30) with , , is determined such that .

Finally, by focusing the behavior of the achievable rate region in the high SNR regime, we characterize the achievable d.o.f. region of the frequency-selective BCC (1).

Theorem 8.

where , denote non-negative integers. The Vandermonde precoding achieves the above d.o.f. region.

Proof.

which is dominated by the pre-log of in (37). This establishes the achievability.

The converse follows by noticing that the inequalities (33) and (34) correspond to trivial upper bounds. The first inequality (33) corresponds to the s.d.o.f. of the MIMO wiretap channel with the legitimate channel and the eavesdropper channel , which is bounded by . The second inequality (34) follows because the total number of streams for receiver 1 cannot be larger than the d.o.f. of , that is, .

## 4. Multiuser Secure Communications

In this section, we provide some applications of the Vandermonde precoding in the multi-user secure communication scenarios where the transmitter wishes to send confidential messages to more than one intended receivers. The scenarios that we address are: (a) a -user frequency-selective BCC with confidential messages and one common message, (b) a two-user frequency-selective BCC with two confidential messages and one common message. For each scenario, by focusing on the behavior in the high SNR regime, we characterize the achievable s.d.o.f. region and show the optimality of the Vandermonde precoding.

### 4.1. K + 1-User BCC with K Confidential Messages

As an extension of Section 3, we consider the -user frequency-selective BCC where the transmitter sends confidential messages to the first receivers as well as one common message to all receivers. Each of the confidential messages must be kept secret to receiver . Notice that this model, called multireceiver wiretap channel, has been studied in the literature ([20, 22–26] and reference therein). In particular, the secrecy capacity region of the Gaussian MIMO multireceiver wiretap channel has been characterized in [24, 26] for , an arbitrary , respectively, where the optimality of the S-DPC is proved.

The received signal of receiver and the received signal of receiver at any block are given by

An achievable secrecy rate region for the case of , when the transmitter sends two confidential messages in the presence of an external eavesdropper, is provided in [25, Theorem 1]. This theorem can be extended to an arbitrary while including the common message. Formally we state the following lemma.

Lemma 9.

Proof.

Appendix C.

It can be easily seen that without the secrecy constraint the above region reduces to the Marton's achievable region for the general -user broadcast channel [35].

where denotes the d.o.f. of the common message and denotes the s.d.o.f. of confidential message . As an extension of Theorem 8, we have the following s.d.o.f. region result.

Theorem 10.

where are non-negative integers. The Vandermonde precoding achieves this region.

Proof.

Appendix D.

Remark 11.

### 4.2. Two-User BCC with Two Confidential Messages

We consider the two-user BCC where the transmitter sends two confidential messages , as well as one common message . Each of the confidential messages must be kept secret to the unintended receiver. This model has been studied in [17–19] for the case of two confidential messages and in [20] for the case of two confidential messages and a common message. In [19], the secrecy capacity region of the MIMO Gaussian BCC was characterized. The received signal at receivers 1, 2 at any block is given, respectively, by

where is the input vector satisfying the total power constraint and , are mutually independent AWGN with covariance . We assume the channel vectors , are linearly independent.

We extend Theorem 8 to the two-user frequency-selective BCC (50) and obtain the following s.d.o.f. result.

Theorem 12.

where are non-negative integers. The Vandermonde precoding achieves the region.

Proof.

Appendix F.

Remark 13.

Comparing Theorems 10, 12 as well as Figures 4, 6 for , it clearly appears that the s.d.o.f. of -user BCC with confidential messages is dominated by the s.d.o.f. of -user BCC with confidential messages. In other words, the s.d.o.f. region critically depends on the assumption on the eavesdropper(s) to whom each confidential message must be kept secret.

Remark 14.

## 5. Numerical Examples

In order to examine the performance of the proposed Vandermonde precoding, this section provides some numerical results in different settings.

### 5.1. Secrecy Rate versus SNR

We evaluate the achievable secrecy rate in (32) when the transmitter sends only a confidential message to receiver 1 (without a common message) in the presence of receiver 2 (eavesdropper) over the frequency-selective BCC studied in Section 3.

#### 5.1.1. MISO Wiretap Channel

#### 5.1.2. MIMO Wiretap Channel

### 5.2. The Maximum Sum Rate Point (R_{0}, R_{1}) versus SNR

### 5.3. Two-User Secrecy Rate Region in the Frequency-Selective BCC

## 6. Conclusions

We considered the secured communication over the frequency-selective channel by focusing on the frequency-selective BCC. In the case of a block transmission of symbols followed by a guard interval of symbols discarded at both receivers, the frequency-selective channel can be modeled as an Toeplitz matrix. For this special type of MIMO channels, we proposed a practical yet order-optimal Vandermonde precoding which enables to send streams of the confidential messages and streams of the common messages simultaneously over a block of dimensions. The key idea here consists of exploiting the frequency dimension to "hide" confidential information in the zeros of the channel seen by the unintended receiver similarly to the spatial beamforming. We also provided some application of the Vandermonde precoding in the multiuser secured communication scenarios and proved the optimality of the proposed scheme in terms of the achievable s.d.o.f. region.

We conclude this paper by noticing that there exists a simple approach to establish secured communications. More specifically, perfect secrecy can be built in two separated blocks: (1) a precoding that cancels the channel seen by the eavesdropper to fulfill the equivocation requirement, (2) the powerful off-the-shelf encoding techniques to achieve the secrecy rate. Since the practical implementation of secrecy encoding techniques (double binning) remains a formidable challenge, such design is of great interest for the future secrecy systems.

## Declarations

### Acknowledgments

The work is supported by the European Commission in the framework of the FP7 Network of Excellence in Wireless COMmunications NEWCOM++. The work of M. Debbah is supported by Alcatel-Lucent within the Alcatel-Lucent Chair on Flexible Radio at Supelec. The authors wish to thank Yingbin Liang for helpful discussions, and the anonymous reviewers for constructive comments. The material in this paper was partially presented at IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), Cannes, France, September 2008.

## Authors’ Affiliations

## References

- Wyner AD: The wiretap channel.
*Bell System Technical Journal*1975., 54:Google Scholar - Leung-Yan-Cheong SK, Hellman ME: The Gaussian wire-tap channel.
*IEEE Transactions on Information Theory*1978, 24(4):451-456. 10.1109/TIT.1978.1055917MATHMathSciNetView ArticleGoogle Scholar - Csiszár I, Körner J: Broadcast channels with confidential messages.
*IEEE Transactions on Information Theory*1978, 24(3):339-348. 10.1109/TIT.1978.1055892MATHView ArticleGoogle Scholar - Gopala PK, Lai L, El Gamal H: On the secrecy capacity of fading channels.
*IEEE Transactions on Information Theory*2008, 54(10):4687-4698.MATHMathSciNetView ArticleGoogle Scholar - Khisti A, Wornell G: The MIMOME channel.
*Proceedings of the 45th Annual Allerton Conference on Communication, Control, and Computing, 2007*Google Scholar - Liu T, Prabhakaran V, Vishwanath S: The secrecy capacity of a class of parallel Gaussian compound wiretap channels.
*Proceedings of the IEEE International Symposium on Information Theory (ISIT '08), 2008, Toronto, Canada*116-120.Google Scholar - Liang Y, Poor HV, Shamai S: Secure communication over fading channels.
*IEEE Transactions on Information Theory*2008, 54(6):2470-2492.MATHMathSciNetView ArticleGoogle Scholar - Goel S, Negi R: Secret communication in presence of colluding eavesdroppers.
*Proceedings of the 62nd IEEE Vehicular Technology Conference (VTC '05), 2005, Atlantic City, NJ, USA*3:Google Scholar - Parada P, Blahut R: Secrecy capacity of SIMO and slow fading channels.
*Proceedings of the IEEE International Symposium on Information Theory (ISIT '05), 2005*2152-2155.Google Scholar - Khisti A, Wornell G: Secure transmission with multiple antennas: the MISOME wiretap channel. submitted to
*IEEE Transactions on Information Theory*, 2007Google Scholar - Liu T, Shamai S: A note on the secrecy capacity of the multi-antenna wiretap channel. submitted to
*IEEE Transactions on Information Theory*, 2007Google Scholar - Oggier F, Hassibi B: The secrecy capacity of the MIMO wiretap channel.
*Proceedings of the IEEE International Symposium on Information Theory (ISIT '08), 2008, Toronto, Canada*524-528.Google Scholar - Shafiee S, Ulukus S: Achievable rates in Gaussian MISO channels with secrecy constraints.
*Proceedings of the IEEE International Symposium on Information Theory, 2007*2466-2470.Google Scholar - Khisti A, Wornell G, Wiesel A, Eldar Y: On the Gaussian MIMO wiretap channel.
*Proceedings of the IEEE International Symposium on Information Theory (ISIT '07), 2007, Nice, France*2471-2475.Google Scholar - Bustin R, Liu R, Poor HV, Shamai (Shitz) S: An MMSE approach to the secrecy capacity of the MIMO Gaussian wiretap channel. EURASIP Journal on Wireless Communications and Networking. In pressGoogle Scholar
- Ly HD, Liu T, Liang Y: MIMO broadcasting with common, private, and confidential messages.
*Proceedings of the International symposium on Information Theory and Its Applications (ISITA '08), December 2008, Auckland, New Zealand*Google Scholar - Liu R, Maric I, Spasojevic P, Yates RD: Discrete memoryless interference and broadcast channels with confidential messages: secrecy rate regions.
*IEEE Transactions on Information Theory*2008, 54(6):2493-2507.MATHMathSciNetView ArticleGoogle Scholar - Liu R, Poor HV: Secrecy capacity region of a multi-antenna Gaussian broadcast channel with confidential messages.
*IEEE Transactions on Information Theory*2009, 55(3):1235-1249.MathSciNetView ArticleGoogle Scholar - Liu R, Liu T, Poor HV, Shamai (Shitz) S: MIMO Gaussian broadcast channels with confidential messages.
*Proceedings of the IEEE Symposium on Information Theory (ISIT '09), June-July 2009, Seoul, Korea*Google Scholar - Choo LC, Wong KK: The K-receiver broadcast channel with confidential messages.
*Proceedings of the IEEE International Symposium on Information Theory (ISIT '09), 2009, Seoul, Korea*Google Scholar - Khisti A, Tchamkerten A, Wornell GW: Secure broadcasting over fading channels.
*IEEE Transactions on Information Theory*2008, 54(6):2453-2469.MATHMathSciNetView ArticleGoogle Scholar - Choo LC, Wong KK: The three-receiver broadcast channel with degraded message sets and confidential messages. submitted to IEEE Transactions on Information TheoryGoogle Scholar
- Ekrem E, Ulukus S: Secrecy capacity of a class of broadcast channels with an eavesdropper. submitted to EURASIP Journal on Wireless Communications and NetworkingGoogle Scholar
- Ekrem E, Ulukus S: The secrecy capacity region of the Gaussian MIMO multi-receiver wiretap channel. submitted to IEEE Transactions on Information TheoryGoogle Scholar
- Bagherikaram G, Motahari AS, Khandani AK: The secrecy rate region of the broadcast channel. preprint, 2008, http://arxiv.org/abs/0806.4200Google Scholar
- Bagherikaram G, Motahari AS, Khandani AK: The secrecy capacity region of the Gaussian MIMO broadcast channel. preprint, 2009, http://arxiv.org/abs/0903.3261Google Scholar
- Koyluoglu OO, El Gamal H, Lai L, Poor HV: Interference alignment for secrecy. preprint, 2008, http://arxiv.org/abs/0810.1187Google Scholar
- ANSI/IEEE Std 802.11, Edition (R2003), 1999, http://standards.ieee.org/getieee802/download/802.11-1999.pdf
- Air Interface for Fixed and Mobile Broadband Wireless Access Systems, 2005, http://standards.ieee.org/getieee802/download/802.16e-2005.pdf
- http://www.3gpp.org/Highlights/LTE/LTE.htm
- Ryan Ø, Debbah M: Asymptotic behaviour of random vandermonde matrices with entries on the unit circle. IEEE Transactions on Information Theory 2009., 55(7):Google Scholar
- Cardoso LS, Kobayashi M, Ryan Ø, Debbah M: Vandermonde frequency division multiplexing for cognitive radio.
*Proceedings of the 9th IEEE Workshop on Signal Processing Advances in Wireless Communications (SPAWC '08), 2008, Recife, Brazil*421-425.Google Scholar - Scaglione A, Giannakis GB, Barbarossa S: Lagrange/Vandermonde MUI eliminating user codes forquasi-synchronous CDMA in unknown multipath.
*IEEE Transactions on Signal Processing*2000, 48(7):2057-2073. 10.1109/78.847790View ArticleGoogle Scholar - Poor HV:
*An Introduction to Signal Detection and Estimation*. Springer, New York, NY, USA; 1994.MATHView ArticleGoogle Scholar - Viswanath P, Tse DNC: Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality.
*IEEE Transactions on Information Theory*2003, 49(8):1912-1921. 10.1109/TIT.2003.814483MATHMathSciNetView ArticleGoogle Scholar - Lee J, Jindal N: High SNR analysis for MIMO broadcast channels: dirty paper coding versus linear precoding.
*IEEE Transactions on Information Theory*2007, 53(12):4787-4792.MathSciNetView ArticleGoogle Scholar - Viswanathan H, Venkatesan S, Huang H: Downlink capacity evaluation of cellular networks with known-interference cancellation.
*IEEE Journal on Selected Areas in Communications*2003, 21(5):802-811. 10.1109/JSAC.2003.810346View ArticleGoogle Scholar - Zhang X, Chen J, Wicker SB, Berger T: Successive coding in multiuser information theory.
*IEEE Transactions on Information Theory*2007, 53(6):2246-2254.MathSciNetView ArticleGoogle Scholar - Cover T, Thomas J:
*Elements of Information Theory*. John Wiley & Sons, New York, NY, USA; 1991.MATHView ArticleGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.