scispace - formally typeset
Search or ask a question

Showing papers on "Bit error rate published in 2003"


Journal ArticleDOI
TL;DR: This paper addresses the joint design of transmit and receive beamforming or linear processing for multicarrier multiple-input multiple-output (MIMO) channels under a variety of design criteria by developing a unified framework based on considering two families of objective functions that embrace most reasonable criteria to design a communication system.
Abstract: This paper addresses the joint design of transmit and receive beamforming or linear processing (commonly termed linear precoding at the transmitter and equalization at the receiver) for multicarrier multiple-input multiple-output (MIMO) channels under a variety of design criteria. Instead of considering each design criterion in a separate way, we generalize the existing results by developing a unified framework based on considering two families of objective functions that embrace most reasonable criteria to design a communication system: Schur-concave and Schur-convex functions. Once the optimal structure of the transmit-receive processing is known, the design problem simplifies and can be formulated within the powerful framework of convex optimization theory, in which a great number of interesting design criteria can be easily accommodated and efficiently solved, even though closed-form expressions may not exist. From this perspective, we analyze a variety of design criteria, and in particular, we derive optimal beamvectors in the sense of having minimum average bit error rate (BER). Additional constraints on the peak-to-average ratio (PAR) or on the signal dynamic range are easily included in the design. We propose two multilevel water-filling practical solutions that perform very close to the optimal in terms of average BER with a low implementation complexity. If cooperation among the processing operating at different carriers is allowed, the performance improves significantly. Interestingly, with carrier cooperation, it turns out that the exact optimal solution in terms of average BER can be obtained in closed form.

1,243 citations


Journal ArticleDOI
TL;DR: A new PAR-reduction method is presented that dynamically extends outer constellation points in active (data-carrying) channels, within margin-preserving constraints, in order to minimize the peak magnitude of an OFDM transmit block.
Abstract: The high peak-to-average power ratio (PAR) in orthogonal frequency division multiplexing (OFDM) modulation systems can significantly reduce power efficiency and performance. Methods exist which alter or introduce new signal constellations to combat large signal peaks. We present a new PAR-reduction method that dynamically extends outer constellation points in active (data-carrying) channels, within margin-preserving constraints, in order to minimize the peak magnitude. This scheme simultaneously decreases the bit error rate slightly while substantially reducing the peak magnitude of an OFDM transmit block. Furthermore, there is no loss in data rate and, unlike other methods, no side information is required. PAR reduction for an approximated analog signal is considered, and about a 4.6 dB reduction at a 10/sup -5/ symbol-clip probability is obtained for 256-channel QPSK OFDM. The results show great promise for use in commercial systems.

839 citations


Journal ArticleDOI
TL;DR: A robust symbol-timing and carrier-frequency synchronization scheme applicable to orthogonal frequency-division-multiplexing systems is presented and a new performance measure is introduced for timing estimation, based on the plot of signal to timing-error-induced average interference power ratio against the timing estimate shift.
Abstract: A robust symbol-timing and carrier-frequency synchronization scheme applicable to orthogonal frequency-division-multiplexing systems is presented. The proposed method is based on a training symbol specifically designed to have a steep rolloff timing metric. The proposed timing metric also provides a robust sync detection capability. Both time domain training and frequency domain (FD) training are investigated. For FD training, maintaining a low peak-to-average power ratio of the training symbol was taken into consideration. The channel estimation scheme based on the designed training symbol was also incorporated in the system in order to give both fine-timing and frequency-offset estimates. For fine frequency estimation, two approaches are presented. The first one is based on the suppression of the interference introduced in the frequency estimation process by the training symbol pattern in the context of multipath dispersive channels. The second one is based on the maximum likelihood principle and does not suffer from any interference. A new performance measure is introduced for timing estimation, which is based on the plot of signal to timing-error-induced average interference power ratio against the timing estimate shift. A simple approach for finding the optimal setting of the timing estimator is presented. Finally, the sync detection, timing estimation, frequency estimation, and bit-error-rate performance of the proposed method are presented in a multipath Rayleigh fading channel.

721 citations


