Search

The feasible log-SIR region is defined as a set of all signal-to-interference ratios (SIR) expressed in logarithmic scale that can be supported in a wireless network by means of power control and with all users being active concurrently. Recently, the feasible log-SIR region was shown to be a convex set, which is a key ingredient in the development of some power control strategies for wireless systems. In this paper, under the assumption of a noiseless channel, we strengthen these results by proving a necessary and sufficient condition for the feasible log-SIR region to be a strictly convex set. The strict convexity property is of interest since it is closely related to the problem of the existence and uniqueness of a so-called log-SIR fair power vector. [ABSTRACT FROM AUTHOR]

In this paper, we analyze the sequential message-passing decoding algorithm of low-density parity-check (LDPC) codes by partitioning check nodes. This decoding algorithm shows better bit error rate (BER) performance than the conventional message-passing decoding algorithm, especially for the small number of iterations. Analytical results indicate that as the number of partitioned subsets of check nodes increases, the BER performance is improved. We also derive the recursive equations for mean values of messages at check and variable nodes by using density evolution with a Gaussian approximation. From these equations, the mean values are obtained at each iteration of the sequential decoding algorithm and the corresponding BER values are calculated. They show that the sequential decoding algorithm converges faster than the conventional one. Finally, the analytical results are confirmed by the simulation results. [ABSTRACT FROM AUTHOR]

In this paper, a new information theoretic algorithm is proposed for signal enumeration in DS-CDMA networks. The approach is based on the predictive description length (PDL) of the observation vector. The PDL is the length of a predictive code of observations. For signal detection, the PDL criterion is computed for the candidate models and is minimized to determine the number of signals. The proposed technique uses the maximum likelihood (ML) estimate of the correlation matrix. The only information used in the ML estimation of the correlation matrix is the multiplicity of the smallest eigenvalue. The PDL algorithm has a signal-to-noise ratio resolution threshold that is smaller than that of the minimum description length (MDL). The proposed method can be used on-line and can be applied to time-varying and non-stationary systems. [ABSTRACT FROM AUTHOR]

An efficient way to reduce the peak-to-average power ratio (PAPR) in OFDM systems is clipping. After the clipping in an MIMO-OFDM system, the additive noise may not be white. In this paper, we develop fast (single-symbol) ML decoding algorithms for orthogonal space-time block codes (OSTBC) and (linearly transformed) quasi orthogonal space- time block codes (QOSTBC) in clipped MIMO-OFDM systems by using a clipping noise model with Gaussian approximation. By using the statistics of the clipping distortions, our newly developed fast ML decoding algorithms improve the performance for clipped MIMO-OFDM systems with OSTBC and QOSTBC while the decoding complexities are not increased. Simulation results are presented to illustrate the improvement. [ABSTRACT FROM AUTHOR]

In this paper we propose minimum mean squared error (MMSE) iterative successive parallel arbitrated decision feedback (DF) receivers for direct sequence code division multiple access (DS-CDMA) systems. We describe the MMSE design criterion for DF multiuser detectors along with successive, parallel and iterative interference cancellation structures. A novel efficient DF structure that employs successive cancellation with parallel arbitrated branches and a near-optimal low complexity user ordering algorithm are presented. The proposed DF receiver structure and the ordering algorithm are then combined with iterative cascaded DF stages for mitigating the deleterious effects of error propagation for convolutionally encoded systems with both Viterbi and turbo decoding as well as for uncoded schemes. We mathematically study the relations between the MMSE achieved by the analyzed DF structures, including the novel scheme, with imperfect and perfect feedback. Simulation results for an uplink scenario assess the new iterative DF detectors against linear receivers and evaluate the effects of error propagation of the new cancellation methods against existing ones. [ABSTRACT FROM AUTHOR]

In this paper, adaptive sectoring of a CDMA cellular network is investigated, and the aim is to maximize the uplink capacity by utilizing mobiles' spatial information. One important feature of the algorithm developed is that it does not depend on tracking individual mobile, but rather on the statistics of mobiles. The distribution of mobiles is modeled as a spatial Poisson process, whose rate function quantizes mobile concentration and is inferred with a Bayesian estimator based on the statistics of network traffic. In addition, the time dynamics of the rate function is assumed to evolve according to mobiles' mobility pattern and it is formulated using the Influence model. With the knowledge of mobiles' spatial distribution, the interference and thus the outage probability of different sector partitions of a cell can be computed. The adaptive sectoring problem is formulated as a shortest path problem, where each path corresponds to a particular sector partition, and the partition is weighted by its outage probability. In simulation examples, a hot spot scenario is simulated with the adaptive sectoring mechanism, and it is observed that load balancing between sectors is achieved and which greatly reduces the effect of hot spot. [ABSTRACT FROM AUTHOR]

