Method and circuit arrangement for the realization of the higher path adaptation function in synchronous digital hierarchy equipments

Abstract: The invention relates to a method and circuit arrangement for the realization of the Higher Path Adaptation (HPA) function in Synchronous Digital Hierarchy (SDH) equipments. Such function serves to equalize frequency difference between the synchronisms of signals coming from different nodes of the network. The equalization is carried out through the use of the positive and negative justification technique. The invention, through the alteration of the justification instants, is capable of reducing the capacity of the elastic storage and the generated wander.

Description: This invention relates to a method and to a circuit arrangement for the realization of the Higher Path Adaptation (HPA) function in Synchronous Digital Hierarchy (SDH) equipments. In a synchronous network the timing signals are all locked to a reference primary source. The timing signal of this reference is carried along the entire network and used for synchronizing the local oscillators. However these oscillators can show errors in the reconstruction of the timing signal. Therefore it is necessary to provide for structures that allow the synchronization between the signals from different nodes of the network. The functional structure of the multiplexing apparatus for the synchronous hierarchy is described in CCITT Recommendations G707, G708, G709, G783. These provide for a function for processing the Tributary Units (TU) called Higher Path Adaptation (HPA); the same function is also known and applied in apparatus operating in accordance with the ANSI standard for the SONET synchronous hierarchy (which corresponds to SDH hierarchy of the CCITT). SEXSTON M., REID A.: "Transmission Networking: SONET & the Digital Synchronous Digital Hierarchy" 1992, ARTECH HOUSE TELECOMMUNICATIONS LIBRARY, US, BOSTON XP002010957 201090 describes in general terms synchronous digital multiplexing techniques. In the following, however, reference will be made to CCITT standard terminology, a direct correspondence between the structures of SDH and SONET frames existing anyway. To STM frames there correspond the STS frames, the Administrative Units are called AU both in the CCITT and in the ANSI rules; the Tributary Units, called TU in the first rules, are called VT in the second rules; the low order virtual containers, called LVC in the first rules, are called VTSPE in the second ones; the pointing mechanisms in question are the same in both cases, the AU-pointers being identical and replacing the TU-pointers with the VT-pointers; the range of variation of the possible values of the respective pointers is the same in both cases. The HPA function has for its object to equalize frequency differences between the clock of the higher order virtual container (HVC) in the node in which the TU has been assembled and the clock of the local HVC, de facto allowing the cross-connection between TUs from different sources. In other words, downstream of the HPA, all the STM frames have the same Administrative Unit (AU) pointer fixed. It follows that all TUs contained in the above-mentioned frames are resynchronized with the local clock source and can be exchanged each other. This operation is always possible since the information content of the TUs is identified by two levels of pointers: the AU-pointer (hierarchically higher) and the TU-pointer (hierarchically lower-) . The HPA, operating on a frame in which both pointers are mobile, reconstructs the TU-pointer value corresponding to a fixed AU-pointer value (usually, but not exclusively, zero). The HPA, as described in the CCITT specification that constitutes the known art in the field, comprises a pointer interpreter, an elastic storage and a pointer generator for each of the processed tributaries. The information content of each tributary is written into the elastic memory after having been individuated through interpretation of TU-pointer (the value of the AU-pointer being known, interpreted in the function CCITT G738, "Multiplex Section Adaptation"). An STM frame with fixed AU-pointer is generated downstream of the elastic storage, in the time intervals of which data read out from respective elastic storages are inserted tributary by tributary. On the basis of the read-out instant, the pointer generator determines and inserts the appropriate TU-pointer value for every tributary. The filling up level of the elastic storage is compared with an upper threshold and a lower threshold; when in a determined instant of the TU-frame, the filling-up exceeds the upper threshold, the pointer generator carries out a negative justification (stuffing), by transmitting an information byte too much in the frame. The contrary occurs when the lower threshold is exceeded. The stuffing mechanism allows the absorption of the eventual differences between the write frequency and the read out frequency in the elastic storage. As a result of said mechanism the TU-pointer value evolves with time by describing a shift of the tributary information content with respect to the TU-frame that carries it. In realizing an HPA function in practice two main system parameters in contrast with each other must be taken into account: the network wander rejection threshold, i.e. the slow variations of frequency between the signals, and the delay in the propagation of the tributary through the storage. It is important to observe that the behaviour of the synchronous network towards the plesiochronous tributaries crossing it, as to the wander and propagation delay, is almost completely determined by the HPA function, whereby the proportionment of the parameters that condition its operation is of the utmost importance in designing a synchronous multiplexer. It is evident that an optimal realization should maximize the network wander rejection by minimizing the propagation delay. Since these two requirements are conflicting, the first one requiring large storages and the second one small storages, it is necessary to find a compromise solution. The rules consider the problem of the wander rejection by defining the minimum spacing between the thresholds determining the hysteresis of the elastic storage towards pointer movements. The propagation delay is not subject of rules, however it is already clear in international context that extreme delays may negatively condition the transport of special services inside the network (for instance services using virtual concatenation). A good compromise then consists in proportionating the HPA storages thus assuring the minimum hysteresis provided for by CCITT and in evaluating with great accuracy the margins to be assured in order to prevent storage-breakings under normal condition of operation. Such margins are given by the range of the storage filling up with stationary pointers, during a frame, (static band) summed with the margin necessary to tolerate movements of the write AU-pointers, and of write and read out TU-pointers (dynamic band). Another problem is constituted by the wander generated by the HPA mechanism, in the presence of systematic and monotone AU-stuffings in the write frame. In fact, a train of consecutive and regular write AU-stuffings in only one way is absorbed by means of consecutive read TU-stuffings. In this case, the sequence of read movements is no longer regular, because of the structure of the frames, and a corresponding wander is originated. In fact, the presence of the redundancy bytes in the STM frames (like the SOH ones) makes the above TU-stuffings occur from close up or less depending on whether redundancy bytes (that delay the instant of read out) are present between the write and read instants. In other words, it is true that the average rate of the TU-stuffings is proportional to the difference between the write and the read out frequencies, but this is not true for the instantaneous frequency. The observed wander is given by the fact that, being the stuffing instants irregular, also the shift of the tributary information content inside the TU carrying is irregular, and hence the frequency of the tributary, once demultiplexed, will be irregular. This phenomenon cannot be eliminated downstream, e.g. through filters, its characteristic frequency being small as one likes, as it is the difference between the write and read out frequencies. It is a first object of the present invention to provide a method of realizing the HPA function capable of reducing the propagation delay through the memory. Another object is to reduce the wander generated by the HPA mechanism. A further object of the present invention is to provide a circuit arrangement capable of implementing such method in an effective manner and at low cost. These and further objects are obtained by a method of realizing a higher path adaptation (HPA) function in synchronous digital hierarchy (SDH) equipments which is characterized by comprising the step of altering the instants of justification of a read frame tributary unit (TU-pointer) in function of a value of a write frame auxiliary unit pointer (AU-pointer) and depending on the reciprocal position of the input and output frames by modulating decision thresold values of the instants of justification. Therefore, in accordance with the invention, the method is structured as set forth in claim 1 and the circuit arrangement as set forth in claim 11. Further characteristics of the invention are set forth in the respective subclaims. By altering the stuffing instants of the read frame TU-pointer in a suitable manner, one is able to eliminate the above-mentioned drawbacks and to improve the performances of the HPA function. In a particularly advantageous embodiment the stuffing instants are altered through a suitable modulation of the decision thresholds of the stuffings still maintaining unaltered the minimum spacing between the thresholds recommended by CCITT. If the thresholds are modulated so that the stuffing requests of the TU-pointer are such as to compensate in advance eventual increases in the amount of occupied storage, an elastic storage of reduced capacity can be used and therefore the transit time of the signal in the storage itself is shortened. If, on the contrary, the thresholds are modulated so as to space out in an equal manner the stuffing requests of the read TU-pointer, the wander generated by the HPA mechanism is reduced if not eliminated. It is clear that it is possible to find a compromise solution for a joint optimization of the transit time as well as of the wander. It is possible to apply in an economically advantageous manner the described algorithm by processing all tributaries in the same way, independently of the phase shift between the read and write STM frame and from the value of the relative AU-pointers. It is still possible to apply a pre-processing function to the value of the write AU-pointer, so as to be able to define a sole table describing the algorithm, independently of the phase shift between the read and write STM frames. With the realization of the method as disclosed herein a circuit arrangement is obtained at low cost and with an increase in the overall performances, suitable, inter alia, for the implementation of semicustom circuits too. The wander reduction introduced by the HPA function entails benefits to the user that wishes to use the tributary flow as a reference for the synchronization of his equipments. Moreover, by reducing the above wander, the risk that the total wander introduced on the tributary of the network carrying it (sum of the contributions of all the elements of the network itself) exceeds the maximum values established in the specifications is reduced too. The invention will be better understood from the following description of an embodiment thereof taken in conjunction with the attached drawings in which: Fig. 1 shows the structure of an STM frame at the input and at the output of an HPA function; Fig. 2 represents the distribution of the stuffing instants of the TU-pointer in the presence of sistemating AU-stuffings; Fig. 3 is a block diagram of a circuit arrangement in accordance with the present invention; Fig. 4 shows the shape of the space occupied in the storage in the case of unmodified thresholds and in the case of modified thresholds. As it can be seen in Fig. 1, an STM-1 frame is represented by a 9-rows x 270-columns matrix where each element is an 8-bit byte. The first 9 columns of the matrix are reserved for the overhead functions (SOH), i.e. contain information about auxiliary services, while the remaining part is reserved for the information bytes (payload). In the SOH section there is the AU-pointer which indicates the initial address of the payload in which there are the TU-pointers indicating the positions of the various tributaries. The value assumed by a pointer indicates the position of the first byte of the carried tributary (VC). This value is susceptible to variation during operation because of the justification (stuffing) process. This process allows the accommodation of instantaneous differences between the read and write frequencies astride an elastic storage: if the storage is becoming empty (the read out speed is higher) one decides to carry out a positive justification, otherwise, a negative justification. A positive justification entails the transmission of a VC information byte less in the frame in progress; as a result, in the subsequent frame the pointer will be increased by one, the VC's position being shifted with respect to the frame carrying it; the contrary occurs on occasion of negative justifications. Fig. 1 further shows that at the output of the HPA function the pointers go through to variations so that the STM-1 frame is synchronized with the local clock. The structure of the systems to which reference will be made in the following puts the section buffer (MSA: Multiplex Section Adaptation) before the HPA buffers, in accordance with the functional description contained in the apparatus CCITT rules. Having put the MSA buffer before the HPA buffer, has favourable consequences on the design and structure of the HPA itself, such as the possibility of a synchronous implementation of the HPA buffers (the phase offset Δ between the read and write frames keeps constant with time). The exploitation of this features, in principle leads to link the phase-shift of the read and write STM frame to a value: if, on the contrary, one wishes to be free to arbitrarily pre-establish such parameter on the point of the configuration of the system, it is necessary anyway to carry out a worst-case design. The phase offset Δ between input and output frames is in any case fixed by positioning the read out counter on delay/advance with respect to write : 1) Δ = WRITE phase - READ phase Δ > 0 implies READ in ADVANCE Δ < 0 implies DELAYED READ The range of Δ can be limited, without jeopardizing the generality, to : 2) 0 ≤ Δ < Nb_tr where Nb_tr is the number of bytes in an STM frame. The static and dynamic band of the elastic storage will now be analyzed. At the output of the HPA function the frame regenerated by construction is characterized by a prefixed and constant value of the AU-pointer. In all cases the format of the read STM frame is invariant with fixed AU-pointer (null in the example under consideration). Given the invariance of the read frame with time, invariant is also the clock driving the extraction of the generic tributary from the buffer (edges in a known and fixed position). On the contrary, the shape of the write frame may vary because of the AU-stuffings (in steady conditions, fixed-AU frames, 783 different forms are possible, a priori). The memory occupation can then be expressed in function of the write AU-pointer value. A STATIC BAND is defined as the maximum range of the phase error inside a READ TU-STUFFING (MULTI)FRAME in the absence of justifications and a DYNAMIC BAND is defined as the shape of the phase error with the write pointers in motion (AU-stuffing and TU-stuffing). In order to univocally characterize the shape of the static and dynamic bands in function of the write AU-pointer, it is necessary to assign a value AUs to each (multi)frame (defined on the read out) without ambiguity, even in the presence of justifications, whatever Δ may be. The form of the static band, besides being a function of AUs, in general is also a function of the phase shift between read and write (Δ) and of the serial number of the tributary (TUn) under consideration, although repeating itself unchanged (in the absence of justifications) at frame cycles: in fact, the position (referred to the STM frame) of the write clock edges with respect to the read out taken as a reference varies with Δ in a manner, on the other hand, dependent on the tributary. By expressing the phase error (Δε) as a difference between write address (IS) and read out address (IL) of the HPA reduced to dimension module of the storage (DM): 3) Δε = |IS - IL| DM referring the shape of the static band e.g. with respect to the byte counter of the read synchronous module (nl), what said above can be summarized in the following equations: 4) Δε(nl) = Δε(AUs, TUn, Δ ; nl + K*Nb_tr) K = 0, 1, 2 ... where K is an arbitrary integer in the absence of justifications; 5) Δε tr = [MAX(Δε(nl))] nl - [MIN(Δε(nl))] nl + 1 = Δε (AUs, TUn,Δ) 6) Δε max = [MAX(Δε tr )] AUs = Δε m (TUn,Δ) which represent respectively: the amount of the phase error sampled at one point the amplitude of the static band in a single TU (multi)frame the maximum of the amplitudes searched amongst the possible frame forms, i.e. for all valid values of the AU-pointer: 7) 0 ≤ AUs ≤ AUmax, with AUmax = 782 For loads of type TU1 an exhaustive analysis allowed the verification of the following statements: the maximum amplitude Δε tr of the static band in a (multi)frame (but not its shape!) does not depend on the serial number of the tributary (TUn) under consideration: this is equivalent to simplify e.g. (5) as 8) Δε tr = [MAX(Δε (nl))] nl - [MIN(Δε(nl ))] nl + 1 = Δε (AUs,A) the maximum of Δε tr , as AUs is varied, is a constant and therefore eq. (6) assumes the form 9) Δε max = cost. = 3 for 0 ≤ AUs ≤ AUmax the values of the write AU-pointer AUs Δε max for which the static band has a maximum amplitude (Δε max ), on the contrary, depend on Δ and on the serial number of the tributary (TUn). 10) AUs Δεmax = AUs(TUn,Δ) as a result of all preceding points it follows that critical values of AU (and hence the dynamic behaviour) vary with the reciprocal position between the frames and, depending on this, eventually also with the serial number of the tributary. The dynamic band will now be analyzed. The write clock, unlike the read one, is, as a result of movements of the AU-pointer, variable with time. With the error Δε deduced directly from the write and read addresses of a byte-organized storage it is possible to detect the effects of the AU-stuffings only when these produce unit phase variations: in other words the comparator works with one byte resolution (granulosity). In write, 21, 7 and 1 are, for TU12, TU2 and TU3 respectively, the minimum distances, expressed in monotone AU-stuffings (TU being motionless), spacing two consecutive transitions: it follows that the maximum values of phase jumps due to the single motion of AU are equal to: 11) Δε AUgiu Max = 1/21 of byte at TU12 level 12) Δε AUgiu Max = 1/7 of byte at TU2 level 13) Δε AUgiu Max = 1 byte at TU3 level that at the output of the comparator are transformed into steps (spaced out at TU1 and TU2 levels) having width equal to its resolution: 14) Δε AUc = = 1 VC byte Hence there are write AU-stuffings that do not solicit at all the comparator while others give a (unit) step in the phase error: such justifications will be referred to as "critical" (i.e. they are those in correspondence of which the accumulation of 1 byte in the error is reached or exceeded). Given the invariance of the read out edges with respect to the STM (STS) frame and the synchronous character of the storages, it is evident that the critical justification of a tributary unit occur, for a given phase-shift between read and write frames, always for well determined transitions of the AU (when any write edge gets ahead of the corresponding read out edge) : 15) AU = AUc The TU-stuffings, on the contrary, always induce 1-byte sharp variations in the storage occupation (one byte write in excess or in lack). 16) Δε TU = 1 VC byte Given the independence of the write AU- and TU- stuffings, it is possible the overlapping in the same (multi)frame of a critical AU-stuffing with a TU-stuffing of the same sign. In the selected structure, the phase-error at the comparator may then be subjected to 2-bit jumps due to justifications only: 17) Δε c = Δε AUc + Δε TU = 2 VC bytes With regard to stuffing succession it can be observed that: I. a long sequence of write consecutive and monotone TU-stuffings (at the maximum frequency) can be exactly compensated by the read out counterstuffings at the maximum frequency (500 Hz for TU1 or TU2, 2 KHz for TU3); II. a long sequence of consecutive and write monotone AU-stuffings can be entirely compensated by the more or less frequent read counter-justifications; III. in overlapping cases I and II, the read counter-justifications are able to compensate for the effect of the TU-stuffings only, but not for the effect of the AU-stuftings which determine a phase error drift leading the storage up to breaking. From point III above it follows that an important constraint to HPA design consists in assuring the storages holding, expressed e.g. in consecutive and monotone AU-stuffings, (AUs holding), in statistically reasonable conditions of degraded network. In the presence of detune between the timings of the frame entering the MSA of an apparatus of the synchronous hierarchy and of the outgoing frame, the latter will feature a regular and monotone sequence of AU-stuffings to accommodate the frequency difference in the transmission of the carried data. Therefore, it is of normal occurrence the presence of regular and monotone of AU-stuffings in the write frame of an HPA. Being the write AU-stuffings compensated by read TU-stuffings, taking as an example the case of TU12 tributaries, 35 TU-stuffings every 783 AU-stuffings will be originated in a distrituted fashion as Fig. 2 summarizes. The TU-stuffings are generated when any write edge, through the effect of accumulation of 18) N AUgiu = N AUgiu (AUs, TUn,Δ) AU-stuffings having extent 19) Δε AUgiu = Δε AUgiu (AUs, TUn,Δ) equivalent to 3 bytes of AU, gets ahead of the corresponding read edge. Therefore, NAUgiu write AU-stuffings will fall between two subsequent read TU-stuttings, such that 20) N AUgiu * Δε AUgiu = Δε AUc The value of N AUgiu corresponds to the distance between two subsequent AUc. Should the AU-pointer values causing the read TU-counterstuffings be fairly distributed, the generated wander would be minimal (of extent equal to the effect of the single TU-stuffing). Conventionally, the read TU-stuffings are determined by comparison with the thresholds (in a pre-established position) of the phase error value, evaluated at a pre-established point (the decision circuit DEC): more precisely in the stuffing opportunity (multi)frame, the justification is carried out or less on the basis of the error sampled in the immediately preceding (multi)frame (such quantity will be denoted as "error at decision circuit" Δε DEC ). Through a decision criterium of this type, the maximum width of the static band becomes important not much, but the lower (Δε Di ) and upper (Δε Ds ) variations of the phase error with respect to the value sampled at the decision circuit in the preceding (multi)frame, will do. In static conditions the following statements integrate those related to the static band discussed above: the error Δε DEC is a function, besides of the selected decision circuit as it is obvious, of the basic parameters ( Δ, TUn, AUs) in general, from which the shape of the static band depends. 21) Δε DEC = Δε D (Δ, TUn, DEC, AUs) All what said for Δε DEC can be repeated (recalling (3) and (4)) also for the phase error variations in (multi)frame with respect to the decision circuit. 22) Δε Ds = [MAX(Δε(nl)] nl - Δε DEC = Δε Ds (Δ, TUn, DEC, AUs) 23) Δε Di = Δε DEC - [MIN(Δε (nl))] nl = Δε Di (Δ, TUn, DEC,AUs) from eq. (5) it follows that in a single (multi)frame the sum of the error variations with respect to the decision circuit equals the static band independently of the selected decision point 24) Δε Di + Δε Ds = (Δ, TUn, AUs) a statement similar to the preceding one does not apply to maximum amplitudes gathered by scanning all possible AUs; i.e., once defined the limit variations as 25) Δε Di_max [MAX (Δε Di )] AUs = Δε Dim (Δ, TUn, DEC) 26) Δε Ds_max [MAX (Δε Ds )] AUs = Δε Dsm (Δ, TUn, DEC) it may result that 27) Δε Ds_max + Δε Di_max ≥ Δε max from the exhaustive analysis it results that, for TU1 loads, the maximum amplitudes of the error oscillations with respect to any decision point, evalued on all possible AUs, vary only with it 28) Δε Di_max = [MAX(Δε Di )] AUs = Δε Dim (DEC) 29) Δε Ds_max = [MAX(Δε Ds )] AUs = Δε Dsm (DEC) From a dynamic point of view, the considerations made previously extend unchanged also to the variation of the phase error at the decision circuit; thus: the effective variations of the error at the decision circuit, through the effect of the AU-stuffings, are still expressed by equations (11), (12), (13) and the steps produced at the output of the comparator are given by eq. (14); the TU-stuffings always induce 1-byte jumps as indicated in the equation (16). The considerations made so far lead to state that the dimension of an HPA storage with TU-stuffing decided on the phase error sampled in one point can be expressed as 30) DM = Ist + Δε OUTs + Δε OUTi + 2*Δε TU where the position of the lower (Sinf) and upper (Ssup) thresholds (assuming that the addressing starts from zero), is given by 31) Sinf = Δε TU + Δε OUTi - 1 32) Ssup = DM - (Δε TU + Δε OUTs ) - 1 and with stuffing conditions determined by 33) Δε i ≤ Sinf 34) Δε s > Ssup where Ist and Δε TU are known constants with regard to the TU-stuffings (in the order: wander rejection and collection of the single write TU-stuffing) Δε OUTi and Δε OUTs are functions that give the margin (respectively beyond the upper and beyond the lower stuffing threshold) to assure the storage holding also in condition of degraded network: in such condition, in fact, the contributions made by the static band (Δε Di_max and Δε Ds_max ) to the margin to be maintained for tolerating an acceptable number of consecutive AU-stuffings at the maximum frequency, add up. Δε Di_max and Δε Ds_max are bounded to the static band and represent the spacing to be left out of the lower and upper thresholds for the storage holding in steady conditions: they are not constants and introduce a dependence upon DEC for TU1. From the exhaustive analysis (because the aforesaid margin) it results that: 35) Δε OUTi + Δε OUTs > Δε max Hence the problem of storage synthesis can be considered as solved by the individuation of the parameters minimizing the sum of Δε OUTi and Δε OUTs (then eq. 30 with the exception of the constants) and through it, the average propagation delay. As to the wander generated by systematic movements of the write AU-pointer, the values of AUc correspond to those values of AUs for which Δε DEC exceeds the stuffing decision threshold. By examining the mapping of TU12 tributaries in the STM frame, one obtains the distribution of the: 36) N AUgiu = N AUgiu (AUs,Δ) described in Fig. 2. It is observed herein an interval of 45 AU-stuffings between two TU-stuffings, corresponding to a shift of the write frame in a position partially overlapped to the read one, a position in which the static band is reduced and the Δε DEC is not modified. In correspondence with partially overlapped row position there are also smaller intervals in which 24 AU-stuffings are absorbed without TU-counterstuffings. The average value of the phase increase due to one AU-stuffing, referred to the TU12 tributary, is 37) Δε AUgiuMed = number of C12 bits in one frame/number of AU-stuffing equivalent to one frame = 8*32/783 = 0.3269 UI where UI means Unity Interval. The irregularity of 45 AU movements hence corresponds to one jitter equal to 38) J AUmax = 45*Δε AUgiuMed = 14-71 UI As an example, the table of performance (TAB.1) of an optimization achievable with the conventional method is reproduced hereinafter. The values indicated are calculated with a frame format compliant with CCITT specifications. Possible DECISION POINTS for TU12 in STM Fixed parameters: Δ = 1 Variable parameters: DEC = 1+36; TUn = 1+63 DEC (subframe) (edge) Statistic average delay (µs ref. to 2 Mb/s) Jitter from AU-stuffing (UI ref. to 2 Mb/s) Storage Dimension (byte) 4 - # 1 13.43 14.71 5+1st 4 - # 35 13.47 14.71 5+1st 4 - # 36 13.71 14.71 5+1st 4 - # 2 13.75 14.71 5 + 1st 4 - # 3 13.98 14.71 5+1st 4 - # 34 17.14 14.71 6+1st By observing that the capacity and the holding of the HPA elastic storages depends on how the static band disposes itself about the decision point, it is possible to reduce the minimum capacity required by suitably changing the phase error at the decision circuit (then the indication of TU1-stuffing). If the target is to minimize the dimension of the storages it is necessary at first to transform the relation (35) into an equality (reduction of the sum of the error ranges to the theoretical minimum) in such a way as to symmetrize the variation of the phase error with respect to the decision circuit. This result can be reached by changing, in function of the basic parameters Δ, TUn, DEC and AUs, the value sampled in the decision point whereby definition (21) of error at the decision circuit changes as follows 39) Δε DV = Δε DEC + ƒ (Δ, TUn, DEC, AUs) where ƒ is the correction term. Equivalently, instead of changing Δε DEC , it may be thought to bind with complementary law the positions of both thresholds (thus without affecting the TU wander rejection) to Δ, TUn, DEC and AUs (the modes of comparison with the thresholds for the stuffing decision remain unchanged): 40) Sv_inf = Sinf - ƒ (Δ TUn, DEC, AUs) 41) Sv_sup = Ssup - ƒ (Δ, TUn, DEC, AUs) The problem of the choice of the decision point in minimizing the storages can be made marginal by seeing that the position of the thresholds depends on the same variables to which the error Δε DEC is bound: in fact what is changing is only the "shape" of the correcting function ƒ. Operatively, what has been said means to "shift", in function of the AU-pointer of the write frame, the error transitions to the decision circuit in the minimum static band areas. On the contrary, if the target is to reduce to the maximum extent, as close as possible to the theoretical minimum limit, the wander introduced by the conversion of the AU-stuffings at HPA level on any transported load, the threshold variation law must be oriented to the modification of the dynamic behaviour of the storages. It will be necessary to tend toward the equidistribution of transitions of the error at the decision circuit in the range of possible values of the write AU-pointer. For the definition of a simple algorithm of threshold variations the following thesis are essential: I. Invariance of the error phase at the decision circuit with respect to the number of TU (TUn). As long as the write frame SOHs are not inserted between the decision edges (defined on the read out), the value of the phase error sampled at the decision circuit (with stationary TU-pointer obviously) is independent of the serial number of the incoming tributary, i.e. 42) Δε DEC = Δε D (Δ, DEC, AUs) for 43) |Δ| DIMriga ≤ rJ1 + (SD - 1)*NTUmax 44) |Δ| DIMriga ≥ (rJ1 + SOH) + SD*NTUmax where DIMriga is the length of an STM (STS) row, rJ1 are the redundancy columns inserted in the virtual container (VC) of HO and SOH the section columns, SD is the frame sector to which the decision circuit belongs (range number 14 for TU12) and finally NTUmax is the maximum number of transportable Low Order VCs. Therefore it is advisable to choose one decision point in the read multiframe for the tributaries, such that the SOH area of the write frame is not interested; this is always possible, once the offset Δ between the above-mentioned frames has been fixed. II. Invariance of the phase error at the decision circuit with respect to the offset Δ between the SOHs. The variation of the phase error at the decision circuit, for a given tributary unit, expressed in function of the actual value of the AU-pointer, keeps unaltered against the variations of the offset imposed between the frames except for a translation (AU) with respect to one (arbitrary) phase assumed as a reference, e.g. phase 0 corresponding to in-phase frames. III. Invariance of the phase error at the decision circuit with respect to the offset Δ between the SOHs and to the number (TUn) of TUs. The combination of assertions I and II is summarized in the assertion that the error sampled at the decision point depends neither on the tributary number nor on the reciprocal position between read and write, provided that : a) the write SOHs are not positioned in overlapping with the read frame area in which the decision points are located or inequalities 43) and 44) are fully satisfied; b) the value of the independent variable AUs is corrected with the translation defined at II (reduction to phase 0 of the pointer through the adding of the parameter AU0): 45) AU0 = |AUs + ΔAU0| (AUmax + 1) In short, point I allows the definition of a unique threshold variation function common to all tributaries, whilst point II releases the shape of such a function from the various possible positionings between the frames; from point III, it may be asserted that the position of the thresholds depends on the sole AU-pointer, once the configuration parameters (decision point and offset between frames) have been fixed ƒ = ƒ ( AUs ) From the above it is immediate to extrapolate an algorithm which symmetrizes the error pattern about the decision circuit and, at the same time, yet assures, still in a minimum storage condition, the holding towards the critical sequence of stuffings. The algorithm is naturally composed of two separated parts: one, of static configuration, linked to the phase difference imposed between read and write; the other one, evolutionary, is connected to the AU-stuffings. In the following, reference is expressly made to TU12 tributary units in STM. The static configuration phase (software functionality), being performed once and for all at the initialization of the machine, is naturally referred to the controller charged for setting and monitoring the characteristic parameters of the system. It can be broken down into three steps: I. Depending on the reciprocal position of the input and output frames (value of Δ unknown a priori); within interval 0 to 2429 (STM or STS-3 frames); 0 to 809 (STS-1 frames); Selection of two decision points in such a way that, by choosing either, depending on the value Δ the invariance, with respect to Δ and TUn, of the phase error pattern, will occur. II. Determine the correction constant AU0 to be added to the AU-pointer value according to the following procedure considering the first decision point: a) the distance, expressed in bytes, between the write and read frames being known, define as offset. the value of such a distance, to be made a round figure equal to a multiple of three (for instance, but not necessarily, the upper one) should one operate on STM or STS-3 frames; b) assign a fixed value to the AU-pointer of the read frame (e.g. zero), and determine the time position of the byte indicated by this, denoting it, e.g., as J1L; c) the offset of step a) being known, defines the value AUo of the AU-pointer that the write frame should have so that the time position of the byte pointed by this coincide (with error rounded off as in step a)) with the J1L individuated in step b); d) define the correct value of the write AU-pointer as a sum of the parameter AUo defined in step c) and the current write AU-pointer modulo 783; e) process the value obtained at step d) as effective write AU-pointer for the purpose of determining the table describing the modification law of the position of thresholds, considering therein the offset between write and read frames as null. III.Repeat the operation of step II for the second decision point thus obtaining two decision points and two threshold modification tables. The actions contemplated by the evolutional part of the algorithm (hardware functionality) at every multiframe are: I. Reduction to phase zero of the actual value of the pointer through the adding (SUM MODULO 783) of the constant AU0 set by the controller, the above-mentioned offset Δ being known. II. Eventual translation of the thresholds positions in function of the modified value (AU0) of the pointer (THRESHOLDS VARIATION: circuitally it is a matter of combinatory logic). III. Sampling of the phase error at the decision circuit and comparison with the thresholds (stuffing decision to COMPARATOR). IV. TU-stuffing execution (if required) at the first opportunity (subsequent multiframe). Fig. 3 shows how a software function block 1 determines, the Δ between frames being known, which of the two decision circuits is to be used and a correction value Δ AUo 2, and then decides (the signal is on terminal 3), each time, if the thresholds are to be shifted and how. A summing block 5 of the hardware functions 7 dynamically carries out the sum of the AU4 pointer value and the correction value ΔAUo 2. The threshold variation function 6 applies one of the two tables defined above, depending on the programmed decision point. Comparators 14, 15, 16 for every tributary carry out the difference between the read addresses 8, 10, 12 and write ones 9, 11, 13, eventually performing the shifting of the thresholds. The result, for every tributary, is the eventual justification. An optimization example for minimizing the transit time is now illustrated. In case of tributaries TU12 in STM-1 frame, through the application of the threshold variation algorithm, the chosen decision points reduce to only two, summarized in TABLE 3: in this case, in practice, there is a series of positionings between the frames for which the holding can be greater than the limits indicated that refer to the worst conditions (maximum number of values AUs at maximum static band). The choice of using the DECISION CIRCUIT ≠ 1 (V4) or ≠ 36 (in subframe 4) is not casual but is due to realization simplicity reasons (simplification of the hardware circuitry): in fact for them it is a function defined on only two values (defined in a matricial form, it is shown in TABLE 2) of the type: ƒ = 0 → THRESHOLDS IN NOMINAL POSITION ƒ = 1 → THRESHOLDS SHIFTED DOWNWARDS BY ONE UNIT On the contrary, for other decision points, even if belonging to the same frame sectors as the preceding ones, it would be defined on three values such as: ƒ = 0 → THRESHOLDS IN NOMINAL POSITION ƒ = 1 → THRESHOLDS SHIFTED DOWNWARDS BY ONE UNIT ƒ = -1 → THRESHOLDS SHIFTED UPWARDS BY ONE UNIT In Fig. 4, located on x-axis are the values of the write AU-pointer and on y-axis is the space occupied by the elastic storage (with the exception of the read TU-stuffings). The dots represent the phase error pattern, sampled at the decision instant in the assumption of unchanged thresholds. Instead, the stars represent the phase error pattern sampled at the decision instant in the assumption of modified (+1) thresholds in the (multi)frames indicated by the "Xs". Therefore, as exemplified in Fig. 4, the alteration of the position of the thresholds is defined in the multiframes designated by "X". Therewith, the stuffing requests, due to movements of AU-pointers of the write frame, are shifted in a position remote from the dynamic band transitions. As to the problem of the wander generated by systematic movements of write AUs, it is possible to exploit the threshold position modification function in such a way as to reduce the maximum number of consecutive AU-stuffings absorbed without generating TU-stuffings of eq. 36). In other words, the positions of the AUcs are modified in such a way as to reduce the maximum value of N AUgiu . There is imposed that at the area of partially overlapped frames, the position of the thresholds is altered in such a way that requests for stuffing are generated, for instance distributed in three intervals of 27 stuffings each, instead of one 45-stuffing interval followed by two 21-stuffing intervals. Being this a reduced static band area, the shifting of the requests for stuffing (limited to the area itself) does not affect the holding to overlapped write TU- and AU-stuffings that remains equal to the one assured in the other areas of the frame. The magnitude of the inserted wander is: 46) J AUmax = J single just . + 5 = 12.3 UI DEFINITION OF THRESHOLD VARIATION FUNCTION FOR OPTIMIZING THE TRANSIT TIME OF TU12 IN STM : DECISION CIRCUIT ≠ 1 (V4) Row index AU-value range with row shifted thresholds one unit downwards (ƒ=1) 1 523+533 547+554 568+575 589+596 2 610+620 634+641 655+662 676+683 3 697+707 721+728 742+755 763+782 4 - 25+26 46+53 67+74 5 88+98 112+119 133+140 154+161 6 175+185 199+206 220+227 241+248 7 262+272 286+293 307+314 328+335 8 349+359 373+380 394+401 415+422 9 436+446 460+467 481+488 502+509 DEFINITION OF THRESHOLD VARIATION FUNCTION FOR OPTIMIZING THE TRANSIT TIME OF TU12 IN STM: DECISION CIRCUIT ≠ 36 (subframe 4) Row index AU-value range with row shifted thresholds one unit downwards (ƒ=1) 1 523+536 544+557 565+578 586+599 2 610+623 631+644 652+665 673+686 3 697+710 718+731 739+758 - 4 1+2 22+29 43+56 64+77 5 88+101 109+122 130+143 151+164 6 175+188 196+209 217+230 238+251 7 262+275 283+296 304+317 325+338 8 349+362 370+383 391+404 412+425 9 436+449 457+470 478+491 499+512 The indicated values have been computed with a frame format coherent with CCITT Soecs. Characteristics of DECISION POINTS in STM for TU12 with THRESHOLDS VARIABLE in conformity with the law assigned in Table 2 - Variable Parameters : Δ = 1271; TUn = 163 DEC (subframe) (edge) Statistic avg delay (µs ref. to 2 Mb/s) AU-stuffing jitter (UI ref. to 2 Mb/s) Storage capacity (bytes) 4 - #1 11.91 12.3 4+1st 4 - #36 11.60 12.3 4+1st An optimization example for minimizing the generated wander is now illustrated. In case of TU12 tributaries in STM-1 frame, through the application of the threshold variation algorithm the selected decision points are reduced to only two, summarized in TABLE 4. In this case ƒ will be defined on three values such as: ƒ = 0 → THRESHOLDS IN NOMINAL POSITION ƒ = 1 → THRESHOLDS SHIFTED DOWNWARDS BY ONE UNIT ƒ = -1→ THRESHOLDS SHIFTED UPWARDS BY ONE UNIT As exemplified in Fig. 4, the alteration of the position of the thresholds is defined in the multiframes designated by "X". Therewith, the threshold position modification function is exploited to reduce the maximum number of consecutive AU-stuffings absorbed without generating TU-stuffings of eq. 36). In other words, the positions of the AUcs are modified to reduce the maximum value of N AUgiu . It is imposed that requests for stuffings are generated and distributed in the best of the possible ways: instead of 35 stuffings distributed as in Fig. 2, 22 intervals of 22 stuffings and 13 intervals of 23 stuffings are defined, inserted in a regular fashion. The magnitude of the inserted wander is : 47 J AUmax = J single just. + 0.32 = 7.63 UI Definition of threshold variation function for optimization of TU12 wander in STM : decision circuit ≠ 1 (V4) Row Index AU-value range with thresholds having index shifted downwards by one unit (negative row intervals) or upwards (positive intervals) 1 -523+524 - -568+568 -589+591 2 - 610+613 -634+635 -635+658 -676+680 3 - 697+703 -721+725 -742+747 -763+770 4 + 10+24 + 32+45 + 55+66 + 77+87 5 + 100+111 + 122+132 + 144+153 + 167+174 6 + 189+198 +211+219 +234+210 +256+261 7 +279+285 +301+306 +323+327 +346+348 8 +368+372 +390+393 +313+414 - 9 + 435+435 + 457+459 + 480+480 - Definition of threshold variation function for optimization of TU12 wander in STM : decision circuit ≠ 36 (subframe 4) Row Index AU-value range with thresholds having index shifted downwards by one unit (negative row intervals) or upwards (positive rots intervals) 1 -523+527 -544+549 -565+571 -586+594 2 -610+616 -631+638 -652+661 -673+683 3 -697+706 -718+728 -739+750 +774+0 4 + 13+21 + 35+42 + 58+63 + 80+87 5 + 103+108 + 125+129 + 147+150 + 170+174 6 + 192+195 + 214+216 + 237+237 + 259+261 7 + 282+282 - 325+325 - 8 - - 370+370 -391+392 -412+415 9 -436+437 - 457+459 - 478+482 - 499+504

