Search

Recently, radio-on-free-space optical (RoFSO) technology is regarded as a new universal platform for enabling seamless convergence of fiber and FSO communication networks, thus extending broadband connectivity to underserved areas. In this article, an experimental demonstration of the newly developed advanced RoFSO system capable of transmitting the Japanese integrated services digital broadcasting- terrestrial (ISDB-T) signals over a 1 km FSO link is presented. Our innovative system combines a new generation full optical FSO system with radio over fiber technology. Important performance quality metrics like the modulation error ratio and bit error rate are measured and analyzed to characterize the deployment environment influencing the transmission of ISDB-T signals over the FSO link. The obtained results can be used for designing, predicting, and evaluating the RoFSO system capable of transmitting multiple wireless services over turbulent FSO links. [ABSTRACT FROM PUBLISHER]

High peak-to-average power ratio (PAPR) is a critical issue in any multicarrier systems using orthogonal frequency division multiplexing, as terrestrial digital video broadcasting (DVB). It can result in low power efficiency and large performance degradation of systems, due to the nonlinearity of high-power amplifier (HPA). A PAPR reduction method based on tone reservation technique with second-order cone programming (SOCP) approach in terrestrial DVB systems is proposed. The authors first demonstrate the superiority of the SOCP optimisation algorithm compared with an iterative gradient-based algorithm, using the current DVB-T parameters: significant PAPR reduction gains can be achieved with only a very small set of subcarriers in the useful bandwidth, making the proposed method more promising in terms of spectral efficiency. Moreover, the proposed solution presents a very good trade-off between PAPR reduction gain and mean transmitted power increase. An overall study, taking into account the limitation of the power level of the dedicated subcarriers and the evaluation of the performances in presence of a nonlinear HPA, is presented. These performances are given in terms of adjacent channel power ratio and bit error rate. The resulting PAPR reduction gain demonstrates that the relevance of the proposed method for the future DVB-T standard is straightforward. [ABSTRACT FROM AUTHOR]

In the tone reservation (TR) scheme of the orthogonal frequency division multiplexing (OFDM) systems, there exists a trade-off between the peak to average power ratio (PAPR) reduction performance and the peak reduction tone (PRT) set size. In this paper, we propose a multi-stage TR scheme for PAPR reduction, which adaptively selects one of several PRT sets according to the PAPR of OFDM signal while the PRT set is fixed for the conventional TR scheme. It is shown that the PAPR reduction performance of the proposed scheme is better than that of the conventional TR scheme when the tone reservation rate (TRR) is the same. [ABSTRACT FROM AUTHOR]

Wavelength division multiplexing (WDM) has been emerging as an effective technique for making use of the full bandwidth offered by optical fiber. To achieve long-haul transmission, erbium-doped fiber amplifiers (EDFAs) are employed to compensate for signal attenuation without using optoelectronic/electro-optic conversions. Transmission in these systems is limited by fiber nonlinearities and amplified spontaneous emission noise from amplifiers. In this paper, the long-haul optical WDM system with EDFAs is investigated theoretically. The noise and bit error rate (BER) characteristics of the system with optical amplifiers are calculated and the dependence of the BER on interamplifier separation and input power is shown. [ABSTRACT FROM AUTHOR]

The iterative exchange of extrinsic information between the K-best sphere detector (SD) and the channel decoder is appealing since it is capable of achieving a near maximum a posteriori (MAP) performance at a moderate complexity. However, the computational complexity imposed by the K-best SD significantly increases when using a large value of K for the sake of maintaining a near-MAP performance in a high-throughput uplink spatial-division multiple access (SDMA) orthogonal frequency-division multiplexing (OFDM) system supporting a large number of users and/or a high number of bits/symbol. This problem is further aggravated when the number of users/mobile stations (MSs) U exceeds that of the receive antennas N at the base station (BS), namely, in the challenging scenario of rank-deficient systems. We demonstrate that the iterative decoding convergence of this two-stage system may be improved by incorporating a unity rate code (URC) having an infinite impulse response, which improves the efficiency of the extrinsic information exchange. Although this results in a slightly more complex three-stage system architecture, it allows us to use a low-complexity SD having a significantly reduced candidate list size Ncand. Alternatively, a reduced signal-to-noise ratio (SNR) is required. For example, given a target bit error ratio (BER) of 10-5 and Ncand = 32 for the SD, the three-stage receiver is capable of achieving a performance gain of 2.5 dB over its two-stage counterpart in a rank-deficient SDMA/OFDM 4-quadratic-amplitude modulation (4-QAM) system supporting U = 8 cochannel users and employing N = 4 receive antennas at the BS, namely, in an (8 x 4) system. For the sake of further enhancing the three-stage concatenated receiver, the proposed iterative center-shifting SI) scheme and the irregular convolutional codes (IrCCs) are intrinsically amalgamated, which leads to an additional performance gain of 2 dB. [ABSTRACT FROM AUTHOR]

