Early life events as discriminators of socialized and undersocialized delinquents.

The relationship between early life events and the socialized and undersocialized dimensions of conduct disorder was investigated. Subjects were 40 incarcerated male delinquents and their mothers. The mothers were administered the Children's Life Events Questionnaire and the Developmental Questionnaire. Youths were administered the Adolescent Parent Relations Scale. The results indicated that the undersocialized delinquents had a greater number of stressful life events during their first 4 years of life than did the socialized delinquents. Discriminant function analysis indicated that stressful life events during the 2nd and 4th years were the most important predictors of membership in the undersocialized group. The discriminant function generated was able to classify 82.5% of the sample correctly. The remaining variables did not significantly discriminate the groups.

A VLSI design of a pipeline Reed-Solomon decoder.

A pipeline structure of a transform decoder similar to a systolic array is developed to decode Reed-Solomon (RS) codes. An important ingredient of this design is a modified Euclidean algorithm for computing the error-locator polynomial. The computation of inverse field elements is completely avoided in this modification of Euclid's algorithm. The new coder is regular and simple, and naturally suitable for VLSI implementation. An example illustrating both the pipeline and systolic array aspects of this decoder structure is given for a RS code.

VLSI architectures for computing multiplications and inverses in GF(2m).

Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There is a need for good multiplication and inversion algorithms that can be easily realized on VLSI chips. Massey and Omura recently developed a new multiplication algorithm for Galois fields based on a normal basis representation. In this paper, a pipeline structure is developed to realize the Massey-Omura multiplier in the finite field GF(2m). With the simple squaring property of the normal basis representation used together with this multiplier, a pipeline architecture is developed for computing inverse elements in GF(2m). The designs developed for the Massey-Omura multiplier and the computation of inverse elements are regular, simple, expandable, and therefore, naturally suitable for VLSI implementation.