Claims: Method of realizing a higher path adaptation (HPA) function in synchronous digital hierarchy (SDH) equipments, the method being characterized by comprising the step of altering the instants of justification of a read frame tributary unit (TU-pointer) in function of a value of a write frame auxiliary unit pointer (AU-pointer) and depending on the reciprocal position of the input and output frames by modulating decision thresold values of the instants of justification. Method according to claim 1, characterized in that said thresholds are altered in such a way that the instants of justification of the read frame tributary unit (TU-pointer) are for compensating in advance eventual requests for an increase in the amount of memory occupied. Method according to claim 2, characterized in that said thresholds are alterated in such a way as to make the instants of justification of the read frame tributary (TU-pointer) equi-spaced as much as possible. Method according to claim 2, characterized in that the method further comprises the steps of: a) attributing an arbitrary fixed value to the AU-pointer of the read frame; b) providing a phase-error as a difference between a write address and a read address, sampled in correspondence with a write in or a read out of a byte; c) selecting one of a read or write frame with respect to which to sample the phase error defined in step b); d) defining, for every tributary, a decision point in the frame selected at step c) equal for every tributary; e) calculating the phase error at the decision point defined in step d); f) defining a static phase value that the phase error calculated at step e) must have, in an absence of justifications, for every value of the write AU-pointer; g) analyzing the write and read instants implicit in respective write and read frames for obtaining a dynamic band of the storage and for obtaining those values of the write AU-pointer such that a write AU-stuffing generates a discontinuity in the dynamic band of the storage; h) defining in which areas and in which way the phase error computed at step e) should assume a value different from the one defined at step f) so as to compensate in advance for the discontinuity obtained at step g), so that an AU-stuffing as described at step g) does not cause storage of a further byte in the memory; i) defining two thresholds for a stuffing decision, respectively positive and negative, about the static phase of step f); I) applying the alteration of step h) to the position of the thresholds of step i) so that, in so altered areas a request for read TU-stuffing that shifts the phase error calculated in step e) in a position of step h) arises, compensating in advance for the discontinuity of step g); m) defining a storage capacity as a result of the sum of a hysteresis between the thresholds of step i), defining a static band and a margin necessary for tolerating a write TU-stuffing positive or negative, thus eliminating the effects of the dynamic band. Method according to any of claims 1-4, characterized in that said decision thresholds are altered in such a way as to tend to maintain unaltered the minimum spacing between the thresholds recommended by CCITT. Method according to claim 3, characterized by comprising the steps of: a) attributing an arbitrarily fixed value to the read frame AU-pointer; b) defining a phase error as a difference between a write and a read addresses sampled in correspondence with a writing or a reading of a byte; c) choosing one of a read or write frames, with respect to which the phase error of step b) is to be sampled; d) defining for each tributary a decision point in the frame chosen at step c) equal for all the tributaries; e) calculating the phase error at the decision point of step d); f) defining a static phase value that the phase error of step e) must have, in an absence of justifications, for every value of the write AU-pointer; g) obtaining a phase error pattern from the preceding steps; h) measuring a distance between observed discontinuities, in terms of values of AU, the values of the write AU-pointer relative to discontinuities of the pattern obtained at g) corresponding to the positions in which a read TU-stuffing would be performed, in a fixed-threshold system, in case of monotone sequences of write AU-stuffings; i) defining the areas in which the position of the thresholds is alterable in such a way that, by shifting the AU-pointer values for which requests for TU-stuffings are generated, the discontinuities observed at step h) are equispaced as far as possible. Method according to claim 1, characterized by comprising the further step of determining a decision instant of justification that, for all tributaries, never crosses a section overhead (SOH) area in a write frame. Method according to claim 7, characterized by comprising the steps of: a) defining two possible decision points in a read multiframe of a generic TU that belong to two columns of an STM frame, distinct from each other; b) defining a first set of decision circuits as a set of bytes corresponding to a first decision point selected at step a), for all tributaries; c) defining a second set of decision circuits as a set of bytes corresponding to a second decision point selected at step a) for all tributaries; d) according to known offset between read and write frames, determining which set of decision circuits, among those defined at steps b) and c), does not cross the SOH area of the write frame; e) selecting, between the two decision points of step a), for all tributaries, a point whose set satisfies the condition of step d). Method according to claim 1, characterized by comprising the further step of determining a correction factor to be summed to a received value of an auxiliary unit pointer (AU-pointer) to take a relative position of a read frame and a write frame into account. Method according to claim 9, characterized by comprising the steps of: a) selecting an arbitrary reference position of the write frame with respect to the read frame; b) defining a known distance, expressed in bytes, between the write and read frames as an offset therebetween; c) assigning a fixed value to the AU-pointer of the read frame and determining a time position of a byte indicated by it; d) defining, according to the known offset of step b) a parameter value AUo of the AU-pointer that the write frame should have in order that the time position of the byte pointed by it approximate the value individuated at step c) as much as possible; e) defining a correct value of the write AU-pointer as an absolute value of a sum of the parameter value AUo of step d) and a current write AU-pointer, where such absolute value is a maximum value that AU may assume; f) processing the value obtained at step e) as an effective write AU-pointer considering the fixed offset between the write and read frame as having a value equal to the one selected at step a). Circuit arrangement for a realization of a higher path adaptation (HPA) function in SDH equipments, characterized in that it comprises means for altering justification instants of a read frame tributary unit pointer (TU-pointer) as a function of a value of a write frame auxiliary unit pointer (AU-pointer) and depending on the reciprocal position of the input and output frames by applying an alteration law to decision thresold values of the instants of justification. Circuit arrangement according to claim 11, characterized in that it further comprises: means for determining an offset value (Δ) between a write and read frames and a relative correction value (AU0) of the write frame auxiliary unit pointer (AU-pointer); means for adding said relative correction value (AU0) to the write frame auxiliary unit pointer (AU-pointer); means for determining the extent of variation of thresholds; and means for comparing the write and read addresses.

Inventors: FRIGERIO SILVANO, LOMETTI ALBERTO, TRAVERSO GIOVANNI, FRIGERIO, SILVANO, LOMETTI, ALBERTO, TRAVERSO, GIOVANNI
Applicants: CIT ALCATEL, ALCATEL
Application year: 1994
Main classification: H04J3
IPC codes: H04J3