We consider the block diagonalization (BD) and user selection based on limited feedback in multiple antenna broadcast channels. With limited feedback, due to the imperfect channel state information at the transmitter (CSIT), BD cannot completely eliminate multiuser interference, and the throughput is correspondingly lower than that achieved with perfect CSIT. Nevertheless, the achievable multiuser diversity gain can be the same, such that limited-feedback-based BD can achieve an optimal throughput growth as the number of users increases. To show this, we first propose a channel quality indicator (CQI) for user selection. The CQI is designed to accurately estimate an achievable rate of each user and is given by an expected rate, where the expectation is solely taken over precoding matrices which cannot be known at the feedback stage. With the proper CQI, user selection can benefit from a large number of users in the system. As a result, we show that the BD can achieve an asymptotically optimal growth in throughput with the proposed CQI, based solely on a finite-rate feedback of channel information.

Massive multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) is a promising technology for next-generation wireless communications. However, when channel state information (CSI) at the transmitter is obtained using channel feedback, the benefits of this system are severely limited by the tradeoff between downlink capacity and feedback overhead. To solve this problem, we propose a time-domain differential feedback scheme for massive multiple-input single-output (MISO) OFDM systems. The proposed scheme exploits channel correlations in time, frequency, and space domains simultaneously by considering differential channel impulse response (CIR). To simplify the codebook design, and to reduce codeword-search complexity, we partition and then quantize the differential CIR using a number of subcodebooks. Because the total feedback bits are shared by the subcodebooks, we further optimize the bit allocation for them to minimize the total quantization error. For this, we analyze the quantization error of the proposed scheme and then use the analysis results for the bit-allocation optimization. In simulations, the proposed scheme efficiently exploits all correlations and achieves significant spectral-efficiency gain compared to conventional feedback schemes.

To maintain a specific degree of multiplexing gain with limited feedback in multiple-input/multiple-output broadcast channels, the number of feedback bits has been increased linearly with the signal-to-noise ratio (SNR) measured in decibel, and conditions for the slope of this increase have been derived in previous studies. However, previous studies mostly focused on the chordal distance (ChD) for channel quantization, although it is not an optimally designed distance measure. Thus, the possibility exists that the same degree of multiplexing gain can be obtained by using fewer feedback bits than the existing method requires. In this paper, we propose an optimal distance measure that can maximize the multiplexing gain achieved by limited-feedback-based block diagonalization over broadcast channels. Then, we provide a sufficient condition for the number of feedback bits to achieve a specific degree of multiplexing gain with the proposed method. The sufficient number of feedback bits is given by a linear function of the SNR (decibel) as in previous studies, but the slope of the linear increase can be much less than that obtained in previous studies. As a consequence, the proposed method achieves higher multiplexing gain and corresponding throughput than the existing methods with the same number of feedback bits.

We consider block diagonalization (BD) based on limited feedback for multiple-antenna broadcast channels. With limited feedback, achievable sum rate is reduced due to multi-user interference. When the chordal distance (ChD) is used as a quantization measure, the number of quantization bits should scale with the signal to noise ratio (SNR) to guarantee full multiplexing gain of MIMO channel. Although the ChD can be used to prove such bit-scaling law, it is not an optimal quantization criterion for limited-feedback-based BD. Moreover, the required number of quantization bits for full multiplexing gain is too large to be realized in practical wireless communications. In this paper, we propose a more-appropriate quantization criterion for channel direction information that can achieve much higher sum capacity with moderate feedback rate than can ChD. We also consider a sufficient condition for quantization bits to maintain achievable multiplexing gain of the proposed quantization criterion.

We consider limited-feedback-based block diagonalization (BD) and user selection for multiple antenna broadcast channels. With limited feedback, the conventional channel norm can not be a good estimate for channel quality of each user, because multiuser interference is not completely eliminated by using BD under limited channel direction information. Therefore, we need an appropriate channel quality indicator (CQI) to increase the diversity gain achieved by multiuser scheduling. To this end, we consider a determinant-based instantaneous channel capacity and propose a new CQI by taking an expectation over precoding matrices that can not be known at the feedback stage. Simulation results show that the sum rate with the proposed CQI is much higher than the sum rate with conventional CQIs.

In this paper, we study low-complexity detection schemes for cooperative multiple-input multiple-output (MIMO) systems with decode-and-forward (DF) relays. In fixed DF protocols, the error propagation effect that limits the diversity gain can be overcome by using joint maximum-likelihood (JML) detection, but its complexity increases exponentially with the number of streams and modulation orders. To develop a low-complexity detection scheme, we first extend the cooperative maximum-ratio combining (C-MRC) scheme to MIMO relay networks, and then investigate the diversity order of the system. We show that C-MRC achieves full diversity gain for orthogonal space-time code, but its diversity gain is limited when the deployed space-time code is non-orthogonal. To address this problem, we propose an effective detection scheme that is applicable to arbitrary space-time codes. On the basis of pairwise error probability approximation, max-log approximation, and the Chernoff bound, we construct an equivalent point-to-point MIMO signal model, and then apply tree-search detection techniques. Compared to JML, the proposed detection scheme significantly reduces the detection complexity while preserving diversity gain. Moreover, it can be readily extended to complex-field network-coding systems whose performance is superior to that of Galois-field network-coding systems. Analysis and simulation results confirm the efficiency of the proposed scheme.

