New simple encoder and trellis decoder for Golay codes

New simple encoding and trellis decoding techniques for Golay codes, based on generalised array codes (GAGs) are proposed. The techniques allow the design of both (23,12,7) Golay and (24,12,8) extended Golay codes with minimal trellises. It is shown that these trellises differ only in the last trellis depth with different labelling digits.<>     

Relation between bit and symbol error probabilities for FSK withLDI detection

In M-ary, Gray coded digital communication the bit error probability is usually approximated by the symbol error probability divided by the number of bits in a symbol. This approximation is known to be excellent for phase shift keying with coherent detection at high-signal-to-noise ratios and Gaussian channel. Here it is illustrated that this approximation may also be good for M-ary frequency shift keying with limiter-discriminator-integrator detection on Gaussian, Rayleigh, and Rician channels     

Subspace-based approach for DOA estimation using pilot symbol channel identification

In the paper, antenna processing is applied in the radio localisation frame. For a source of interest, the multipath directions of arrival (DOA) are estimated and the shortest/direct propagation path is identified. First, an unstructured estimate of the sampled channel impulse response is derived by use of pilot symbols. The channel response samples are then separately processed to recover the DOA of the relative paths. For stationary channels, it is suggested that smoothing be used in the case of a uniform and linear antenna array (ULA) to recover the source subspace. For fast fading channels, which is typically the case for high speed mobiles, it is shown that using a MUSIC like algorithm allows source subspace recovery by exploiting the gain diversity over a reduced number of slots with unchanged DOA and time delays. Separate processing of channel response samples reduces the constraint on antenna array size and allows comparison of the path lengths.     

Relation between bit and symbol error probabilities for frequencyshift keying with limiter-discriminator detection

In M-ary, Gray coded frequency shift keying with limiter discriminator detection the bit error probability is usually approximated by the symbol error probability divided by the number of bits in a symbol. This approximation is known to be excellent for phase shift keying with large energy-to-noise ratios and Gaussian channel. In other cases this may be questionable. The authors compute the exact values of bit error probability as a function of energy-to-noise-ratio per bit for Gaussian, Rayleigh and Rician channels. They also compute the relative error involved in this approximation     

Fast motion estimation using reliability weighted robust search

The displaced frame difference (DFD) is the most commonly used search criterion in motion estimation optimisation methods. Using a simple reliability function it is possible to speed up scale estimation required when using robust influence functions and it is shown that the search also experiences speed gains     

Relation between bit and symbol error probabilities for DPSK andFSK with differential phase detection

In M-ary, Gray coded DPSK, and FSK with differential phase detection the bit error probability is usually approximated by the symbol error probability divided by the number of bits in a symbol. This approximation is known to be excellent for PSK with large signal-to-noise ratios in a Gaussian channel. In other cases this approximation may be questionable. Here we compute the exact values of bit error probability for DPSK and FSK in Gaussian, Rayleigh, and Rician channels. We also compute the relative error involved in this approximation. The conclusion is that except for very low values of signal-to-noise ratio the approximation is good for all channels     

Asymptotic equivalence between the unconditional maximum likelihood and the square-law nonlinearity symbol timing estimation

This paper provides a systematic approach to the problem of nondata aided symbol-timing estimation for linear modulations. The study is performed under the unconditional maximum likelihood framework where the carrier-frequency error is included as a nuisance parameter in the mathematical derivation. The second-order moments of the received signal are found to be the sufficient statistics for the problem at hand and they allow the provision of a robust performance in the presence of a carrier-frequency error uncertainty. We particularly focus on the exploitation of the cyclostationary property of linear modulations. This enables us to derive simple and closed-form symbol-timing estimators which are found to be based on the well-known square timing recovery method by Oerder and Meyr. Finally, we generalize the OM method to the case of linear modulations with offset formats. In this case, the square-law nonlinearity is found to provide not only the symbol-timing but also the carrier-phase error.     

Joint channel and symbol estimation by oblique projections

The problem of simultaneous blind channel and symbol estimation of a single-input multiple-output (SIMO) communication channel is considered. It is shown that the outer product of the channel vector and the channel input sequence can be obtained by a linear estimator that has the finite sample convergence property. Furthermore, this estimator can be obtained by the use of oblique projections. An order detection algorithm that avoids the use of subjective thresholding is also proposed. Applications to multiuser detection are also considered     

