LDPC Codes Based on α – Resolvable BIB and Group Divisible Designs

<p>Structured LDPC codes have been constructed using balanced incomplete block (BIB) designs, resolvable BIB designs, mutually orthogonal Latin rectangles, partial geometries, group divisible designs, resolvable group divisible designs and finite geometries. Here we have constructed LDPC codes from <i>α </i>–<b> </b>resolvable BIB and Group divisible designs. The sub–matrices of incidence matrix of such block design are used as a parity – check matrix of the code which satisfy row – column constraint. Here the girth of the proposed code is at least six and the corresponding LDPC code (or Tanner graph) is free of 4– cycles. </p>

LDPC Codes Based on α – Resolvable BIB and Group Divisible Designs

<p>Structured LDPC codes have been constructed using balanced incomplete block (BIB) designs, resolvable BIB designs, mutually orthogonal Latin rectangles, partial geometries, group divisible designs, resolvable group divisible designs and finite geometries. Here we have constructed LDPC codes from <i>α </i>–<b> </b>resolvable BIB and Group divisible designs. The sub–matrices of incidence matrix of such block design are used as a parity – check matrix of the code which satisfy row – column constraint. Here the girth of the proposed code is at least six and the corresponding LDPC code (or Tanner graph) is free of 4– cycles. </p>

A Detection and Tracking Algorithm for Resolvable Group with Structural and Formation Changes Using the Gibbs-GLMB Filter

In the field of resolvable group target tracking, further study on the structure and formation of group targets is helpful to reduce the tracking error of group bluetargets. In this paper, we propose an algorithm to detect whether the structure or formation state of group targets changes. In this paper, a Gibbs Generalized Labeled Multi-Bernoulli (GLMB) filter is used to obtain the estimation of discernible group target bluestates. After obtaining the state estimation of the group target, we extract relevant information based on the estimation data to judge whether the structure or formation state has changed. Finally, several experiments are carried out to verify the algorithm.

Resolvable Group State Estimation with Maneuver Based on Labeled RFS and Graph Theory

In this paper, multiple resolvable group target tracking was considered in the frame of random finite sets. In particular, a group target model was introduced by combining graph theory with the labeled random finite sets (RFS). This accounted for dependence between group members. Simulations were presented to verify the proposed algorithm.