# Reconfigurable antennas and link adaptation algorithms for MIMO-OFDM wireless systems

- George D Sworo
^{1}Email author, - Kapil R Dandekar
^{1}and - Moshe Kam
^{1, 2}

**2015**:156

https://doi.org/10.1186/s13638-015-0390-6

© Sworo et al. 2015

**Received: **6 May 2014

**Accepted: **18 May 2015

**Published: **6 June 2015

## Abstract

In this work, we study and analyze the performance of physical layer algorithms for adaptive multiple input-multiple output orthogonal frequency-division multiplexing (MIMO-OFDM) wireless systems that employ a new class of adaptive antenna systems known as reconfigurable antennas. These antennas are capable of adaptively modifying their radiation characteristics and thus leverage pattern diversity to affect how the transmitter and receiver perceive the wireless channel. We propose a low complexity spatial adaptive modulation and coding (AMC) algorithm that uses the advantages of pattern reconfigurable antennas in concert with link adaptation to improve MIMO-OFDM link throughput. The algorithm operates in two main stages; first, it searches for the antenna configuration that yields the highest post processing signal-to-noise ratio (ppSNR) and, then, applies AMC to improve spectral efficiency. The performance of the proposed scheme is experimentally evaluated for a 2×2 MIMO-OFDM wireless system in an indoor environment.

## Keywords

## 1 Introduction

Adaptive multiple input-multiple output (MIMO) wireless systems have been demonstrated to increase spectral efficiency and provide flexible data rates in multipath fading channels [1, 2]. Recent research in this area has either focused on adaptive antenna systems such as pattern reconfigurable antennas [1–8] or adaptive physical layer (PHY) techniques such as link adaptation [9–13] to enhance data rates.

Several studies [2–4] have proposed pattern reconfigurable antennas for MIMO-orthogonal frequency-division multiplexing (OFDM) systems. These antennas are capable of dynamically changing their radiation properties or patterns according to the wireless channel characteristics. Pattern reconfigurability has been shown to be effective in improving signal-to-noise ratios (SNR) at the receiver [3] and the channel capacity [4] in MIMO-OFDM systems.

Although several works [3, 4, 8] have demonstrated the benefits of reconfigurable antennas, translating the benefits of these antennas into a practical realizable MIMO communication system is very challenging. The cost of integrating and implementing the functionality of the reconfigurable antennas into the system and their complexity of operation have inhibited the process of integration. Moreover, the use of reconfigurable antennas also introduce the need for efficient selection algorithm to leverage the radiation pattern diversity resulting from the different antenna states to improve diversity gain. Specifically, the key challenge is in the selection of the optimal radiation pattern or state from all the available states for a transceiver pair in different wireless conditions. This challenge is compounded by the large antenna state search space that grows with the number of reconfigurable antenna elements used at the transmitter and receiver. Available closed-form solutions are either computationally complex or are based on generic assumptions that may not apply to all wireless channel environments. In this work, we attempt to redress this issue by employing a low-complexity spatially adaptive scheme for joint antenna state selection and adaptive modulation and coding (AMC) for throughput enhancement in MIMO-OFDM links with bit error rate constraint. We develop and test the proposed scheme in a software defined radio framework that leverages the capabilities of reconfigurable antennas and physical layer adaptation algorithms. This framework can potentially be used to integrate these antennas into practical MIMO communication systems.

Current generation standards such as 3rd Generation Partnership Project Long-Term Evolution (3GPP LTE) have employed similar techniques such as joint MIMO precoder and AMC to improve diversity gain through directional gain and interference reduction [14, 15]. Both precoding and reconfigurable-antenna-based signal processing exploit the channel state information by operating on the transmit signal using a weighting vector that essentially assigns more transmit power along beams with strong channel and vice versa. However, the key distinction between precoding techniques and antenna configuration selection algorithms is that, whereas precoding takes place at the baseband, the antenna configuration takes place at the RF domain using baseband level metrics.