Journal ArticleDOI
TL;DR: It is shown that the performance of recently proposed quasi-orthogonal space-time codes can be improved by phase-shifting the constellations of the symbols constituting the code, leading to substantially improved performance.
Abstract: In this letter, we show that the performance of recently proposed quasi-orthogonal space-time codes can be improved by phase-shifting the constellations of the symbols constituting the code. The optimal rotation of the symbols increases the minimum distance of the corresponding space-time codewords, leading to substantially improved performance.

360 citations


Journal ArticleDOI
TL;DR: This work addresses the problem of finding the most suitable index assignments to arbitrary, high order signal constellations and proposes a new method based on the binary switching algorithm that finds optimized mappings outperforming previously known ones.
Abstract: We investigate bit-interleaved coded modulation with iterative decoding (BICM-ID) for bandwidth efficient transmission, where the bit error rate is reduced through iterations between a multilevel demapper and a simple channel decoder. In order to achieve a significant turbo-gain, the assignment strategy of the binary indices to signal points is crucial. We address the problem of finding the most suitable index assignments to arbitrary, high order signal constellations. A new method based on the binary switching algorithm is proposed that finds optimized mappings outperforming previously known ones.

286 citations


Proceedings ArticleDOI
06 Apr 2003
TL;DR: An improved PAR-reduction method is presented that dynamically extends outer constellation points in active channels, within margin-preserving constraints, in order to minimize the peak magnitude of an OFDM transmit block and requiring no side information.
Abstract: The high peak-to-average power ratio (PAR) in orthogonal frequency division multiplexing (OFDM) modulation systems can significantly limit performance. Methods exist which alter or introduce new signal constellations to combat large signal peaks. We present an improved PAR-reduction method that dynamically extends outer constellation points in active (data-carrying) channels, within margin-preserving constraints, in order to minimize the peak magnitude. This scheme simultaneously decreases the bit error rate slightly while substantially reducing the peak magnitude of an OFDM transmit block and requiring no side information. PAR reduction for an approximated analog signal is considered, and a 4.5 dB reduction is obtained for 256-channel QPSK OFDM. The results show great promise for use in commercial systems.

258 citations


Proceedings ArticleDOI
08 Dec 2003
TL;DR: An exhaustive characterization of multi-bit errors in 90/130 nm SRAMs is presented to support bit interleaving rules that make the impact of multi -bit errors negligible.
Abstract: Error correction code schemes are being implemented in memories and microprocessor caches in response to SER increases which result from increasing bit counts and technology scaling These methods can be rendered ineffective by multi-bit error events An exhaustive characterization of multi-bit errors in 90/130 nm SRAMs is presented to support bit interleaving rules that make the impact of multi-bit errors negligible

257 citations


Journal ArticleDOI
TL;DR: This work obtains exact and generic expressions in M for the BER of the generalized hierarchical M-PAM (pulse amplitude modulation) constellations over additive white Gaussian noise (AWGN) and fading channels and shows how these expressions can be extended to generalized hierarchical Hierarchical M-QAM constellation (square and rectangular).
Abstract: Hierarchical constellations offer a different degree of protection to the transmitted messages according to their relative importance. As such, they find interesting application in digital video broadcasting systems as well as wireless multimedia services. Although a great deal of attention has been devoted in the literature to the study of the bit error rate (BER) performance of uniform quadrature amplitude modulation (QAM) constellations, very few results were published on the BER performance of hierarchical QAM constellations. We obtain exact and generic expressions in M for the BER of the generalized hierarchical M-PAM (pulse amplitude modulation) constellations over additive white Gaussian noise (AWGN) and fading channels. We also show how these expressions can be extended to generalized hierarchical M-QAM constellations (square and rectangular). For the AWGN case, these expressions are in the form of a weighted sum of complementary error functions and are solely dependent on the constellation size M, the carrier-to-noise ratio, and a constellation parameter which controls the relative message importance. Because of their generic nature, these new expressions readily allow numerical evaluation for various cases of practical interest.

215 citations


Journal ArticleDOI
TL;DR: This letter presents a new method for the evaluation of the bit error probability of a time hopping binary pulse position ultra-wideband modulation scheme, in the presence of multiuser interference, and a comparison with the Gaussian approximation is presented.
Abstract: This letter presents a new method for the evaluation of the bit error probability of a time hopping binary pulse position ultra-wideband modulation scheme, in the presence of multiuser interference. The technique permits to predict the system performance with high accuracy and reasonable complexity. A perfect agreement with simulation results is shown, and a comparison with the Gaussian approximation is presented.