This paper considers resource allocation for down-link orthogonal frequency-division multiple access (OFDMA). We propose a subcarrier and power-allocation method that differentiates users per service type to fulfill the quality-of-service (QoS) requirements of each user. Network coordination improves the performance of users at the border of the cells and, thus, decreases the minimum sum power for users with guaranteed performance (GP). Best effort (BE) users are then scheduled to maximize their sum capacity. The proposed method only assumes causal coordination between base stations and can be seen as a generalized macrodiversity scheme suited for distributed networks. Numerical results show that network coordination increases the ratio of satisfied GP users, as well as the average data rate of BE users. [ABSTRACT FROM AUTHOR]

Channel estimation in multipath environments is typically performed using the pilot-symbol-assisted modulation (PSAM) scheme. However, the traditional PSAM scheme requires the use of dedicated pilot subcarriers and therefore leads to a reduction in the bandwidth utilization. Accordingly, this paper investigates a channel-estimation approach for orthogonal frequency-division multiplexing (OFDM) systems using a super- imposed training (ST) scheme, in which the pilot symbols are superimposed onto the data streams prior to transmission. By using equally spaced pilot symbols of equal power and assuming that the number of pilots is larger than the channel order, it is shown that the channel-estimation performance is independent of the number of pilots used. The optimal ratio of the pilot symbol power to the total transmission power is analyzed to maximize the lower bound of the channel capacity. Overall, the current results show that the ST-based channel estimation schemes have a slightly poorer performance than the PSAM scheme but yield higher system capacity. [ABSTRACT FROM AUTHOR]

For orthogonal frequency-division multiplexing (OFDM) systems equipped with multiple receive antennas, conventional pre-discrete Fourier transform (DFT) combining cannot balance the signal-to-noise ratio (SNR) performance of all subcarriers. This degrades the whole system performance. In this paper, we propose the use of the max-min fair criterion for pre-DFT combining to solve the problem. Semidefinite relaxation (SDR) is employed to approximate the solution. We also present a simple way to. effectively reduce the amount of computation without sacrificing much of the performance. Simulation results show that, for both uncoded and coded OFDM systems, the proposed max-mm fair pre-DFT combining solved via SDR can outperform conventional pre-DFT combining under various multipath channel environments with affordable computational complexity. [ABSTRACT FROM AUTHOR]

We consider the problem of pilot design for channel estimation in multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems in the presence of virtual carriers. The design criterion is the average mean-square error (MSE) of the least square (LS) estimates of the channel frequency response over the data carriers. To maximize bandwidth efficiency, the number of pilots is set to its minimum which is equal to the number of unknown channel coefficients. Both the phase shift orthogonal and disjoint pilot schemes are investigated. For a given pilot placement, a closed-form expression for the pilot power distribution for the disjoint scheme is provided. It is found that the optimal power distribution allocates less power to the pilots that are close to the virtual carriers. Pilot placement is obtained using an exhaustive search. The latter is too complex in systems with large number of subcarriers. A suboptimum pilot placement design for the disjoint pilot scheme is presented. It is shown that, unlike fully loaded systems where the two pilot design schemes have similar performance, in the presence of virtual carriers the optimal disjoint scheme not only has lower complexity but also yields more accurate channel estimation and bit error rate performance. [ABSTRACT FROM AUTHOR]

We consider a combined time-hopping (TH) and spread-time (ST) multiple-access technique that uses an internal code. In this method, the duration of each bit is divided into N8 frames. The outputs of the encoder and a pseudorandom (PN) sequence specify the number of the frame in which the data bit is transmitted in ST code-division multiple-access (ST-CDMA) form using the second PN sequence. We consider the correlator receiver, followed by the channel decoder. We obtain the performance of the combined method in additive white Gaussian noise (AWGN) and fading channels in the presence of multiple-access interference (MAI) and narrowband interference (NBI). We also consider the conventional ST-CDMA system and compare its performance with our method. The results indicate that the proposed method has much better performance while it has the same bandwidth and spectral efficiency as the conventional ST-CDMA system. In the new method, like in the conventional ST-CDMA system, an external error-correcting code can be applied for further performance enhancement. [ABSTRACT FROM AUTHOR]

In this paper, we propose a joint-transmitter-and-receiver design for spatial multiplexing based on a novel prewhitening detector (PWD). By using decision feedback equalization (DFE), Gaussian approximation, a prewhitening filter, and a matched filter, the proposed PWD transforms the multiple-input-multiple-output (MIMO) system into several parallel single-input-single-output (SISO) schemes and facilitates single-symbol detection. The proposed scheme achieves near-optimal symbol recovery with a complexity similar to that of a minimum-mean-square-error decision feedback equalizer (MMSE-DFE). The closed-form symbol error rate (SER) of the PWD is derived, which can be used to closely predict the ML performance for uncoded V-BLAST schemes. By assuming full channel knowledge at the transmitter side, we use a preequalizer and a precoder in a downlink scenario. The preequalizer can transfer the feedback part of the DFE to the transmitter side and thus provide better performance in a low signal-to-noise ratio (SNR) with reduced receiver complexity. The precoder designed to minimize the SER of this system can further improve performance without affecting the complexity at the receiver side. [ABSTRACT FROM AUTHOR]