The literature on AMC is vast, and for brevity, we consider the representative approaches found in [9–11]. These approaches provide the framework upon which other AMC techniques were modeled. The works in [9, 10] propose bit allocation schemes that attempt to maximize throughput over a set of modulation types given that the mean bit error rate (BER) is below a prescribed threshold. The model in [9] uses a peak BER threshold which cannot be exceeded by each subcarrier; the peak BER is adjusted iteratively until the throughput is maximized. Adaptive bit allocation is achieved by varying the signal constellation size according to the measured SNR values in each subcarrier; this allocation uses a different modulation type per subcarrier but does not consider coding. The model in [10] employs adaptive power allocation and bit loading on a per subcarrier basis, using an iterative technique known as water-filling AMC (WF-AMC).

The AMC algorithm proposed in this paper employs instead a fixed modulation type and coding rate across all subcarriers; it uses lookup tables known to both the transmitter and receiver to minimize the volume of feedback to the transmitter and reduce the computational complexity resulting from the iterative process used in [9, 10]. Another technique named block AMC (BL-AMC), presented in [11], builds on the model in [10] to reduce the volume of feedback information by performing AMC adaptation based only on a single OFDM symbol rather than on all subcarriers. It employs an exhaustive search algorithm for adapting a fixed modulation type and coding scheme across all subcarriers. The adaptation algorithm used in our study attempts to reduce the computational complexity by replacing the exhaustive search with fixed lookup tables.

We evaluate the experimental performance of the proposed scheme for a 2×2 MIMO-OFDM wireless system in an indoor environment. We demonstrate that the computational complexity of the proposed scheme is significantly lower than the relative values for the adaptation algorithms in [10, 11]. Furthermore, we demonstrate the advantage of using reconfigurable antennas in synergy with link adaptation for performance enhancement in MIMO systems. The proposed algorithm provides a suboptimal but practical alternative to established algorithms that may prove difficult to implement in a realistic wireless communications system.

The paper is organized as follows: “Introduction” section outlines the related work. Section “System model” describes the system model. Section “Spatially adaptive modulation and coding” discusses the proposed algorithm for spatial adaptation in detail. Section “Experimental setup and implementation” presents the experimental setup and the implementation framework including the hardware. Section “Performance results and analysis” presents the performance results and analysis, and “Conclusions” section provides a brief summary.

## 2 System model

The system is constructed by concatenating a convolutional encoder with an interleaver and a symbol mapper. After the mapping, the symbols in M-ary quadrature amplitude modulation (M-QAM) are modulated by the inverse fast Fourier transform (IFFT) and the appropriate cyclic prefix is added to reduce inter-symbol interference. The data are then split into two spatial streams that are fed into the antenna controller before transmission; the controller sets the correct antenna transmission configuration or mode. The two streams are separately transmitted from the two transmit antennas over the radio channel using spatial multiplexing technique. At the receiver, the cyclic prefix is removed and the signal is transformed back into frequency domain with an FFT prior to de-interleaving and subsequently decoded to reconstruct the received symbols.

The receiver estimates the post-processing signal-to-noise ratio (ppSNR) to be used for adaptation and then, runs the spatially adaptive modulation and coding (SAMC) control algorithm to determine the antenna configuration and transmission rates. The controller uses the lookup tables to select the indices of the configuration and AMC mode that consists of a modulation type and coding rate. It sends this indices to the transmitter via the feedback channel and transmitter uses its lookup tables to match the selected parameters.

Each of the reconfigurable antennas used in this MIMO system is able to adaptively modify its radiation characteristics and thus leverage pattern diversity to impact the manner in which the transmitter and receiver perceive the wireless channel. As established in [4], “two co-located antennas with different patterns ‘see’ differently weighted multi-path components so that they interfere differently for the two antennas resulting in better reception”. This observation motivated us to merge the benefits of antenna diversity and antenna reconfigurability to improve link capacity and SNR at the receiver [3].

*Q*transmit and

*P*receive antennas sending data across

*K*subcarriers using the

*j*th (

*j*=1,…,

*J*) antenna configuration. The OFDM sequence transmitted from the

