US5570358A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for Implementing switching in time or space domain
Assignee: Schofield Technologies LLC
•
Filing: 1993-07-08
•
Granted: 1996-10-29
•
Expires: 2013-07-08
Abstract
Abstract PCT No. PCT/FI93/00292 Sec. 371 Date Mar. 10, 1995 Sec. 102(e) Date Mar. 10, 1995 PCT Filed Jul. 8, 1993 PCT Pub. No. WO94/03021 PCT Pub. Date Feb. 3, 1994A method for implementing switching in the time or space domain, in which the switching is effected on the basis of switching data contained in an address control memory, and a basic switching block is defined on the basis of an incoming frame structure so that the number of its time slots corresponds to the greatest possible number of signals of the lowest level of hierarchy to be switched in the frame. The basic switching block recurs in the same form with respect to switching. In order for the switching to be simplified: (i) the number of the switching instructions to be stored in the address control memory corresponds to the size of the basic switching block, whereby when the basic switching block also contains higher-level signals, the same switching instruction is used in the address control memory at given intervals, depending on how the signals occur in the basic switching block, (ii) the same address control memory is read during the entire frame structure, whereby it gives a switching instruction to all time slots in the frame, and (iii) the switching instructions read from the address control memory are skipped during the time slots which are not cross-connected.
Inventors
- 👤 Hannu Alatalo
- 👤 Marko Kokko
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 22:17
CPC Classifications
H; H04; H04Q; H04Q11/00; H04Q11/04; H04Q11/08; H04J; H04J3/00; H04J3/16; H04J3/1605; H04J3/1611; H04Q11/0428; H04Q11/0478; H04J2203/00; H04J2203/0001; H04J2203/0003; H04J2203/0005; H04J2203/0012
Claims Analysis
Total Claims: 5
Claim 1
Independent Claim
241 words
A method for implementing time switching for signals of several different levels of hierarchy, said signals having a common frame structure, comprising: writing the contents of the time slots of an incoming signal into a memory at respective memory locations determined by a respective write address; and reading said contents from said memory at the memory locations indicated by switching data contained in an address control memory defining a basic switching block on the basis of the frame structure of said incoming signal so that the number of consecutive time slots of said basic switching block corresponds to the greatest possible number of signals of the lowest level of hierarchy to be switched, said basic switching block recurring in the frame structure of said incoming signal; the number of switching instructions to be stored in the address control memory corresponding to the size of the basic switching block, and when the basic switching block also contains signals of a higher level of hierarchy than said lowest level, the same switching instruction being used in said address control memory at given intervals, depending on how often said signals of a higher level occur in the basic switching block, and the same address control memory being read during the entire frame structure, and giving a switching instruction to all time slots in the frame, and the switching instructions read from the address control memory being skipped during time slots which are not cross-connected.
Claim 2
Independent Claim
241 words
A method for implementing time switching for signals of several different levels of hierarchy, said signals having a common frame structure, comprising: writing the contents of the time slots of an incoming signal into a memory at respective memory locations determined by a respective write address; and reading said contents from said memory at the memory locations indicated by switching data contained in an address control memory defining a basic switching block on the basis of the frame structure of said incoming signal so that the number of consecutive time slots of said basic switching block corresponds to the greatest possible number of signals of the lowest level of hierarchy to be switched, said basic switching block recurring in the frame structure of said incoming signal; the number of switching instructions to be stored in the address control memory corresponding to the size of the basic switching block, and when the basic switching block also contains signals of a higher level of hierarchy than said lowest level, the same switching instruction being used in said address control memory at given intervals, depending on how often said signals of a higher level occur in the basic switching block, and the same address control memory being read during the entire frame structure, and giving a switching instruction to all time slots in the frame, and the switching instructions read from the address control memory being skipped during time slots which are not cross-connected.
Claim 3
Dependent Claim
51 words
A method according to claim 1, wherein: each said switching instruction is a relative read address, which indicates the relative transition of the data contained in a respective time slot within the frame structure, and forcing each respective switching instruction to become zero during the time slots which are not cross-connected.
Claim 4
Independent Claim
198 words
A method for implementing switching in the space domain for signals of several different levels of hierarchy, said signals having a common frame structure, comprising: effecting switching on the basis of switching data included in an address control memory; and defining a basic switching block on the basis of an incoming frame structure so that the number of consecutive time slots of the basic switching block corresponds to the greatest possible number of signals of the lowest level of hierarchy to be switched, said basic switching block recurring in the frame structure of said incoming signal; the number of switching instructions to be stored in the address control memory corresponding to the size of the basic switching block, and when the basic switching block also contains higher-level signals, using the same switching instruction in the address control memory at given intervals, depending on how often said higher-level signals occur in the basic switching block, and the same address control memory being read during the entire frame structure, and giving a switching instruction to all time slots in the frame, and the switching instructions read from the address control memory being skipped during time slots which are not cross-connected.
Claim 5
Independent Claim
198 words
A method for implementing switching in the space domain for signals of several different levels of hierarchy, said signals having a common frame structure, comprising: effecting switching on the basis of switching data included in an address control memory; and defining a basic switching block on the basis of an incoming frame structure so that the number of consecutive time slots of the basic switching block corresponds to the greatest possible number of signals of the lowest level of hierarchy to be switched, said basic switching block recurring in the frame structure of said incoming signal; the number of switching instructions to be stored in the address control memory corresponding to the size of the basic switching block, and when the basic switching block also contains higher-level signals, using the same switching instruction in the address control memory at given intervals, depending on how often said higher-level signals occur in the basic switching block, and the same address control memory being read during the entire frame structure, and giving a switching instruction to all time slots in the frame, and the switching instructions read from the address control memory being skipped during time slots which are not cross-connected.
References Cited (Backward Citations)
US4320501A
Cited
US4471479A
Cited
EP0406191A1
Cited
JPH03214891A
Cited
US5197063A
Cited
GB2254754A
Cited
US5311506A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-10-29 | 2000-04-29 | 2000-10-29 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-10-29 | 2004-04-29 | 2004-10-29 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-10-29 | 2008-04-29 | 2008-10-29 | $7700.00 | Window Closed / Lapsed |