TH21911A - "Arrangement of circuits for synchronization" - Google Patents

Abstract

The invention involves organizing a synchronization instrument integrated into the unit. Multiplexing / D multiplexing (1) which receives the bit stream associated with the dataset. The different values and positions of the bits within a given part of the sequential bit sequence of each dataset. Therefore, a given check calculation gives a given value (for example, "O"). The sequence of tiled bits received with the specified part of the sequence. Of tiled bits And belong to the received data set respectively It is computed in order to establish a network where the check calculations will give the specified values. When a manipulation is discovered, it is assumed that the boundary between two adjacent datasets is established through a sequence of bits of Determined part of the tiled sequence of bits Each incoming bit stream will be synchronized. Through the medium or the medium of the control schematic or the control logic (4, 9) by interpolating the delay of time. Received with synchronization as a series-parallel converter (3) for the respective bit currents. The synchronized parallel-formatted bit stream (25) is passed through the control schematic. Or logic to control (4) to memory (5) which will send bit stream to the Pass-through connections (8) through buffer circuits (6) and parallel-series converters (7).

Claims (5)

1.Synchronization circuit arrangement included in multiplexing / decomposition units Which serves to divide the bit stream in order To be the specified data set Clearly sorted in order This is to provide the boundary between the data sets that are aligned. Can be established By making constant selection Which the values and positions of the bits within the section Given the sequence of tiled bits in each data set sent, the required check calculation gives the specified value. (For example, "O") where the order of the bits belonging to the received dataset and sorted by the specified portion of the sequential bit sequence is evaluated to establish the scope. Where the computation checks to give the given value And where, in the case of boundary convergence between two adjacent datasets, is established through the medium or intermediate of the bit sequence of the selected part. And where in case of function Of multiplexing Bit streams that are common to the dataset will occur over a number of incoming connections. And one connection passed And where the reverse is the same in case That is a function of d multiplexing Where it is directed by the manner in which each incoming bitstream Will be synchronized through the control flow media. Or control logic (4, 9) by inserting In a series-parallel converter (3) for the respective bit currents. Which delays the time of synchronization whereby the synchronized bit stream is formatted in parallel. Able to pass Control schematic or control logic (4) to memory (5) which sends bit stream to the Pass-through connections (8) through buffer circuits (6) and parallel-series converters (7). 2. Arrangement as set out in Clause 1, where directed by the manner The assigned part of the sequential bit sequence contains the addressable part of the dataset. Consecutive 3. Arrangement as set out in either Clause 1 or 2. Where is directed by the manner in which the assigned portion of the sequential bit sequence Will be divided into The assigned number of sub-sections By in good form To be the least Four sub-sections 4. Arrangement as set out in any of Clause 1, 2 or 3. Where directed by such a manner that no boundaries will be established Until the convergence was discovered by the number The defined data sets are sorted together. 5. Arrangement as set out in any of Clause 1 or 4. Where is directed by the manner that when the convergence is not discovered with any incoming connections (2a-2d), the assigned portion of the tiled bit sequence is moved one bit forward or backward. Where after that Calculations are performed on that section in the same manner as That happened earlier In order to establish boundaries when convergence is discovered In order to move the part Given to pass the bit's position in the same direction When the convergence is not discovered