Bit-Error-Rate-Minimizing Channel Shortening Using Post-FEQ Diversity Combining and a Genetic Algorithm

In advanced wireline or wireless communication systems, i.e., DSL, IEEE 802.11a/g, HIPERLAN/2, etc., a cyclic prefix which is proportional to the channel impulse response is needed to append a multicarrier modulation (MCM) frame for operating the MCM accurately. This prefix is used to combat inter symbol interference (ISI). In some cases, the channel impulse response can be longer than the cyclic prefix (CP). One of the most useful techniques to mitigate this problem is reuse of a Channel Shortening Equalizer (CSE) as a linear preprocessor before the MCM receiver in order to shorten the effective channel length. Channel shortening filter design is a widely examined topic in the literature. Most channel shortening equalizer proposals depend on perfect channel state information (CSI). However, this information may not be available in all situations. In cases where channel state information is not needed, blind adaptive equalization techniques are appropriate. In wireline communication systems (such as DMT), the CSE design is based on maximizing the bit rate, but in wireless systems (OFDM), there is a fixed bit loading algorithm, and the performance metric is Bit Error Rate (BER) minimization. In this work, a CSE is developed for multicarrier and single-carrier cyclic prefixed (SCCP) systems which attempts to minimize the BER. To minimize the BER, a Genetic Algorithm (GA), which is an optimization method based on the principles of natural selection and genetics, is used. If the CSI is shorter than the CP, the equalization can be done by a frequency domain equalizer (FEQ), which is a bank of complex scalars. However, in the literature the adaptive FEQ design has not been well examined. The second phase of this thesis focuses on different types of algorithms for adapting the FEQ and modifying the FEQ architecture to obtain a lower BER. Simulation results show that this modified architecture yields a 20 dB improvement in BER

Space-time processing for wireless mobile communications

Intersymbol interference (ISI) and co-channel interference (CCI) are two major obstacles to high speed data transmission in wireless cellular communications systems. Unlike thermal noise, their effects cannot be removed by increasing the signal power and are time-varying due to the relative motion between the transmitters and receivers. Space-time processing offers a signal processing framework to optimally integrate the spatial and temporal properties of the signal for maximal signal reception and at the same time, mitigate the ISI and CCI impairments. In this thesis, we focus on the development of this emerging technology to combat the undesirable effects of ISI and CCL We first develop a convenient mathematical model to parameterize the space-time multipath channel based on signal path power, directions and times of arrival. Starting from the continuous time-domain, we derive compact expressions of the vector space-time channel model that lead to the notion of block space-time manifold, Under certain identifiability conditions, the noiseless vector-channel outputs will lie on a subspace constructed from a set. of basis belonging to the block space-time manifold. This is an important observation as many high resolution array processing algorithms Can be applied directly to estimate the multi path channel parameters. Next we focus on the development of semi-blind channel identification and equalization algorithms for fast time-varying multi path channels. Specifically. we develop space-time processing algorithms for wireless TDMA networks that use short burst data formats with extremely short training data. sequences. Due to the latter, the estimated channel parameters are extremely unreliable for equalization with conventional adaptive methods. We approach the channel acquisition, tracking and equalization problems jointly, and exploit the richness of the inherent structural relationship between the channel parameters and the data sequence by repeated use of available data through a forward- backward optimization procedure. This enables the fuller exploitation of the available data. Our simulation studies show that significant performance gains are achieved over conventional methods. In the final part of this thesis, we address the problem identifying and equalizing multi path communication channels in the presence of strong CCl. By considering CCI as stochasic processes, we find that temporal diversity can be gained by observing the channel outputs from a tapped delay line. Together with the assertion that the finite alphabet property of the information sequences can offer additional information about the channel parameters and the noise-plus-covariance matrix, we develop a spatial temporal algorithm, iterative reweighting alternating minimization, to estimate the channel parameters and information sequence in a weighted least squares framework. The proposed algorithm is robust as it does not require knowledge of the number of CCI nor their structural information. Simulation studies demonstrate its efficacy over many reported methods

FPGA-based DOCSIS upstream demodulation