Iterative turbo processing between detection and decoding shows near-capacity performance on a multiple-antenna system. Combining iterative processing with optimum front- end detection is particularly challenging because the front-end maximum a posteriori (MAP) algorithm has a computational complexity that is exponential. Sub-optimum detector such as the soft interference cancellation linear minimum mean square error (SIC-LMMSE) detector with near front-end MAP performance has been proposed in the literature. The asymptotic computational complexity of SIC-LMMSE is O(n²tnr + ntn²r + ntMc2Mc) per detection-decoding cycle where nt is number of transmit antenna, nr is number of receive antenna, and Mc is modulation size. A lower complexity detector is the hard interference cancellation LMMSE (HIC-LMMSE) detector. HIC-LMMSE has asymptotic complexity of O(n²tnr + ntMc2Mc) but suffers extra performance degradation. In this paper, two front-end detection algorithms are introduced that not only achieve asymptotic computational complexity of O(n²tnr + ntn²r [Γ (β) + 1] + ntMc2Mc) where Γ (β) is a function with discrete output {-1, 2,3, …, nt} and O(ntMc2Mc) respectively. Simulation results demonstrate that the proposed low complexity detection algorithms offer exactly same performance as their full complexity counterpart in an iterative receiver while being computational more efficient. [ABSTRACT FROM AUTHOR]

In this paper, we construct a family of block orthogonal Golay sequences that have low peak-to-mean envelope power ratio (PMEPR) as well as blockwise orthogonal properties. We then present an application of the sequences to channel estimation of multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems. We compare the performance of the proposed algorithm with that of a frequency division multiplexing (FDM) piloting algorithm, and investigate the effect of co-channel interference (CCI) on the channel estimation performance. [ABSTRACT FROM AUTHOR]

In this paper, we present an algorithm for joint carrier phase estimation and turbo decoding for the case of rapidly varying carrier phase during the transmitted block. The proposed algorithm shows improved performance over previously proposed communication schemes, both coherent and noncoherent, for channels with additive white Gaussian noise and high carrier phase noise. The novel algorithm utilizes a modified ‘two dimensional’ bit carrier phase a posteriori probability (BCAPP) decoder containing additional states representing the received carrier phase. The BCAPP decoder calculates two extrinsic metrics: one representing the bit soft value and the other representing the received carrier phase probability density function approximation. A modified structure of the turbo code iterations is suggested, implementing separate propagation of the two metrics between the BCAPP decoders. One additional attractive property of the suggested algorithm is its robustness against phase noise model mismatch. [ABSTRACT FROM AUTHOR]

In this paper, we develop optimization techniques for linear zero-forcing (ZF) multiple-input, multiple-output (MIMO) broadcast (BC) precoders. A computationally efficient technique based on QR-update algorithms for implementing this optimization is then proposed. The application of the proposed ZF precoders and decoders to systems with both large and small numbers of users is considered. The proposed optimization technique is also shown to perform very well in conjunction with nonlinear Tomlinson- Harashima precoding. Both coded and uncoded performances are considered. [ABSTRACT FROM AUTHOR]

For conventional cyclic prefix (CP)-assisted single-carrier/frequency-domain equalization (SC/FDE) implementations, as well as for orthogonal frequency-division multiplexing (OFDM) implementations, the CP length is known to be selected on the basis of the expected maximum delay spread. Next, the data block size can be chosen to be large enough to minimize the CP overhead, yet small enough to make the channel variation over the block negligible. This paper considers the possibility of reducing the overall CP assistance, when transmitting sequences of SC blocks, while avoiding an excessively long fast Fourier transform window for FDE purposes and keeping good FDE performances through low-complexity, noniterative receiver techniques. These techniques, which take advantage of specially designed frame structures, rely on a basic algorithm for decision-directed correction (DDC) of the FDE inputs when the CP is not long enough to cope with the time-dispersive channel effects. More specifically, we present and evaluate a novel class of reduced-CP SCIFDE schemes, which takes advantage of a special frame structure for replacing ‘useless’ CP redundancy by fully useful channel coding redundancy, with the help of the DDC algorithm. When using the DDC-FDE technique with these especially designed frame structures, the impact of previous decisions, which are not error-free, is shown to be rather small, thereby allowing a power-efficiency advantage (in addition to the obvious bandwidth-efficiency advantage) over conventional block transmission implementations under full-length CP. Additionally, the DDC algorithm is also shown to be useful to improve the power efficiency of these conventional implementations. [ABSTRACT FROM AUTHOR]