This paper proposes an improved spectrum-sharing protocol for multiuser cooperation in cognitive radio (CR) networks. In CR networks, a secondary user (SU) can access the licensed bands of a primary user (PU) as compensation for cooperative transmission. During cooperative transmission, the SU concurrently transmits its own signal and network-coded signal from the PUs. However, detection errors at the SU cause error propagation which degrades the performance of the PU and SU. To address this problem, we develop a cooperative maximal-ratio combining scheme that mitigates the error propagation and achieves diversity gain. To evaluate the combining scheme, we derive a diversity order and closed-form bit error rate (BER) expression for arbitrary M-QAM at high SNR. The analysis results show that the diversity order and BER depend on the fraction of the transmit power at the SU. Based on the dependency of the fraction factor, we propose an optimization problem to minimize the BER of the SU while guaranteeing the PU's BER. Further, we apply the BER-constrained optimization problem to the adaptive modulation system. Simulation results show that the proposed cooperation provides full diversity gain to the PU and thus improves its spectral efficiency by using the optimized fraction factor.

This paper considers multiple-input multiple-output (MIMO) cognitive radio (CR) networks in which multiple primary and secondary systems coexist. We propose a transceiver design algorithm to minimize the total transmit power of secondary systems subject to the signal to interference plus noise ratio (SINR) constraint for each secondary user and the interference constraint for each primary user. Due to the complexity of backhaul among secondary systems, perfect knowledge about the channel state information (CSI) may not be available in practice. To overcome this problem, we decompose the transmit power minimization problem into cascade problems of decentralized beamformer design with the interference constraint and power allocation with the SINR constraint. For beamformer design, we formulate the total mean squared error of data symbol minimization problem, to enhance the feasible rate and only use the local CSI via dual decomposition. The power allocation problem is established as linear programming. Simulation results show that, compared to the conventional centralized algorithm, the proposed decentralized algorithm achieves much higher feasible rate with slightly increased transmit power.

This letter proposes a distributed beamforming scheme based on block diagonalization (BD) for multicell multiuser multiple-input multiple-output (MU-MIMO) downlink systems. Although conventional BD can be directly extended to these systems in a distributed manner, it suffers from sum-rate degradation due to strict zero-forcing (ZF) constraints. To overcome this problem, we introduce a sum-rate maximization problem for BD, to find the optimal selection of ZF constraints. Then we propose a search algorithm to solve the problem in a distributed and heuristic manner. Simulation results show that the proposed scheme effectively finds a near-optimal solution and significantly improves simple extended BD such that it can provide higher sum rate than the conventional schemes.

In this paper, we propose a protocol for the coexistence of primary and secondary systems over block-fading channels. In the protocol, the primary system employs a hybrid automatic repeat request (HARQ). When the primary system retransmits the data signal, the secondary system serves as a relay for the retransmission of the primary system and simultaneously transmits its data signal. To efficiently accomplish the protocol, we analyze the average throughput of the primary and secondary systems by using the long-term average throughput (LAT). We formulate an optimization problem to maximize the LAT of the secondary system. The constraint of the optimization problem is that the LAT of the primary system with secondary system is not less than that of the primary system alone. Through the optimization problem, we obtain the closed-form solutions of the transmission rate of the secondary system and the fraction of the transmit power for relaying the primary system's data signal and transmitting the secondary system's data signal. Numerical results show that the primary system does not lose the average throughput, and rather achieves an additional throughput gain by adjusting the fraction of the transmit power of the secondary system.

This paper proposes feedback optimization schemes for multiple-input single-output orthogonal frequency-division multiple access (MISO-OFDMA) systems with heterogeneous users. The proposed scheme adjusts the unit and resolution of the feedback to efficiently exploit the long-term channel statistics, including the path loss, delay spread, and mobility. To develop an analytical optimization framework, we first derive the sum-rate of MISO-OFDMA systems when the channel-state information (CSI) at the transmitter is imperfect because of the quantization error, channel variation, and feedback delay. Based on the derived results, we present effective solutions to the sum-rate maximization problem for distributed and centralized scenarios. When the channel statistics of the users are not available at the base station, each user can improve the sum-rate of the system by minimizing the distortion on CSI feedback under a fixed per-user feedback rate. With the channel statistics of the users, the base station can further control the user set and the feedback rate in addition to the feedback granularity. We evaluate the performance of both distributed and centralized schemes over practical wireless environments, where each user has different long-term channel statistics. Simulation results show that both methods significantly improve the performance of MISO-OFDMA systems.

In orthogonal frequency-division multiple access (OFDMA) downlink systems, user equipments over large delay spread channels reduce the cell spectral efficiency due to intersymbol interference (ISI). Channel shortening is an attractive filtering technique to mitigate ISI over such large delay spread scenarios, but the filter should be designed carefully to prevent subsequent spectrum null phenomenon. In this paper, we propose subband interference suppression (SIS) in channel shortening for OFDMA downlink systems. In our framework, we first develop the minimum subband interference (MSI) filter which reduces the interference and noise enhancement within the subcarriers of interest. To reduce its complexity, we present the delay preselection method, which predetermines significant delay candidates on the basis of estimation results. Simulation results show that the proposed SIS framework is effective over cellular scenarios, where conventional schemes do not work properly.

In this paper, we propose an efficient soft-detector for spatial multiplexing multiple-input multiple-output systems. Maximum a posteriori probability detection employing QR decomposition with M algorithm (QRM-MAP) achieves improved performance by adopting unbiased minimum-mean-square error (UMMSE) preprocessing. The efficiency of QRM-MAP can be further improved by using statistical information obtained from MMSE detection. Based on this information, the proposed detector orders tree branches and excludes insignificant branches in advance. To achieve low-and-fixed complexity, the node enumeration pattern that considers the greedy nature of the M algorithm is predetermined according to the node order. In addition, the soft information from MMSE can be used to compensate for the inherent performance loss caused by an insufficient number of candidates. Simulation results show that the proposed scheme provides an enhanced performance-complexity tradeoff as compared to the conventional schemes.

