Skip to content

Advertisement

  • Research
  • Open Access

Macro-pico amplitude-space sharing with layered interference alignment

EURASIP Journal on Wireless Communications and Networking20152015:150

https://doi.org/10.1186/s13638-015-0389-z

  • Received: 10 November 2014
  • Accepted: 14 May 2015
  • Published:

Abstract

Inter-cell interference leads to severe performance degradation in cellular networks, and the study of multi-user interference channel is the corner stone for solving this problem. Amplitude-space layered interference alignment (IA), as an effective complementation to the vector-space IA, is a promising method to increase the data rate in static interference channels. However, recent studies of layered IA has been focused on analyzing the degrees of freedom (DoF) or the achievable rate under specific channel constraints. In this paper, we propose a layered IA scheme that can work with arbitrary channel coefficients. We develop a layer partitioning method and optimize the active layer assignment through linear programming. An implementation scheme is then introduced with multi-level nested lattice codes where the signal and interference are nested in amplitude space, and the interference from different users is nestedly aligned. The performance of the proposed scheme is finally evaluated in homogeneous and heterogeneous cellular networks with practical settings.

Keywords

  • Amplitude-space sharing
  • Heterogeneous network
  • Interference alignment
  • Nested lattice code

1 Introduction

Multi-tier heterogeneous networks can achieve significant areal capacity gain by intensifying spatial reuse of the spectrum [1, 2]. While the high-power macro-cell base station (BS) provides basic coverage and supports high mobility, the low-power nodes like pico-cell BSs support high-capacity transmission for hotspot zones. Accordingly, the data rate requirements of macro-cell user and pico-cell user may have large difference.

Operated in the same frequency band, the interference in heterogeneous networks is complicated, including not only the co-tier interference among macro-cells and among pico-cells but also the cross-tier interference between the macro-cell and pico-cells [3]. One pico-user may encounter interference from the macro-BS and the pico-BSs in the same macro-cell and also from the macro-BSs in adjacent macro-cells. The pico-cells might be deployed at any places in the macro-cell, and the transmit power of the macro-BS is much stronger than the pico-BS.

Conventional methods to mitigate inter-cell interference mainly involve various orthogonalization-based processing. For example, almost blank subframe (ABS) is a time orthogonal interference coordination scheme; fractional frequency reuse (FFR) is a frequency orthogonal interference coordination scheme; coordinated beamforming (CB) is a spatial orthogonal interference coordination scheme [47]. The vector-space interference alignment (IA) scheme is an advanced orthogonalization-based interference coordination scheme, where multiple interference are aligned in a subspace while leave the orthogonal signal subspace interference-free [8, 9]. However, the orthogonalization-based processing schemes are only efficient when the interference has similar strength with the desired signal. If the interference is very weak or very strong, it is a waste of resource to provide orthogonal subspaces for each interference. In fact, for very weak interference channels, treating the interference as noise is optimal [1013]. For strong interference channels, interference cancelation can achieve the capacity [1416].

In multi-tier heterogeneous networks with different interference strengths in various scenarios, amplitude-space sharing of the signal and interferences is an effective way to complement the weakness of the orthogonalization-based processing. In [17], an amplitude-space sharing scheme in a two-cell network was proposed, where each BS schedules one user and the two users simultaneously scheduled in two overlapping cells consist a two-user interference channel. In different interference scenarios, the opportunities for interference cancelation are proactively created and the network sum rates are maximized through the optimized Han-Kobayashi coding [18, 19]. In multi-cell networks, Han-Kobayashi coding is no longer applicable [20], we need to study amplitude-space sharing scheme that can accommodate multiple interference. In this case, the desired signal and interference should occupy different layers in the amplitude space, and multiple interference may be aligned in one layer to compress their occupied spaces.

Layered interference alignment had been studied in multi-user interference channels, but the existing results are obtained under special channel conditions and are not applicable in practical systems. In [21], the degrees of freedom (DoF) of the fully connected K-user Gaussian interference channel were proved to be arbitrarily close to K/2, but the channel coefficients should take specialized forms that the inputs are shifted by an even amount on the desired links and by an odd amount on the interference links (or vice versa). In [22], it was shown that K/2 DoF are achievable when the cross-link channel gains corresponding to the interferers are rational, whereas the direct-link channel gains corresponding to the intended signal are irrational algebraic; if the direct-link channel gains are rational as well, the DoF of the channel are strictly smaller than K/2. Later, a general formula for the DoF of real interference channels was derived in [23] by maximizing the Rényi information dimension. Recently, the authors of [24] proved that the DoF of the static interference channel are K/2 for almost all sets of channel gains through the real interference alignment. In [25], incorporating both vector and real interference alignment, the total DoF of 2K M/(K+1) are characterized in the K×2 and 2×K, M antennas X channels, for almost all channel realizations. The achievability schemes in [22, 24, 25] rely on some results from the field of Diophantine approximation in number theory, especially the lower bounds on the approximability of irrational algebraic numbers by rationals [2632]. However, these results also imply that in asymptotic high signal-to-noise ratio (SNR) region the capacity characterization of the interference channel is extremely sensitive to slight variations of the channel gains.

The generalized degrees of freedom (GDoF) of the symmetric Gaussian K-user interference channel were studied in [33], where all direct links have the same SNR and all cross-links have the same interference-to-noise ratio (INR). The authors found that the GDoF per user do not depend on the number of users, so that the characterization is identical to the two-user interference channel with the exception of a singularity when the INR equals to the SNR. The achievable rates in moderate SNR values were obtained in [34, 35], where the interference alignment scheme is suitable for a class of integer-interference channel, where all cross-link channel gains are integer or rational.

In this paper, we first study the K-user layered interference alignment scheme with arbitrary channel coefficients and then apply the scheme to multi-cell heterogeneous cellular networks with practical SNR values. The main contributions of this paper are as follows. 1) With arbitrary channel coefficients, a novel layer partitioning method is designed based on the power level intersections between the signals and interference. 2) To maximize the network sum rate, a linear programming method was proposed to optimize the assignment of active transmit layers. 3) A nested lattice coding scheme is developed to implement the encoding and decoding when the power levels of each interference are not exactly aligned. 4) The performance of the proposed scheme applied in cellular networks is evaluated, and the affecting factors in different network scenarios are analyzed.