The paper deals with design and performance analysis of orthogonal frequency-division multiple-access (OFDMA)- based downlink cellular wireless communications. Due to a high degree of user mobility, the base station is assumed to have only a statistical knowledge of the users' channels. Relying on the ergodic capacities connected to the user rates, a subcarrier and power allocation that minimizes the total transmitted power is proposed. The allocation strategy requires only the knowledge of the channel statistics and the rate requirements for all users. An extension and a performance analysis of this allocation algorithm in a multicell environment working with a frequency reuse factor equal to one is also conducted. A condition for the multicell network to be able to satisfy all rate requirements is derived. [ABSTRACT FROM AUTHOR]

Blind channel-estimation algorithms return phase-ambiguous estimates. From a receiver design point of view, the phase-ambiguity problem can be by-passed by differential modulation and detection at the expense of a well-known performance loss, in comparison with direct modulation and coherent detection schemes. An alternative approach is followed in this paper. A theoretical minimum mean-square error phase-estimation criterion leads to a supervised phase-recovery procedure that directly corrects the phase of arbitrary linear filter receivers through a simple closed-form projection operation. Conveniently, any known blind channel-estimation algorithm can be used to provide the initial phase-ambiguous estimate. The presentation is given in the context of adaptive space-time receiver designs for binary phase-shift keying direct-sequence code-division-multiple-access antenna array systems. Numerical and simulation studies support the theoretical developments and show that effective phase correction and multiple-access interference suppression can be achieved with about 2% pilot signaling. [ABSTRACT FROM AUTHOR]

In many problems in wireline networks, it is known that achieving capacity on each link or subnetwork is optimal for the entire network operation. In this paper, we present examples of wireless networks in which decoding and achieving capacity on certain links or subnetworks gives us lower rates than other simple schemes, like forwarding. This implies that the separation of channel and network coding that holds for many classes of wireline networks does not, in general, hold for wireless networks. Next, we consider Gaussian and erasure wireless networks where nodes are permitted only two possible operations: nodes can either decode what they receive (and then re-encode and transmit the message) or simply forward it. We present a simple greedy algorithm that returns the optimal scheme from the exponential-sized set of possible schemes. This algorithm will go over each node at most once to determine its operation, and hence, is very efficient. We also present a decentralized algorithm whose performance can approach the optimum arbitrarily closely in an iterative fashion. [ABSTRACT FROM AUTHOR]

In this paper, we provide an efficient quality-of-service (QoS)-guarantee scheme using the cumulative-distribution-function-based scheduling (CS) algorithm in wireless fading channels. We first extend the CS algorithm such that it can encompass the practical environment with discrete user transmission rates. The extended CS algorithm can allocate the time fractions to users in arbitrary manner, and render an exact estimation of user average throughputs, through which it can provide differentiated QoS to each user. We also introduce the effective-capacity concept to describe the delay-constrained capacity of the CS algorithm, both in time-independent and time-correlated channels. In contrast to other existing scheduling algorithms, the CS algorithm enables calculating the effective capacity analytically, rather than estimating it by measurement on the queueing behavior. Using the effective capacity, we can check the feasibility of the user-specified QoS effectively in wireless time-varying channels. [ABSTRACT FROM AUTHOR]