*q*th (

*q*=1,…,

*Q*) transmit antenna on the

*k*th (

*k*=1,…,

*K*) OFDM subcarrier is represented by

*x*

_{ q,k }. The received sequence at the

*p*th (

*p*=1,…,

*P*) receive antenna is given by

*P*×1 received vector at the

*p*th receive antenna, \(H_{p,q,k}^{j}\) is the

*P*×

*Q*channel response matrix between the

*q*th transmit and the

*p*th receive antenna for the

*k*th subcarrier and the

*j*th antenna configuration, and

*n*

_{ p,k }is the

*P*×1 additive white Gaussian noise (AWGN) at the

*p*th receive antenna for the

*k*th subcarrier.

*J*is the total number of antenna configurations, and

*ε*

_{ s }is the transmit energy. Expression (1) can be written as \(y_{p,k}^{j} = \sum _{p=1}^{P} H_{p,q,k}^{j} s_{q,k} + n_{p,k}\) where \(s_{q,k} = \sqrt {\frac {\varepsilon _{s}}{P}}x_{q,k}\). After zero-forcing with successive interference cancellation (ZFSIC) equalization,

*p*th stream at subcarrier

*k*and antenna configuration

*j*is defined as:

where \({\sigma }^{2}_{k}\) is the noise variance of the received symbols.

*j*is determined as the average across transmit antennas and subcarriers.

## 3 Spatially adaptive modulation and coding

The proposed SAMC algorithm is described in Algorithm 1. It is carried out in two main stages: 1) antenna configuration selection and 2) AMC selection.

1) Antenna configuration selection: During this stage, the algorithm selects an optimal configuration *J*
^{∗} that yields the highest average ppSNR. This process requires channel training and is carried out during one of the following training intervals: i) initial training interval and ii) re-training interval. The initial training interval is necessary when no prior channel training has been done. Conversely, the re-training interval prior to some initial training is only used in order to abate the effects of channel fading over time and for up-to-date channel adaptation.

i) Initial training interval: In this interval, initial channel training is carried out over all the *J* possible configurations; ten training packets are transmitted using quadrature phase shift keying (QPSK) modulation for each of the *J* possible configurations. After each training packet transmission, the ppSNR is calculated by taking the mean of the subcarrier ppSNR values. The average ppSNR of a specific configuration is then obtained by taking the mean of the ten transmissions. In total, 160 packets will be transmitted in this phase, and 16 average ppSNR values will be obtained. The algorithm then selects configuration *j*
^{∗} that with the highest average ppSNR. We sort these 16 average ppSNR values and store the top five along with their corresponding configurations.

In this interval, there is need to transmit multiple training packets at a given configuration in order to obtain a meaningful statistic of the channel quality indicator (CQI) from post processing. However, a major challenge arises in selecting the period of the training interval: the use of a long training interval will lead to parameter adaptation based on out-dated channel characteristics; meanwhile, a short interval fails to yield a realistic statistic. Determining the optimal training period requires further analysis that deviates from the main focus of this work. Therefore, a fixed training period of ten packets was only used to obtain a CQI statistic from post processing the channel measurements. Similarly, in an attempt to minimize the re-training interval time, we selected a subset of the total configuration for the re-training phase.

ii) Re-training interval: during this interval, we re-train over the top five configurations stored in interval i); and transmit one training packet per configuration—thus, a total of five training packets. We then select the configuration that yields the highest average ppSNR out of these top five configurations.

2) AMC selection: in this stage, the algorithm selects the AMC scheme using the \(\text {ppSNR}^{j^{*}}\) associated with the optimal configuration in stage 1.

The selected antenna configuration and AMC scheme are then used to transmit a scheduled number of packets. In order to minimize the loss of throughput during the training interval in stage 1 of the algorithm, we append a payload of 1 KB to each training packet. The size of the training packet is reduced to 32 bytes. Additionally, if the optimal configuration found during the training interval is consecutively selected, the number of packets scheduled for transmission at the optimal configuration and AMC scheme is doubled. These measures helped reduce the negative impact of training overhead on throughput gains, and not only minimized training time but provided data transmission opportunity.