The rest of this paper is organized as follows: In Section 2, we first study the optimal active layer assignment under deterministic interference channel models. Then, based on the obtained insight, we study K-user Gaussian interference channel with arbitrary coefficients and study the layer partitioning and active layer assignment methods in Section 3. The encoding and decoding schemes are developed in Section 4, and the performance in cellular networks is evaluated in Section 5. Finally, Section 6 concludes the paper.

2 Interference alignment in deterministic channels

2.1 Deterministic channel model

It is very hard to directly study the interference network problem under Gaussian channels. In this paper, we first resort to the deterministic channel model to gain some insights on the layered interference alignment problem and then extend the idea to general Gaussian interference channels. The deterministic channel model is an approximation methodology developed to solve network information theory problems [36, 37]. Its general principle is that the coding problem in a noisy channel is first approximated by a noiseless problem, then analyze the simplified problem, and use insights obtained from the simplified problem to find new achievable schemes and/or outer bounds of the original problem [38]. The deterministic channel model approximates the Gaussian channel as a discrete set of parallel noiseless channels.

In the single-user Gaussian channel, a real-valued input x generates a real-valued output y that is degraded by Gaussian noise z, that is
$$ y=hx + z, $$
(1)

where h is the channel coefficient, E[x 2]=P, and the variance of z is N 0. The SNR is thus defined as h 2 P/N 0=γ. If x and z are normalized, then the effective channel gain is \(\sqrt {\gamma }\).

To transform the Gaussian channel to a deterministic channel, we first represent the normalized x in a base-2 notation as
$$ \bar{x}=0.b_{1} b_{2} b_{3} b_{4} b_{5} \ldots, $$
(2)

where each bit b i can be interpreted as occupying a signal level, and the most significant bit coincides with the highest level. Since \(\bar {x}\) is a normalized value, \(\bar {x}<1\), all the bits b i are in fractional part.

Given the SNR γ, the output of the deterministic channel model is
$$ \bar{y}=\lfloor 2^{\alpha} \bar{x} \rfloor = b_{1} b_{2} \ldots b_{\alpha}, $$
(3)

where α=log2γ is the largest integer not exceeding log2γ and b α is the smallest signal level containing a transmit power larger than 1/2 α . In other words, the input bit sequence is shifted by α positions and the remained part after b α is truncated due to the degradation of noise.

In the K-user Gaussian interference channels, the inputs of K users form a vector x, and the output vector is
$$ \boldsymbol{y}=\boldsymbol{H}\boldsymbol{x} + \boldsymbol{z}, $$
(4)

where the entry of channel matrix H i,j stands for the channel gain from transmitter j to receiver i. The noise of different users is assumed to be independent and identically distributed (i.i.d.), and E[z z H ]=N 0 I. The SNRs depend on the direct channel gains and are defined as \(\gamma _{k,k}=H^{2}_{k,k}P_{k}/N_{0}\), and the INRs depend on the cross-channel gains and are defined as \(\gamma _{i,j}=H^{2}_{i,j}P_{j}/N_{0}\). These SNRs and INRs compose a link quality matrix Γ, whose (i,j)-th entry is γ i,j .

Defining α i,j =log2γ i,j , and applying (3) to every direct and cross-links of (4), we obtain the deterministic model of interference channel. The input-output relationship is shown in the left part of Fig. 1, for the convenience of demonstration; the input levels are also shifted by α k,k positions so that the inputs and outputs of the direct links are at the same levels. For the cross-link from transmitter j to receiver i, the shifting is thus changed to α i,j α j,j instead of α i,j . At each receiver, the direct-link outputs (signal) and the cross-link outputs (interference) are added together when they are on the same level, and the outputs below the noise level are discarded. Rather than the normal integer addition, modulo-2 addition is chosen here to avoid interaction between different levels. This is a simplified operation only applied in the deterministic model. In Gaussian channels, the addition of signals and interference will produce carry-over problem, which will be addressed in Section 3.
Fig. 1
Fig. 1

An example of deterministic interference channel with three users, where the matrix of {α i,j } is [4 2 3;4 4 4;0 4 4]. The left part shows the input-output relationship and the right part shows the active level assignment result, where solid lines denote signal links and dashed lines denote interference links

2.2 Alignment in amplitude space

From the left part of Fig. 1, we can see that, if all the transmit levels are active, there must be collisions between signals and interference. To avoid collision, only part of the transmit levels can be active. Therefore, we need to study an optimal active level assignment algorithm to avoid collision and simultaneously maximize the network sum rate.

In the K-user deterministic interference channel, each active level conveys one bit. To avoid collision, each level at the receiver side should be occupied either by a signal bit or by an interference bit. Actually, this interference bit can be a modulo-2 addition of several interference bits, since it is not necessary to decode each of these interference bits separately. In order to leave as many receive levels as possible “free” for reception of signal bits, it will be advantageous if multiple interference bits fall on one receive level. This is the principle of interference alignment in amplitude space: the alignment of interference saves amplitude levels for desired signals and thus the throughput can be increased.

