Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
155 words
An asynchronous time division multiplex switching system comprising a serial to parallel converter arranged to receive incoming packets of data which include routing information in serial form and convert them into parallel form, a memory in which each incoming packet of data is entered in an addressed location thereof, a processor to arrange said incoming packets of data in queues, one for each output port, and a parallel to serial converter arranged to receive packets of data from said queues of data in parallel form and convert them into serial form for delivery to output ports corresponding to each queue, said processor being arranged to maintain a record of the number of packets in each of said queues so that when the memory is full, a packet at the head of the longest queue, that is the oldest packet in the longest queue, is discarded to make room for a newer, incoming packet of data.
Claim 2
Dependent Claim
155 words
An asynchronous time division multiplex switching system comprising a serial to parallel converter arranged to receive incoming packets of data which include routing information in serial form and convert them into parallel form, a memory in which each incoming packet of data is entered in an addressed location thereof, a processor to arrange said incoming packets of data in queues, one for each output port, and a parallel to serial converter arranged to receive packets of data from said queues of data in parallel form and convert them into serial form for delivery to output ports corresponding to each queue, said processor being arranged to maintain a record of the number of packets in each of said queues so that when the memory is full, a packet at the head of the longest queue, that is the oldest packet in the longest queue, is discarded to make room for a newer, incoming packet of data.
Claim 3
Dependent Claim
41 words
A system as claimed in claim 1, in which the serial to parallel converter is split into two blocks and each packet of data is split into two halves and read into a respective block of the serial to parallel converter.
Claim 4
Dependent Claim
48 words
A system as claimed in claim 2, in which the memory is split into two halves, each of which is arranged to be accessed independently and is arranged to store the respective half of the packet of data from the respective block of the serial to parallel converter.
Claim 5
Dependent Claim
40 words
A system as claimed in claim 3, in which the parallel to serial converter is split into two blocks, each arranged to receive the respective half of the packet of data from the memory for delivery to an output port.
Claim 6
Dependent Claim
20 words
A system as claimed in claim 1 in which each incoming packet of data is a broadband block of data.
Claim 7
Dependent Claim
15 words
A system as claimed in claim 1 which is embodied in an integrated silicon chip.
Claim 8
Independent Claim
131 words
A method of routing data in an asynchronous time division multiplex switching system, which comprises the steps of: converting incoming packets of data which include routing information from serial form to parallel form, entering each packet of incoming data in an addressed location of a memory, arranging said incoming packets of data in queues, one for each output port, converting said packets of data from parallel form to serial form for delivery to output ports corresponding to each queue, maintaining a record of the number of packets of data in each of said queues, and discarding a packet of data at the head of the longest queue, that is the oldest packet in the longest queue, to make room for a newer, incoming packet of data, when the memory is full.
Claim 9
Independent Claim
131 words
A method of routing data in an asynchronous time division multiplex switching system, which comprises the steps of: converting incoming packets of data which include routing information from serial form to parallel form, entering each packet of incoming data in an addressed location of a memory, arranging said incoming packets of data in queues, one for each output port, converting said packets of data from parallel form to serial form for delivery to output ports corresponding to each queue, maintaining a record of the number of packets of data in each of said queues, and discarding a packet of data at the head of the longest queue, that is the oldest packet in the longest queue, to make room for a newer, incoming packet of data, when the memory is full.