### 3.1 AMC selection algorithms

*P*

_{ e }) and target data rate (

*Ψ*

_{0}). It sacrifices some throughput gain for robustness and the satisfaction of the target constraints. Robustness is achieved through optimization of the AMC mode selection. In lieu of the exhaustive search algorithms in [10, 11], we propose the use of predetermined link tables to obtain the best AMC in solving (6). First, we assign each of the modes to operate within a particular post processing signal-to-noise ratio (ppSNR) region

*R*

_{ χ }. Each region is defined by two thresholds. The thresholds are obtained by using the upper bound expression for the symbol error probability in AWGN channels [16]:

where *M* defines the constellation size, *r* the coding rate, \(\frac {E_{b}}{N_{0}}\) is the SNR per bit, and *m*=log_{2}(*M*). The BER can be approximated by \(\frac {1}{m}\left (1-{(1-P_{\sqrt {M}})}^{2}\right)\).

*ξ*

_{ χ }and

*ξ*

_{ χ+1}, such that

*ξ*

_{ χ }≤ppSNR<

*ξ*

_{ χ+1}. The receiver (RX) feeds back the index

*χ*representing the AMC mode to the transmitter (TX) for adaptation. This AMC mode represents the fixed modulation and coding rate employed across all the subcarriers. When the ppSNR falls into the outage region, we keep the AMC which corresponds to region

*R*

_{1}, even though the target BER will not be satisfied. We restrict the set of different modulation type and coding rates to those specified in [17] (see Table 1 which shows the AMC modes and their regions of operation). Mode AMC1, for example, uses binary phase shift keying (BPSK) and a coding rate of 1/2 and operates within the region \(2.2\leq \text {ppSNR}^{j^{*}} < 6.8\) dB, where \(\text {ppSNR}^{j^{*}}\) is the post processing SNR for the selected configuration

*j*

^{∗}.

AMC modes and their operating regions

AMC mode | Modulation type | Overall coding rate | Data rate (bps/Hz) | Regions for target BER 10 |
---|---|---|---|---|

AMC1 | BPSK | 1/2 | 0.5 | \(2.2\leq \text {ppSNR}^{j^{*}} < 6.8\) |

AMC2 | 4-QAM | 1/2 | 1 | \(6.8\leq \text {ppSNR}^{j^{*}}< 8.6\) |

AMC3 | 4-QAM | 3/4 | 1.5 | \(8.6\leq \text {ppSNR}^{j^{*}} < 13.6\) |

AMC4 | 16-QAM | 1/2 | 2 | \(13.6\leq \text {ppSNR}^{j^{*}}<15.3\) |

AMC5 | 16-QAM | 3/4 | 3 | \(15.3\leq \text {ppSNR}^{j^{*}}<21\) |

AMC6 | 64-QAM | 2/3 | 4 | \(21\leq \text {ppSNR}^{j^{*}}<23\) |

AMC7 | 64-QAM | 3/4 | 4.5 | \(\text {ppSNR}^{j^{*}}\geq 23\) |

The AMC selection procedures are explained below.

#### 3.1.1 Highest rate selection algorithm

*χ*, where

*χ*=1,…,

*χ*

_{max}and

*χ*

_{max}is the total number of modes. For each

*χ*, a convolutional encoder

*ς*

_{ χ }with coding rates

*R*

_{ c }(

*ς*

_{ χ }) and constellation size

*M*

_{ χ }, where \(\text {log}_{2}M_{\chi } = m_{\chi } \in \left \{1,\ldots,m_{\chi _{\text {max}}}\right \}\), are defined. Spectral efficiency,

*Ψ*, is then obtained by solving the optimization problem [10, 11]:

#### 3.1.2 Robust rate selection algorithm

