OFDM‐Based STBC with Low End‐to‐End Delay for Full‐Duplex Asynchronous Cooperative Systems

We propose a new space‐time block coding (STBC) for asynchronous cooperative systems in full‐duplex mode. The orthogonal frequency division multiplexing (OFDM) transmission technique is used to combat the timing errors from the relay nodes. At the relay nodes, only one OFDM time slot is required to delay for a pair‐wise symbol swap operation. The decoding complexity is lower for this new STBC than for the traditional quasi‐orthogonal STBC. Simulation results show that the proposed scheme achieves excellent performances.     

Performance analysis of selective cooperation in amplify‐and‐forward relay networks over identical Nakagami‐m channels

In cooperative communications, multiple relays between a source and a destination can increase the diversity gain. Because all the nodes must use orthogonal channels, multiple‐relay cooperation becomes spectrally inefficient. Therefore, a bestrelay selection scheme was recently proposed. In this paper, we analyzed the performance of this scheme for a system with the relays operating in amplify‐and‐forward mode over identical Nakagami‐m channels using an exact source–relay–destination signal‐to‐noise ratio (SNR).We derived accurate closed‐form expressions for various system parameters including the probability density function of end‐to‐end SNR, the average output SNR, the bit error probability, and the channel capacity. The analytical results were verified through Monte Carlo simulations. Copyright © 2011 John Wiley & Sons, Ltd.     

Cross‐layer design for MIMO systems over spatially correlated and keyhole Nakagami‐m fading channels

Cross‐layer design is a generic designation for a set of efficient adaptive transmission schemes, across multiple layers of the protocol stack, that are aimed at enhancing the spectral efficiency and increasing the transmission reliability of wireless communication systems. In this paper, one such cross‐layer design scheme that combines physical layer adaptive modulation and coding (AMC) with link layer truncated automatic repeat request (T‐ARQ) is proposed for multiple‐input multiple‐output (MIMO) systems employing orthogonal space‐‐time block coding (OSTBC). The performance of the proposed cross‐layer design is evaluated in terms of achievable average spectral efficiency (ASE), average packet loss rate (PLR) and outage probability, for which analytical expressions are derived, considering transmission over two types of MIMO fading channels, namely, spatially correlated Nakagami‐m fading channels and keyhole Nakagami‐m fading channels. Furthermore, the effects of the maximum number of ARQ retransmissions, numbers of transmit and receive antennas, Nakagami fading parameter and spatial correlation parameters, are studied and discussed based on numerical results and comparisons. Copyright © 2009 John Wiley & Sons, Ltd.     

A coalitional game‐based relay load balancing and power allocation scheme in decode‐and‐forward cellular relay networks

In this paper, a game theoretic relay load balancing and power allocation scheme is proposed for downlink transmission in a decode‐and‐forward orthogonal frequency division multiple access‐based cellular relay network. A system with a base station communicating with multiple users via multiple relays is considered. The relays have limited power, which must be divided among the users they support. In traditional scheme, each relay simply divides its transmit power equally among all its users. Moreover, each user selects the relay with the highest channel gain. In this work, we do not apply the traditional relay scheme. It is because the users are distributed randomly, and by applying the traditional relay selection scheme, it may happen that some relays have more users connected to them than other relays, which results in having unbalanced load among the relays. In order to avoid performance degradation, achieve relay load balancing, and maximize the total data rate of the network, a game theoretic approach is proposed, which efficiently assigns the users to relays. The power of each relay is wisely distributed among users by the efficient power allocation scheme. Simulation results indicate that the proposed game‐based scheme can considerably improve the average sum‐spectral efficiency. Moreover, it shows that by applying the game, users who can connect to uncongested relays join them as opposed to connecting to congested relays. Copyright © 2015 John Wiley & Sons, Ltd.     

Application of Rate Compatible Punctured Turbo Coded Hybrid ARQ to MC‐CDMA Mobile Radio

