Boots – shoes – and leggings
Patent
1992-12-30
1995-10-03
Coleman, Eric
Boots, shoes, and leggings
364228, 3642295, 3642305, 3642401, 3642402, 3642405, 3642407, 3642419, 3642448, 364DIG1, 364DIG2, 39520002, 34082503, 340827, G06F 1128, G06F 1336, G06F 1320, G06F 1314
Patent
active
054559561
ABSTRACT:
A method and system construct an O-tree and I-tree for a rearrangeably-blocked digital symmetrical matrix (DSM) network. The method includes the steps of receiving a plurality of parameters including a tree forming instruction for forming the I-tree and O-tree, an input switch parameter, an output switch parameter, and middle switch parameters. From these parameters, the method and system yield a set of feasible nodes for rearranging the DSM network to make the desired connection. The method and system are modified to terminate at the first feasible node of a modified I-tree or a modified O-tree. Also, both a rearrangement method and system and a DSM network control method and system are provided that use either the I-tree and O-tree construction process or the modified I-tree and modified O-tree construction process. Furthermore, a parallel rearrangement algorithm is provided for even further enhancement.
REFERENCES:
patent: 4710916 (1987-12-01), Amstutz et al.
patent: 4825206 (1987-04-01), Brice, Jr. et al.
patent: 5084870 (1992-01-01), Hutchison et al.
Huynh Dung T.
Nguyen Brian H.
Alcatel Network Systems
Coleman Eric
Pan Daniel H.
LandOfFree
Connection tree rearrangement method and system for rearrangebly does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Connection tree rearrangement method and system for rearrangebly, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Connection tree rearrangement method and system for rearrangebly will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1083572