The optimal active level assignment problem can be formulated as
$$\begin{array}{@{}rcl@{}} &&{\max} \sum_{k=1}^{K} \sum_{l=1}^{\alpha_{k,k}} b_{k,l}, \\ && ~\mathrm{s.t.}~ b_{k,l} \in \{0, 1\}, \\ &&\qquad b_{k,l} + b_{j,l'} \le 1, ~~\forall j,k,l~ \text{and}~ j \ne k \end{array} $$
(5)

where b k,l indicates whether the l-th transmit level of user k is active or not, and l=l +(α k,j α j,j ). When the level is active, b k,l =1, otherwise b k,l =0. The second constraint means that, if the l -th level of user j interferes with the l-th level of user k through the cross-link, b k,l and \(b_{j,l^{\prime }}\) can not be “1” simultaneously; otherwise, the received signal is not decodable. Since the transmit levels of user j are shifted by α k,j α j,j positions when they arrive at receiver k, the l -th transmit level of user j will fall on level l +(α k,j α j,j ) at receiver k. Thus,when l=l +(α k,j α j,j ), \(b_{j,l^{\prime }}\) is an interference to b k,l , and these two bits are not allowed to be “1” simultaneously.

If there is another user i and its l ′′-th level \(b_{i,l^{\prime \prime }}\) also interfere with b k,l , similarly there will be a constraint that \(b_{k,l} + b_{i,l^{\prime \prime }} \le 1\). However, we do not restrict the summation of the interference bits, i.e., \(b_{j,l^{\prime }} + b_{i,l^{\prime \prime }}\) can be any value even when they fall on the same level at receiver k. If both \(b_{i,l^{\prime \prime }}\) and \(b_{j,l^{\prime }}\) are active, where l ′′+(α k,i α i,i )=l +(α k,j α j,j )=l, the constraint can still be satisfied as long as b k,l =0.

The optimization problem in (5) is a binary integer programming problem, which can be solved efficiently by a linear programming (LP)-based branch-and-bound algorithm [39]. The algorithm searches for an optimal solution to the binary integer programming problem by solving a series of LP relaxation problems, in which the binary integer requirement on the variables is replaced by the weaker constraint 0≤b k,l ≤1.

One example of the optimized results is shown in the right part of Fig. 1. We can see the features of an amplitude-aligned interference network. From the transmitter side, each user has different active level assignment, and the active levels may not be contiguous. At the receiver side, several interference links might be aligned on one level, and the interference levels might be above, below, or interlaced with the signal levels.

3 Interference alignment in Gaussian channels

The deterministic channel model described above assumes that all SNRs and INRs are integer on the log scale, i.e., the signals fall exactly on the evenly spaced “levels” at the receiver. In Gaussian channels, however, this assumption is not valid. In the following, we will address the interference alignment problem taking into account arbitrary SNR and INR values.

Given the link quality matrix Γ, at each receiver, there is one collision pattern in amplitude space, i.e., part of the desired signal may collide with part of the interference. The collision pattern changes at different receivers because they experience different SNR and INRs. The layer partitioning requires to find all the possible collision areas in the amplitude space between the signals and interference.

The layer partitioning procedure is shown in Fig. 2. For each user k, the SNR of the direct channel is γ k,k , which is represented by a bar with a height logγ k,k at the transmitter side. At receiver k, there are K bars representing the K received signals. Their relative positions in the amplitude space are affected by the corresponding SNRs and INRs. For user i’s bar, the upper and lower boundaries are logγ k,i and logγ k,i − logγ i,i , respectively. If the bar of user j,jk, overlaps with the bar of user k, both bars are split (separated into different layers) at the intersecting boundary positions. Repeating these processes at every receiver, we will obtain at most 2K(K−1) layers for each transmit signal. The results shown in Fig. 2 are obtained when a group of random values are set for Γ, i.e.,
$$ 10 \log_{10} \boldsymbol{\Gamma} = \left[ \begin{array}{llll} 7.43 & 3.47 & 1.57 & 8.69 \\ 7.42 & 6.51 & 4.16 & 3.92 \\ 3.45 & 7.18 & 9.40 & 2.53 \\ 8.84 & 9.58 & 4.50 & 8.33 \\ \end{array} \right] \text{dB}. $$
(6)
Fig. 2
Fig. 2

From left to right: the transmit signal before layer partitioning, the received signals of different users, and the layer partitioning results

After layer partitioning, user k has L k layers in the transmitter side, and the upper and lower boundaries of the l-th layer are respectively P k,l and P k,l−1. Thus, the l-th layer has an amplitude space represented by ρ k,l =P k,l /P k,l−1. Assume now that we have a layered transmission scheme where the bits in the highest layers are decoded first. Thus, the decisions of the current layer can at most be disturbed by as-yet undecoded layers, i.e., the layers with a lower power than the current one. Thus, ρ k,l can be viewed as a signal-to-interference ratio (SIR) of this layer. If Shannon capacity achieved transmission were used, R k,l =1/2 log(1+ρ k,l ) bits could be transmitted in this layer. Considering the encoding and decoding methods to be introduced in Section 4, which have a rate loss of at most 0.5 bit, we use R k,l =1/2 log(ρ k,l ).

As in the deterministic model of Section 2, some layers must be inactive to avoid collision between the layered signals of different users. We can still apply the binary integer programming algorithm to search the optimal active layer assignment, so that the total throughput can be maximized. In Gaussian channels, since each layer has different amplitude space, the objective function should be weighted by the transmission capability of each layer, i.e., R k,l . The optimization problem is therefore formulated as
$$\begin{array}{@{}rcl@{}} &&{\max} \sum_{k=1}^{K} \sum_{l=1}^{L_{k}} R_{k,l} b_{k,l}, \\ && ~\mathrm{s.t.}~ b_{k,l} \in \{0, 1\}, \\ &&\qquad b_{k,l} + b_{j,l'} \le 1, ~~\forall j,k,l~ \text{and}~ j \ne k \end{array} $$
(7)

where b k,l denotes the transmit state of layer l of user k. When this layer is active, b k,l =1, otherwise b k,l =0. The second constraint is to avoid collision between the desired signal and interferences. If the l -th layer of user j interferes with the l-th layer of user k through the cross-link, b k,l and \(b_{j,l^{\prime }}\) can not be “1” simultaneously. Unlike in the deterministic model, the relation between l and l does not have an explicit expression here.

This optimization problem can also be solved by the LP-based branch-and-bound algorithm. The search result is shown in Fig. 3, where the contiguous active layers are combined. We can see that some interference layers overlap and occupy the same part of the amplitude space, but they may not be strictly aligned with respect to the upper and lower boundaries. Since we need to decode the superimposed interference, this kind of alignment complicates the encoding designs. We will discuss in detail the encoding and decoding schemes in Section 4.
Fig. 3
Fig. 3

From left to right: the transmit layer assignment, the received signals of different users, and the desired signal and undesired interference, where the grey blocks denote the superimposed interference

Different from the deterministic channels, the addition of two layers of interference has a higher signal level than any of the two layers, i.e., the carry-over problem must be considered. The active layers assigned through (7) might be tightly connected, which means that at one receiver the lower boundary of an upper signal layer might be the upper boundary of a lower interference layer. If the interference layer is superimposed from two or more users, the carry-over part might collide with the upper signal layer. Therefore, at the bottom of the signal layer, we need to reserve some amplitude space for the carry-over interference. In practice, this can be done by retaining the transmit power and reducing the data rate of the upper signal layer.

For example, at receiver k, suppose there are two interference layers below the signal layer l. One is from user j, and the upper boundary is \(h^{2}_{k,j}P_{j,l^{\prime }}\); the other is from user i, and the upper boundary is \(h^{2}_{k,i}P_{i,l^{\prime \prime }}\). Thus, the lower boundary of the signal layer l at the transmitter side is changed into
$$ \tilde{P}_{k,l-1} = \max \left\{P_{k,l-1}, \frac{h^{2}_{k,j}P_{j,l'} + h^{2}_{k,i}P_{i,l^{\prime\prime}}}{h^{2}_{k,k}} \right\}, $$
(8)

where the first term inside the maximum operation is the upper boundary of the (l−1)-th layer of user k, and the second term is the sum power of two layers of interference divided by the square of the direct-link channel gain. If the second term is larger, at receiver k, the lower boundary of the l-th layer of user k is changed from \(h^{2}_{k,k} P_{k,l-1}\) to \(h^{2}_{k,j}P_{j,l^{\prime }} + h^{2}_{k,i}P_{i,l^{\prime \prime }}\). The reserved space is at most 3 dB and thus the data rate loss is at most 0.5 bit. When the lower layer is occupied by the superimposed interference from K users, the reserved space is at most 10 log10(K) dB and the data rate loss is at most 1/2 log(K) bits. This data rate loss can be neglected compared to the increasing sum rate when SNR goes to infinity.

4 Implementation by multi-level nested lattice codes

In the layered interference alignment scheme, since the superimposed interference layers need to be decoded, random coding is no longer applicable. We thus present a coding scheme with multi-level nested lattice codes in this section. Lattice coding is a structural coding; if there are two codewords that are selected from a lattice, their sum and difference are also within the same lattice. Thus, we can directly decode the superposition of the aligned interferences, instead of decoding the interference signals one by one.

A lattice Λ is an n-dimensional discrete subgroup of the Euclidean space \(\mathbb {R}^{n}\) under vector addition. Thus, if λ 1 and λ 2 are in Λ, their sum and difference are also in Λ. A lattice Λ 2 is said to be nested in a lattice Λ 1 if Λ 2Λ 1. The lattice Λ 1 is often referred to as a fine lattice and Λ 2 as a coarse lattice. A nested lattice code \(\mathcal {L}\) is the set of all points of the fine lattice that are within the fundamental Voronoi region \(\mathcal {V}_{2}\) of the coarse lattice, i.e., \(\mathcal {L} = \Lambda _{1} \cap \mathcal {V}_{2}\).

For any two powers P a P b ≥0, [40] shows that there exist nested n-dimensional lattices Λ 2Λ 1, as n, their second moment σ 2(Λ 2)=P a , σ 2(Λ 1)=P b , and the coding rate of \(\mathcal {L}\) satisfies
$$ R = \frac{1}{n} \log |\mathcal{L}| = \frac{1}{n} \log \frac{\text{Vol}(\mathcal{V}_{2})} {\text{Vol}(\mathcal{V}_{1})} = \frac{1}{2}\log\left(\frac{P_{a}}{P_{b}} \right), $$
(9)

where \(|\mathcal {L}|\) is the cardinality of set \(\mathcal {L}\) and \(\text {Vol}(\mathcal {V}_{i})\) is the volume of Voronoi region \(\mathcal {V}_{i}\).

In [41], it is shown that nested lattice codes can achieve the capacity of point-to-point AWGN channels. In [42], a doubly nested lattice coding scheme was provided which can approach the capacity region of a two-way relay channel within 0.5 bit. Reference [43] provides a practical implementation scheme for nested lattice coding, where turbo coding and trellis shaping (multidimensional quantization) are involved. Due to space limitation, we refer the interested reader to [44, 45] for the detailed definitions and general construction methods of lattice codes.

For the transmitter k, define a sequence of nested lattice Λ k,0, Λ k,1, , \(\Lambda _{k,L_{k}}\), where \(\Lambda _{k,L_{k}} \subseteq \cdots \subseteq \Lambda _{k,1} \subseteq \Lambda _{k,0}\). The second moment of Λ k,l is σ 2(Λ k,l )=P k,l .

The codebook used by level l is a nested lattice code \(\mathcal {C}_{k,l} = \Lambda _{k,l-1} \cap \mathcal {V}_{k,l}\), and the codeword \(\boldsymbol {c}_{k,l} \in \mathcal {C}_{k,l}\). The rate of this code is
$$ R_{k,l} = \frac{1}{n} \log \frac{\text{Vol}(\mathcal{V}_{k,l})} {\text{Vol}(\mathcal{V}_{k,l-1})} = \frac{1}{2}\log\left(\frac{P_{k,l}}{P_{k,l-1}} \right). $$
(10)
The transmitted signal of user k is the summation of all the codewords where the corresponding layers are active, i.e.,
$$ \boldsymbol{s}_{k} = \sum_{l=1}^{L_{k}} b_{k,l} \boldsymbol{c}_{k,l}. $$
(11)
The received signal at user k is the superposition of the signals from all transmitted users, which is
$$ \boldsymbol{r}_{k} = \sum_{j=1}^{K} h_{k,j} \boldsymbol{s}_{j} + \boldsymbol{v}_{k}. $$
(12)

However, it has decoding problem if we just use L k layers of nested lattice code for each user k. As shown in Fig. 3, the received signals and interference are in layers and might be interlaced. If an interference layer is above a signal layer, we need first to decode and cancel the interference layer before decoding the signal layer. If the interference from two or more users exist above a signal layer, we need to decode the superimposed interference irrespective of whether the boundaries of interference layers are aligned or not.

For example, at receiver k, above the l-th signal layer there is a superimposed interference layer that is added by the l -th layer of user j and the l ′′-th layer of user i. The upper boundary of the signal layer is \(h^{2}_{k,k} P_{k,l}\), and the lower boundaries of two interference layers are respectively \(h^{2}_{k,j} P_{j,l'-1}\) and \(h^{2}_{k,i} P_{i,l^{\prime \prime }-1}\), where we have \(h^{2}_{k,j} P_{j,l'-1} \ge h^{2}_{k,k} P_{k,l}\) and \(h^{2}_{k,i} P_{i,l^{\prime \prime }-1} \ge h^{2}_{k,k} P_{k,l}\).

The received signal codeword is h k,k c k,l h k,k Λ k,l−1, and the received interference codewords are \(h_{k,j}\boldsymbol {c}_{j,l^{\prime }} \in h_{k,j}\Lambda _{j,l^{\prime }-1}\) and \(h_{k,i}\boldsymbol {c}_{i,l^{\prime \prime }} \in h_{k,i}\Lambda _{i,l^{\prime \prime }-1}\). To decode the superimposed interference \(h_{k,j}\boldsymbol {c}_{j,l'}+h_{k,i}\boldsymbol {c}_{i,l^{\prime \prime }}\), we require that the lattices \(h_{k,j}\Lambda _{j,l^{\prime }-1}\) and \(h_{k,i}\Lambda _{i,l^{\prime \prime }-1}\) are aligned or nested. Through adjusting the transmit powers of related layers, we can make \(h_{k,j}\Lambda _{j,l^{\prime }-1}\) and \(h_{k,i}\Lambda _{i,l^{\prime \prime }-1}\) aligned at receiver k, but it is impossible to simultaneously make \(h_{k^{\prime },j}\Lambda _{j,l^{\prime }-1}\) and \(h_{k^{\prime },i}\Lambda _{i,l^{\prime \prime }-1}\) aligned at another receiver k .

To solve this problem, we just require a relationship that \(h_{k,j}\Lambda _{j,l^{\prime }-1}\) and \(h_{k,i}\Lambda _{i,l^{\prime \prime }-1}\) are nested at receiver k. Since \(h^{2}_{k,j} P_{j,l'-1} \ge h^{2}_{k,k} P_{k,l}\) and \(h^{2}_{k,i} P_{i,l^{\prime \prime }-1} \ge h^{2}_{k,k} P_{k,l}\), we can add a level of nested lattice Λ j,m with second moment \(h^{2}_{k,k}/h^{2}_{k,j} P_{k,l}\) at transmitter j, and add a level of nested lattice Λ i,m with second moment \(h^{2}_{k,k}/h^{2}_{k,i} P_{k,l}\) at transmitter i. The lattice nesting relation becomes \(\Lambda _{j,l^{\prime }-1} \subseteq \Lambda _{j,m} \subseteq \Lambda _{j,l^{\prime }-2}\) and \(\Lambda _{i,l^{\prime \prime }-1} \subseteq \Lambda _{i,m} \subseteq \Lambda _{i,l^{\prime \prime }-2}\). Thus, both \(h_{k,j}\boldsymbol {c}_{j,l^{\prime }}\) and \(h_{k,i}\boldsymbol {c}_{i,l^{\prime \prime }}\) are nested in h k,k Λ k,l . Obviously, their sum is also nested in h k,k Λ k,l . The superimposed interferences can then be decoded. Similarly, at receiver k , if there are interference layers above the signal layers and the interference layer is superimposed from multiple users, we can add more levels of nested lattice at the transmitter side to make the received interference codewords nested.

After these level insertion operations, the nested lattice levels increase to \(L_{k}^{+}\) for user k, but the number of active signal layers does not change. The decoded codeword of the l-th signal layer is
$$ \hat{\boldsymbol{c}}_{k,l} = \left[Q_{\Lambda_{k,l-1}}(\boldsymbol{r}_{k})\right] ~\text{mod}~ \Lambda_{k,l}, $$
(13)

i.e., the received signal r k is first quantized to lattice Λ k,l−1 and then taken a modulus operation relative to lattice Λ k,l . The quantization operation is to mitigate the interference of lower layers, and the modulus operation can mitigate the interference of the upper layers by decoding and cancelation.

The developed implementation scheme is based on the idea of nested alignment and can guarantee the superimposed interference decodable at every receiver with any kind of power relationships.

5 Simulation results

We first study the performance of the layered IA scheme in deterministic interference channels and compare it with the orthogonal transmission scheme, and a virtual IA scheme where each user can achieve 1/2 DoF of the channel.

The virtual IA scheme demonstrated here is not a real transmission scheme. Since currently there is only DoF result for the layered IA transmission with arbitrary channel coefficients, we use this result to provide a performance benchmark of the achievable sum rate. In the virtual IA scheme, we compute the achievable rate of each user based on its SNR and without taking into account the impact of interference, and the sum rate of K users is obtained by the summation of each user’s achievable rate and divided by 2. This method reflects the fact that each user can exploit 1/2 DoF of the channel. If there is only one user, this user will use the full DoF of the channel. The sum rate obtained in this way is labeled as “ K/2 DoF” in Figs. 4 and 5. When SNR approaches infinity, the DoF result can reflect the upper bound of channel capacity. However, in moderate SNR values the achieved rate obtained from the DoF may have large difference with the capacity.
Fig. 4
Fig. 4

Compare the average sum rate of the layered IA scheme with the virtual IA scheme and the orthogonal transmission scheme in deterministic interference channels

Fig. 5
Fig. 5

Compare the average sum rate of the layered IA scheme with the virtual IA scheme and the orthogonal transmission scheme in Gaussian interference channels

In deterministic models, the logarithmic channel gains are integer. We set the logarithmic SNRs and INRs as random integer selected from 1 6. In K-user orthogonal transmission scheme, each user occupies 1/K of the time or frequency resources no matter what the SNRs and INRs are. The corresponding results are shown in Fig. 4. We can see that the sum rate of the virtual IA scheme linearly increases with the number of users when K≥2, but its performance is not the best for all cases. In two-user or three-user interference channels, the proposed layered IA scheme can achieve higher sum rate. According to the optimization process in Section 2, the active level assignment is not an equal distribution among users. By contrast, the user with better channel conditions (e.g., large SNR and small INR) might be assigned more active levels to maximize the sum rate. Hence, when the number of users is not too much, the optimized level assignment scheme outperforms the scheme that each user exploits one half of the channel resource. In interference channels with more than three users, the virtual IA scheme will gradually dominate the performance due to the advantage that each user can exploit 1/2 DoF of the channel. No matter how many users exist, the achieved sum rate of the orthogonal transmission scheme always keeps unchanged.

The comparisons of the layered IA scheme and other two schemes in Gaussian channels are shown in Fig. 5, where the SNRs and INRs are all randomly selected from 0 40 dB. Because of the carry-over effect, in moderate SNR levels, the achieved sum rate of the layered IA scheme grows not as fast as in deterministic channels. Yet with two and three users, the layered IA scheme still outperforms the virtual IA scheme. Similarly, with more users the virtual IA scheme will dominate the performance again since its achieved sum-rate keeps linearly increased.

We then investigate the performance of the layered IA scheme in cellular systems. Two network topologies, i.e., homogeneous networks and heterogeneous networks, are respectively studied. In homogeneous networks, every cell has similar coverage and the user is probably interfered by all other adjacent BSs. In heterogeneous networks, the macro-BS may interfere with a lot of pico-cell users, but the pico-BS only interferes with a few macro-cell users. Both kinds of cellular deployment are shown in Fig. 6.
Fig. 6
Fig. 6

Cellular deployment for homogeneous and heterogeneous networks

No matter in homogeneous or heterogeneous network deployments, we consider single-antenna configurations for BSs and users. This is to show the performance gain purely provided by the amplitude-space sharing scheme. The inter-site distance of the macro-BSs is 500 m, and the cell radius of pico-cell is 30 m. The transmit powers of macro-BS and pico-BS are 46 and 30 dBm, respectively. The path loss models for macro-BS to users and for pico-BS to users are chosen according to the 3GPP channel model [46]
$$\begin{array}{@{}rcl@{}} \text{PL}_{1} &=& 15.3 + 37.6 \log_{10} (D), \\ \text{PL}_{2} &=& 30.6 + 36.7 \log_{10} (D), \end{array} $$

where D is the distance between the BS and user. The cell-edge SNR is set as 5 dB, and small-scale Rayleigh fading is also considered.

We first observe the performance of layered IA scheme in three-cell homogeneous networks. Although the proposed scheme can be applied with any number of cells, for the homogeneous deployment, the interferences to one cell are mainly from the adjacent two cells. The outer cells with further distance only contribute noisy interference and will not affect the layer participation and alignment scheme. In this configuration, two kinds of user distribution are simulated. The first is symmetric distribution, where the macro-users are moved along the line connecting the macro-BS and the central vertex of the three cells, as the asterisks (“*”) shown in Fig. 6, and their distances to macro-BSs are the same. The second is random distribution, where the macro-users are randomly distributed in the cell-edge areas, as the dots (“ ·”) shown in Fig. 6, and the cell-edge boundaries are changed symmetrically. Conventionally, a FFR scheme is used to avoid inter-cell interference in the cell edge areas, where each cell uses 1/3 of the available bandwidth. In the layered IA scheme, we use frequency reuse factor of one, i.e., every cell uses all the bandwidth, and the interference are coordinated in the amplitude space. The sum rate performances are shown in Fig. 7. We can see that the layered IA scheme has approximately two times of the data rate over the FFR scheme both for the symmetric and random user distribution scenarios. The performance gain increases as the users approach the BSs. Although with small-scale fading, when the users are close to the BSs, the average SNRs are higher and the average INRs are lower; thus, there are more opportunities to assign active layers. The random distribution scenario is more practical; when the cell-edge boundary moves far away from the BS, the average sum rate achieved in this scenario can be greater than that in symmetric distribution scenario. The reason is that random user distribution diverges the SNR and INR values, which also creates more opportunities to assign active layers.
Fig. 7
Fig. 7

Compare the average sum rates of the layered IA scheme and the FFR scheme in three-cell homogeneous networks

The performance of the layered IA scheme in heterogeneous networks is evaluated in Fig. 8, where 1 3 pico-cells coexisting with one macro-cell are considered. In this kind of deployment, the macro-user is randomly distributed in one sector of the macro-cell, as shown in Fig. 6, and there is also one pico-user randomly distributed in each pico-cell. The layered IA scheme demonstrates great potential in this scenario, and the performance gain keeps increasing along with more coexisting pico-cells. When the distance between the pico-BS and macro-BS changes, the sum rate varies in different patterns with different number of pico-cells. With only one pico-cell coexists with the macro-cell, it constitutes a two-user interference channel. Although the position of the macro-user is random, the interference scenarios that the pico-user experienced have certain rules to follow. When the pico-cell moves from cell center to cell edge, the interference caused by the macro-BS to the pico-user will change from strong to weak. In this kind of two-user interference channel, the sum rate is higher both in strong interference or weak interference scenarios and is lower when the interference has a similar strength with the signal. From the explanation in Section 3, we also know that the strong interference can share the upper amplitude space above the signal layer, and the weak interference can share the lower amplitude space below the signal layer. If the interference has a similar strength as the signal, both the signal and the interference will reduce their occupied amplitude space for coexisting. In the simulation results of Fig. 8, the average sum rate for one pico-cell configuration is a concave curve, which subsidizes our analysis.
Fig. 8
Fig. 8

Compare the average sum rates of the layered IA scheme in heterogeneous networks with different number of pico-cells

When the number of pico-cells increases to two and three, the sum rate curves are monotonically increasing. The reason behind this phenomenon is the interference among the pico-cells. In the simulations, the SNRs and INRs of all links are computed from the transmit power and the simulated channel gains, which include the large-scale path loss and small-scale Rayleigh fading. When the pico-cells are close to the macro-BS, as can be seen from Fig. 6, the distances between these pico-cells are shorter. In this scenario, not only the interference from macro-BS to pico-users is stronger but also the interference from pico-BSs to pico-users. When the pico-cells move away from the macro-BS, the interference from macro-BS and pico-BS are all weaker. As observed in Section 3, the layer partitioning and assignment are complicated in the multi-user case. Although we do not provide an explicit analysis, the simulation results show that the average sum rate will increase when we move the pico-cells towards the macro-cell edge.

6 Conclusions

In this paper, we proposed a layered interference alignment scheme for Gaussian interference networks with arbitrary channel coefficients and applied the idea of amplitude-space sharing to homogeneous and heterogeneous cellular networks. We introduced a layer partitioning method and optimized the active layer assignment based on the insights obtained in deterministic channels. The transmission is implemented by multiple-level nested lattice codes, where the encoding method is judiciously designed to guarantee the superimposed interference layers keep aligned at all receivers. Simulation results show that in Gaussian interference channels the achieved sum rate grows with the number of users, and with two or three users, the proposed scheme outperforms the virtual scheme that each user occupies half of the channel resource. In practical cellular systems, the layered IA scheme provided evident rate gain over the orthogonal-based transmission schemes and showed great potential to mitigate the complicated co-tier and cross-tier interferences in heterogeneous networks.

Declarations

Acknowledgements

This work was supported by the National Natural Science Foundation of China under Grant 61371077.

Authors’ Affiliations

(1)
School of Electronics and Information Engineering, Beihang University, 37 Xueyuan Road, Beijing, 100191, People’s Republic of China

References

  1. S-P Yeh, S Talwar, G Wu, N Himayat, K Johnsson, Capacity and coverage enhancement in heterogeneous networks. IEEE Wireless Commun. Mag. 18(3), 32–38 (2011).View ArticleGoogle Scholar
  2. J Hoydis, M Kobayashi, M Debbah, Green small-cell networks. IEEE Veh. Technol. Mag. 6(1), 37–43 (2011).View ArticleGoogle Scholar
  3. D Lopez-Perez, I Guvenc, G de la Roche, M Kountouris, TQS Quek, J Zhang, Enhanced intercell interference coordination challenges in heterogeneous networks. IEEE Wireless Commun. Mag. 18(3), 22–30 (2011).View ArticleGoogle Scholar
  4. S Chatzinotas, B Ottersten, in 19th International Conference on Telecommunications (ICT). Cognitive interference alignment between small cells and a macrocell (Jounieh, Lebanon, 23 April 2012).Google Scholar
  5. Y Jeong, H Shin, MZ Win, in Proc. IEEE 22nd International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC). Interference rejection combining in two-tier femtocell networks (Toronto, Canada, 11 September 2011).Google Scholar
  6. W Shin, W Noh, K Jang, H-H Choi, Hierarchical interference alignment for downlink heterogeneous networks. IEEE Trans. Wireless Commun. 11(12), 4549–4559 (2012).View ArticleGoogle Scholar
  7. M Maso, M Debbah, L Vangelista, A distributed approach to interference alignment in OFDM-based two-tiered networks. IEEE Trans. Veh. Technol. 62(5), 1935–1949 (2013).View ArticleGoogle Scholar
  8. VR Cadambe, SA Jafar, Interference alignment and degrees of freedom of the K-user interference channel. IEEE Trans. Inf. Theory. 54(8), 3425–3441 (2008).MATHMathSciNetView ArticleGoogle Scholar
  9. T Gou, SA Jafar, Degrees of freedom of the K user M×N MIMO interference channel. IEEE Trans. Inf. Theory. 56(12), 6040–6057 (2010).MathSciNetView ArticleGoogle Scholar
  10. AS Motahari, AK Khandani, Capacity bounds for the Gaussian interference channel. IEEE Trans. Inf. Theory. 55(2), 620–643 (2009).MathSciNetView ArticleGoogle Scholar
  11. X Shang, G Kramer, B Chen, A new outer bound and the noisy interference sum-rate capacity for Gaussian interference channels. IEEE Trans. Inf. Theory. 55(2), 689–699 (2009).MathSciNetView ArticleGoogle Scholar
  12. VS Annapureddy, VV Veeravalli, Gaussian interference networks: sum capacity in the low-interference regime and new outer bounds on the capacity region. IEEE Trans. Inf. Theory. 55(7), 3032–3050 (2009).MathSciNetView ArticleGoogle Scholar
  13. VS Annapureddy, VV Veeravalli, Sum capacity of MIMO interference channels in the low interference regime. IEEE Trans. Inf. Theory. 57(5), 2565–2581 (2011).MathSciNetView ArticleGoogle Scholar
  14. AB Carleial, A case where interference does not reduce capacity. IEEE Trans. Inf. Theory. 21(5), 569–570 (1975).MATHMathSciNetView ArticleGoogle Scholar
  15. H Sato, The capacity of the Gaussian interference channel under strong interference. IEEE Trans. Inf. Theory. 27(6), 786–788 (1981).MATHView ArticleGoogle Scholar
  16. X Shang, HV Poor, Capacity region of vector Gaussian interference channels with generally strong interference. IEEE Trans. Inf. Theory. 58(6), 3472–3496 (2012).MathSciNetView ArticleGoogle Scholar
  17. Y Tian, S Lu, C Yang, Macro-pico amplitude-space sharing with optimized Han-Kobayashi coding. IEEE Trans. Commun. 61(10), 4404–4415 (2013).View ArticleGoogle Scholar
  18. TS Han, K Kobayashi, A new achievable rate region for the interference channel. IEEE Trans. Inf. Theory. 27(1), 49–60 (1981).MATHMathSciNetView ArticleGoogle Scholar
  19. RH Etkin, DNC Tse, H Wang, Gaussian interference channel capacity to within one bit. IEEE Trans. Inf. Theory. 54(12), 5534–5562 (2008).MATHMathSciNetView ArticleGoogle Scholar
  20. SA Jafar, Interference alignment - a new look at signal dimensions in a communication network. Found. Trends Commun. Inf. Theory. 7(1), 1–134 (2011).MathSciNetView ArticleGoogle Scholar
  21. VR Cadambe, SA Jafar, S Shamai, Interference alignment on the deterministic channel and application to fully connected Gaussian interference networks. IEEE Trans. Inf. Theory. 55(1), 269–274 (2009).MathSciNetView ArticleGoogle Scholar
  22. RH Etkin, E Ordentlich, The degrees-of-freedom of the K-user Gaussian interference channel is discontinuous at rational channel coefficients. IEEE Trans. Inf. Theory. 55(11), 4932–4946 (2009).MathSciNetView ArticleGoogle Scholar
  23. Y Wu, S Shamai, S Verdu, in IEEE International Symposium on Information Theory. Degrees of freedom of the interference channel: a general formula (Saint-Petersburg, Russia, 31 July 2011).Google Scholar
  24. AS Motahari, S Oveis-Gharan, M Maddah-Ali, AK Khandani, Real interference alignment: exploiting the potential of single antenna systems. IEEE Trans. Inf. Theory. 60(8), 4799–4810 (2014).MathSciNetView ArticleGoogle Scholar
  25. SH Mahboubi, M Hussain, AS Motahari, AK Khandani, Layered interference alignment: achieving the total DoF of MIMO X channels. arXiv:1412.7188 (2014).Google Scholar
  26. WM Schmidt, Diophantine Approximation (Springer, Berlin, 1980).MATHGoogle Scholar
  27. GH Hardy, EM Wright, An Introduction to the Theory of Numbers (Oxford Science, Oxford, 2003).Google Scholar
  28. M Hussain, J Levesley, The metrical theory of simultaneously small linear forms. Funct. Approx. Comment. Math. 48(2), 167–181 (2013).MATHMathSciNetView ArticleGoogle Scholar
  29. M Hussain, S Kristensen, Metrical results on systems of small linear forms. Int. J. Number Theory. 9(3), 769–782 (2013).MATHMathSciNetView ArticleGoogle Scholar
  30. V Beresnevich, D Dickinson, S Velani, RC Vaughan, Diophantine approximation on planar curves and the distribution of rational points. Ann. Math. 166(2), 367–426 (2007).MATHMathSciNetView ArticleGoogle Scholar
  31. V Beresnevich, Rational points near manifolds and metric Diophantine approximation. Ann. Math. 175(1), 187–235 (2012).MATHMathSciNetView ArticleGoogle Scholar
  32. D Badziahin, S Harrap, M Hussain, An inhomogeneous Jarník type theorem for planar curves. arXiv:1503.04981 (2015).Google Scholar
  33. SA Jafar, S Vishwanath, Generalized degrees of freedom of the symmetric Gaussian K user interference channel. IEEE Trans. Inf. Theory. 56(7), 3297–3303 (2010).MathSciNetView ArticleGoogle Scholar
  34. A Jafarian, S Vishwanath, Achievable rates for K-user Gaussian interference channels. IEEE Trans. Inf. Theory. 58(7), 4367–4380 (2012).MathSciNetView ArticleGoogle Scholar
  35. O Ordentlich, U Erez, On the robustness of lattice interference alignment. IEEE Trans. Inf. Theory. 59(5), 2735–2759 (2013).MathSciNetView ArticleGoogle Scholar
  36. G Bresler, A Parekh, DNC Tse, The approximate capacity of the many-to-one and one-to-many Gaussian interference channels. IEEE Trans. Inf. Theory. 56(9), 4566–4592 (2010).MathSciNetView ArticleGoogle Scholar
  37. AS Avestimehr, SN Diggavi, DNC Tse, Wireless network information flow: a deterministic approach. IEEE Trans. Inf. Theory. 57(4), 1872–1905 (2011).MathSciNetView ArticleGoogle Scholar
  38. D Tse, It’s easier to approximate. Inf. Theory Soc. Newslett. 60(1), 6–11 (2010). (Plenary talk presented at the ISIT 2009).Google Scholar
  39. LA Wolsey, Integer Programming (John Wiley & Sons, New York, 1998).MATHGoogle Scholar
  40. W Nam, S-Y Chung, YH Lee, Capacity of the Gaussian two-way relay channel to within 1/2 bit. IEEE Trans. Inf. Theory. 56(11), 5488–5494 (2010).View ArticleGoogle Scholar
  41. U Erez, R Zamir, Achieving 1 2 log ( 1 + SNR ) $\frac {1}{2} \log (1 + \text {SNR})$ on the AWGN channel with lattice encoding and decoding. IEEE Trans. Inf. Theory. 50(10), 2293–2314 (2004).Google Scholar
  42. Y Tian, D Wu, C Yang, AF Molisch, Asymmetric two-way relay with doubly nested lattice codes. IEEE Trans. Wireless Commun. 11(2), 694–702 (2012).View ArticleGoogle Scholar
  43. U Erez, S Brink ten, A close-to-capacity dirty paper coding scheme. IEEE Trans. Inf. Theory. 51(10), 3417–3432 (2005).MATHView ArticleGoogle Scholar
  44. JH Conway, NJA Sloane, Sphere Packings, Lattices and Groups. (3rd, ed.) (Springer, New York, 1998).Google Scholar
  45. U Erez, S Litsyn, R Zamir, Lattices which are good for (almost) everything. IEEE Trans. Inf. Theory. 51(10), 3401–3416 (2005).MATHMathSciNetView ArticleGoogle Scholar
  46. 3GPP, in TR 36.814 V9.0.0. Further advancements for E-UTRA physical layer aspects, (2010).Google Scholar

Copyright

© Tian et al. 2015

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

Advertisement