Efficient soft-decision decoding of Reed-Solomon (RS) codes is made possible by the Koetter-Vardy (KV) algorithm which consists of a front-end to the interpolation-based Guruswami-Sudan (GS) list decoding algorithm. This paper approaches the soft-decision KV algorithm from the point of view of a communications systems designer who wants to know what benefits the algorithm can give, and how the extra complexity introduced by soft decoding can be managed at the systems level. We show how to reduce the computational complexity and memory requirements of the soft-decision front-end. Applications to wireless communications over Rayleigh fading channels and magnetic recording channels are proposed. For a high-rate RS(255,239) code, 2-3 dB of soft-decision gain is possible over a Rayleigh fading channel using 16-quadrature amplitude modulation. For shorter codes and at lower rates, the gain can be as large as 9 dB. To lower the complexity of decoding on the systems level, the redecoding architecture is explored, which uses only the appropriate amount of complexity to decode each packet. An error-detection criterion based on the properties of the KV decoder is proposed for the redecoding architecture. Queueing analysis verifies the practicality of the redecoding architecture by showing that only a modestly sized RAM buffer is required. [ABSTRACT FROM AUTHOR]

In this letter, we consider the problem of constructing high-rate codes with low peak-to-mean-envelope power ratio (PMIEPR) for multicarrier signals. Assuming coefficients of the multicarrier signal are chosen from a symmetric q-ary constellation, we construct codes with rate 1 - (1 /r) logq 2 and PMEPR of less than cr log n for any r and n, where n is the number of subcarriers and c is a constant independent of n and r. The construction is based on dividing n subcarriers into n/r groups of r subcarriers and choosing a sign for each group to minimize the PMEPR. The signs are chosen using a variation of the algorithm proposed by the authors in previous papers. For large n, we can, in fact, construct a code with a rate of 1 - O(1/log n) and PMEPR of less than c log² n. For binary phase-shift-keying-modulated signals, this partially solves the problem posed by Litsyn and implies a construction of 2n/2 codewords with PMEPR less than 2c log n. [ABSTRACT FROM AUTHOR]

In this paper, novel equalization algorithms for continuous phase modulations (CPMs) are illustrated. Both conventional (linear and decision-feedback) and turbo equalization techniques are derived using the Laurent decomposition of CPM signals. All of them operate in the frequency domain and process two samples of the received signal per channel symbol. Numerical results show that on one hand, conventional equalization strategies offer good performance for binary partial response signaling over severely frequency-selective wireless channels at a moderate complexity. On the other hand, there is evidence that turbo techniques provide a small energy saving at the price of a substantial computational burden. [ABSTRACT FROM AUTHOR]

This paper studies an enhanced widely linear (WL) receiver for direct-sequence code-division multiple-access (DS-CDMA) systems that employ aperiodic spreading sequences with offset quadrature phase-shift keying (OQPSK) modulation. The modulation scheme generates improper complex multiple-access interference (MAI) and necessitates the use of WL receivers. Focus is on bandlimited pulse shapes and the inherent cyclostationarity (CS) of the uncoded received signal. The enhanced WL receiver replaces the conventional chip-matched filter with new filters that exploit the CS of the received signal through frequency shifting. The proposed WL receiver is shown to outperform the classical strictly linear (SL) receiver when the interfering users are (quasi-)synchronous with respect to the user of interest. High-powered interfering users, that may exist to support high data rates, increase the performance improvement delivered by the WL receiver. Moreover, it is shown that MAI can become proper, either identically or asymptotically, when users are asynchronous and equally powered. This is despite the fact that individual interfering signals are improper. Numerical results demonstrate that the WL receiver can outperform the SL receiver by 1–3 dB under the examined scenarios with current CDMA standards settings. In asynchronous or quasi-synchronous transmission modes, performance gain of the WL receiver degrades unless the number of high-powered active users remains small. An example for implementation of the WL receiver is proposed and compared with that of the SL receiver when minimum-shift keying modulation, a special case of OQPSK, is used. The implementation is based on a fractionally spaced equalizer whose taps are updated by an adaptive algorithm. It is shown that the proposed structure is capable of delivering the maximum signal-to-noise ratio predicted by theory. [ABSTRACT FROM AUTHOR]