MC‐CDMA, a multicarrier (MC) modulation scheme based on code division multiple access (CDMA), is the most likely candidate for the next generation of mobile radio communications. The rate compatible punctured turbo (RCPT) coded hybrid automatic repeat request (HARQ) has been found to give improved throughput performance in a direct sequence (DS) CDMA system. However, the extent to which the RCPT HARQ improves the throughput performance of an MC‐CDMA system has not been fully understood. In this paper, we apply the RCPT HARQ to MC‐CDMA and evaluate by computer simulations its performance in a frequency selective Rayleigh fading channel. We found that the performance of RCPT HARQ MC‐CDMA is almost insensitive to channel characteristics. The performance can be drastically improved with receive diversity combined with space‐time transmit diversity. In addition, the comparison of RCPT HARQ MC‐CDMA, orthogonal frequency division multiplexing, and DS‐CDMA shows that under similar conditions the throughput of MC‐CDMA is the best in a frequency selective fading channel.     

New stopping criteria for iterative decoding of LDPC codes in H‐ARQ systems

Under severely unreliable channel, decoding of error‐correcting codes frequently fails, which requires a lot of computational complexity, especially, in the iterative decoding algorithm. In hybrid automatic repeat request systems, most of computation power is wasted on failed decoding if a codeword is retransmitted many times. Therefore, early stopping of iterative decoding needs to be adopted. In this paper, we propose a new stopping algorithm of iterative belief propagation decoding for low‐density parity‐check codes, which is effective on both high and low signal‐to‐noise ratio ranges and scalable to variable code rate and length. The proposed stopping algorithm combines several good stopping criteria. Each criterion is extremely simple and will not be a burden to the overall system. With the proposed stopping algorithm, it is shown via numerical analysis that the decoding complexity of hybrid automatic repeat request system with adaptive modulation and coding scheme can be fairly reduced. Copyright © 2012 John Wiley & Sons, Ltd.     

Cooperative power allocation with partial channel information in multi‐cell multi‐user dual‐hop MIMO relay systems

This paper considers cooperative power allocation with the use of partial channel state information (CSI) in a multi‐user dual‐hop relay system with multiple antennas. The end‐to‐end capacity can be improved by dynamically allocating the transmit power of the base station and relay according to co‐channel interference caused by the adjacent relays. The proposed scheme allocates the transmit power in association with the eigenvalues and angle difference between the eigenvectors of transmit correlation matrices of the desired and interference channel. It is shown by means of upper‐bound analysis that the end‐to‐end capacity of the proposed scheme can be maximized in highly correlated channel environments when the principal eigenvectors of transmit correlation matrices of the desired and interference channel are orthogonal to each other. It is also shown that the proposed scheme is robust to the channel estimation error. Finally, the performance of the proposed scheme is verified by the computer simulation. Copyright © 2010 John Wiley & Sons, Ltd.     

Adaptive Channel‐Matched Extended Alamouti Space‐Time Code Exploiting Partial Feedback

Since the publication of Alamouti's famous space‐time block code, various quasi‐orthogonal space‐time block codes (QSTBC) for multi‐input multi‐output (MIMO) fading channels for more than two transmit antennas have been proposed. It has been shown that these codes cannot achieve full diversity at full rate. In this paper, we present a simple feedback scheme for rich scattering (flat Rayleigh fading) MIMO channels that improves the coding gain and diversity of a QSTBC for 2ⁿ (n = 3, 4,…) transmit antennas. The relevant channel state information is sent back from the receiver to the transmitter quantized to one or two bits per code block. In this way, signal transmission with an improved coding gain and diversity near to the maximum diversity order is achieved. Such high diversity can be exploited with either a maximum‐likelihood receiver or low‐complexity zero‐forcing receiver.     

Block‐wise Alamouti schemes for OQAM‐OFDM systems with complex orthogonality