System reliability estimation using simulation combined with network reductions

This paper proposes a dynamic Monte Carlo sampling method, called the conditional minimal cut set (COMICS) algorithm, where all arcs are not simulated at each trial and all minimal cut sets need not be given in advance. The proposed algorithm repeats simulating a minimal cut set composed of the arcs which originate from the (new) source node and reducing the network on the basis of the states of simulated arcs until the s-t connectedness is confirmed. We develop the importance sampling estimator, the total hazard estimator and the hazard importance sampling estimator which are all based on the proposed algorithm, and compare the performance of these simulation estimators. It is found that these estimators can significantly reduce the variance of the raw simulation estimator and the usual importance sampling estimator.     

Bounds on bearing and symbol estimation with side information

We develop Cramer-Rao bounds (CRBs) for bearing, symbol, and channel estimation of communications signals in flat-fading channels. We do this using the constrained CRB formulation of German and Hero (1990), and Stoica and Ng (see IEEE Signal Processing Lett., vol.5, p.177-79, 1998), with the unknown parameters treated as deterministic constants. The equality constraints may be combined arbitrarily, e.g., we may develop CRBs for bearing estimation of constant modulus (CM) signals where a subset of the symbols are known (semi-blind, CM case). The results establish the value of side information in a large variety of communications scenarios. We focus on the CM and semi-blind properties and develop closed-form CRBs for these cases. Examples are presented indicating the relative value of the training and CIM property. These show the significant amount of signal processing information provided under these two conditions. In addition, we consider the performance of the maximum-likelihood beamformer for the semi-blind case, assuming the bearings are known. This semi-blind beamformer achieves the appropriate (constrained) CRB with finite data at finite SNR. Analysis also reveals that in a semi-blind scenario with two closely spaced sources, ten or more training symbols are sufficient to achieve the asymptotic training regime. Together with previous results on angle estimation for known sources, these results indicate that relatively few training samples enable both angle estimation and closely spaced co-channel source separation that approaches the CRB with finite data and finite SNR     

An alternative degradation reliability modeling approach using maximum likelihood estimation

An alternative degradation reliability modeling approach is presented in this paper. This approach extends the graphical approach used by several authors by considering the natural ordering of performance degradation data using a truncated Weibull distribution. Maximum Likelihood Estimation is used to provide a one-step method to estimate the model's parameters. A closed form expression of the likelihood function is derived for a two-parameter truncated Weibull distribution with time-independent shape parameter. A semi-numerical method is presented for the truncated Weibull distribution with a time-dependent shape parameter. Numerical studies of generated data suggest that the proposed approach provides reasonable estimates even for small sample sizes. The analysis of fatigue data shows that the proposed approach yields a good match of the crack length mean value curve obtained using the path curve approach and better results than those obtained using the graphical approach.     

Adaptive symbol and parameter estimation in asynchronous multiuserCDMA detectors

Existing multiuser code-division multiple-access (CDMA) detectors either have to rely on strict power control or near-perfect parameter estimation for reliable operation. A novel adaptive multiuser CDMA detector structure is introduced. Using either an extended Kalman filter (EKF) or a recursive least squares (RLS) formulation, adaptive algorithms which jointly estimate the transmitted bits of each user and individual amplitudes and time delays may be derived. The proposed detectors work in a tracking mode after initial delay acquisition is accomplished using other techniques not discussed here. Through computer simulations, we show that the algorithms perform better than a bank of single-user (SU) receivers in terms of near-far resistance. Practical issues such as the selection of adaptation parameters are also discussed     

可靠性评估中利用先验信息的一种新思路

Bayes分析的一般程序是先验分布 数据=后验分布.提出一种新的Bayes分析程序:先基于数据诱导出参数的置信分布,而将参数的原先验分布等效成某种类型数据;然后将置信分布作为参数的"先验分布",而将先验信息的等效数据作为"试验数据";最后采用通常的Bayes方法进行可靠性评估.该新思路主要用于多参数寿命分布的可靠性评估.它克服了多参数模型下确定先验分布的困难及计算上的困难.仿真结果表明该方法具有较高的精度,且计算简单,可以应用于实际.     