In this paper, we present a new analytical model that captures link dependencies in all-optical wavelength-division multiplexing (WDM) networks under uniform traffic and enables the estimation of connection-blocking probabilities more accurately than previously possible. The basic formula of the dependency between two links in this model reflects their degree of adjacency, the degree of connectivity of the nodes composing them, and their carried traffic. Our validation tests have shown that the analytical dependency model gives accurate results and successfully captures the main dependency characteristics observed in the simulation measurements. The usefulness of the model is illustrated by showing how to use it in enhancing a simulation-based algorithm that we recently proposed for the sparse placement of full wavelength converters in WDM networks. To analytically handle the presence of wavelength converters, a lightpath containing converters is divided into smaller subpaths, such that each subpath is a wavelength-continuous path, and the nodes shared between these subpaths are full wavelength-conversion-capable. The blocking probability of the entire path is obtained by computing the probabilities in the individual subpaths. We validate the analytically-based sparse placement algorithm by comparing it with its simulation-based counterpart using a number of network topologies. [ABSTRACT FROM AUTHOR]

This paper analyzes the multiuser capacity of Gaussian frequency-selective wireline multiaccess channels. Both the uplink (multiple-access channel) and downlink (broadcast channel) capacity regions are considered. The concept of balanced capacity is introduced to characterize the multiuser channel performance. Algorithms for the computation of the balanced multiuser capacity (and the associated power allocations) are proposed for an arbitrary number of users. The optimal power allocation in a K-user memoryless Gaussian channel is analyzed in detail, and an extension to intersymbol interference channels is given with various kinds of power constraints. Results are provided for a wireline access network with 20 users. [ABSTRACT FROM AUTHOR]

In this paper, we present a new wireless scheduling algorithm based on the cumulative distribution function (cdf) and its simple modification that limits the maximum starving time. This cdf-based scheduling (CS) algorithm selects the user for transmission based on the cdf of user rates, in such a way that the user whose rate is high enough, but least probable to become higher, is selected first. We prove that the CS algorithm is equivalent to a scheduling algorithm that regards the user rates as independent and identically distributed, and the average throughput of a user is independent of the probability distribution of other users. So, we can evaluate the exact user throughput only if we know the user's own distribution, which is a distinctive feature of this proposed algorithm. In addition, we try a modification on the CS algorithm to limit the maximum starving time, and prove that the modification does not affect the average interservice time. This CS with starving-time limitation (CS-STL) algorithm turns out to limit the maximum starving time at the cost of a negligible throughput loss. [ABSTRACT FROM AUTHOR]

This paper presents a reduced-complexity soft-input soft-output detection scheme, called iterative tree search detection for multiple-input multiple-output wireless communication systems employing turbo processing at the receiver. In this scheme, a reduced search space is selected with the aid of the M-algorithm, and QAM signal constellations with block partitionable labels are independent of the modulation order, as well as asymptotically linear in the number of transmit antennas. Results from computer simulations are presented which demonstrate the capability of the scheme to approach optimal performance at considerable reduced complexity. [ABSTRACT FROM AUTHOR]

We consider scheduling strategies for multiantenna and multibeam cellular wireless systems for high-speed packet data services on the downlink. We establish a fundamental connection between the stability region of the queuing system and the set of feasible transmission rates, which provides the basis for the scheduling algorithm proposed in this paper. Transmission using adaptive steerable beams and fixed sector beams are considered and average delay versus throughput results are obtained through simulations for the proposed scheduling scheme in each case. While in single antenna systems multiuser diversity gains are achieved by the scheduling algorithms that transmit to a single user in each scheduling interval, our results show that with multiple antennas, transmitting to a carefully chosen subset of users has superior performance. The multiantenna scheduling problem is closely related to the problem of coordinated scheduling for transmission through multiple base stations, where a user can receive signals from several base stations simultaneously. We consider the special case when three single-antenna base stations are allowed to cooperate and transmit to the users in the triangular region between the base stations and propose scheduling strategies that demonstrate significant gains. [ABSTRACT FROM AUTHOR]

Fast adaptive transmission has been recently identified as a key technology for exploiting potential system diversity and improving power-spectral efficiency in wireless communication systems. In this paper, an adaptive resource-allocation approach, which jointly adapts subcarrier allocation, power distribution, and bit distribution according to instantaneous channel conditions, is proposed for multiuser multiple-input multiple-output (MIMO)/orthogonal frequency-division multiplexing systems. The resultant scheme is able to: 1) optimize the power efficiency; 2) guarantee each user's quality of service requirements, including bit-error rate and data rate; 3) ensure fairness to all the active users; and 4) be applied to systems with various types of multiuser-detection schemes at the receiver. For practical implementation, a reduced-complexity allocation algorithm is developed. This algorithm decouples the complex multiuser joint resource-allocation problem into simple single-user optimization problems by controlling the subcarrier sharing according to the users' spatial separability. Numerical results show that significant power and diversity gains are achievable, compared with non-adaptive systems. It is also demonstrated that the MIMO system is able to multiplex several users without sacrificing antenna diversity by using the proposed algorithm. [ABSTRACT FROM AUTHOR]