In the design of this algorithm, we observed that the feedback information is often transmitted through a fading channel and is therefore itself prone to errors. There is a non-zero probability of feedback packet loss which may result in a mismatch of switching decisions (the transmitter may not be able to determine the correct AMC mode that the receiver sent). To decrease the occurrence of a mismatch, a change in an AMC level should only be initiated when the BER constraint cannot be achieved. Switching is minimized when the AMC mode used in the previous packet transmission is still a candidate for a subsequent transmission. The optimization problem becomes a slightly modified version of (6) with an additional constraint: log_{2}(1+ppSNR)≥*Ψ*
_{0}. This constraint ensures that the achieved data rate, log_{2}(1+ppSNR), is at least equal to the target data rate, *Ψ*
_{0}. The introduction of the new constraint may lead to more switching between AMC modes. However, the frequency of switching due to the additional constraint is preferable to the requirement of sending feedback after every packet transmission due to the resulting throughput savings.

The pseudocode describing the AMC selection algorithms is shown in Algorithm 2. It depicts the steps used for implementing the proposed AMC algorithms. First, the algorithm takes in the initial value of the target bit error rate (*P*
_{
e
}) constraint. It then computes the AMC performance thresholds as illustrated in step 3 of Algorithm 2. These thresholds are used to determine the performance regions of the lookup tables. If the objective is to maximize throughput, the “highest rate” selection algorithm is employed to choose the AMC mode. The “highest rate” selection algorithm uses Table 1, to lookup the AMC index that corresponds to the region where the measured \(\text {ppSNR}^{j^{*}}\) falls; thus, selecting the maximum AMC mode that satisfies the target BER constraint.

*ξ*

_{ χ }, and then determines a ppSNR range over which to optimize the AMC mode selection. If the measured ppSNR is greater than this threshold value, the range consists of ppSNR values starting with the threshold value and incremented by an arbitrary value of 0.5 dB until \(\text {ppSNR}^{j^{*}}\). Otherwise, the range is equal to \(\text {ppSNR}^{j^{*}}\). Since the threshold value is the minimum requirement to satisfy both target BER and target data rate constraints, an AMC mode based on any of the ppSNR values within this range is a candidate for selection. Next, we populate 2D lookup tables for each ppSNR in the range with the AMC candidates; Table 2 shows a table for two possible target BERs and various target data rates at a ppSNR of 10 dB. Note that an empty box in the Table 2 means that the corresponding constraints cannot be satisfied at the measured ppSNR.

A 2D lookup table for “robust rate” selection algorithm for ppSNR = 10 dB

Possible target rates | |||||||
---|---|---|---|---|---|---|---|

0.5 | 1 | 1.5 | 2 | 3 | 4 | 4.5 | |

BER | Candidate modes | ||||||

10 | AMC1 | AMC2 | AMC3 | ||||

AMC2 | AMC3 | ||||||

AMC3 | |||||||

10 | AMC1 | AMC2 | |||||

AMC2 |

As an example, suppose the target BER is 10^{−3}, target data rate equals 1.5 bps/Hz and the measured ppSNR is 10 dB. From Table 1, we determine that AMC3 (QPSK and coding rate 3/4) is the minimal AMC mode that would satisfy the specified target data rate. We then calculate the minimum threshold for the target BER as in step 3 of Algorithm 2 and find that *ξ*
_{
χ
} is 8.6 dB; the ppSNR range is therefore [8.6–10] dB. We populate four 2D lookup tables (one for each ppSNR value in this range) as in Table 2 for the specified target BER and target data rate constraints. And finally, select the AMC mode with the highest number of occurrence across the four lookup tables. This is the mode that minimizes the need to carry out the selection process on subsequent packet transmission.

The proposed methods significantly reduce feedback overhead since only one index representing the AMC to be used is fed back. The feedback information in our model is independent of the total number of subcarriers (*K*) and requires only ⌈log_{2}(*χ*
_{max})⌉ compared to \(\phantom {\dot {i}\!}K\lceil \text {log}_{2}(m_{\chi _{\text {max}}})\rceil + N_{q} + \lceil \text {log}_{2}(\chi _{\text {max}})\rceil \) in [10], where *N*
_{
q
} is the number of bits to represent the quantized power level. The price of the reduced complexity is lower accuracy — from using average channel statistics rather than the channel conditions of each subcarrier. The water-filling AMC (WF-AMC) and the block AMC (BL-AMC) are two of the alternative AMC selection algorithms with improved degree of accuracy. However, as will be demonstrated through experimental results, WF-AMC and BL-AMC, are computationally more expensive and may prove difficult to implement in real wireless systems.