201 citations


Journal ArticleDOI
TL;DR: Performance evaluations indicate that the signal-to-noise ratio (SNR) gain of the ZP and CP minimum BER precoders over conventional water-filling DMT, MMSE, and orthogonal frequency division multiplexing (OFDM) schemes can be as much as several decibels.
Abstract: We determine the linear precoder that minimizes the bit error rate (BER) at moderate-to-high signal-to-noise ratios (SNRs) for block transmission systems with zero-forcing (ZF) equalization and threshold detection The design is developed for the two standard schemes for eliminating inter-block interference, viz, zero padding (ZP) and cyclic prefix (CP) We show that both the ZP minimum BER precoder and the CP minimum BER precoder provide substantially lower error rates than standard block transmission schemes, such as orthogonal frequency division multiplexing (OFDM) The corresponding SNR gains can be on the order of several decibels We also show that the CP minimum BER precoder can be obtained by a two-stage modification of the water-filling discrete multitone modulation (DMT) scheme in which the diagonal water-filling power loading is replaced by a full matrix consisting of a diagonal minimum mean square error power loading matrix post multiplied by a discrete Fourier transform (DFT) matrix

200 citations


Journal ArticleDOI
TL;DR: In this paper, a 10-Gb/s phase-locked clock and data recovery circuit incorporating a multiphase LC oscillator and a half-rate phase/frequency detector with automatic data retiming is presented.
Abstract: A 10-Gb/s phase-locked clock and data recovery circuit incorporates a multiphase LC oscillator and a half-rate phase/frequency detector with automatic data retiming. Fabricated in 0.18-/spl mu/m CMOS technology in an area of 1.75/spl times/1.55 mm/sup 2/, the circuit exhibits a capture range of 1.43 GHz, an rms jitter of 0.8 ps, a peak-to-peak jitter of 9.9 ps, and a bit error rate of 10/sup -9/ with a pseudorandom bit sequence of 2/sup 23/-1. The power dissipation excluding the output buffers is 91 mW from a 1.8-V supply.

Patent
21 Jan 2003
TL;DR: In this article, a serial flash integrated circuit is provided with an integrated error correction coding (ECC) system that is used with integrated volatile page memory for fast automatic data correction.
Abstract: A serial flash integrated circuit is provided with an integrated error correction coding (“ECC”) system that is used with an integrated volatile page memory for fast automatic data correction. The ECC code has the capability of correcting any one or two bit errors that might occur on a page of the flash memory array. One bit corrections are done automatically in hardware during reads or transfer to the page memory, while two-bit corrections are handled in external software, firmware or hardware. The ECC system uses a syndrome generator for generating both write and read syndromes, and an error trapper to identify the location of single bit errors using very little additional chip space. The flash memory array may be refreshed from the page memory to correct any detected errors. Data status is made available to the application prior to the data. The use of the ECC is optional.

Journal ArticleDOI
TL;DR: The BER performance of precoded OFDM systems with zero forcing and minimum mean squared error (MMSE) receivers is analyzed and it is shown that for quadrature phase shift keying (QPSK), there exists a class of optimal precoders that are channel independent.
Abstract: We consider the minimization of uncoded bit error rate (BER) for the orthogonal frequency division multiplexing (OFDM) system with an orthogonal precoder. We analyze the BER performance of precoded OFDM systems with zero forcing and minimum mean squared error (MMSE) receivers. In the case of MMSE receivers, we show that for quadrature phase shift keying (QPSK), there exists a class of optimal precoders that are channel independent. Examples of this class include the discrete Fourier transform (DFT) matrix and the Hadamard matrix. When the precoder is the DFT matrix, the resulting optimal transceiver becomes the single carrier system with cyclic prefix (SC-CP) system. We also show that the worst solution corresponds to the conventional OFDM system; the conventional OFDM system has the largest BER. In the case of zero forcing receivers, the design of optimal transceiver depends on the signal-to-noise ratio (SNR). For higher SNR, solutions of optimal precoders are the same as those of MMSE receivers.