Recent theoretical results describing the sum capacity when using multiple antennas to communicate with multiple users in a known rich scattering environment have not yet been followed with practical transmission schemes that achieve, this capacity. We introduce a simple encoding algorithm that achieves near-capacity at sum rates of tens of bits/channel use. The algorithm is a variation on channel inversion that regularizes the inverse and uses a "sphere encoder" to perturb the data to reduce the power of the transmitted signal. This paper is comprised of two parts. In this first part, we show that while the sum capacity grows linearly with the minimum of the number of antennas and users, the sum rate of channel inversion does not. This poor performance is due to the large spread in the singular values of the channel matrix. We introduce regularization to improve the condition of the inverse and maximize the signal-to-interference-plus-noise ratio at the receivers. Regularization enables linear growth and works especially well at low signal-to-noise ratios (SNRs), but as we show in the second part, an additional step is needed to achieve near-capacity performance at all SNRs. [ABSTRACT FROM AUTHOR]

The puncturing technique allows obtaining high-rate convolutional codes from low-rate convolutional codes used as mother codes. This technique has been successfully applied to generate good high-rate convolutional codes which are suitable for Viterbi and sequential decoding. In this paper, we investigate the puncturing technique for convolutional self-doubly orthogonal codes (CSO²C) which are decoded using an iterative threshold-decoding algorithm. Based on an analysis of iterative threshold decoding of the rate-R = b/(b + 1) punctured systematic CSO²C, the required properties of the rate-R = 1/2 systematic convolutional codes (SCCs) used as mother codes are derived. From this analysis, it is shown that there is no need for the punctured mother codes to respect all the required conditions, in order to maintain the double orthogonality at the second iteration step of the iterative threshold-decoding algorithm. The results of the search for the appropriate rate-R = 1/2 SCCs used. as mother codes to yield a large number of punctured codes of rates 2/3 ⩽ R ⩽ 6/7 are presented, and some of their error performances evaluated. [ABSTRACT FROM AUTHOR]

Recently, a class of real-number Bose-Chaud- huri-Hocquengem codes known as discrete Fourier transform (DFT) codes have been considered as joint source and channel codes for providing robustness to erasures and errors over wireless networks. In this paper, we propose three subspace algorithms for error localization with quantized DFT codes. The algorithms are similar to the MUSIC, the minimum-norm, and the ESPRIT algorithms used in array signal processing for direction-of-arrival estimation. They provide different but related formulations of the error localizations by first partitioning a vector space into the channel error subspace and its orthogonal complement, the noise subspace. The locations of the errors are determined from either the error subspace eigenvectors or the noise subspace eigenvectors. We also present a brief performance analysis of the localization error in terms of the perturbation of the error subspace due to quantization. Simulation results show that their localization performances are similar, and they perform better than the coding-theoretic approach over a broad range of channel-error-to-quantization-noise ratios. [ABSTRACT FROM AUTHOR]

In a general wireless system, cells are loosely defined and user signals appear at multiple antennas with various powers and delays. Despite the enormous performance benefits of system-wide maximum-likelihood multiuser detection (ML MUD), its application to such systems is hampered by the lack of a regular structure. Prior work usually dismisses the possibility on computational grounds as exponential in the total number of users, at least. This paper is the first to address efficient computation of system-wide ML MUD. We present a computational organization that achieves dramatic reduction in complexity through exploitation of the partial overlap of user sets at different antennas. This algorithm, which applies to code-division multiple access or narrowband systems, can be viewed as a spatiotemporal extension of the well-known Viterbi algorithm (VA), and, like the VA, it is derived from dynamic programming principles. [ABSTRACT FROM AUTHOR]