### 3.2 Computational complexity of SAMC

*K*(the total number of subcarriers). For the water-filling AMC (WF-AMC) model in [10], the complexity, denoted by

*T*(

*K*)ops, is given by

where *J* is the total number of antenna configurations; *ς*
_{max}, the number of coding rates; and *K* is the total number of subcarriers. *N*
_{EF} and *N*
_{ET} denote the number of iterative searches needed in order to obtain the solutions for the “Efficientizing” and “E-tightening” subroutines in the Levin-Campello algorithm, respectively. These two parameters can grow up to *K* in the worst case, depending on the initial bit allocation [20].

The two terms in (9) represent the serial selection of the optimal configuration followed by the AMC. The first term represents the complexity of selecting the optimal configuration. The second represents the AMC selection complexity, which turns out to be a constant due to the use of pre-determined lookup link tables [21].

## 4 Experimental setup and implementation

### 4.1 Software defined radio (SDR) testbed

We use the wireless open-access radio platform (WARP) designed at Rice University for protocol implementation at the PHY layer. Three main components of the WARP testbed are of interest: (a) Xilinx Virtex-II Pro Field-Programmable Gate Array (FPGA), (b) MIMO-capable radios, and (c) 10/100 Ethernet port. The FPGA allows for MAC protocols to be written in C code. The platform supports up to four radio boards which can be configured for applications similar to the 802.11g/n standards. Source/sink traffic and feedback of the protocols is handled over the Ethernet port [23].

### 4.2 Reconfigurable printed dipole array (RPDA) antennas

Possible configurations for 2 × 2 MIMO-OFDM system

Configurations | |||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|

1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | ||

TX | Ant 1 | S | S | L | S | S | S | L | L | L | L | L | L | L | S | S | S |

Ant 2 | S | S | L | S | L | L | L | L | L | S | S | S | S | S | L | L | |

RX | Ant 1 | S | L | S | S | S | L | L | L | S | S | L | L | S | L | S | L |

Ant 2 | S | L | S | L | L | L | S | L | L | S | S | L | L | S | S | S |

*ρ*

_{ c }) derived in [26] yields a more accurate result when correlation is included in the channel modeling estimation of capacity or BER. This expression is summarized in (10) below:

*i*is excited, and. is the Hermitian product (Fig. 6).

### 4.3 Scattering environment

### 4.4 Measurement setup

Prior to the experimental evaluation of our work, we conducted a test campaign to approximate the coherence time of the channel by obtaining the SNR rate profile for the fixed nodes in the measurement environment. By applying the methodology in [27], we varied the SNR across the full range of allowable received power for the WARP radio board (−80 to −40 dBm) and measured the coherence time at a speed of 0 mps. Our preliminary tests showed that the average coherence time was approximately 192 ms. Therefore, based on this result, we infer that the channel was relatively static or slow fading and is sufficiently constant to decode the received symbols with a particular modulation rate during the coherence interval.

^{7}samples/s. To reduce noise and phase distortions, we use an over sampling factor of 4 which yields a sampling frequency of 4 ×10

^{7}samples/s. Based on procedure in [16], the OFDM symbol transmit time is given by (11) and the data rate by (12). And, the throughput is estimated by multiplying the result from (12) by the (1 - PER), where PER is the estimated packet error rate.

Data are encoded using punctured convolutional codes and modulated at a carrier frequency of 2.484 GHz using one of the four signal constellations: BPSK, QPSK, 16-QAM, and 64-QAM. The convolutional encoder uses a constraint length of and code generator polynomials of 133 and 171 (in octal numbers). The puncturing matrices for the relevant coding rates (1/2, 2/3, 3/4) are specified in [28]. All transmissions consisted of a 24-byte header which includes a cyclic redundancy check (CRC) modulated with BPSK and bits were coded at rate 1/2. The header carries a fixed channel training sequence [17] and a payload of 1 KB is followed by a 4-byte CRC check.