We consider the downlink of a multiuser multiple-input multiple-output (MIMO) system, where the base station and the mobile receivers are equipped with multiple antennas. We propose simplified algorithms for channel-aware multiuser scheduling in conjunction with receive antenna selection for two downlink multiuser orthogonal space-division multiplexing techniques: block diagonalization and successive optimization. The algorithms greedily maximize the weighted sum rate. The algorithms add the best user at a time from the set of users that are not selected yet to the set of selected users until the desired number of users has been selected. To apply the proportional fairness criterion, simplified user scheduling metrics are proposed for block diagonalization and successive optimization. Two receive antenna selection algorithms are also proposed, which further enhance the power gain of the equivalent single-user channel after orthogonal precoding by selecting a subset of the receive antennas that contributes the most toward the total power gain of the channel. A user grouping technique is used to further lower the complexity of the selection algorithms. We compare various multiuser MIMO scheduling strategies that are applied to block diagonalization and successive optimization transmission techniques through simulation. Simulation results demonstrate the effectiveness of the proposed algorithms in ensuring throughput fairness among users. Results also show that when the number of users is large, the proposed scheduling algorithms perform close to the exhaustive search algorithms and previously proposed greedy scheduling algorithms, but with much lower complexity. [ABSTRACT FROM AUTHOR]

Ultrawideband (UWB) communications involve very sparse channels, because the bandwidth increase results in a better time resolution. This property is used in this paper to propose an efficient algorithm that jointly estimates the channel and the transmitted symbols. More precisely, this paper introduces an expectation-maximization (EM) algorithm within a wavelet- domain Bayesian framework for semiblind channel estimation of multiband orthogonal frequency division multiplexing based UWB communications. A prior distribution is chosen for the wavelet coefficients of the unknown channel impulse response to model a sparseness property of the wavelet representation. This prior yields, in maximum a posteriori estimation, a thresholding rule within the EM algorithm. We particularly focus on reducing the number of estimated parameters by iteratively discarding "insignificant" wavelet coefficients from the estimation process. Simulation results using UWB channels that were issued from both models and measurements show that, under sparseness conditions, the proposed algorithm outperforms pilot-based channel estimation in terms of the mean square error (MSE) and bit error rate (BER). Moreover, the estimation accuracy is improved, whereas the computational complexity is reduced compared with traditional semiblind methods. [ABSTRACT FROM AUTHOR]

A method for the spectral analysis of convolutionally coded Markov-driven impulse radio (IR)-based ultrawideband (UWB) systems is introduced. Example applications in UWB systems include the study of pulse position modulation (PPM), pulse-amplitude modulation (PAM), biorthogonal modulation, and pulse-shape modulation combined with periodic (e.g., pseudo-random)/random time-hopping (TH), as well as periodic/random direct-sequence (DS) multiplication. The effects of random jitter and pulse attenuation are considered in this analysis. The final result allows simple examination of the power spectral density (PSD) of such signals. This result clearly delimitates the relative contributions of parameters that allow enhanced design of UWB systems. Application examples are presented for a new convolutional encoder, providing a spectral-line-free PSD for quaternary biorthogonal (PAM/PPM) modulation IR UWB systems. [ABSTRACT FROM AUTHOR]

Orthogonal frequency division multiplexing (OFDM) is a powerful modulation choice for wideband wireless communication systems. However, its high peak-to-average power ratio greatly limits the high power amplifier (HPA) power efficiency. Here, we present the design of an adaptive predistorter to compensate the distortion caused by the HPA. Specifically, we deal with the implementation issue of the proposed predistorter in Lee and de Figueiredo's work (2006). The performance improvement by predistorter is verified by both floating-point simulation and fixed-point simulation, where the latter includes the distortion effects from the hardware. The bit widths for OFDM signals, ADC, and DAC are evaluated, and the bit width of 10 is shown to be sufficient for the hardware design. [ABSTRACT FROM AUTHOR]

The combination of vertical Bell Labs layered space time (V-BLAST) and space time block coding (STBC), known as a Layered STBC (LSTBC) system, offers high spectral efficiency with a higher order of diversity. The system structure, computational complexity and error performance of the V-BLAST and LSTBC multiple-input multiple-output orthogonal frequency division multiplexing systems are analysed and compared. It is shown that, compared with V-BLAST, the overall diversity order of LSTBC increases two fold. This diversity gain is achieved at the expense of a four–fold increase in the computational complexity of the QR decomposition (QRD) algorithm, required at the receiver of both LSTBC and V-BLAST. The authors propose a modified QRD algorithm which reduces this four-fold complexity to two fold. [ABSTRACT FROM AUTHOR]