In orthogonal frequency-division multiple access (OFDMA), closely spaced multiple subcarriers are assigned to different users for parallel signal transmission. An interleaved subcarrier-assignment scheme is preferred because it provides maximum frequency diversity and increases the capacity in frequency-selective fading channels. The subcarriers are overlapping, but orthogonal to each other such that there is no intercarrier interference (ICI). Carrier-frequency offsets (CFOs) between the transmitter and the receiver destroy the orthogonality and introduces ICI, resulting in multiple-access interference. This paper exploits the inner structure of the signals for CFO estimation in the uplink of interleaved OFDMA systems. A new uplink signal model is presented, and an estimation algorithm based on the signal structure is proposed for estimating the CFOs of all users using only one OFDMA block. Diversity schemes are also presented to improve the estimation performance. Simulation results illustrate the high accuracy and efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Multiuser or joint detection has recently been receiving significant research interest because of its potential for the significant increase in system capacity and performance. Among the conventional multiuser detection schemes such as the minimum mean-squared error and successive interference cancellation-based ones, maximum-likelihood multiuser detection has the best system performance. However, the complexity of maximum-likelihood detection (MLD) increases exponentially in the number of users and constellation size. In this paper, a low-complexity MLD scheme based on the use of a sensitive-bits algorithm is proposed. It is demonstrated that the proposed method can greatly reduce the computational complexity with a minimal penalty in performance compared with the exhaustive optimal MLD scheme. [ABSTRACT FROM AUTHOR]

It is well known that multiuser detection can obtain significant performance advantages over the conventional matched filter receiver in code division multiple access systems. Further, since optimal multiuser detection is exponentially complex, the majority of research has focused on suboptimal approaches such as successive interference cancellation (SIC). SIC has been shown to require a geometric distribution of received powers to achieve equal performance for all received signals. In this paper we propose a power control scheme for SIC to achieve this profile (or the profile corresponding to any desired and achievable set of error rates) based on frame-error rate (FER) or bit-error rate (BER). Specifically, we derive the relationship between received power and BER for linear SIC and show that for unlimited mobile powers, a deterministic distributed BER-based outer-loop power control will drive the received powers to the optimal power profile. The convergence of the deterministic BER-based algorithm is examined in the absence of inner loop power control errors. The simulated performance of a stochastic version of this algorithm is examined using instantaneous FER measurements. The stochastic algorithm is shown to provide unbiased estimates of the true power updates and converge to the optimal power vector provided the mobiles have unlimited power. Further, we consider power limits for specific mobiles and find that individual mobile limits do not affect the performance of other signals. Further, we examine the impact of system loading, multiple FER targets, error correction, and inner loop power control error on the performance of the algorithm. [ABSTRACT FROM AUTHOR]

This article focuses on forthcoming research papers to be published in this periodical. One paper "On the Application of Factor Graphs and the Sum-Product Algorithm to ISI Channels," is based on the application of the sum-product algorithm to factor graphs representing the joint a posteriori probability of the transmitted symbols, we propose new iterative soft-input soft-output detection schemes for intersymbol interference channels. Another research called "A Class of Signal Processing Schemes for Reducing the Envelope Fluctuations of CDMA Signals," present a class of nonlinear signal processing schemes to reduce the envelope fluctuations in the downlink transmission within code division multiple access (CDMA) systems. These schemes are compatible with conventional CDMA receivers since they just require some modifications at the transmitter side. The proposed transmitter structure includes a nonlinear operation in the time-domain followed by a linear, frequency-domain filtering operation.

In this paper, a bidirectional Fano algorithm (BFA) is proposed, in which a forward decoder (FD) and a backward decoder (BD) search in the opposite direction in the code tree simultaneously. It is shown that the proposed BFA can achieve more than twice the decoding throughput compared to the conventional unidirectional Fano algorithm (UFA) and there is higher throughput improvement at low signal-to-noise ratio (SNR). This new BFA decoding technique is applied in the parallel convolutional decoding architecture in very high throughput systems, such as the WirelessHD system. Due to the variability in the decoding delays of the parallel codewords, a scheduler is introduced in the parallel Fano decoding architecture which can dynamically allocate the idle decoders to assist with decoding the other parallel codewords in a bidirectional manner. It is shown that the proposed parallel Fano decoding with scheduling can dramatically increase the decoding throughput compared to the parallel Fano decoding without scheduling, and its computational complexity is much lower than that of parallel Viterbi decoding, especially at high SNR. The performance of the parallel Fano decoding with different scheduling schemes is also compared and analyzed in detail in the paper. [ABSTRACT FROM AUTHOR]