## 5 Performance results and analysis

We evaluate the experimental performance of the proposed SAMC algorithm using the measurement setup presented above. The SAMC algorithm uses the highest rate transmission AMC. We also analyze the performance of the highest rate AMC without antenna selection procedure. This is considered as the non-reconfigurable scenario where the 2×2 MIMO system is equipped with RPDA antennas that uses a fixed configuration (all antenna states are set to short configuration). We compare the performances of these two approaches with that of two other algorithms: WF-AMC [10] and BL-AMC [11].

^{−3}at ppSNRs greater than 7 dB. This behavior is partly due to the necessary training required for the configuration selection. Training introduces a delay which causes adaptation on outdated channel information. The random jumps above the target BER line can be explained by the use of BPSK even when the ppSNR fell in the outage region (see Fig. 2). Despite the relatively close throughput and BER performances, our approach is superior in its computational complexity performance. The computational complexity of our model is at least 2 orders of magnitude lower than the measured values for the other models in [10] and [11] (see Fig. 3).

## 6 Conclusions

A spatially adaptive modulation and coding algorithm was proposed and implemented in a software-defined radio testbed. Multiple techniques of link adaptation were employed to develop a low computational complexity, throughput enhancing model. The capabilities of reconfigurable printed dipole array (RPDA) antennas in MIMO-OFDM systems were harnessed to improve spectral efficiency. It was shown via field implementation that our model can increase post processing signal-to-noise ratio and therefore system reliability over a multiple-antenna slow fading channel. Future work will investigate the effects of feedback delay on the proposed algorithm.

## Declarations

### Acknowledgements

The authors would like to thank Damiano Patron and Nikhil Gulati for the valuable comments and suggestions to improve the quality of the paper. The study was supported by the US National Science Foundation under grant No. 0916480.

## Authors’ Affiliations

## References