This paper presents a novel generalized transceiver architecture, i.e., Multicarrier Interleave-Division-Multiplexing-aided Interleave Division Multiple Access (MC-LDM-IDMA). A parallel interference cancellation (PIC)-aided iterative multi- user detection (MUD) algorithm is introduced, and the convergence behavior of the system is evaluated with the aid of EXtrinsic Information Transfer (EXIT) charts under the assumption of an equal-power multiuser scenario. Three interesting design tradeoffs of the MC-IDM-IDMA system are analyzed: 1) the multiplexing versus diversity tradeoffs; 2) the coding versus spreading tradeoffs, where the achievable bandwidth efficiency of both MC-IDM and MC-IDMA are characterized, and a general design rule is provided for low-rate codes; and 3) the complexity versus performance tradeoffs and the EXIT characteristics of two different MUD algorithms are investigated, leading to a reduced- complexity hybrid MUD. [ABSTRACT FROM AUTHOR]

In this paper, we propose a weighting factor: (WF) estimation method for peak power reduction (PPR) based on adaptive flipping of parity carriers in a turbo-coded orthogonal frequency-division multiplexing (OFDM) system. In this,. PPR scheme, the peak-to-average power ratio of a turbo-coded OFDM signal is reduced with adaptive flipping of the phase of the parity carriers corresponding to the WFs. At the receiver, the WFs are estimated at a turbo decoder by exploiting the redundancy of an error-correcting code using no extra side information. The proposed WF estimation method is based on an iterative decoding of the turbo code, i.e., the turbo decoder provides not only, error correction capability but the WF estimation function as well. When the proposed WF estimation method is used for the system using a turbo code with constraint length K = 4 and a code rate of R = 1/2, the instantaneous power of the OFDM signal at the complementary cumulative distribution function of 10-4 can be reduced by about 2.1 dB through the application of the PPR scheme. When the bit error rate (BER) performance is evaluated as a function of the peak signal-to-noise power ratio (PSNR), the proposed method achieves better BER performance than the case without the PPR in an attenuated 12-path Rayleigh fading condition. The improvements in BER performance as a function of PSNR are about 1.1, 2.0, and 2.1 dB at BER = 10-4 for turbo-coded OFDM signals using QPSK, 16-state quadrature amplitude modulation (QAM), and 64-state QAM schemes, respectively. [ABSTRACT FROM AUTHOR]

Telecommunication and grid computing applications demand high bandwidth data channels that offer guarantees with respect to service availability. Such applications include: remote surgery, remote experimentation, video on-demand, teleconferencing and bulk transfers. Furthermore, by forecasting traffic patterns internet service providers attempt to optimise network resources in order to lower operational costs during peak periods of bandwidth consumption. Advance reservation for wavelength division multiplexed networks can address some of these issues by reserving high volume communication channels (i.e. lightpaths) beforehand. The authors develop a mathematical model to solve the problem of scheduling lightpaths in advance. The optimal solution is presented as a mixed integer linear program with the assumption that all traffic is static and the network is centrally controlled. Furthermore, we have developed two novel meta-heuristics based on: 1) a greedy implementation (local search) and 2) simulated annealing. The meta-heuristics have shown to produce good approximate solutions in a reasonable amount of time. [ABSTRACT FROM AUTHOR]

Motion-compensated fine-granularity scalability (MC-FGS) with leaky prediction has been shown to provide an efficient tradeoff between compression gain and error resilience, facilitating the transmission of video over dynamic channel conditions. In this paper, we propose an n-channel symmetric motion-compensated multiple description (MD) coding and transmission scheme for the delivery of scalable video over orthogonal frequency division multiplexed systems, utilizing the concepts of partial and leaky predictions. We investigate the proposed MD coding and transmission scheme using a cross-layer design perspective. In particular, we construct the symmetric motion-compensated MD codes based on the diversity order of the channel, defined as the ratio of the overall bandwidth of the system to the coherence bandwidth of the channel. We show that knowing the diversity order of a physical channel can assist an MC-FGS video coder in selecting the motion-compensation prediction point, as well as on the use of leaky prediction. More importantly, we illustrate how the side information can reduce the drift management problem associated with the construction of symmetric motion-compensated MD codes. We provide results based on both an information-theoretic approach and simulations. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of traffic grooming in wavelength-division multiplexing (WDM) rings where connection requests arrive online. Each request specifies a pair of nodes that wish to communicate and also the desired bandwidth of this connection. If the request is to be satisfied, it must be allocated to one or more wavelengths with sufficient remaining capacity. We consider three distinct profit models specifying the profit associated with satisfying a connection request. We give results on offline and online algorithms for each of the three profit models. We use the paradigm of competitive analysis to theoretically analyze the quality of our online algorithms. Finally, experimental results are given to provide insight into the performance of these algorithms in practice. [ABSTRACT FROM AUTHOR]

Consider the problem of transmitting multiple video streams to fulfill a constant bandwidth constraint. The available bit budget needs to be distributed across the sequences in order to meet some optimality criteria. For example, one might want to minimize the average distortion or, alternatively, minimize the distortion variance, in order to keep almost constant quality among the encoded sequences. By working in the p-domain, we propose a low-delay rate allocation scheme that, at each time instant, provides a closed form solution for either the aforementioned problems. We show that minimizing the distortion variance instead of the average distortion leads, for each of the multiplexed sequences, to a coding penalty less than 0.5 dB, in terms of average PSNR. In addition, our analysis provides an explicit relationship between model parameters and this loss. In order to smooth the distortion also along time, we accommodate a shared encoder buffer to compensate for rate fluctuations. Although the proposed scheme is general, and it can be adopted for any video and image coding standard, we provide experimental evidence by transcoding bitstreams encoded using the state-of-the-art H.264/AVC standard. The results of our simulations reveal that is it possible to achieve distortion smoothing both in time and across the sequences, without sacrificing coding efficiency. [ABSTRACT FROM AUTHOR]