In this paper, we propose a feedback granularity control scheme for multiuser multiple-input multiple-output orthogonal frequency-division multiple access (MIMO-OFDMA) systems. The proposed scheme resizes the unit and the resolution of the feedback to efficiently exploit channel correlations in both the time and the frequency domains. Two types (centralized and distributed) of granularity search methods are proposed, and their performance characteristics over practical wireless channels are investigated. Simulation results show that the proposed schemes (particularly the distributed method) effectively calculate the optimal granularity, and thus significantly improve the sum-rate of multiuser MIMO-OFDMA systems.

In this paper, we analyze the outage probability and the long-term average throughput (LAT) of a decode-and-forward (DF) cooperative scheme with hybrid automatic repeat request (HARQ) over Nakagami-m fading channels. To derive the outage probability, the distribution of the weighted sum of two independent gamma random variables is needed. We approximately obtain the distribution by using gamma approximation and derive a closed-form expression of the outage probability of the DF cooperative scheme with high SNR assumption. By exploiting the outage probability, we obtain the LAT of the DF cooperative scheme. Numerical results show that the derived LAT of the DF cooperative scheme is able to predict the average throughput and the DF cooperative scheme achieves higher LAT than the direct transmission scheme because of higher diversity gains.

In cognitive radio networks, multiple secondary systems can access a licensed spectrum when none of the secondary transmitters cause harmful interference to the Primary Users (PUs). For spectrum sharing with coordination among co-located secondary systems, we propose both centralized and distributed beamforming algorithms. The proposed algorithms minimize the total transmit power of secondary systems, while maintaining the interference to PUs below a certain threshold and satisfying the Quality-of-Service (QoS) constraint for each secondary system. The centralized algorithm achieves the optimal transmit power by exploiting the virtual uplink-downlink duality using the knowledge of the channel state information for all the secondary links. However, the assumption of global channel knowledge at each secondary system may not be allowed in practical applications for multi-cell coordination. To address this problem, we design a distributed transceiver beamformer that satisfies the interference constraint to protect PUs. On the basis of this distributed beamformer, we also propose power allocation algorithms that guarantee the QoS for secondary systems. Distributed beamforming and power allocations operate iteratively to minimize the total transmit power. Simulation results show that the distributed algorithms achieve a near-optimal transmit power while satisfying both the QoS and interference constraints.

In this paper, we study a cooperation-based dynamic spectrum leasing mechanism via multi-winner auction of multiple bands. Based on a second-price auction mechanism, the primary users independently conduct auctions to determine winners who are then granted access to leased bands and prices for those bands. Before auctions, each secondary user jointly chooses bands which they want to lease and generates bids for those bands with a limited transmit power budget. To this end, we determine the feasibility conditions for band selection and for power and time allocation. Further, we propose a low complexity bidding algorithm that iteratively selects a band and calculates the bid for that band. For the paying price among winners after auctions, a multi-objective optimization problem is considered. We derive Pareto optimal solutions and propose paying schemes that prioritize the objectives with pre-defined weighting rules. In addition, the payment and secondary utility are investigated with regard to the number of winners. Simulation results show that secondary users achieve significantly increased utility as more winners are chosen, while primary users are guaranteed a non-negative benefit from spectrum leasing. The power consumed by the secondary users for cooperative transmission is compared for the proposed paying schemes.

We propose an opportunistic two-stage feedback and scheduling algorithm that is based upon zero-forcing beamforming with semi-orthogonal user selection (ZFBF-SUS) to reduce its feedback load. In an SUS algorithm, a base station schedules semi-orthogonal users using the feedback of all users' channel information. However, such feedback overhead significantly increases with the number of users. To reduce the feedback load of ZFBF-SUS systems, the proposed two-stage feedback scheme opportunistically and separately exploits the signal-to-interference-plus-noise ratio and orthogonality in each stage such that only a fraction of users feed back their channel information. Based on this opportunistic feedback scheme, we decouple the entire process of the SUS into two sub-processes. The proposed two-stage feedback and scheduling scheme effectively exclude the inappropriate users for ZFBF transmission in both feedback and scheduling periods, and thus save the scarce resources consumed for the feedback process. We derive an analytical expression for the average number of feedback bits of the proposed system and optimize it in an averaged sense. Further, the sum-rate of the proposed system is theoretically investigated. Both analytical and simulation results show that the proposed algorithm achieves the performance of conventional ZFBF-SUS systems with a significantly reduced number of feedback bits.

In spectrum-sharing-based cognitive radio networks, multiple secondary systems can access a licensed spectrum to better utilize scarce radio resources. When the multiple secondary transmitters are co-located, the weighted sum-rate of the secondary users (SUs) is mainly limited by the inter-cell interference (ICI). With limited cooperation among co-located secondary transmitters, we propose an algorithm for decentralized beamforming with power allocation via dual decomposition. To maximize the weighted sum-rate of the SUs, the proposed decentralized algorithm efficiently mitigates the ICI by the undesired leakage power limitation at each secondary transmitter. Because the channel information is not perfectly known at the transmitter in practical applications, we also develop a decentralized robust beamformer. To efficiently design the robust beamformer, a convex problem is formulated by semi-definite relaxation. Simulation results show that the proposed algorithm with perfect channel state information (P-CSI) efficiently maximizes the weighted sum-rate performance by the undesired leakage power limitation. For an imperfect CSI with a small error bound, the proposed robust beamformer approaches the performance of a P-CSI case, without causing harmful interference to the primary user.