Journal ArticleDOI
TL;DR: The bit error rate of the Alamouti scheme with transmit antenna selection in flat Rayleigh fading channels is presented and performance analysis reveals that this scheme achieves a full diversity order, as if all the transmit antennas were used.
Abstract: The bit error rate of the Alamouti scheme with transmit antenna selection in flat Rayleigh fading channels is presented. Performance analysis reveals that this scheme achieves a full diversity order, as if all the transmit antennas were used. This scheme has a fixed low decoding complexity and provides a systematic method to construct full-rate space-time block codes with a full diversity order.

Patent
14 Feb 2003
TL;DR: In this article, a multi-rate adaptive coder that is capable of transmitting a continuous voice stream transmission at a source code bit rate and a channel code bit level is described.
Abstract: A coding system and method for a terminal including a multi-rate codec is disclosed. The terminal includes a multi-rate adaptive coder that is capable of transmitting a continuous voice stream transmission at a source code bit rate and a channel code bit rate. A quality of service probing module probes an end-to-end network path of the continuous voice stream transmission to obtain at least one quality of service parameter. A quality of service management module determines at least one constraint associated with the continuous voice stream transmission. An adaptive bit rate algorithm module dynamically adjusts the source code bit rate and the channel code bit rate as a function of the quality of service parameter and the constraint to obtain a maximum value of perceived user performance during the continuous voice stream transmission.

Journal ArticleDOI
TL;DR: This paper analyzes the data suppression characteristic of the SOA using a large signal model and estimates the bit error rate degradation in the presence of an unsuppressed downstream bit pattern in an upstream signal.
Abstract: This paper describes a method for realizing the efficient utilization of wavelength resources in wavelength-division multiplexing networks with centralized light sources. Using a deeply saturated semiconductor optical amplifier (SOA) modulator located in a remote node (RN), we erase the data on a downstream signal with a low extinction ratio and modulate it with new data to generate an upstream signal. Thus, we use only one wavelength for bidirectional transmission between a center node and an RN, without placing lasers at the RN. In this paper, we analyze the data suppression characteristic of the SOA using a large signal model. We also estimate the bit error rate degradation in the presence of an unsuppressed downstream bit pattern in an upstream signal. We then report experimental results that confirm the basic characteristics of the wavelength channel data rewriter, which we constructed using a linear amplifier and an SOA. Finally, we provide the results of a data transmission experiment that we undertook using the data rewriter.

Journal ArticleDOI
TL;DR: Simulation is used to show that the bit error rate (BER) for CCSK can be closely estimated by using existing equations that apply to M-ary orthogonal signaling (MOS) and it is shown that significantly fewer computations are required for C CSK than for MOS when the number of bits per symbol is the same.
Abstract: A low probability of intercept (LPI), or low probability of detection (LPD) communication technique known as cyclic code shift keying (CCSK) is described. We discuss the basic concepts of CCSK and describe a system based on the use of random or pseudorandom codes for biphase modulation. We use simulation to show that the bit error rate (BER) for CCSK can be closely estimated by using existing equations that apply to M-ary orthogonal signaling (MOS). Also, we show that significantly fewer computations are required for CCSK than for MOS when the number of bits per symbol is the same. We show that using biphase modulation results in waveforms that have a large time-bandwidth product and very low input signal-to-noise ratio (SNR) and thus inherently have an LPI by a radiometer. We evaluate detection by a radiometer and show that LPI can be achieved by using codes of lengths greater than about 2/sup 12/ (i.e., by transmitting more than about 12 bits per symbol). Results illustrate the effect that the CCSK symbol length and error probability, and the radiometer integration time and probability of false alarm (PFA), have on detection by a radiometer. We describe a variation of CCSK called truncated CCSK (TCCSK). In this system, the code of length 2/sup k/ is cyclically shifted, then truncated and transmitted. Although shortened, the truncated code still represents k bits of information, thus leading to an increased data rate. We evaluate radiometer detection of TCCSK and it is shown that the probability of detection is increased compared with the detection of CCSK.