One of the challenging issues for Orthogonal Frequency Division Multiplexing (OFDM) system is its high Peak-to-Average Power Ratio (PAPR). In this paper, we review and analysis different OFDM PAPR reduction techniques, based on computational complexity, bandwidth expansion, spectral spillage and performance. We also discuss some methods of PAPR reduction for multiuser OFDM broadband communication systems. [ABSTRACT FROM AUTHOR]

We address low-complexity, highly-accurate frequency offset estimation for multi-band orthogonal frequency division multiplexing (MB-OFDM) based ultra-wide band systems in time-invariant as well as time-variant channels. We investigate the unique characteristics of MB-OFDM systems, namely, different frequency offsets, channel responses, received energies, and preamble structures in different frequency bands. Utilizing them, we develop frequency offset estimators based on the best linear unbiased estimation principle. If compared to the reference estimators, our proposed methods achieve significantly better estimation performance (4 to 6.4 dB (5 to 20 dB) estimation mean-square error advantage in the time-invariant (time-variant) channels) for all preamble patterns of the MB-OFDM system in [8]. [ABSTRACT FROM AUTHOR]

Carrier frequency offset (CFO) mitigation is critical for orthogonal frequency-division multiplexing (OFDM)-based cooperative transmissions because even small CFO per transmitter may lead to severe performance loss, especially when the number of cooperative transmitters is large. In this paper, we show that cyclic prefix (CP) can be exploited to mitigate or even remove completely the CFO. The mitigation performance increases along with the CP length. In particular, long CP with length proportional to NI, where N is the fast Fourier transform (FFT) block length and I is the number of cooperative transmitters, can guarantee a complete CFO removal. While this comes with a reduction in bandwidth efficiency, the long CP in the proposed scheme is exploited to enhance transmission power efficiency in a way similar to spread-spectrum systems, and thus is different from conventional CP that degrades both bandwidth and power efficiency. An efficient CFO-mitigation algorithm is developed that has complexity at most O(NI²), or even linear in N approximately in some cases. Implemented as a preprocessing procedure independently from cooperative encoding/decoding details, this algorithm makes the CFO problem effectively transparent to and thus has general applications in OFDM-based transmissions. [ABSTRACT FROM AUTHOR]

In this paper, we consider an orthogonal frequency-division multiplexing (OFDM) communication system over a power-line channel (PLC) that exhibits cyclic short-time variations. In order to follow the cyclic channel variation, a blind estimation method is proposed. Simulations on an indoor PLC network show that the proposed estimation method is suited for following the short-time variation of the channel, achieving a better bit-error rate (BER) than a base pilot-aided method. [ABSTRACT FROM AUTHOR]

This letter proposes an approximate waterfill power loading scheme using limited feedback in orthogonal frequency division multiplexing (OFDM) systems. The proposed technique achieves nearly the capacity of optimal waterfill power loading, while significantly reducing feedback by using order information for the subcarrier channel gains. Furthermore, the proposed power loading technique can circumvent the practical shortcomings of previous limited feedback power loading techniques by simply exploiting order mapping and interpolation. The advantages are particularly visible at low SNR or for many subcarriers, both of which will be very common in emerging wireless broadband OFDM standards. [ABSTRACT FROM AUTHOR]

For communication over doubly dispersive channels, we consider the design of multicarrier modulation (MCM) schemes based on time-frequency shifts of prototype pulses. We consider the case where the receiver knows the channel state and the transmitter knows the channel statistics (e.g., delay spread and Doppler spread) but not the channel state. Previous work has examined MCM pulses designed for suppression of inter-symbol/inter-carrier interference (181/ICI) subject to orthogonal or biorthogonal constraints. In doubly dispersive channels, however, complete suppression of ISI/ICI is impossible, and the ISI/ICI pattern generated by these (bi)orthogonal schemes can be difficult to equalize, especially when operating at high bandwidth efficiency. We propose a different approach to MCM pulse design, whereby a limited expanse of ISI/ICI is tolerated in modulation/demodulation and treated near-optimally by a downstream equalizer. Specifically, we propose MCM pulse designs that maximize a signal-to-interference-plus-noise ratio (SINR) which suppresses ISI/ICI outside a target pattern. In addition, we propose two low-complexity turbo equalizers, based on minimum mean-squared error and maximum likelihood criteria, respectively, that leverage the structure of the target ISI/ICI pattern. The resulting system exhibits an excellent combination of low complexity, low bit-error rate, and high spec- tral efficiency. [ABSTRACT FROM AUTHOR]