In recent years, the state-of-the-art in field programmable gate array (FPGA) technology has been advancing rapidly. Consequently, the use of FPGAs is being considered in many applications which have traditionally relied upon application-specific integrated circuits (ASICs). FPGA-based designs have a number of advantages over ASIC-based designs, including lower up-front engineering design costs, shorter time-to-market, and the ability to reconfigure devices in the field. However, ASICs have a major advantage in terms of computational resources. As a result, expensive high performance ASIC algorithms must be redesigned to fit the limited resources available in an FPGA. Concurrently, coaxial cable television and internet networks have been undergoing significant upgrades that have largely been driven by a sharp increase in the use of interactive applications. This has intensified demand for the so-called upstream channels, which allow customers to transmit data into the network. The format and protocol of the upstream channels are defined by a set of standards, known as DOCSIS 3.0, which govern the flow of data through the network. Critical to DOCSIS 3.0 compliance is the upstream demodulator, which is responsible for the physical layer reception from all customers. Although upstream demodulators have typically been implemented as ASICs, the design of an FPGA-based upstream demodulator is an intriguing possibility, as FPGA-based demodulators could potentially be upgraded in the field to support future DOCSIS standards. Furthermore, the lower non-recurring engineering costs associated with FPGA-based designs could provide an opportunity for smaller companies to compete in this market. The upstream demodulator must contain complicated synchronization circuitry to detect, measure, and correct for channel distortions. Unfortunately, many of the synchronization algorithms described in the open literature are not suitable for either upstream cable channels or FPGA implementation. In this thesis, computationally inexpensive and robust synchronization algorithms are explored. In particular, algorithms for frequency recovery and equalization are developed. The many data-aided feedforward frequency offset estimators analyzed in the literature have not considered intersymbol interference (ISI) caused by micro-reflections in the channel. It is shown in this thesis that many prominent frequency offset estimation algorithms become biased in the presence of ISI. A novel high-performance frequency offset estimator which is suitable for implementation in an FPGA is derived from first principles. Additionally, a rule is developed for predicting whether a frequency offset estimator will become biased in the presence of ISI. This rule is used to establish a channel excitation sequence which ensures the proposed frequency offset estimator is unbiased. Adaptive equalizers that compensate for the ISI take a relatively long time to converge, necessitating a lengthy training sequence. The convergence time is reduced using a two step technique to seed the equalizer. First, the ISI equivalent model of the channel is estimated in response to a specific short excitation sequence. Then, the estimated channel response is inverted with a novel algorithm to initialize the equalizer. It is shown that the proposed technique, while inexpensive to implement in an FPGA, can decrease the length of the required equalizer training sequence by up to 70 symbols. It is shown that a preamble segment consisting of repeated 11-symbol Barker sequences which is well-suited to timing recovery can also be used effectively for frequency recovery and channel estimation. By performing these three functions sequentially using a single set of preamble symbols, the overall length of the preamble may be further reduced

Constant False Alarm Rate (CFAR) detection based estimators with applications to sparse wireless channels

Thesis (Master)--Izmir Institute of Technology, Electronics and Communication Engineering, Izmir, 2006Includes bibliographical references (leaves: 87-89)Text in English; Abstract: Turkish and Englishx, 94 leavesWe provide Constant False Alarm Rate (CFAR) based thresholding methods for training based channel impulse response (CIR) estimation algorithms for communication systems which utilize a periodically transmitted training sequence within a continuous stream of information symbols. After obtaining the CIR estimation by using known methods in the literature, there are estimation errors which causes performance loss at equalizers. The channel estimation error can be seen as .noise. on CIR estimations and CFAR based thresholding methods, which are used in radar systems to decide the presence of a target, can effectively overcome this problem. CFAR based methods are based on determining threshold values which are computed by distribution of channel noise. We provide exact and approximate distribution of channel noise appear at CIR estimate schemes. We applied Cell Averaging-CFAR (CA-CFAR) and Order Statistic-CFAR (OSCFAR) methods on the CIR estimations. The performance of the CFAR estimators are then compared by their Least Square error in the channel estimates. The Signal to Interference plus Noise Ratio (SINR) performance of the decision feedback equalizers (DFE), of which the tap values are calculated based on the CFAR estimators, are also provided