Journal ArticleDOI
TL;DR: A systematic maximum-likelihood approach to the decoding of OSTBC for unknown propagation channels and unknown noise and interference conditions is taken and a low-complexity ML decoding algorithm based on cyclic minimization and assisted by a minimum amount of training data is derived.
Abstract: Space-time coding (STC) schemes for communication systems employing multiple transmit and receive antennas have been attracting increased attention. The so-called orthogonal space-time block codes (OSTBCs) have been of particular interest due to their good performance and low decoding complexity. In this paper, we take a systematic maximum-likelihood (ML) approach to the decoding of OSTBC for unknown propagation channels and unknown noise and interference conditions. We derive a low-complexity ML decoding algorithm based on cyclic minimization and assisted by a minimum amount of training data. Furthermore, we discuss the design of optimal training sequences and optimal information transfer to an outer decoder. Numerical examples demonstrate the performance of our algorithm.

Journal ArticleDOI
TL;DR: The Bennett 1992 protocol is proved unconditional, by using a reduction to an entanglement distillation protocol initiated by a local filtering process, and the bit errors and the phase errors are correlated after the filtering.
Abstract: We prove the unconditional security of the Bennett 1992 protocol, by using a reduction to an entanglement distillation protocol initiated by a local filtering process. The bit errors and the phase errors are correlated after the filtering, and we can bound the amount of phase errors from the observed bit errors by an estimation method involving nonorthogonal measurements. The angle between the two states shows a trade-off between accuracy of the estimation and robustness to noises.

Journal ArticleDOI
TL;DR: Adaptive modulation constitutes a lower complexity alternative to multiple-transmitter and receiver-based systems when considering the range of techniques that can be used for mitigating the effects of the channel-quality fluctuations imposed by wireless channels.
Abstract: A set of optimum mode-switching levels is derived for a generic constant-power adaptive-modulation scheme based on a closed-form expression of the average bit error ratio (BER) and the average bits-per-symbol (BPS) throughput of the adaptive-modulation scheme. This results in a constant BER, variable-throughput arrangement. The corresponding BPS throughput performance and the achievable signal-to-noise ratio (SNR) gain are investigated for the optimum mode-switching assisted constant-power adaptive-modulation schemes employing various diversity schemes, including maximal ratio combining (MRC) receive-antenna diversity, a two-dimensional RAKE receiver, as well as transmit-diversity aided space-time (ST) coding, when communicating over various fading scenarios. The BPS throughput of our constant-power adaptive quadrature amplitude modulation (AQAM) scheme approaches the throughput of variable-power variable-rate AQAM within 1 dB. However, the achievable throughput gain of the adaptive-modulation scheme, in comparison to conventional fixed-mode modems, is substantially reduced as the diversity order of the receiver is increased. Hence, adaptive modulation constitutes a lower complexity alternative to multiple-transmitter and receiver-based systems when considering the range of techniques that can be used for mitigating the effects of the channel-quality fluctuations imposed by wireless channels.

Patent
24 Jan 2003
TL;DR: In this paper, spread spectrum receiver architectures and methods are described for reducing interference, particularly the interference observed at a user-end terminal in a WCDMA 3G mobile communications system.
Abstract: Spread spectrum receiver architectures and methods are described for reducing interference, particularly the interference observed at a user-end terminal in a W-CDMA 3G mobile communications system. Interpath interference which arises due to non-zero cross and auto correlation of more than one spreading code is suppressed by estimating a transmitted signal stream, or a plurality of such signal streams in the case of a plurality of multipath components, respreading this estimated signal and subtracting non-orthogonal interference contributions from a received signal. The techniques provide an improved bit error rate or equivalently, enhanced capacity for a digital mobile communications network.

