Nova Patents
SE424251B

Multiplexer

Abstract

1486105 Multiplex systems INTERNATIONAL BUSINESS MACHINES CORP 17 Feb 1975 [17 May 1974] 6558/75 Heading H4M A multiplexer for handling circuit switched (synchronous) traffic and store and forward (asynchronous) traffic comprises a set of registers 12-16 each associated with one of a first set of sources of circuit switched traffic and a buffer store for storing data from a second set of sources of store and forward traffic, with a transferring arrangement (OR gate 34 and adapter 36) for transferring data alternately from the registers and the buffer store to a common transmission line 38. A first selector (counter 51, input/output register 10, decoder 70 and gates 72-90) selectively activates outputs of the registers to release data to the transferring arrangement during discrete assigned time slots of repetitive frames in accordance with control data in a control store 10 and a second selecting arrangement (counter 62, comparator 68, gate 78) activates the buffer store to release data to the transferring arrangement only during discrete time gaps between the assigned time slots. The selectors operate such that a non zero minimum capacity is provided for store and forward traffic in each frame. A minimum part M (Fig. 3) of a frame is reserved for asynchronous traffic, while in the rest of the frame M priority is given to synehronous traffic; but any space unused by synchronous traffic may be occupied by asynchronous. The store and forward switched data is fed to the buffer store 18 via an editing unit 20 which arranges the data packets in sequence and adds identification and control information. Data is fed to the transmission path 38 via an assembler comprising OR gate 34 and adapter 36. The outputs of the registers 12-16 are selectively actuated in accordance with control data in a control store 10 to feed synchronous data to the multiplex channel and if no data is released from the registers (indicated by an output 58 from the store) the buffer store 18 is selectively activated to release asynchronous data to the multiplex channel. The store is associative and holds information on time slot assignments for synchronous data, each row of the store recording the first bit position of a time slot in the frame, the time slot width and the number of the data channel to which the time slot is assigned. In response to a bit clock 40, a counter 50 is incremented. The count is fed to gate 51 and thence to the store. Each count that corresponds with a bit position recorded in the first column of the associative store results in an output from the store indicator I which sets the flip-flop 54 and enables the counter 62 and comparator 68. When the counter 62, incremented by the bit clock 40, reaches the valve of time slot width stored in the second column of the associative store 10, a signal which resets the flip-flop 54 is delivered, providing a signal on line 48 to actuate the buffer 18 to release asynchronous data to the multiplex line. The flip-flop 54 remains reset in the intervals between synchronous time slots. During the set periods, in the synchronous time slots, the channel numbers for the slots are read out to decoder 70 which provides signals to read out the appropriate registers 12-16 to the gate 34 and hence the line 38. The frame sync pattern is held in a register 84 and this is read out to the line at an appropriate time determined by the store 10 from information in its first two rows 000 and 001. The system further incorporates a main store which contains lists defining the time slots (defined by starting bit position and width) available to both synchronous and asynchronous data, and also holds information defining the minimum number of bits which must be available for asynchronous data. When requests are received by the system for further allocation of time slots for synchronous data, the store determines whether any bits beyond the minimum needed for asynchronous data are available. If so, a search is conducted to find the slots whose width most nearly matches the new data. Information is then sent to the associative store at the multiplexer so that this records the position and width of the new time slot. This information must also be sent to the demultiplexer at the receiver in the system, which contains a similar associative store. This operation takes time, which could result in data assigned to a new synchronous time slot at the transmitter being interpreted as asynchronous at the receiver and thus transferred to the wrong output. To prevent this, newly entered words in the associative store are marked by "10" in "transition mask" locations, and this mask prevents the words being accessed until a signal is returned from the demultiplexer indicating that it has recorded the information. Then the mask changes to 11 to indicate an active row (free or passive rows are marked 00).

SE424251B, drawing sheet 1
Sheet 1 of 3

Term

No projected expiry on record.

  1. Priority
  2. Filed
  3. Granted
  4. Today

