An improved approximation for the isolated transition in saturated magnetic recording

An improved analytic approximation for the isolated transition in saturated magnetic recording is developed. This, in turn, has led to a determination of the analytic form of the magnetization pattern which appears to be a more general representation of the traditional arctangent form.     

Sequence detection and channel state estimation over finite stateMarkov channels

A useful model for general time-varying channels is a finite state Markov chain. In this paper, maximum likelihood sequence estimation (MLSE) for signals over finite state Markov channels (FSMCs) is studied. Also studied is the maximum a posteriori (MAP) channel state estimation. When coded signals with interleaving are transmitted, the channel estimates can be used to make soft-decision decoding. The error performance of the proposed sequence and channel state estimation schemes are evaluated through computer simulations. The effect of channel modeling error is also discussed     

A generalized two-threshold detection procedure

A modified sequential procedure for testing binary hypotheses with different means, proposed by C.C. Lee and J.B. Thomas (ibid., vol.IT-30, no.1, p.16-23, Jan. 1984), is generalized for application to the case of multiple hypotheses with different means/variances of the Gaussian distribution. The method constitutes a two-threshold test for fixed-size packages of samples with a sequential procedure of discarding the package for which no decision is reached and subsequently testing a new package. The objective is to find an optimum package size N₀ which leads to the minimum overall average sample number (ASN) for a given overall error probability. An optimization algorithm is developed to extend the application of the Lee-Thomas procedure to the M-ary case. Performance characteristics of the generalized two-threshold (GTT) test procedure are compared with those of conventional sequential as well as fixed-sample-size (FSS) methods. It is shown for the M-ary different means/variances cases that for low error rates the number of samples required by the GTT test is, on the average, approximately half that needed by a FSS test. However, it is somewhat more than the ASN obtained with a conventional sequential test. With decreasing error probabilities the GTT test performance approaches that of conventional sequential methods     

ML estimation of symbol timing and carrier phase for CPM in Walshsignal space

An algorithm to estimate jointly the symbol timing and carrier phase for continuous-phase modulation (CPM) is described. It is designed to optimize the steady-state performance of the CPM synchronizer and exhibits excellent performance, very close to the optimum maximum-likelihood estimate. The algorithm is simple and practical and may be employed with any CPM scheme. It is based on a signal space decomposition of the CPM signal in the Walsh signal space     

Sequential sequence estimation for multiple-channel systems withintersymbol and interchannel interference

A vector sequential sequence estimator is proposed for multiple-channel systems with both intersymbol interference (ISI) and interchannel interference (ICI). Both finite ISI-ICI and infinite ISI-ICI are considered. The estimator consists of a multiple-dimensional whitened matched filter and a vector sequential decoder. The metric of the sequential algorithm is derived, and the algorithm's performance is analyzed. Computer simulation results for a two-dimensional finite ISI-ICI channel and a two-dimensional infinite ISI-ICI channel are presented. Analysis and simulation show that the symbol error probability of the vector sequential algorithm is essentially the same as for maximum-likelihood sequence estimation using the vector Viterbi algorithm, while its average computational complexity is much less, although computation per symbol is a random variable with the Pareto distribution. There exists a signal-to-noise ratio above which the ensemble average computation is bounded. An upper bound on this ratio is found     

VLSI Structures for Viterbi Receivers: Part I--General Theory and Applications

A taxonomy of VLSI grid model layouts is presented for the implementation of certain types of digital communication receivers based on the Viterbi algorithm. We deal principally with networks of many simple processors connected to perform the Viterbi algorithm in a highly parallel way. Two interconnection patterns of interest are the "shuffleexchange" and the "cube-connected cycles." The results are generally applicable to the development of area-efficient VLSI circuits for decoding: convolutional codes, coded modulation with multilevel/phase signals, punctured convolutional codes, correlatively encoded MSK signals and for maximum likelihood sequence estimation ofM-ary signals on intersymbol interference channels. In a companion paper, we elaborate on how the concepts presented here can be applied to the problem of building encoded MSK Viterbi receivers. Lower bounds are established on the product (chip area) * (baud rate)^-2and on the energy consumption that any VLSI implementation of the Viterbi algorithm must obey, regardless of the architecture employed or the intended application.     

Bandwidth-constrained signature waveforms and Walsh signal space receivers for synchronous CDMA systems

Synchronous CDMA systems whose transmission bandwidth is quantified through the fractional out-of-band energy (FOBE) constraint are considered. Either a conventional matched filter (MF) receiver or a minimum mean-square error (MMSE) receiver is employed for users' data detection. The total squared correlation (TSC) and the total mean-square error (TMSE) are proposed as the performance parameters for the MF and MMSE receivers respectively. These parameters need to be minimized in order to maximize the signal-to-interference ratios (SIRs) at the receivers' outputs. For a given FOBE bandwidth constraint, the sets of signature waveforms that minimize either TSC or TMSE are obtained from the prolate spheroidal wave functions (PSWFs). Furthermore, if the number of users is the size of a Hadamard matrix, then optimal signature waveforms can be obtained to maximize the individual SIR for every user. Due to the complicated nature of the PSWFs, simplified MF and MMSE receivers based on the Walsh signal space are developed.     

A quasi-optimum receiver for continuous phase modulation

A simple receiver structure for any continuous phase modulation (CPM) scheme is introduced. Its front end is just the ordinary linear receiver followed by a subinterval sampler, eliminating the need for the standard analog matched filters. Its design is based on the decomposition of the CPM signal in the Walsh signal space. This brings the hardware requirement to a minimum, and near-optimum performance can be easily obtained     

Distance properties of finite-impulse response channels

High-speed data communication over channels with limited bandwidth gives rise to intersymbol interference at the receiver usually resulting in a poor receiver error performance. An important parameter that determines the receiver error performance is the minimum Euclidean distance between two received sequences. Channel properties that maximize this distance are investigated. It is shown that maximum distance channels exist for any length of interference     

Some Aspects of Nonstationary Myoelectric Signal Processing

Nonstationary myoelectric signal processing is considered. A midpoint moving average estimator for the signal variance is developed. The performance of the estimator is analyzed and optimum window size criteria are derived. Comparison of the theoretical performance to experimental performance shows good agreement. The resultant estimation error is only moderately (2-3 percent) degraded from the equivalent stationary case. Finally, the developed estimator is compared to a typical squarer followed by a low-pass filter myoelectric processor. Provided that the low-pass filter has a linear phase characteristic in the passband, the two systems have essentially the same error performance.