QR-decomposition with M algorithm is a promising technique for multi-input multi-output (MIMO) systems. When the number of candidates is insufficient, its performance is, however, degraded due to an inaccurate log likelihood ratio (LLR). To address this problem, an enhanced soft LLR calculation scheme is proposed for soft-output MIMO detection. Based on QR-decomposition, the proposed algorithm can efficiently obtain a soft information of minimum mean-squared error (MMSE) equalization. With this information, an optimal weighted combining method is derived in an MSE sense. In addition, we compute a more reliable clipping value from the soft information of MMSE equalization. Simulation results show that the proposed algorithm provides a considerable performance gain over conventional algorithms and its performance is close to optimal performance with insufficient candidates.

Single-carrier frequency division multiple access (SC-FDMA) is an attractive air interface scheme for broadband wireless communications. For the coherent demodulation of SC-FDMA systems, the receiver performs channel estimation to obtain the channel frequency response by using the reference signals multiplexed in the transmitted signal. In this paper, we propose an iterative frequency domain channel estimation scheme for SC-FDMA systems. To prevent severe noise enhancements due to the Gaussianity of the frequency domain data signal, we consider two low complexity algorithms, namely, hard and soft frequency replacements. We first analytically derive the mean square error (MSE) to characterize the effects of frequency replacement and post iterative filtering. By analyzing MSE performance, we present a design framework to develop the optimal frequency replacement. Based on the design framework, hard and soft frequency replacement algorithms are optimized in the MSE sense. Then, their low complexity adaptation methods are proposed for practical SC-FDMA systems, where the proposed frequency replacement is performed according to the reliability of the data estimates. Simulation results show that the proposed iterative channel estimation techniques effectively compensate for noise enhancements, and thus give good MSE and frame error rate performances.

In cognitive radio networks, imperfect spectrum sensing causes harmful interferences or low utilization of unused bands, depending on an access policy of the secondary system. Since these losses have a trade-off relationship, it is hard to decide proper sensing and access policies for the licensed bands. To deal with this problem, we propose a joint algorithm for sensing adaptation and opportunistic resource allocation. The joint optimization problem minimizes the total expected cost of the losses and utilities which are likely generated for the secondary system. To protect the primary system and ensure the secondary system's utility, we employ an average interference threshold constraint and a QoS constraint for the secondary system. Two types of average secondary utilities are considered for the QoS constraint; one is averaged over only transmitted frames and the other is averaged over total frames. Based on energy detection, we derive feasible ranges of sensing threshold to satisfy the constraints. Simulation results show that the proposed scheme dynamically adapts sensing threshold depending on the network environment and minimizes the total cost of the secondary system. In addition, we investigate the performance of the proposed scheme with the two types of the secondary utility.

This paper proposes a spectral efficient multiuser scheme for single-carrier transmission. In the proposed scheme, a combination (hybrid) of localized and distributed subcarrier mapping types is employed, where the signals of users with different subcarrier mapping types are superimposed on a common set of subcarriers. We first present mathematical formulations of multiuser detection and derive the equalization coefficients for the hybrid type. In fading environments, the proposed scheme allows users to employ any subcarrier mapping types (localized, distributed, hybrid types), which can support low and high speed users. To estimate the performance of the proposed scheme, we develop a density evolution technique and show that the predicted performances are consistent with simulated performances. Further, based on the performance estimation of the proposed scheme, we discuss channel-dependent resource allocation algorithms: opportunistic scheduling and adaptive modulation and coding (AMC) schemes. These resource allocation algorithms increase the spectral efficiency of the proposed scheme with guaranteed quality-of-service (QoS). Simulation results show that the proposed multiuser scheme achieves both multiuser and frequency diversity gains in fading environments.

This paper proposes a space-time block coded (STBC) transmission with phase feedback for two-user multi-input multi-output multiple access channels (MIMO-MAC). In the proposed system, the phase feedback is transmitted to only one user, which reduces the overhead of the reverse link. We derive a closed-form solution for the proposed phase feedback, in order to maximize the overall received signal-to-interference-plus-noise power ratio (SINR). This allows the receiver to separate the two users with a linear detection. We also propose an efficient search method for the phase feedback, which reduces the complexity of computation. For practical applications, the quantized feedback of the proposed system is designed. Simulation results show that the proposed system with only 1-bit feedback considerably improves the performance of the MIMO-MAC system.

In this paper, we propose power budget allocation algorithms for bidding of auctions in cooperation-based spectrum leasing. The cooperation-based spectrum leasing allows secondary users to dynamically access licensed bands while providing the benefit of cooperative diversity to primary users as a reward. For efficient allocation of the licensed bands to the secondary users, a second-price based multiple auction mechanism is considered. In this mechanism, the secondary users select bands which they want to use and calculate bids for those bands, under a limited transmit power. For the optimal solution of the bidding problem, however, computational complexity increases exponentially with the number of bands. To overcome this problem, we find feasibility conditions for band selection and propose a suboptimal algorithm. The suboptimal algorithm makes bids consisting of the maximum achievable rates for cooperative transmissions. Simulation results show that the primary and secondary users achieve significantly increased achievable rates through spectrum leasing with the proposed algorithms. It is also shown that the performance of the suboptimal algorithm approaches that of the optimal solution as the invested power budget increases.

