Deterministic routing method for minimal switch circuits

Details Deterministic routing method for minimal switch circuits Deterministic routing method for minimal switch circuits

1992-01-24

1994-12-06

Olms, Douglas W.

Communications: electrical

Continuously variable indicating

With meter reading

34082583, 34082585, 34082586, 34082589, 3408259, 34082591, 370 56, 307112, 307113, 307115, H04Q 300

Patent

active

053714954

ABSTRACT:
A deterministic routing method for switch matrices. The routed matrix receives N input signals and produces M output signals on M output columns. The method of the present invention has three steps. First, each of the M output columns in the switch matrix is searched for each of N separate input signals. Secondly, each of the N inputs is assigned to its located column. If all of the N inputs cannot be assigned to one of the M columns, the set of inputs is shifted and the steps are repeated until all of the N inputs are routed.

REFERENCES:
patent: 4150258 (1979-04-01), Fujimoto et al.
patent: 4843383 (1989-06-01), Roberts et al.
patent: 4922246 (1990-05-01), Cormen et al.
patent: 4989022 (1991-01-01), Hwang et al.
patent: 5126999 (1992-06-01), Munter et al.

Affiliated with

Also associated with

Rating

Deterministic routing method for minimal switch circuits does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Deterministic routing method for minimal switch circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deterministic routing method for minimal switch circuits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-217411