In orthogonal frequency division multiplexing communication systems, the system performance may be degraded by the effect of inter-carrier interference. In this paper, a new scheme is proposed to cancel the effect of ICI. The system performances are evaluated based on carrier-to-interference ratio and bit error rate. The simulation results show that the effect of phase error with the proposed scheme is lighter than that with Zhao's scheme. Hence, the BER performance of proposed scheme is better than that of Zhao's scheme even in a large frequency offset. [ABSTRACT FROM AUTHOR]

In orthogonal frequency-division multiple access (OFDMA) systems, the cyclic prefix (CP) length needs to be no less than the longest delay spread of the channels of many users, reducing bandwidth efficiency more significantly than in single-user orthogonal frequency division multiplexing systems. In this paper, we address OFDMA downlink data transmission when a short CP is used to mitigate the inefficient bandwidth usage. Previous time-domain equalizers (TEQs) can be used to shorten the channel; however, they tend to increase noise by introducing spectral nulls. A previous work on per-tone equalization (PTEQ) structure involves a multitap frequency-domain equalizer (FEQ) for each tone, and shows better performance than TEQ-based receiver structure. We propose a novel receiver structure with only one-tap FEQ for OFDMA systems with a reduced CP, exploiting the unused subchannels for a user. We formulate an optimization problem to set the FEQ coefficients at the unused subchannels such that the channel is shortened (approximation is involved) and noise is not enhanced at the used subchannels. With the aid of computer simulations, it is demonstrated that the proposed equalization method is superior to the conventional TEQ-based receivers, and is comparable to the previous PTEQ-based receiver in terms of the achievable SNR, error performance, and bandwidth efficiency. Although the throughput curve versus synchronization delay of the PTEQ is smoother than that of the proposed receiver, the proposed method shows proper throughput over a wider range of the delay values than PTEQ receiver when the system parameters are set so that the complexities are comparable. [ABSTRACT FROM AUTHOR]

In this paper, a novel generalization of subspace-based blind channel identification methods in cyclic prefix (CP) systems is proposed. For the generalization, a new system parameter called repetition index is introduced whose value is unity for previously reported special cases. By choosing a repetition index larger than unity, the number of received blocks needed for blind identification is significantly reduced compared to all previously reported methods. This feature makes the method more realistic especially in wireless environments where the channel state is usually fast-varying. Given the number of received blocks available, the minimum value of repetition index is derived. Theoretical limit allows the proposed method to perform blind identification using only three received blocks in absence of noise. In practice, the number of received blocks needed to yield a satisfactory bit-error-rate (BER) performance is usually on the order of half the block size. Simulation results not only demonstrate the capability of the algorithm to perform blind identification using fewer received blocks, but also show that in some cases system performance can be improved by choosing a repetition index larger than needed. Simulation of the proposed method over time-varying channels clearly demonstrates the improvement over previously reported methods. [ABSTRACT FROM AUTHOR]

Copyright of Teknoloji is the property of Engineering Science & Technology, an International Journal and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

As the demand for high bandwidths in microelectronic systems increases, optical interconnect architectures are now being considered that involve schemes commonly used in telecommunications, such as wavelength-division multiplexing (WDM) and wavelength conversion. In such on-chip architectures, the ability to perform wavelength conversion is required. So far wavelength conversion on a silicon chip has only been demonstrated using schemes that are fundamentally all-optical, making their integration on a microelectronic chip challenging. In contrast, we show wavelength conversion obtained by inducing ultrafast electro–optic tuning of a microcavity. It is well known that tuning the parameters of an optical cavity induces filtering of different colours of light. Here we demonstrate that it can also change the colour of light. This is an effect often observed in other disciplines, for example, in acoustics, where the sound generated by a resonating guitar string can be modified by changing the length of the strings (that is, the resonators). Here we show this same tuning effect in optics, enabling compact on-chip electrical wavelength conversion. We demonstrate a change in wavelength of up to 2.5 nm with up to 34% on–off conversion efficiency. [ABSTRACT FROM AUTHOR]

This paper considers semiblind channel estimation and data detection for orthogonal frequency-division multiplexing (OFDM) over frequency-selective fading channels. We show that the samples of an OFDM symbol are jointly complex Gaussian distributed, where the mean and covariance are determined by the locations and values of fixed pilot symbols. We exploit this distribution to derive a novel maximum-likelihood (ML) semiblind gradient-descent channel estimator. By exploiting the channel impulse response (CIR) statistics, we also derive a semiblind data detector for both Rayleigh and Ricean fading channels. Furthermore, we develop an enhanced data detector, which uses the estimator error statistics to mitigate the effect of channel estimation errors. Efficient implementation of both the semiblind and the improved data detectors is provided via sphere decoding and nulling-canceling detection. We also derive the Cramér-Rao bound (CRB) and design optimal pilots by minimizing the CRB. Our proposed channel estimator and data detector exhibit high bandwidth efficiency (requiring only a few pilot symbols), achieve the CRB, and also nearly reach the performance of an ideal reference receiver. [ABSTRACT FROM AUTHOR]