Offset quadrature amplitude modulation‐based orthogonal frequency division multiplexing (OFDM) systems cannot be directly combined with the Alamouti code because of the intrinsic imaginary interference. In this paper, we propose a block‐wise space‐frequency block coding (SFBC) scheme and a block‐wise space‐time block coding (STBC) scheme for offset quadrature amplitude modulation‐based OFDM systems, which achieve bit error rate performances that are close to OFDM systems. The proposed schemes satisfy the orthogonality condition of the Alamouti code in the complex field with guard band/intervals. To improve the spectral efficiency of the block‐wise SFBC scheme, we also consider the case without the guard band. It is observed that only the two innermost subcarriers do not satisfy the complex orthogonality condition when the guard band is removed. Then, a simple equalization scheme is proposed to independently equalize the two innermost subcarriers. Simulation results show that the block‐wise SFBC scheme works well under channels with mild‐to‐moderate frequency selectivity, and the block‐wise (STBC ) scheme suffers less than 1 dB loss under severe frequency selective channels at the bit error rate of 10 ^− 3, when only a simple one tap zero‐forcing equalizer is employed. Copyright © 2016 John Wiley & Sons, Ltd.     

A low‐complexity MSK‐based M‐ary cyclic‐shift keying transceiver for direct sequence spread spectrum system over multipath fading channels

In this paper, a low‐complexity spread spectrum system with M‐ary cyclic‐shift keying (MCSK) symbol spreading is proposed. In addition, by using the minimum‐shift‐keying (MSK) as the chip‐level modulation, we obtain a high‐rate QPSK‐MCSK transceiver scheme which not only provides a constant‐envelop and continuous‐phase transmitted signal, but can also achieve a better performance than the conventional direct sequence spread spectrum (DSSS) system. At the transmitter, the data stream is first mapped into QPSK‐MCSK symbols in terms of orthogonal Gold code sequences, then followed by the cyclic prefix (CP) insertion for combating the interblock interference, and finally applying the MSK scheme to maintain the constant‐envelope property. The receiver first performs MSK demodulation, then CP removal, and finally the channel‐included MCSK despreading and symbol demapping. Furthermore, the single input single output (SISO) QPSK‐MCSK transceiver can be easily extended to the multiple input single output (MISO) case by incorporating the space–time block coding for high‐link quality. Simulation results show that the proposed SISO and MISO QPSK‐MCSK systems significantly outperform the conventional DSSS counterparts under the AWGN channel, and attain a more robust performance under the multipath fading channel. Copyright © 2011 John Wiley & Sons, Ltd.     

Distributed Routing Based on Minimum End‐to‐End Delay for OFDMA Backhaul Mobile Mesh Networks

In this paper, an orthogonal frequency division multiple access (OFDMA)‐based minimum end‐to‐end delay (MED) distributed routing scheme for mobile backhaul wireless mesh networks is proposed. The proposed scheme selects routing paths based on OFDMA subcarrier synchronization control, subcarrier availability, and delay. In the proposed scheme, OFDMA is used to transmit frames between mesh routers using type‐I hybrid automatic repeat request over multipath Rayleigh fading channels. Compared with other distributed routing algorithms, such as most forward within radius R, farthest neighbor routing, nearest neighbor routing, and nearest with forwarding progress, simulation results show that the proposed MED routing can reduce end‐to‐end delay and support highly reliable routing using only local information of neighbor nodes.     

A Full Rate Quasi‐orthogonal STF‐OFDM with DAC‐ZF Decoder over Wireless Fading Channels

In this letter, we propose a quasi‐orthogonal space‐time‐frequency (QOSTF) block coded orthogonal frequency division multiplexing (OFDM) that can achieve full symbol rate with four transmit antennas. Since the proposed QOSTF‐OFDM cannot achieve full diversity, we use a diversity advantage collection with zero forcing (DAC‐ZF) decoder to compensate the diversity loss at the receiving side. Due to modulation advantage and collected diversity advantage, the proposed scheme exhibits a better bit‐error rate performance than other orthogonal schemes.     

Secrecy sum rate optimization in MISO nonorthogonal multiple access systems with orthogonal space‐time block coding

In this paper, we investigate the secrecy sum rate optimization problem for a multiple‐input single‐output (MISO) nonorthogonal multiple access (NOMA) system with orthogonal space‐time block codes (OSTBC). This system consists of a transmitter, two users, and a potential eavesdropper. The transmitter sends information by orthogonal space‐time block codes. The transmitter's precoder and the power allocation scheme are designed to maximize achievable secrecy sum rate subject to the power constraint at the transmitter and the minimum transmission rate requirement of the weak user. We consider two cases of the eavesdropper's channel condition to obtain positive secrecy sum rate. The first case is the eavesdropper's equivalent channel is the weakest, and the other is the eavesdropper's equivalent channel between the strong user and weak user. For the former case, we employ the constrained concave convex procedure (CCCP)‐based iterative algorithm with one‐dimensional search. While for the latter, we adopt the method of alternating optimization (AO) between precoder and power allocation. We solve a semidefinite programming to optimize the precoder and drive a closed‐form expression of power allocation. The simulation results obtained by our method demonstrate the superiority of our proposed scheme.     