10 claims: 3 independent, 7 dependent

  1. 1
    Claims. Patentkrav. 1. Metod för överföring av information i tidsmultiplex från olika källor över ett gemensamt överföringsarrangemang medelst en gemensam styrenhet för utväljning av i på varandra följande tidsavsnitt överförd information, kännetecknad därav, att överföring av data från en första undergrupp av källor (22, 24, 26) sker i synkron form i diskreta tidsspår inom sekvensiella tidsavsnitt, vilka tidsspår är temporärt tilldelade källorna, varvid storleken på ett tidsspår och dettas läge inom avsnittscykeln fastlägges av nämnda styrenhet (fig. 4), att överföring av data från en andra undergrupp av källor sker i asynkron form medelst mellanlagring av data i ett buffertminne (18), vilka data därefter uttages och överföres i form av en intermittent dataström i av styrenheten avkända gap, vilka har kvarlämnats i tidsavsnittet mellan den synkrona trafikens tidsspår, att vid tilldelning av ett nytt tidsspår genom prövning av styrenheten (fig. 4) först fastlägges om efter sådan tilldelning den för den asynkrona trafikens tillgängliga kanalkapacitet, som motsvarar summan av de resterande gapen, icke understiger ett bestämt minivärde och att vid positiv prövning ett nytt tidsspår tilldelas den första undergruppens källor. 1st Method for transmitting information in time multiplexes from different sources over a common transmission arrangement by means of a common control unit for selecting information transmitted in consecutive time sections, characterized in that data is transferred from a first subset of sources (22, 24, 26). in synchronous form in discrete time tracks within sequential time sections, which time tracks are temporarily assigned to the sources;wherein the size of a time track and its position within the section cycle is determined by said controller (FIG. 4) transmitting data from a second subset of sources in asynchronous form by means of intermediate storage of data in a buffer memory (18), which data is then extracted and transmitted in the form of an intermittent data stream in the gaps detected by the controller, which are left in the time section between the synchronous traffic time track, that when assigning a new time track by testing the controller (fig. 4) first determine if, after such allocation, the available channel capacity for asynchronous traffic, which corresponds to the sum of the remaining gaps, does not fall below a specified minimum value and that upon positive testing a new time track is assigned to the sources of the first subgroup.
  2. 3
    Metod enligt patentkraven 1 och 2, kännetecknad därav, att för identifiering av ett tidsspår lagring sker av numret på dess första bitposition i förhållande till avsnittets början och av det totala antalet bitpositioner, vilka höra till detta tidsspår. 3rd Method according to claims 1 and 2, characterized in that for identifying a time track storage, the number of its first bit position relative to the beginning of the section and of the total number of bit positions belonging to that time track are made. 7504748-0 7504748-0
  3. 6
    Multiplexanordning för tillämpning av metoden enligt patentkraven 1-5, kännetecknad av ett flertal källregister (12, 14 16) hörande till källorna (22, 24, 26) i den första undergruppen för kretskopplad trafik, ett buffertminne (18) för lagring och sekvensiell avgivning av data från tillhörande källor (28, 30, 32) i den andra undergruppen för lagra- och släpp fram-trafik, en kombinationsenhet (34) för alternativ överföring av data från källregistren och buffertminnet till ingångsorgan (36) i överföringsarrangemanget (38), första väljarkretsar (10a, 42 ... 46, 50 ... 76) för selektiv aktivering av källregisterutgångarna för att åstadkomma avgivning av dataelement till kombinationsenheten i diskreta tidsspår inom sekvensiella tidsavsnitt i enlighet med styrdata, som är lagrad i ett styrminne (10), vilket är anslutet till väljarkretsarna, samt andra väljarkretsar (52, 54, 48, 78) för aktivering av buffertminnet för att få detta att avgiva dataelement till kombinationsenheten endast under diskreta tidsgap mellan nämnda diskreta tidsspår. 6th Multiplex device for applying the method according to claims 1-5, characterized by a plurality of source registers (12, 14 16) belonging to the sources (22, 24, 26) of the first sub-group for circuit switched traffic, a buffer memory (18) for storage and sequential delivery of data from associated sources (28, 30, 32) in the second subgroup for storage and drop traffic;a combination unit (34) for alternatively transmitting data from the source registers and buffer memory to input means (36) in the transfer arrangement (38), first selector circuits (10a, 42 ... 46, 50 ... 76) for selectively activating the source register outputs to effect delivery of data elements to the combination unit in discrete time slots within sequential time sections in accordance with control data stored in a control memory (10), which is connected to the selector circuits, and other selector circuits (52, 54, 48, 78) for activating the buffer memory to cause it to output data elements to the combination unit only during discrete time gaps between said discrete time traces. 7504748-0 7504748-0