This paper proposes a bit-interleaved coded multilevel modulation for non-orthogonal cooperative transmissions. The proposed system encodes and interleaves multiple layers together, using one encoder and one interleaver, in order to average the performance of multiple layers with unequal error probabilities. The multiple layers are mapped by hierarchical symbol mapping. To improve the performance of the proposed system, the relay transmits the layers with a different hierarchical mapping pattern from the source, which is optimally derived for minimizing mean square error. To mitigate error propagation from the relay, we propose a power scaling scheme based on the error performance of the layers. The detected signals at the relay are scaled before being transmitted to the destination. A corresponding destination structure is also presented, where multiple layers can be decoupled by an iterative equalization with improved soft information. To estimate the performance of the proposed system, we develop a density evolution technique, and show that the predicted performances are consistent with simulated performances. Simulation results indicate that by using the optimal mapping pattern, power scaling, and iterative equalization with improved soft information, the proposed technique achieves both cooperative diversity and coding gains, and thus outperforms conventional cooperative schemes.

The relay employs network coding to transmit the packets from the source nodes simultaneously, for increasing spectral efficiency in wireless environments. The cooperative transmission based on network coding usually works on decode-and-forward (DF) protocols. However, detection errors at the relay cause error propagation, which degrades the performance of cooperative communications. To overcome this problem, we model the error propagation effect of the DF-based system at the destination as the addition of virtual noise, and then design a low complexity detection method. We derive the achievable diversity gain to evaluate the proposed model and corresponding detection scheme. To extend the proposed model to network-coded systems, we first express the channel conditions between the sources and relay as a single equivalent channel gain. Then, we develop low complexity detection schemes for the network-coded systems. From the error propagation model, we propose a dual mode network coding technique, which exploits different network coding schemes adaptively according to channel qualities. Simulation results show that the proposed model and detection scheme effectively reduce the error propagation effects. Also, the proposed dual mode network coding has gains for all channel conditions and thus gives better BER performance than conventional methods.

In this letter, we consider a multiuser cooperative transmission scheme with network coding over wireless channels. Network coding based on decode-and-forward protocol is a promising technique to improve network throughput. However, decoding errors at the relay cause error propagation, which degrades the performance of network-coded cooperations. To mitigate the error propagation in the network-coded signal, we first express a single equivalent gain, and then the opportunistic relay selection and proportional combining schemes are performed with the equivalent channel and the relay-destination channel. Simulation results show that all cooperative users can obtain a diversity gain of order two by using single network-coded transmission, even when there are detection errors at the relay.

This paper proposes a spectral efficient cooperative diversity technique with multi-layered modulation for high data rate transmissions. The proposed system transmits with different cyclic delay and phase rotation patterns, in order to achieve cooperative diversity gain for all transmit signals from the source. Since these patterns increase the interference between the layers, we derive optimal cyclic delay and phase rotation patterns to minimize mean square error. With the optimal patterns, the proposed system still suffers from inter-layer interference, especially in high-order modulations. To overcome this problem, multiple layers are separately interleaved by layer-specific interleavers and are mapped by hierarchical symbol mapping for the high data rate transmission with cooperative diversity. A destination structure with iterative equalization is also presented to separate each layer and extract diversity gain for high data rate transmissions. The proposed system can use reliable feedback from the layers and effectively remove the inter-layer interference. To estimate the performance of the proposed system, we develop a density evolution technique. It is shown that the predicted performances agree with simulated performances. Simulation results indicate that the proposed system achieves cooperative diversity and has better performance than conventional cooperative systems.

This paper proposes spectral efficient relay-assisted transmit diversity techniques, i.e., space-time and space-frequency block codes (STBC/SFBC), for single carrier frequency-domain equalization (SC-FDE). The proposed systems achieve spatial diversity over frequency selective channels in a distributed fashion without cyclic prefix (CP), which increases spectral efficiency of conventional relay-assisted systems. In practical mobile applications, the CP-less distributed STBC (D-STBC) SC-FDE suffers from the time selectivity of wireless fading channels, resulting in a deviation from the basic assumption of Alamouti codeword. In order to obtain a reliable performance over doubly selective channels, the CP-less D-SFBC SC-FDE and its efficient implementation are presented. Further, the performance of these two distributed SC transmissions is analytically compared over fast fading (i.e., time selective) environments. For evaluation of mean square error over fast fading channels, we present a channel model that captures the time-varying nature of wireless channels. It is shown through analysis that the CP-less DSFBC SC-FDE outperforms the CP-less D-STBC SC-FDE when there exists a severe Doppler spread. Timing synchronization and highly accurate channel estimation of the proposed systems are also addressed for practical implementations. Simulation results show that the proposed systems approach the lower bound of full-CP systems, thus increasing the spectral efficiency.

Cooperative communications can achieve spatial diversity gain and enhance coverage. However, conventional half-duplex relaying schemes suffer from the loss in spectral efficiency, because the two channel uses are required for transmission from the source to the destination. In this paper, we present spectral efficient transmissions for a user cooperative diversity system over multipath fading channels. To increase the spectral efficiency, a node, which acts as a relay, employs a superposition coding to transmit its own data block and the data block from the other node simultaneously. For superposition, we consider two different re-encoding schemes. One is based on complex field superposition coding and the other is based on Galois field superposition coding. In both re-encoding schemes, we introduce a user-specific interleaver to the data blocks for user separation. We also propose an iterative detection scheme to combat the effects of inter-symbol interference caused by multipath fading and to extract diversity gain from the superposed signals. For performance estimation, we develop a density evolution technique. It is shown that the proposed schemes can obtain diversity gain without sacrificing spectral efficiency and the predicted performances are consistent with simulated performances.

This paper proposes a bit-interleaved coded transmission with multilevel modulation for multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems. In the proposed system, multiple layers are encoded and interleaved together, using one encoder and one interleaver, and then mapped by hierarchical symbol mapping. A corresponding receiver structure is presented, where multiple layers can be decoupled by iterative MIMO detection and equalization with ordered successive interference cancellation (SIC) and full log-likelihood ratio (LLR). Full LLR provides reliable estimates of transmit signals, and significantly improves the performance of proposed multilevel modulation. Simulation results show that the proposed system has better performance than conventional modulation schemes such as bit-interleaved coded modulation (BICM) and multilevel BICM (MLBICM).