Journal ArticleDOI
TL;DR: In this article, the temporal resolution of a time-reversal or passive-phase conjugation process as applied to underwater acoustic communications is studied. And the effect of temporal focusing as measured by the peak-to-sidelobe ratio of the back-propagated or phase-conjugated pulse (both pulse elongation and sidelobe leakages are causes of intersymbol interference and bit errors for communications).
Abstract: In this paper, we study the temporal resolution of a time-reversal or passive-phase conjugation process as applied to underwater acoustic communications. Specifically, we address 1) the time resolution or the pulse width of a back-propagated time-compressed pulse as compared with the original transmitted pulse; 2) the effectiveness of temporal focusing as measured by the peak-to-sidelobe ratio of the back-propagated or phase-conjugated pulse (both pulse elongation and sidelobe leakages are causes of intersymbol interference and bit errors for communications); 3) the duration of temporal focusing or the temporal coherence time of the underwater acoustic channel; and 4) the stability of temporal focusing as measured by the phase fluctuations of successive pulses (symbols). Binary phase-shift keying signals collected at sea from a fixed source to a fixed receiver are used to extract the above four parameters and are compared with simulated results. Mid-frequency (3-4-kHz) data were collected in a dynamic shallow-water environment, exhibiting high temporal fluctuations over a scale of minutes. Despite this, the channel is found to be highly coherent over a length of 17 s. As a result, only one probe signal is used for 17 s of data. The bit error rate and variance of the symbol phase fluctuations are measured as a function of the number of receivers. They are of the same order as that calculated from the simulated data. The agreement suggests that these two quantities could be modeled for a communication channel with high coherence time. The phase variance can be used to determine the maximum data rate for a phase-shift keying signal for a given signal bandwidth and a given number of receivers.

Journal ArticleDOI
TL;DR: This work addresses the problem of finding the signal sets that are the most suitable for designing power-efficient BICM schemes over an additive white Gaussian noise (AWGN) channel, and shows that the most attractive signal sets are those for which Gray mapping is possible, provided that their symbol error rate performance is "sufficiently close" to the optimum.
Abstract: Bit-interleaved coded modulation (BICM) is a bandwidth-efficient coding technique consisting of serial concatenation of binary error-correcting coding, bit-by-bit interleaving, and high-order modulation. BICM is capable of achieving excellent error performance provided that powerful codes, such as for example turbo codes or low-density parity-check (LDPC) codes, are employed. We address the problem of finding the signal sets that are the most suitable ones for designing power-efficient BICM schemes over an additive white Gaussian noise (AWGN) channel. To this end, we exploit the expression of the BICM capacity limit, and evaluate it for several 8- and 16-ary constellations. The bit-error rate (BER) performance of some BICM schemes made up of turbo codes and various signal sets is also investigated by computer simulations so as to illustrate the theoretical results. We show that, for spectral efficiencies of practical interest, the most attractive signal sets are those for which Gray mapping is possible, provided that their symbol error rate performance is "sufficiently close" to the optimum. This explains why some constellations having a simple structure, such as 8-PSK and 16-QAM, perform very well when combined with a powerful code. At the same time, the constellations displaying optimal error performance without coding are, generally, not of interest for BICM.

Journal ArticleDOI
TL;DR: A comparative investigation on various channel estimation algorithms for OFDM system in the mobile communication environment is presented and analyzed in terms of computational complexity, mean square error, and bit error rate and Wiener filter estimation shows the best error performance.
Abstract: A comparative investigation on various channel estimation algorithms for OFDM system in the mobile communication environment is presented and analyzed in terms of computational complexity, mean square error, and bit error rate in this paper. As a result, Wiener filter estimation shows the best error performance. Concerning the computational complexity as well as the performance, however, the piecewise linear estimator is considered as a proper choice when the reference signal spacing is relatively narrow. And the cubic-spline estimator is a good alternative to the Wiener filter estimation if the reference signal spacing is wider than the coherent bandwidth of transmission channel.

Journal ArticleDOI
TL;DR: A parametric methodology for rate allocation in progressive source-channel coding is developed, an empirical model of decoded bit-error rate as a function of the channel code rate is investigated.
Abstract: Progressive image transmission is difficult in the presence of a noisy channel, mainly due to the propagation of errors during the decoding of a progressive bitstream. Excellent results for this problem are made possible through combined source-channel coding, a method that matches the channel code to the source operational rate distortion as well as channel conditions. This paper focuses on the key component of combined source-channel coding: rate allocation. We develop a parametric methodology for rate allocation in progressive source-channel coding. The key to this technique is an empirical model of decoded bit-error rate as a function of the channel code rate. We investigate several scenarios. In the case of the memoryless channel, we present closed-form expressions. For the fading channel and channels with feedback, where closed-form results are elusive, our analysis leads to low-complexity algorithms. The results presented are applicable to any progressive source code, and any family of channel codes.