Uncoded symbol error rate estimation: methods and analysis

In wireless communications systems, channel quality estimates are often used to provide a measure of the quality of service or to enable resource allocation techniques that improve system capacity and/or user quality. The uncoded bit or symbol error rate (SER) is specified as a channel quality metric in second and third generation cellular systems (e.g., general packet radio service (GPRS), enhanced general packet radio service (EGPRS), and universal mobile telecommunications system (UMTS). Nonetheless, techniques to estimate the uncoded SER are typically outside the scope of these wireless standards and are not specified. In this paper, we analyze the performance of a number of uncoded SER estimation techniques, including a novel technique in which we use the soft information of the received symbols to obtain a fast and accurate estimate of the uncoded SER. The technique we introduce has been found to outperform, in terms of accuracy and required estimation interval, conventional hard-decision based techniques that use test-patterns, or use a decode/re-encode/compare approach . Our technique also outperforms the brute-force technique, which is to send a known test-pattern, demodulate it at the receiver, and count the observed discrepancies.     

Efficient maximum likelihood decoding of linear block codes using a trellis

It is shown that soft decision maximum likelihood decoding of any(n,k)linear block code overGF(q)can be accomplished using the Viterbi algorithm applied to a trellis with no more thanq^{(n-k)}states. For cyclic codes, the trellis is periodic. When this technique is applied to the decoding of product codes, the number of states in the trellis can be much fewer thanq^{n-k}. For a binary(n,n - 1)single parity check code, the Viterbi algorithm is equivalent to the Wagner decoding algorithm.     

MAP symbol estimation on frequency-flat Rayleigh fading channelsvia a Bayesian EM algorithm

In this paper, an expectation-maximization (EM) technique for maximum a posteriori estimation is employed to devise novel soft-in soft-out algorithms for symbol detection over frequency-flat Rayleigh fading channels. An application of these algorithms to iterative decoding of coded PSK signals is proposed and some performance results are illustrated     

Robust decoding of variable-length encoded Markov sources using a three-dimensional trellis

In this letter, we present an improved index-based a-posteriori probability (APP) decoding approach for the error-resilient transmission of packetized variable-length encoded Markov sources. The proposed algorithm is based on a novel two-dimensional (2D) state representation which leads to a three-dimensional trellis with unique state transitions. APP decoding on this trellis is realized by employing a 2D version of the BCJR algorithm where all available source statistics can be fully exploited in the source decoder. For an additional use of channel codes the proposed approach leads to an increased error-correction performance compared to a one-dimensional state representation.     

相位编码信号码元宽度估计的修正克拉美—罗限

推导了相位编码信号码元宽度估计的修正克拉美-罗限(MCRB).采用Parseval定理将单位冲激函数δ(t)平方的积分转换到频域计算,得到脉冲成形函数是矩形脉冲时码元宽度估计的修正克拉美-罗限.当脉冲成形函数是升余弦脉冲时则进行了数值计算.计算表明,当滚降系数为0.5时,升余弦脉冲和矩形脉冲对应的码元宽度估计性能相差1dB左右.     

Joint symbol detection and channel parameter estimation inasynchronous DS-CDMA systems

A method for jointly estimating the time delay and complex gain parameters, as well as detecting the transmitted symbols in an asynchronous multipath DS-CDMA system, is presented. A short training sequence is used to obtain a coarse estimate of the channel parameters, which is consequently used to detect the symbols. By exploiting structure in the digitally modulated signals, the method iterates to (i) improve the estimate of the channel parameters and (ii) reduce the probability of incorrect detection. The method's efficacy is demonstrated by numerical simulations     

Joint symbol timing and channel estimation for OFDM based WLANs

The orthogonal frequency-division multiplexing access technique has been attracting considerable interest especially for wireless local area networks (WLANs). We consider the joint estimation of the symbol timing, the channel length and the channel-impulse response. A novel estimation algorithm based on maximum-likelihood principles and the generalized Akaike information criterion are proposed. We provide simulation results to illustrate the performance of our proposed algorithm