Boots – shoes – and leggings
Patent
1992-05-29
1993-11-16
Mai, Tan V.
Boots, shoes, and leggings
3401462, G06F 700, G06F 702
Patent
active
052629694
ABSTRACT:
The data words in a list are grouped into n groups. The grouping is performed by selecting the first code word of the list and every nth code word thereafter to form a first group, and then by selecting the next code word of the list and every nth code word thereafter to form a second group and repeating this selection process until n groups are formed. The maximum/minimum among the data words of each of the n groups is determined, and a data word number of the maximum/minimum is ascertained. Subsequently, an absolute data word number of the maximum/minimum of each of said n groups is determined using the data word number obtained and the group number and n. Finally, the absolute code word is determined by ascertaining the maximum/minimum in the list by comparing the n maximums/minimums of the n groups.
REFERENCES:
patent: 5122979 (1992-06-01), Culverhouse
Gourlay et al, "Circuit for finding the minimum or maximum of a set of binary numbers", IBM Tech. Disl. Bull. vol. 25 No. 7A Dec. 1982 pp. 3318-3320.
Mai Tan V.
NEC Corporation
LandOfFree
Arrangement and method of ascertaining data word number of maxim does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Arrangement and method of ascertaining data word number of maxim, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Arrangement and method of ascertaining data word number of maxim will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-26556