- GJ Foschini, MJ Gans, On the limits of wireless communication in a fading environment when using multiple antennas. Wireless Personal Commun. 6, 131–335 (1998).View ArticleGoogle Scholar
- D Piazza,
*Reconfigurable antennas for adaptive MIMO communication systems. Ph.D. dissertation, Dept. Electrical and Computer Engineering*(Drexel University, Philadelphia, PA, USA, 2009).Google Scholar - A Grau, H Jafarkhani, FD Flavis, A reconfigurable multiple-input multiple-output communication system. IEEE Trans. Wireless Commun. 7(5), 1719–1733 (2008).View ArticleGoogle Scholar
- D Piazza, NJ Kirsch, A Forenza, RW Heath, KR Dandekar, Design and evaluation of a reconfigurable antenna array for MIMO systems. IEEE Trans. Antennas Propagation. 56(3), 869–881 (2008).View ArticleGoogle Scholar
- GJ Foschini, Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas. Bell Lab. Technical J. 1(2), 41–99 (1996).View ArticleGoogle Scholar
- PW Wolniansky, GJ Foschini, GD Golden, RA Valenzuela, in Proceedings IEEE International Symposium on Signals, Systems, and Electronics. V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel (Pisa, Italy, 1998), pp. 295–300.Google Scholar
- D Piazza, K Dandekar, Reconfigurable antenna solution for MIMO-OFDM systems. Electron. Lett. 42(8), 446–447 (2006).View ArticleGoogle Scholar
- J Boerman, J Bernhard, Performance study of pattern reconfigurable antennas in MIMO communications systems. IEEE Trans. Antennas Propagation. 56(1), 231–236 (2008).View ArticleGoogle Scholar
- AM Wyglinski, F Labeau, P Kabal, An efficient bit allocation algorithm for multicarrier modulation. Wireless Commun. Netw. Conf. 2, 1194–1199 (2004).Google Scholar
- K Song, A Ekbal, JM Cioffi, ST Chung, Adaptive modulation and coding (AMC) for bit-interleaved coded OFDM (BIC-OFDM). IEEE Trans. Wireless Commun. 5(7), 3197–3201 (2006).Google Scholar
- CK Sung, S Chung, J Heo, I Lee, Adaptive bit-interleaved coded OFDM with reduced feedback information. IEEE Trans. Wireless Commun. 55(9), 1649–1655 (2007).View ArticleGoogle Scholar
- A Goldsmith, S Chua, Variable-rate variable-power MQAM for fading channels. IEEE Trans. Commun. 45(10), 1218–1230 (1997).View ArticleGoogle Scholar
- D Qiao, S Choi, KG Shin, Goodput analysis and link adaptation for IEEE 802.11a wireless LANs. IEEE Trans. Mobile Comput. 1(4), 278–292 (2002).View ArticleGoogle Scholar
- IF Akyildiz, DM Gutierrez-Estevez, EC Reyes, The evolution to 4G cellular systems: LTE-Advanced. Elsevier J. Phys. Commun. 3, 217–244 (2010).View ArticleGoogle Scholar
- RT Becker, Precoding and spatially multiplexed MIMO in 3GPP long-term evolution. High Freq Electron (2009). [online] Available: http://highfreqelec.summittechmedia.com/Oct09/HFE1009_Becker.pdf.
- A Goldsmith,
*Wireless communications*(Cambridge University Press, London, 2005).View ArticleGoogle Scholar - IEEE 802.16 Working group IEEE standard for local and metropolitan area networks. Nov. 2004. [Online] Available: https://standards.ieee.org/findstds/standard/802.16-2004.html.
- JM Cioffi, A multicarrier primer.
*Standford University*. last accessed Sept. 2010. [online] Available: http://www.stanford.edu/group/cioffi/documents/multicarrier.pdf. - JG Proakis,
*Digital communiations*, 4th Ed (McGraw-Hill, New York, 2000).Google Scholar - J Cioffi,
*EE379C-Digital communication: signal processing*(Stanford University, Stanford, CA, 2008). [online] Available: http://www.stanford.edu/class/ee379c.Google Scholar - I Parberry,
*Algorithm analysis and computational complexity*(University of North Texas, TX, 2001). [online] Available: http://larc.unt.edu/ian/books/free/lnoa.pdf.Google Scholar - A Quarteroni, F Saleri,
*Scientific computing with Matlab*(Springer, Berlin, 2003).MATHView ArticleGoogle Scholar - WARP Research Platform,
*Rice University*. [Online]. Available: http://warp.rice.edu/. - RG Vaughan, JB Antenna, Diversity in mobile communications. IEEE Trans. Vehicular Technol. 36(4), 149–172 (1987).View ArticleGoogle Scholar
- CB Dietrich, K Dietze, RJ Nealy, WI Stutzman, Spatial polarization and pattern diversity for wireless handheld terminals. IEEE Trans. Antennas Propagation. 49(9), 1271–1281 (2001).View ArticleGoogle Scholar
- P Kyritsi, DC Cox, RA Valenzuela, PW Wolniansky, Correlation analysis based on MIMO channel measurements in an indoor environment. IEEE J. Selected Areas Commun. 21(5), 713–720 (2003).View ArticleGoogle Scholar
- J Camp, E Knightly, Modulation rate adaptation in urban and vehicular environments: cross-layer implementation and experimental evaluation. IEEE/ACM Trans. Netw. 18(6), 1949–1962 (2010).View ArticleGoogle Scholar
- P Frenger, PO Tony, A Svensson,
*Multi-rate convolutional codes*(Chalmers University Technology, Gotenberg, Sweden, Technology Republic 21, 1998).Google Scholar - GD Sworo, M Kam, K Dandekar, in
*Proceedings of the 46th Annual Conference on Information Science and Systems (CISS)*. Performance of link adaptation algorithms and reconfigurable antennas for MIMO-OFDM wireless systems (PrincetonUSA, 2012).Google Scholar

## Copyright

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.