Abstract: A method and apparatus for interleaving within a communication system is provided herein. More particularly parameters for a convolutional turbo code interleaver are provided, and interleaving takes place utilizing the new parameters. The new parameters generate interleavers that have the correct turbo code behaviors of improving performance with increasing block size and an error floor well below a block error rate of 10?4. Furthermore, the parameters have no implementation impact. Interleaving in accordance with the preferred embodiment of the present invention can achieve a block error rate of 10?4 at a signal-to-noise ratio that is at least 0.5 dB, and in some cases up to 1.3 dB, smaller than that which can be achieved with the code using the existing parameters.

Abstract: A structured parity-check matrix H is proposed, wherein H is an expansion of a base matrix Hb. Base matrix Hb comprises a section Hb1 and a section Hb2. Section Hb2 comprises column hb having weight wh>=3 and H?b2 having a dual-diagonal structure with matrix elements at row i, column j equal to 1 for i=j, 1 for i=j+1, and 0 elsewhere. The 1's of hb and Hb1 are arranged such that one or more groups of the rows of Hb can be formed so that the rows of Hb within each group do not intersect. Further more, the rows of base matrix Hb can be permuted such that every two consecutive rows do not intersect.

Abstract: A base model matrix is defined for the largest code length of each code rate. The set of shifts {p(i,j)} in the base model matrix are used to determine the shift sizes for all other code lengths of the same code rate. Shift sizes {p(f; i, j)} for a code size corresponding to expansion factor zf are derived from {p(i,j)} by scaling p(i,j) proportionally, and a model matrix defined by {p(f,i,j)} is used to determine the parity-check bits for the f-th code.

Abstract: A base model matrix is defined for the largest code length of each code rate. The set of shifts {p(i,j)} in the base model matrix are used to determine the shift sizes for all other code lengths of the same code rate. Shift sizes {p(f, i, j)} for a code size corresponding to expansion factor zf are derived from {p(i,j)} by scaling p(i,j) proportionally, and a model matrix defined by {p(f,i,j)} is used to determine the parity-check bits for the f-th code.

Abstract: A structured parity-check matrix H is proposed, wherein H is an expansion of a base matrix Hb and wherein Hb comprises a section Hb1 and a section Hb2, and wherein Hb2 comprises a first part comprising a column hb having an odd weight greater than 2, and a second part comprising matrix elements for row i, column j equal to 1 for i=j, 1 for i=j+1, and 0 elsewhere. The expansion of the base matrix Hb uses identical submatrices for 1s in each column of the second part H?b2, and the expansion uses paired submatrices for an even number of 1s in hb.

Abstract: An applicator for applying a paint design along the border of a wall includes a holder having a planar base, a handle extending from one side of the base and a hook-and-loop fastener on an opposite side of the base for attaching in any desired position a sponge or other member for holding paint and applying it to the wall. The hook-and-loop fastener carries a grid so that the paint holding and applying member can be located in a precise position on the base of the holder relative to edges of the base and to other paint holding and applying members.

Abstract: Damaged composites are repaired by use of a rubber modified vinyl ester resin composition as either an adhesive for bonding metal or cured composite to the area surrounding the damaged area or by placing an uncured reinforcing material saturated with a rubber modified vinyl ester resin composition over the prepared damaged zone and curing in place.