(b) Figure 1. (a) Parity-check matrix H3⨉6, and (b) bipartite graph representation. (a) (b) (c) Figure 2. (a) Base matrix, (b) QC sub-matrix representation with 1 on the lines and 0 otherwise, and (c) full-expanded QC parity-check matrix.
Particle filtering is widely used in numerous nonlinear applications which require reconfigurability, fast prototyping, and online parallel signal processing. The emerging computing platform, CUDA, may be regarded as the most appealing platform for such implementation. However, there are not yet literatures exploring how to utilize CUDA for particle… (More)
Many recent reconfigurable/multi-mode quasi-cyclic low density parity check (QC-LDPC) decoder designs have shown appealing implementation results in the literature. However, most of them are based on datapath multiplexing techniques with ad hoc matrix arrangement. There is still room for further inter-connection reduction, throughput enhancement, and a more… (More)
Constrained particle filter is widely used in indoor localization applications. With environmental information, the cascaded hypothesis modifier can improve accuracy by rejecting particles those have invalid transitions. However, the memory requirement and computation complexity of constrained particle filter are both large, and the low spatial correlations… (More)
The sampling importance resampling particle filter (SIR PF) is a common tool for nonlinear/non-Gaussian state estimation. The SIR PF is a memory-hungry algorithm, and the estimation accuracy is better with more particles (memory). However, the SIR PF does not utilize the memory effectively. In this paper, we propose a multi-prediction (MP) PF with two-stage… (More)