Spectrum sensing is a key enabling technology of cognitive radio. Reliable detection increases access opportunity to temporarily unused bands and prevents harmful interference to the licensed users. Due to the receiver noise, signal attenuation, and multi-path fading effect, however, it is usually not possible to determine the existence of primary signal with absolute certainty. By extracting a global decision from shared local sensing results, cooperative sensing achieves high reliability over fading channels. In this paper, we assume that the traffic statistic of primary system is logged into the radio environment map (REM) and can be accessed by the secondary systems. The threshold of each energy detector is dynamically adapted according to the utility values and a priori information from REM. Then, decision results and corresponding operating points are collected by a fusion center, which makes a global decision with high confidence.

Spectrum sensing is a key enabling technology of cognitive radio. Reliable detection increases access opportunity to temporarily unused bands and prevents harmful interference to the licensed users. Due to the receiver noise, signal attenuation, and multi-path fading effect, however, it is usually not possible to determine the existence of primary signal with absolute certainty. Without the information of primary user activity, Neyman-Pearson criterion has been commonly used to minimize the missed detection probability for a given false alarm rate. In this paper, we assume that the traffic statistic of primary system is logged into the radio environment map (REM) and can be accessed by the secondary system. Considering sensing errors, Bayes criterion is adopted for total utility maximization of primary and secondary systems. The threshold of energy detector is adapted according to the utility values and a priori information from REM, i.e., both false alarm and detection probabilities are dynamically adjusted.

Peak-to-average power ratio (PAPR) regrowth after clipping is one disadvantage of space-frequency block coded orthogonal frequency-division multiplexing (SFBC-OFDM). In this letter, we propose an effective PAPR reduction technique of SFBC-OFDM for multinode cooperative transmission. To reduce PAPR at the source (mobile equipment), the relay applies SFBC encoding, which enables the source to transmit clipped single-input single-output (SISO)-OFDM signals without any increase of PAPR. Simulation results show that the clipped signals of proposed scheme are effectively recovered, and the proposed scheme achieves the diversity of SFBC without the complexity of multiple antennas at the source.

This letter proposes a multiple-input multiple-output (MIMO) technique for single carrier frequency-domain equalization (SC-FDE). The proposed system achieves spatial multiplexing and transmit diversity gains altogether, thus improving error performance and increasing spectral efficiency compared to conventional spatial multiplexing and transmit diversity techniques, respectively. In order to achieve both of the gains, independent data streams are transmitted simultaneously through all transmit antennas with different cyclic delay patterns for each data stream. Corresponding receiver structure is also presented, where a successive interference cancellation (SIC) algorithm without ordering process is introduced. Simulation results show that the proposed system with iterative receiver structure provides considerable performance gains over conventional MIMO techniques.

Space-time block coded (STBC) single carrier (SC) transmission was extended in a distributed fashion for practical implementation of user cooperation. However, STBC was designed under the assumption that the channel is static over the duration of a space-time codeword. Thus, the distributed STBC SC system suffers from the time selectivity of wireless fading channels. To achieve a reliable performance over fast fading channels, we propose a distributed space-frequency block coded (D-SFBC) SC transmission. This paper analytically compares the performance of these two distributed SC transmissions over fast fading environment. For evaluation of mean square error (MSE) over fast fading channels, we present a channel model that captures the time-varying nature of wireless channels. It gives an insight into the characteristics of inter-carrier interference and simplifies the evaluation of MSE. Using this model, it is proven that the D-SFBC SC transmission outperforms the D-STBC SC transmission when there exists a severe Doppler spread. Simulation results are also provided to validate our analysis and to compare two distributed single carrier transmission schemes.

This paper proposes a full-rate cooperative communication technique with spatial diversity for single-carrier transmissions. In order to achieve both the spatial diversity and the full-rate, data streams are simultaneously transmitted through all direct and relay channels with different phase rotation and cyclic delay patterns. The phase rotation and cyclic delay patterns are derived in the sense of minimizing interlayer interference and a corresponding destination structure is presented for decoupling each layer at the destination. Simulation results show that the proposed technique achieves spatial diversity without sacrificing spectral efficiency and outperforms conventional full-rate cooperative communication techniques.

Multi-input multi-output orthogonal frequency division multiplexing (MIMO-OFDM) has become a promising candidate for next generation broadband wireless communications. However, like a single-input single-output (SISO)-OFDM, one main disadvantage of the MIMO-OFDM is the high peak-to-average power ratio (PAPR), which can be reduced by using an amplitude clipping. In this paper, we propose clipped signal reconstruction methods for the MIMO-OFDMs with spatial diversity, such as space-time and space-frequency block codes (STBC/SFBC). The proposed methods are based on the technique called iterative amplitude reconstruction (IAR) for SISO-OFDM. It is shown that the IAR can be easily employed for the STBC-OFDM, but it cannot be directly applied to the SFBC-OFDM, because the transmitted sequences over different antennas are dependent due to the use of space-frequency code. We propose a new SFBC transmitter for clipped OFDM, which has approximately half the computational complexity of conventional SFBC-OFDM. The proposed clipping preserves the orthogonality of transmitted signals, and the clipped signals are iteratively recovered at the receiver. Further, we theoretically analyze the performance of IAR with optimum equalization, and also provide highly accurate channel estimation of the OFDM with amplitude clipping. Simulation results show that the proposed receivers effectively recover contaminated OFDM signals with a moderate computational complexity.