For a power limited orthogonal frequency-division multiplexing (OFDM) system transmitting a large number N of subcarriers over a Rayleigh-fading channel, the distribution of the instantaneous capacity is shown to be approximately Gaussian. The mean and variance of the approximating distribution are derived. It is also shown that, in the limit as N → ∞, the capacity approaches a constant value equal to the capacity of the infinite-bandwidth Gaussian channel. [ABSTRACT FROM AUTHOR]

Cyclic delay diversity (CDD) is a simple and elegant technique to exploit transmit diversity in a MIMO-OFDM system by artificially increasing the frequency-selectivity of the equivalent channel. In this paper, we study the application of CDD in digital audio broadcasting (DAB), which is well motivated by the mismatch analysis between the channel inherent diversity and the capability of the DAB channel coding and interleaving. Simulation of DAB with CDD in rural area and typical urban area is carried out; the results demonstrate the advantage of CDD in creating a more uniform coverage area compared to the system without CDD. We further devise a lower bound which allows justification of tradeoff between the design parameters and the performance improvement. [ABSTRACT FROM AUTHOR]

An effective frequency-offset acquisition technique based on differential detection (DD) for wireless orthogonal frequency-division multiplexing communication is investigated. By exploiting differentially coherent detection involving coherent cross-correlation extraction and subsequent DD, data-aided frequency acquisition assisted by frequency-domain pseudonoise matched filters reduces probabilities of false alarm and miss over a propagation channel with a sufficiently wide coherence bandwidth. Furthermore, the proposed technique uses the inherent frequency diversity with maximum ratio combining and exploits subcarrier-level differential operation and subsequent coherent cross-correlation accumulation. To realize the subcarrier-level DD approach proposed here, the in-lock sequence must be modified by taking self-interference caused by Rayleigh fading into account, and the out-of-lock sequence must be remodeled by means of the discrete Wiener process. Statistical analysis and extensive computer simulation verities the superiority of the proposed technique. [ABSTRACT FROM AUTHOR]

The main disadvantage of orthogonal frequency-division multiplexing (OFDM) is the high time-domain peak-to-average power ratio (PAR) that limits transmitter power efficiency. Assuming no changes in receiver structure, the transmitter can only reduce PAR by distorting the data carriers or by adding power to the free carriers. This paper shows that the OFDM signal with globally minimum PAR, subject to constraints on the allowed constellation error and the free carrier power, can be efficiently computed using convex optimization. Simulation results are presented for the 802.11a/g wireless local-area network standard. The globally minimum PAR, subject to the constellation error constraint, ranges from 0.7 dB for 6-Mbps binary phase-shift keying to 4.1 dB for 54-Mbps 64-QAM. Tradeoff analysis shows that the free carrier power can be drastically reduced by backing off from this globally minimum PAR by less than 1 dB. A customized interior-point method (IPM) is derived for solving the OFDM optimization problem. The IPM reaches the desired tradeoff between PAR and free carrier power within two iterations, where the main computational complexity per iteration is four fast Fourier transforms plus the solution of a linear system of equations. The customized IPM is about 100 times faster than a general-purpose optimization algorithm. [ABSTRACT FROM AUTHOR]

The orthogonal frequency and code division multiplexing (OFCDM) system with 2-D spreading (time- and frequency-domain spreading) is becoming a promising candidate for future broadband wireless communication systems. OFCDM is more attractive than orthogonal frequency-division multiplexing (OFDM) both by introducing frequency-domain spreading for frequency diversity provision and time-domain spreading for flexible data rate provision. To provide high-speed mobile services, multicode transmission is employed in conjunction with OFCDM. In a Gaussian or flat-fading channel, multicode channels are orthogonal. However, in a realistic wireless channel, the orthogonality no longer maintains. Thus, multicode interference (MCI) is caused. This paper focuses on the investigation of the effect of Doppler shift on the downlink transmission of high-speed mobile OFCDM systems. A practical channel estimation algorithm based on a code-multiplexed pilot channel is employed to track the variations of fading channels. Hybrid MCI cancellation and minimum mean-square error (MMSE) detection proposed by the authors is employed as an efficient way to eliminate the MCI in the frequency domain. The system performance is analytically studied with imperfect channel estimation to show how it is affected by parameters such as the window size in the channel estimation, Doppler shift, the number of stages of the hybrid detection, the power ratio of pilot to data channels, spreading factor, and so on. [ABSTRACT FROM AUTHOR]

Starting with the maximum a posteriori (MAP) estimation approach, this paper derives the optimum (in the MAP estimation sense) means for performing symbol-timing recovery in the absence of carrier-phase information (i.e., prior to carrier-phase recovery). Specifically, we examine the necessary modification of a well-known form of coherent symbol synchronizer, namely, the data transition tracking loop (DTTL), to allow its operation in the absence of carrier-phase information, i.e., as a so-called noncoherent symbol sync loop. By employing such a noncoherent scheme, one can eliminate the need for iteration between the carrier and symbol sync functions, as typically takes place in receivers that more commonly perform carrier tracking and acquisition prior to symbol timing. The performance of both the linear and nonlinear versions of this noncoherent DTTL is obtained by a combination of analysis and simulation, and compared with that of the corresponding coherent DTTLs. [ABSTRACT FROM AUTHOR]