On the comparisons of system performance and capacity of asynchronous STBC MC‐CDMA multirate access schemes

Three multirate access schemes, multicode, variable spreading gain (VSG), and spectral overlaid multiple‐symbol‐rate (MSR), for asynchronous space‐time block coded (STBC) multicarrier code division multiple access (MC‐CDMA) systems are proposed. The three possible spectral overlaid configurations for MSR systems are also investigated. The expressions to evaluate the multiple access interferences, bit error rate (BER) performances, and system capacities of a antenna STBC MC‐CDMA using the three multirate access schemes are obtained. Transmit power allocation is adjusted according to the service rates and the number of active users in each service class to maintain the link quality and to improve the system capacity. Our numerical results show that systems with multicode access scheme using orthogonal Gold spreading codes and with VSG access scheme have similar system performance and capacity, and both perform in general better than systems with MSR access scheme of any spectrum configurations. In case when non‐orthogonal Gold codes are used, multicode access scheme shows degradation in the system capacity as compared to VSG, due to the presence of larger self‐interference (SI) among the codes used by each user. The achievable capacities for the three spectral overlaid configurations of MSR multirate systems are also compared. Copyright © 2007 John Wiley & Sons, Ltd.     

Performance analysis of MIMO cognitive amplify‐and‐forward relay networks with orthogonal space–time block codes

In this paper, we study the performance of multiple‐input multiple‐output cognitive amplify‐and‐forward relay networks using orthogonal space–time block coding over independent Nakagami‐m fading. It is assumed that both the direct transmission and the relaying transmission from the secondary transmitter to the secondary receiver are applicable. In order to process the received signals from these links, selection combining is adopted at the secondary receiver. To evaluate the system performance, an expression for the outage probability valid for an arbitrary number of transceiver antennas is presented. We also derive a tight approximation for the symbol error rate to quantify the error probability. In addition, the asymptotic performance in the high signal‐to‐noise ratio regime is investigated to render insights into the diversity behavior of the considered networks. To reveal the effect of network parameters on the system performance in terms of outage probability and symbol error rate, selected numerical results are presented. In particular, these results show that the performance of the system is enhanced when increasing the number of antennas at the transceivers of the secondary network. However, increasing the number of antennas at the primary receiver leads to a degradation in the secondary system performance. Copyright © 2014 John Wiley & Sons, Ltd.     

Evolution from symbol‐level space–time coded MIMO to chip‐level space–time coded MIMO: a review

Space–time coded multiple‐input multiple‐output (MIMO) technology is an important technique that improves the performance of wireless communication systems significantly without consuming bandwidth resource. This paper first discusses the characteristics and limitations of traditional symbol‐level space–time coding schemes, which work largely on the basis of an assumption that signals are sent to a block‐fading channel. Therefore, the symbol‐level space–time coding schemes rely on symbol‐level signal processing. Taking advantage of orthogonal complementary codes, we propose a novel MIMO scheme, in this paper, based on chip‐level space–time coding that is different from the traditional symbol‐level space–time coding. With the help of space–time–frequency complementary coding and multicarrier modem, the proposed scheme is able to achieve multipath interference‐free and multiuser interference‐free communications with simple a correlator detector. The proposed chip‐level space–time coded MIMO works well even in a fast fading channel in addition to its flexibility to achieve diversity and multiplexing gains simultaneously in varying channel environments. Copyright © 2012 John Wiley & Sons, Ltd.     

On the performance of multi‐hop wireless relay networks