In this paper, we present an iterative multiuser detection scheme using frequency-domain equalization (IMDFDE), which can be incorporated into a single carrier frequency division multiple access (SC-FDMA) framework. The IMD-FDE scheme employs a different interleaver for each user at the transmitter, and removes multiuser interference with an iterative detection method in the frequency domain at the receiver. The extrinsic information transfer (EXIT) charts and bit-error rate (BER) plots are presented to investigate the iterative behavior of the IMD-FDE over additive white Gaussian noise and multipath fading channels. In a conventional time-division multiple-access (TDMA)-based relay protocol, cooperative transmission over two time slots leads to a 50% loss in spectral efficiency. We propose two spectral efficient relay protocols, where multiple sources access a relay, destination, or both simultaneously. We also present a new iterative detection scheme that effectively removes multiuser interferences for the proposed relay protocols.With the proposed protocols and the aid of iterative multiuser detection scheme, the proposed relay-assisted SC-FDMA with IMD-FDE can obtain diversity gain without sacrificing spectral efficiency and approaches the single-user bound over time-varying and frequency-selective fading relay channels.

Relay-assisted space-time block code (STBC) and space-frequency block code (SFBC) for single carrier frequency-domain equalization (SC-FDE) were presented. They achieve spatial diversity over fading relay channels under the assumption of perfect channel state information (CSI). In this paper, we propose a pilot position selection/detection technique for channel estimation of those systems. Unlike the conventional block-type channel estimation techniques, the proposed scheme superimposes pilots on data-carrying tones whose positions are selected to minimize the distortion of original signals. Without additional pilot overhead, the proposed technique can track the CSI even when the mobile equipment speed is high. The corresponding destination structure and frequency domain equalization are also presented, where the pilot positions are blindly detected and the distorted data symbols are iteratively reconstructed. Simulation results show that the proposed method gives better BER performance than the block-type channel estimation for the distributed SFBC (D-SFBC) SC-FDE over fast fading relay channels, without the loss of spectral efficiency.

This paper proposes a low-complexity iterative detection scheme with cooperative transmission for single-carrier frequency-domain equalization (SC-FDE). To increase the spectral efficiency, a node, which acts as a relay, simultaneously transmits its own data block and the data block from the other node. For user separation, each data block is interleaved by a user-specific interleaver. At the destination, linear combining is performed and then the interference from the other source is effectively removed by an iterative detection method in the frequency domain. Simulation results show that the proposed system can obtain diversity gain without sacrificing spectral efficiency and approaches the performance of iterative maximum a posteriori (MAP) equalization at low computational cost.

This paper proposes a relay-based transmit diversity technique for single carrier frequency-domain equalization (SC-FDE). The proposed system achieves spatial diversity over fading channels in a distribution fashion without cyclic prefix (CP), which increases spectral efficiency of conventional relay- based systems. The destruction of channel cyclicity due to the lack of CP is recovered at the input of relay and destination. In order to obtain spatial diversity, the transmit sequence of relay is efficiently generated in time domain, realizing space-frequency block code (SFBC). Corresponding destination structure using FDE, timing synchronization, and highly accurate channel estimation for the proposed system are also presented. Simulation results show that the proposed system approaches the lower bound of full-CP system.

In this letter, we propose a new multiuser detection scheme for a space-frequency block code (SFBC) single-carrier modulation with frequency-domain equalization (SC-FDE). The iterative multiuser detection method used for the single transmit antenna system cannot be directly applied to SFBC SC-FDE, because there exists the off-diagonal components of channel matrices corresponding to multiuser interferences after maximal ratio combining. The output equations of SFBC combiner are reformulated, and the equalizer coefficients are derived for the SFBC SC-FDE system. Simulation results show that the proposed SFBC IMD-FDE efficiently provides the diversity gain, in the presence of multiuser interferences.

This paper proposes a relay-assisted space- frequency block code (SFBC) for single carrier frequency-domain equalization (SC-FDE) in a distributed fashion. The proposed scheme achieves spatial diversity over uplink fast fading channels without the complexity of multiple antennas. The source (mobile equipment) of the proposed system has a very simple transmitter structure with constant amplitude transmit sequences. In order to obtain spatial diversity, the transmit sequence of relay is efficiently generated in the time domain, which is equivalent to the SFBC. The corresponding destination structure and frequency domain equalization are also presented. Simulation results show that the proposed system considerably outperforms the distributed space-time block code (D-STBC) SC-FDE over fast fading channels.

Two of the major drawbacks of orthogonal frequency-division multiplexing (OFDM) are its large peak-to-average power ratio (PAPR) and long cyclic prefix (CP), which decrease the system power and spectral efficiencies, respectively. Clipping is an efficient and simple method to reduce the PAPR of OFDM. However, it causes distortion that degrades the system performance. In this paper, an iteration technique, called iterative CP and amplitude reconstruction, is first proposed, which is to recover the insufficient CP and clipped OFDM signals simultaneously with one iteration loop at the receiver. Simulation results show that the proposed receiver effectively recovers the contaminated OFDM signals with a moderate computational complexity

As with orthogonal frequency-division multiplexing (OFDM), one main disadvantage of multi-input multi-output (MIMO) OFDM is the prohibitively large peak-to-average power ratio (PAPR) of transmitted signals on different antennas, which can be reduced by a deliberate amplitude clipping. However, clipping causes distortion that degrades the system performance. In this letter, we propose clipping noise mitigation techniques for space-time and space-frequency block coded (STBC/SFBC)-OFDMs. A new SFBC transmitter for clipped OFDM is proposed, and the optimum equalizer is derived for reconstruction of the clipped signals. Simulation results show that the proposed receivers effectively recover contaminated STBC/SFBC-OFDM signals with a moderate computational complexity.

