2,681 research outputs found
A mixed MAP/MLSE receiver for convolutional coded signals transmitted over a fading channel
Copyright © 2002 IEEEThis paper addresses the problem of estimating a rapidly fading convolutionally coded signal such as might be found in a wireless telephony or data network. We model both the channel gain and the convolutionally coded signal as Markov processes and, thus, the noisy received signal as a hidden Markov process (HMP). Two now-classical methods for estimating finite-state hidden Markov processes are the Viterbi (1967) algorithm and the a posteriori probability (APP) filter. A hybrid recursive estimation procedure is derived whereby one hidden process (the encoder state in our application) is estimated using a Viterbi-type (i.e., sequence based) cost and the other (the fading process) using an APP-based cost such as maximum a posteriori probability. The paper presents the new algorithm as applied specifically to this problem but also formulates the problem in a more general setting. The algorithm is derived in this general setting using reference probability methods. Using simulations, performance of the optimal scheme is compared with a number of suboptimal techniques-decision-directed Kalman and HMP predictors and Kalman filter and HMP filter per-survivor processing techniquesLangford B. White and Robert J. Elliot
Input Design for System Identification via Convex Relaxation
This paper proposes a new framework for the optimization of excitation inputs
for system identification. The optimization problem considered is to maximize a
reduced Fisher information matrix in any of the classical D-, E-, or A-optimal
senses. In contrast to the majority of published work on this topic, we
consider the problem in the time domain and subject to constraints on the
amplitude of the input signal. This optimization problem is nonconvex. The main
result of the paper is a convex relaxation that gives an upper bound accurate
to within of the true maximum. A randomized algorithm is presented for
finding a feasible solution which, in a certain sense is expected to be at
least as informative as the globally optimal input signal. In the case
of a single constraint on input power, the proposed approach recovers the true
global optimum exactly. Extensions to situations with both power and amplitude
constraints on both inputs and outputs are given. A simple simulation example
illustrates the technique.Comment: Preprint submitted for journal publication, extended version of a
paper at 2010 IEEE Conference on Decision and Contro
- …