Patent US5212686A successfully refreshed from Google Patents.
US5212686A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Asynchronous time division switching arrangement and a method of operating same
Assignee: GEC PLESSEY TELECOMMUNICATIONS Ltd NEW CENTURY PARK PO BOX 53 COVENTRY CV3 1HJ ENGLAND
•
Filing: 1989-09-29
•
Granted: 1993-05-18
•
Expires: 2009-09-29
Abstract
Abstract An asynchronous time division multiplex switching arrangement comprises a serial to parallel converter arranged to receive input packets of data which include routing information, in serial form and convert the packets of data to parallel form. A random access memory is provided in which each packet of data is entered at an addressed location into the memory, and the address is entered in a respective first-in first-out output queue at the tail. The address at the head of the queue is accessed and the packet of data is read from the random access memory into a parallel to serial converter and the packet of data is serially delivered to the associated output.
Inventors
- 👤 Andrew K. Joy
- 👤 Michael D. Jager
- 👤 Andrew J. Pickering
- 👤 Raymond E. Oakley
- 👤 John S. Arnold
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 18:53
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/10; H04L49/103; H04L49/30; H04L49/3027; H04L49/3036
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
133 words
An asynchronous time division multiplex switching arrangement comprising a serial to parallel converter arranged to receive input packets of data which include routing information, in serial form, and convert the packets of data to parallel form; a random access memory, a first-in-first-out (FIFO) output queuing means for each output wherein each packet of data in parallel form is entered at an addressed location into the random access memory, the address is entered at the tail of the respective FIFO output queue, and the address at the head of the FIFO output queue is accessed; and a parallel to serial converter for reading the packet of data from the random access memory at the address from the head of the FIFO output queue and serially delivering the packet of data to a required output.
Claim 2
Dependent Claim
133 words
An asynchronous time division multiplex switching arrangement comprising a serial to parallel converter arranged to receive input packets of data which include routing information, in serial form, and convert the packets of data to parallel form; a random access memory, a first-in-first-out (FIFO) output queuing means for each output wherein each packet of data in parallel form is entered at an addressed location into the random access memory, the address is entered at the tail of the respective FIFO output queue, and the address at the head of the FIFO output queue is accessed; and a parallel to serial converter for reading the packet of data from the random access memory at the address from the head of the FIFO output queue and serially delivering the packet of data to a required output.
Claim 3
Dependent Claim
48 words
An arrangement as claimed in claim 1, wherein means is provided to split each packet of data into `k` segments, where `k` is an even number and where means is provided to read successive odd and even segments into a respective half of the serial to parallel converter.
Claim 4
Dependent Claim
34 words
An arrangement as claimed in claim 2, wherein means is provided to read the successive odd and even segments from the random access memory into a respective half of the parallel to serial converter.
Claim 5
Dependent Claim
40 words
An arrangement as claimed in claim 3 , wherein the random access memory is split into two halves, each of which is arranged to be accessed, independently, and used to store the respective odd and even segments of each packet.
Claim 6
Dependent Claim
37 words
An arrangement as claimed in claim 3, wherein the random access memory is split into `k` parts, each of which is arranged to be accessed independently, and used to store the respective `k` segments of each packet.
Claim 7
Dependent Claim
27 words
An arrangement as claimed in claim 1, wherein the respective FIFO output queue resides in the Random Access Memory and dynamically shares the capacity of the memory.
Claim 8
Independent Claim
169 words
A method of operating an asynchronous time division multiplex switching arrangement comprising the steps of receiving input packets of data, by a serial to parallel converter, including routing information, in serial form; converting the packets of data to parallel form selecting data from the serial to parallel converter by a walking one sequencer; entering each packet of data in parallel form into an addressed location of a random access memory; drawing the address from the head of a first-in first-out queue of addresses of free locations in the memory where one or more separate FIFO output queuing means each associated with an output are provided to list in order of arrival the address location of input packets directed to said output, accessing the address when an address comes to the head of the queue; reading the packet of data from the random access memory into a parallel to serial converter; converting the packet of data to serial form; and serially delivering the packet of data to a required output.
Claim 9
Independent Claim
169 words
A method of operating an asynchronous time division multiplex switching arrangement comprising the steps of receiving input packets of data, by a serial to parallel converter, including routing information, in serial form; converting the packets of data to parallel form selecting data from the serial to parallel converter by a walking one sequencer; entering each packet of data in parallel form into an addressed location of a random access memory; drawing the address from the head of a first-in first-out queue of addresses of free locations in the memory where one or more separate FIFO output queuing means each associated with an output are provided to list in order of arrival the address location of input packets directed to said output, accessing the address when an address comes to the head of the queue; reading the packet of data from the random access memory into a parallel to serial converter; converting the packet of data to serial form; and serially delivering the packet of data to a required output.
Claim 10
Dependent Claim
21 words
An arrangement as claimed in claim 2, wherein the serial to parallel converter is controlled by a walking one sequencer unit.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-05-17 | 1996-11-16 | 1997-05-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-05-17 | 2000-11-16 | 2001-05-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-05-17 | 2004-11-16 | 2005-05-18 | $7700.00 | Window Closed / Lapsed |