This letter proposes a space-frequency block-coded (SFBC) single-carrier frequency-domain equalization (SC-FDE) system. The transmit sequence of the proposed system is designed to have spatial and frequency diversities, and the corresponding combining receiver is derived under a minimum mean square error criterion. It is shown that the proposed system significantly outperforms the space-time block-coded SC-FDE system over fast-fading channels while providing lower computational complexity than orthogonal frequency division multiplexing combined with the SFBC.

In this paper, we describe a new technique to restore the cyclicity of the received signal when the cyclic prefix (CP) is not sufficient for OFDM systems. The proposed technique efficiently restores the cyclicity of the ith received symbol by adding the weighted (i + 1)th received symbol to the ith received symbol. The iterative CP reconstruction (CPR) procedure is obtained using the proposed technique and the residual intersymbol interference cancellation (RISIC) algorithm. In addition, we apply the CPR method to the Alamouti space-time block coded (STBC) OFDM system. It is shown that in the STBC OFDM, tail cancellation as well as cyclic reconstruction of the CPR procedure should be repeated. Simulation results show that the proposed CPR algorithm outperforms the conventional RISIC in the symbol error rate even when the channel impulse response is longer than a half of the symbol duration, for multiple antenna applications.

In order to prevent a loss of spectral efficiency due to the use of cyclic prefix (CP), a CP reconstruction (CPR) method, such as residual intersymbol interference cancellation (RISIC), has recently been developed. In this paper, we apply the RISIC method to Alamouli space-time block coded (STBC) orthogonal frequency division multiplexing (OFDM) system with insufficient CP. It is shown that in the STBC OFDM, tail cancellation as well as cyclic restoration of the RISIC should be repeated. An iterative channel estimation method for the STBC OFDM system with CPR is proposed. The performance of the proposed method is evaluated by computer simulation in multipath fading environment.

This paper discusses a far-end crosstalk (FEXT) canceller for twisted-pair transmission. Many twisted-pair systems such as fiber-to-the-curb, very high-speed digital subscriber line, and high-speed LAN systems, use frequency-division duplexing (FDD) for duplex transmission. It is shown that the maximum reach of FDD twisted-pair system is limited by the performance of its upstream channel, which is assumed to be located at higher frequencies than the downstream channel. In order to improve the performance of such an FDD transceiver, FEXT cancellation is introduced for the channel at higher frequencies. A system arrangement and its blind startup procedure are studied when the FEXT canceller and equalizer are jointly adapted to combat channel intersymbol interference, FEXT, and other additive noise. We investigate the initial convergence and the steady-state behavior of the proposed twisted-pair system without requiring transmission of an ideal training sequence. Measured characteristics as well as analytical model of the FEXT channel are used to estimate the time span needed for the FEXT canceller. It is also shown that the memory span for the FEXT canceller is almost independent of the channel, thus making our results useful for the twisted-pair system over all different channels.

This paper presents a study of the effects of bridged taps on very high-speed digital subscriber line (VDSL) transmission systems. It is shown that the short bridged taps, which affect VDSL signals, are much more damaging than the longer bridged taps, which affect other xDSL signals, such as high-rate digital subscriber line (HDSL) and asymmetric digital subscriber line (ADSL). Specifically, short bridged taps introduce a lot of linear distortion in the loop's transfer function. In addition, they also tend to introduce more overall propagation loss than longer bridged taps. The peak-power-to-average-power ratio (PAR) of the signal increases for the loop with short bridged taps, and thus more A/D bits are needed in the implementation of a digital VDSL transceiver as compared to the loop with long bridged taps. The performance of various equalizer structures is discussed in the presence of a severe channel distortion caused by the bridged tap.

The authors present fine-grain pipelined architectures for adaptive infinite impulse response (AIIR) filters. The AIIR filters are equation error based. The proposed architectures are developed by employing a combination of scattered look-ahead and relaxed look-ahead pipelining techniques. The scattered look-ahead technique is applied do the non-adaptive (but time-varying) recursive section. The relaxed look-ahead technique is applied to the adaptive blocks. It is shown via simulations that speed-ups of up to 8 and more can be achieved with marginal or no degradation in performance.

The paper describes the characteristics and performance of the 16-CAP transmission scheme that has been chosen by the Technical Committee of the ATM Forum as the ATM LAN physical layer interface standard at 51.84 Mb/s for category 3 unshielded-twisted-pair (UTP) wiring. The two most attractive features of the 16-CAP transceiver are its capability of operating in the presence of multiple users in a voice-grade UTP cable and the straightforward way in which it can provide scalability to lower speeds. It is also shown in the paper how the carrierless AM/PM (CAP) modulation scheme used for the ATM LAN standard can be utilized to provide substantially higher data rates than 51 Mb/s when there is only one user in a cable. Under this condition, data rates up to 155 Mb/s can be achieved over category 3 wiring and significantly higher rates can be achieved over high-performance category 5 wiring.>

Describes techniques for achieving data rates up to 155 Mb/s over unshielded twisted-pair (UTP) wiring for local area network (LAN) applications in premises distribution systems. Duplex operation at these high data rates is achieved over two pairs of UTP wiring and with a bandwidth utilization that is less than 30 MHz, thus avoiding potential problems with radiation limits. The transmission scheme used for these LAN applications is carrierless AM/PM (CAP), which is a bandwidth-efficient two-dimensional passband encoding scheme. The paper also discusses in some detail a technique called NEXT equalization, which allows several users to share the same cable