Previous work introduced the idea of matching network codes with network graphs to handle the network dynamics. This paper further integrates channel coding in the adaptive network coding framework through an elegant treatment of circulant shifting. Several code constructions are developed. Theoretical analysis and simulations show that the resultant generalized adaptive network coded cooperation (GANCC) is simple, adaptive, distributive, and capable of remarkable coding gains even with a very small number of cooperating users. [ABSTRACT FROM AUTHOR]

This paper considers how to estimate the average signal-to-noise ratio (SNR) for a communication system employing orthogonal non-coherent M-ARY frequency shift keying (NCMFSK), in white Gaussian noise (AWGN) and over both symbol-by-symbol fading channels and block fading channels. The proposed algorithm finds its application in a variety of applications including a cooperative transmission system, which is the main motivation behind this study. The maximum likelihood estimator and one using data statistics have been derived and simulated for various scenarios including data-aided, non-data aided and joint estimation using both the data and pilot sequences. We also derive the Cramer-Rao bound for the estimators in the case of Rayleigh fading channels. The results show that for a particular region of interest (e.g. high SNR or low SNR) and depending upon the availability of pilot sequence, a particular SNR estimation scheme is suitable. [ABSTRACT FROM AUTHOR]

In frequency-selective channels linear receivers enjoy significantly-reduced complexity compared with maximum likelihood receivers at the cost of performance degradation which can be in the form of a loss of the inherent frequency diversity order or reduced coding gain. This paper demonstrates that the minimum mean-square error symbol-by-symbol linear equalizer incurs no diversity loss compared to the maximum likelihood receivers. In particular, for a channel with memory ν, it achieves the full diversity order of (ν+1) while the zero-forcing symbol-by-symbol linear equalizer always achieves a diversity order of one. [ABSTRACT FROM AUTHOR]

The introduction of relay station (RS) nodes is a key feature in next generation wireless networks such as 3GPP's long term evolution advanced (LTE-Advanced), or the forthcoming IEEE 802.16j WiMAX standard. This paper presents, using game theory, a novel approach for the formation of the tree architecture that connects the RSs and their serving base station in the uplink of the next generation wireless multi-hop systems. Unlike existing literature which mainly focused on performance analysis, we propose a distributed algorithm for studying the structure and dynamics of the network. We formulate a network formation game among the RSs whereby each RS aims to maximize a cross-layer utility function that takes into account the benefit from cooperative transmission, in terms of reduced bit error rate, and the costs in terms of the delay due to multi-hop transmission. For forming the tree structure, a distributed myopic algorithm is devised. Using the proposed algorithm, each RS can individually select the path that connects it to the BS through other RSs while optimizing its utility. We show the convergence of the algorithm into a Nash tree network, and we study how the RSs can adapt the network's topology to environmental changes such as mobility or the deployment of new mobile stations. Simulation results show that the proposed algorithm presents significant gains in terms of average utility per mobile station which is at least 17.1% better relatively to the case with no RSs and reaches up to 40.3% improvement compared to a nearest neighbor algorithm (for a network with 10 RSs). The results also show that the average number of hops does not exceed 3 even for a network with up to 25 RSs. [ABSTRACT FROM AUTHOR]

Cooperative communications have received considerable attention for wireless multimedia applications as a technique to improve reliability and service coverage. To apply such cooperation over slow fading channels, we consider exploiting the spatial diversity in multiple relay networks. In this paper, we focus on amplify-and-forward relaying schemes, namely, orthogonal amplify-and-forward, selective relaying, and distributed beamforming, for the cooperative wireless multimedia transmission. Furthermore, the successive refinement source coding is exploited such that the multimedia signal is encoded into multiple layers and the quality of its reconstruction at the receiver is improved when more layers are received correctly. We study two strategies for the layered source transmission, namely, progressive transmission and superposition coding. With our developed framework, we propose suboptimal resource allocation algorithms to efficiently assign rate, power, and channel uses to different layers so as to maximize the quality of the multimedia signal reconstructed at the receiver. The proposed optimization methodology is simple and only requires the knowledge of the channel statistics compared to the existing algorithms. As a result, the receiver only requires to feedback the determined rate, power, and channel uses to the transmitter whenever the channel statistics or the layered source transmission strategy changes. [ABSTRACT FROM PUBLISHER]