CELLULAR REALIZATION OF THE DYNAMIC PROGRAMMING ALGORITHM.
Annual progress rept.,
MONTANA STATE UNIV BOZEMAN ENGINEERING RESEARCH LABS
Pagination or Media Count:
General algorithmic specification, not including detailed logical design, of a highly parallel, specially organized cellular machine to embody a discrete Kalman filter is described. Various matrix operation algorithms and comparisons to sequential operations are given. Parallel computation is based on a square array of identical, limited capability modules, providing inherent speed and taking advantage of current LSI technology. The time to process increases about linearly with problem size rather than as the cube. Simulation results of a tracking problem posed by Naval Electronics Laboratory, San Diego, are included. The problem is one of a linear plant with a nonlinear observation. Thus a dynamic linearization of the observation matrix is required, such dynamics pervading the entire filter. Author
- Operations Research
- Computer Hardware