Stress analysis of finite orthotropic composite containing an elliptical hole

Although the mechanical integrity of a member can be highly influenced by associated stresses, determining the latter can be very challenging for finite orthotropic composites containing cutouts. This is particularly so if the external loading is not well known, a common situation in practical situations. Acknowledging the above, a finite elliptically-perforated orthotropic tensile laminate is stress analyzed by combining measured displacement data with relevant analytical and numerical tools. Knowledge of the external loading is unnecessary. Results are verified independently and the concepts are applicable to other situations. The developed technology can provide important design-type information for orthotropic composites. In particular, the ability to apply analyses for perforated composite structures which assume infinite geometry to finite geometries is demonstrated.

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>