Carrier frequency offset (CFO) in orthogonal frequency-division multiplexing (OFDM) systems, which can induce the loss of orthogonality among subcarriers and result in significant performance degradation, is critical to be estimated and compensated for. In this paper, a suboptimal scheme is proposed to estimate the CFO using null subcarriers. In the proposed scheme, the CFO is divided into the fractional part and the integer part, with the fractional CFO estimated followed by the integer CFO estimation. Compared with previous work using null subcarriers and exhaustive search, the implementation complexity of the proposed scheme is significantly lower due to the fact that the main component required is a simple correlator. Furthermore, with only one training OFDM symbol and proper null subcarrier allocation, the estimation range of the proposed scheme can be the inverse of the sampling duration. In contrast, conventional schemes with the same estimation range and complexity require two OFDM symbols. To achieve good performance, it will be shown that the null subcarrier allocation should be based upon some specific binary sequences such as the proposed extended m-sequences. It will also be shown by simulations that the same null subcarrier allocation criterion should be employed for optimal maximum-likelihood CFO estimation. [ABSTRACT FROM AUTHOR]

We propose a new scheme for differential modulation in orthogonal frequency-division multiplexing (OFDM) with cyclic delay diversity. Delay diversity is done in a cyclic manner in order not to exceed the guard interval. However, the increased frequency selectivity, and consequently, reduced coherence bandwidth, causes problems for noncoherent detection of differential modulation in frequency direction. Our proposal is able to cope with the increased frequency selectivity, and enables picking up the spatial diversity in frequency-selective channels with unknown delay spread in combination with standard differential modulation techniques. The new scheme is less complex than differential unitary space-time modulation. The overhead due to reference symbols is minimized and the detection delay is reduced, compared with differential modulation in time direction. [ABSTRACT FROM AUTHOR]

Transmit diversity can be applied to OFDM systems by adopting space time code. Since the received signal is the overlapped signals transmitted from different transmit antennas, channel estimation is a rather challenging task for space time coded OFDM (ST-OFDM) systems. Pilot structure can help the receiver to effectively separate the overlapped signals and perform accurate channel estimation. In this paper, we propose three different channel estimation algorithms based on specially designed comb type pilots inserted in frequency domain. One of our proposed algorithms is performed in frequency domain and the other two are performed in time domain. Such comb type pilot based algorithms can provide higher bandwidth efficiency than common significant-tap-catching algorithm using training block pilots. Numerical analyzes and computational simulation show that our proposed estimation schemes have the same good performance while the time domain methods have relatively simple structure. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a receive diversity combining method for orthogonal frequency division multiplexing wireless local area network systems with cochannel interference. The scheme utilizes interference plus noise power (INP) to obtain the weighting factors for signal to interference plus noise power ratio (SINR) based maximum ratio combining (MRC). INP is estimated by using the correlation between the subchannel gains within the coherence bandwidth of the channel, which is caused by the limited delay spread of the multipath channel. Simulation results show that the SINR based MRC using the proposed INP estimator reveals greatly improved packet error rate performance compared to the signal-to-noise ratio based MRC that only considers white channel noise. [ABSTRACT FROM AUTHOR]

We consider optimization of the capacity of a multi-input single-output wideband cellular "downlink," in which the base station has estimates of the statistics of the spatial channel. Our main focus is on orthogonal frequency-division multiplexed (OFDM) systems, although some of our results apply to single-carrier systems, as well. Prior work has shown that estimates of the channel spatial covariance can be obtained without overhead for both frequency-division duplex (FDD) and time-division duplex (TDD) systems by suitably averaging uplink measurements. In this paper, we investigate the benefits of supplementing this "free" covariance feedback with mean feedback, where the latter refers to estimates of the spatial channel realization in each subcarrier. Mean feedback can be obtained using reciprocity for TDD systems, and requires explicit feedback for FDD systems. We first devise strategies for using both covariance and mean feedback, mainly restricting attention to beamforming, which is optimal or near-optimal for many outdoor channels with narrow spatial spread. Second, since mean feedback degrades rapidly with feedback delay for mobile channels, we develop quantitative rules of thumb regarding the accuracy required for the mean feedback to be a useful supplement to the already available, and robust, covariance feedback. Our results validate the following intuition: the accuracy requirements for mean feedback to be useful are more relaxed for channels with larger spatial spread, or for a larger number of transmit elements. [ABSTRACT FROM AUTHOR]

All optical networking is a promising candidate for supporting high-speed communications because of the huge bandwidth of optics. In this paper, we study optimal scheduling in buffered WDM interconnects with limited range wavelength conversion capability. We formalize the problem of maximizing network throughput and minimizing total delay as a problem of finding an optimal matching in a weighted bipartite graph. We then give a simple algorithm, called the Scan and Swap Algorithm, that finds the optimal matching in O(kB) time, where k is the number of wavelengths per fiber and B is the buffer length, as compared to directly adopting other existing algorithms that need at least O(k²N² + k²BN) time, where N is the number of input fibers. [ABSTRACT FROM AUTHOR]