User cooperation has evolved as a popular coding technique in wireless relay networks (WRNs). Using the neighboring nodes as relays to establish a communication between a source and a destination achieves an increase of the diversity order. The relay nodes can be seen as a distributed multi‐antenna system, which can be exploited for transmit diversity by using distributed space–time block coding (STBC). In this paper, we investigate the bit error rate (BER) of multi‐hop WRNs employing distributed STBC at the relay nodes. We develop the general model of WRNs using distributed STBC, and we derive the pairwise error probability and an approximation of the BER. We examine the impact of several parameters, such as distributed STBC at the relays, the number of relays, the distances between the nodes, and the channel state information available at the receivers, on the BER performance of the multi‐hop WRN. The obtained results provide guidelines about the expected error performance and the design of channel estimation for these networks. Copyright © 2011 John Wiley & Sons, Ltd.     

General switch‐and‐examine relaying for demodulate‐and‐forward cooperative diversity

Two new demodulate‐and‐forward schemes of multi‐relay cooperative diversity with switch‐and‐examine relaying (SER) are analyzed. To reduce relay usage and enhance bandwidth efficiency, the two new cooperative diversity schemes employ a switch‐based relay selection. The proposed schemes consume less communication resource than regular relaying schemes, such as the selection combining (SC) or maximal ratio combining (MRC) schemes that always use all relays, and also achieve better performance than distributed switch‐and‐stay schemes. In the first scheme, the decision statistic for relay usage and selection is based on the signal‐to‐noise ratio (SNR). In the second scheme, the log‐likelihood ratio (LLR) of received signals is used for the decision of relay usage and selection. With the two SER schemes, the bit error probability (BEP) of binary phase shift keying (BPSK) and the average number of used paths are derived and expressed in closed‐form for the independent and identically distributed (i.i.d.) Rayleigh fading channels. Numerical and simulation results are presented for performance illustrations. According to the numerical results, the LLR‐based SER not only achieves a lower BEP but also consumes less relay resource than the SNR‐based SER. Furthermore, the LLR‐based SER scheme even outperforms the corresponding SNR‐based SC scheme for a range of average SNR. Copyright © 2014 John Wiley & Sons, Ltd.     

Network coding‐based channel quality indicator reporting for two‐way multi‐relay networks

This paper considers channel quality indicator (CQI) reporting for data exchange in a two‐way multi‐relay network. We first propose an efficient CQI reporting scheme based on network coding, where two terminals are allowed to simultaneously estimate the CQI of the distant terminal‐relay link without suffering from additional overhead. In addition, the transmission time for CQI feedback at the relays is reduced by half while the increase in complexity and the loss of performance are negligible. This results in a system throughput improvement of 16.7% with our proposed CQI reporting. Upper and lower bounds of the mean square error (MSE) of the estimated CQI are derived to study performance behaviour of our proposed scheme. It is found that the MSE of the estimated CQI increases proportionally with the square of the cardinality of CQI level sets although an increased number of CQI levels would eventually lead to a higher data rate transmission. On the basis of the derived bounds, a low‐complexity relay selection (RS) scheme is then proposed. Simulation results show that, in comparison with optimal methods, our suboptimal bound‐based RS scheme achieves satisfactory performance while reducing the complexity at least three times in case of large number of relays. Copyright © 2012 John Wiley & Sons, Ltd.     

MC‐CDMA MIMO systems with quasi‐orthogonal space–time block codes: Channel estimation and multiuser detection

This paper investigates blind channel estimation and multiuser detection for quasi‐synchronous multi‐carrier code‐division multiple‐access (MC‐CDMA) multiple‐input multiple‐output (MIMO) systems with quasi‐orthogonal space–time block codes (QO‐STBC). Subspace‐based blind channel estimation is proposed by considering a QO‐STBC scheme that involves four transmit antennas and multiple receive antennas. Based on the first‐order perturbation theory, the mean square error of the channel estimation is derived. With the estimated channel coefficients, we employ minimum output energy and eigenspace receivers for symbol detection. Using the QO‐STBC coding property, the weight analyses are performed to reduce the computational complexity of the system. In addition, the forward–backward averaging technique is presented to enhance the performance of multiuser detection. Numerical simulations are given to demonstrate the superiority of the proposed channel estimation methods and symbol detection techniques. Copyright © 2011 John Wiley & Sons, Ltd.