Journal ArticleDOI
TL;DR: In this article, the adaptive minimum bit error rate (BER) decision feedback multiuser receivers for DS-CDMA systems in fast frequency selective Rayleigh fading channels were investigated.
Abstract: In this letter we investigate adaptive minimum bit error rate (BER) decision feedback multiuser receivers for DS-CDMA systems in fast frequency selective Rayleigh fading channels. We examine stochastic gradient adaptive algorithms and introduce fast algorithms for minimizing the BER cost function from training data.

Proceedings ArticleDOI
11 May 2003
TL;DR: This paper designs adaptive modulation schemes for multi-antenna transmission based on partial CSI, that models the spatial fading channels as Gaussian random variables with non-zero mean and white covariance, conditioned on feedback information.
Abstract: Adaptive modulation has the potential to increase the system throughput significantly by matching transmitter parameters to time-varying channel conditions. However, adaptive modulation assuming perfect channel state information (CSI) is sensitive to CSI imperfections induced by estimation errors and feedback delays. In this paper, we design adaptive modulation schemes for multi-antenna transmission based on partial CSI, that models the spatial fading channels as Gaussian random variables with non-zero mean and white covariance, conditioned on feedback information. Based on a two-directional beamformer, our proposed transmitter optimally adapts the beam directions, the power allocation between two beams, and the signal constellation, to maximize the transmission rate while maintaining a target bit error rate (BER). Numerical results demonstrate the rate improvement, and illustrate an interesting tradeoff that emerges between feedback quality and hardware complexity.

Patent
Paul R. Gentieu1, Chris Cicchetti1, Arthur Michael Lawson1, An Huynh1, Harold Yang1 
24 Apr 2003
TL;DR: In this paper, a bit error rate tester (100) is proposed for high speed networks, which includes a sequence generator (302), memory (112), synchronizer (322), sequence start detect module (326), and comparator (338).
Abstract: A bit error rate tester (100) for use in connection with a high speed networks. The bit error rate tester (100) includes transmit and receive ports (102, 104, 106 and 108), as well as a sequence generator (302), memory (112), synchronizer (322), sequence start detect module (326), and comparator (338). The sequence generator (302) generates a bit sequence for transmission through a network path. The bit sequence returns to the bit error rate tester (100) by way of the receive port (102, 104, 106 or 108). The synchronizer (322) then bit-aligns the received bit sequence to compensate for idles/fill words added/dropped as the bit sequence transited the network. The synchronized bit sequence is passed to the start word detector (326) which detects start and end words in the bit sequence and instructs the comparator (338) to compare only data between the start and end words. The comparator (338) compares the received bit sequence with a copy of the transmitted bit sequence regenerated from the memory (112), and calculates a bit error rate.

Journal ArticleDOI
TL;DR: Based on this new model, the bit error rate performance of an orthogonal frequency-division multiplexing system with receive diversity over correlated Nakagami-m fading channels is analytically evaluated and some numerical results are given.
Abstract: Nakagami-m fading modeling in the frequency domain is investigated. For frequency-selective Nakagami-m fading channels, we show the magnitudes of the channel frequency responses to be also Nakagami-m distributed random variables with fading and mean power parameters as explicit functions of the fading and mean power parameters of the channel impulse responses. Based on this new model, the bit error rate performance of an orthogonal frequency-division multiplexing system with receive diversity over correlated Nakagami-m fading channels is analytically evaluated and some numerical results are given.

Proceedings ArticleDOI
01 Dec 2003
TL;DR: The proposed algorithm, based on the water-filling approach, is appropriate for OFDM systems in a time varying wireless channel for its low computational complexity and good performance.
Abstract: In this paper, we propose a computationally efficient algorithm for transmit power and bit allocations in wireless OFDM systems aiming at maximization of data rate under the constraint of total transmit power and bit error rate. Although the proposed algorithm is based on the water-filling approach, the computational complexity is only O(k/spl times/M), where k denotes the number of iterations required to meet the constraints and M is the number of subchannels. By computer simulations, we verify that 10 iterations are sufficient to satisfy the constraints, and the decrease of data rate for the proposed algorithm is shown to be less than one percent relative to the optimal method at the average SNR above 4 dB. The proposed algorithm is appropriate for OFDM systems in a time varying wireless channel for its low computational complexity and good performance.