WO1995010897A1 - Procede de mise en memoire tampon et memoire tampon associee - Google Patents

Procede de mise en memoire tampon et memoire tampon associee Download PDF

Info

Publication number
WO1995010897A1
WO1995010897A1 PCT/FI1994/000462 FI9400462W WO9510897A1 WO 1995010897 A1 WO1995010897 A1 WO 1995010897A1 FI 9400462 W FI9400462 W FI 9400462W WO 9510897 A1 WO9510897 A1 WO 9510897A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
buffer
bit
memory
synchronization
Prior art date
Application number
PCT/FI1994/000462
Other languages
English (en)
Inventor
Toni Oksanen
Jari Patana
Esa Viitanen
Original Assignee
Nokia Telecommunications Oy
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nokia Telecommunications Oy filed Critical Nokia Telecommunications Oy
Priority to GB9607820A priority Critical patent/GB2297464B/en
Priority to DE4497707A priority patent/DE4497707B4/de
Priority to AU78153/94A priority patent/AU7815394A/en
Priority to DE4497707T priority patent/DE4497707T1/de
Publication of WO1995010897A1 publication Critical patent/WO1995010897A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F5/00—Methods or arrangements for data conversion without changing the order or content of the data handled
    • G06F5/06—Methods or arrangements for data conversion without changing the order or content of the data handled for changing the speed of data flow, i.e. speed regularising or timing, e.g. delay lines, FIFO buffers; over- or underrun control therefor
    • G06F5/16—Multiplexed systems, i.e. using two or more similar devices which are alternately accessed for enqueue and dequeue operations, e.g. ping-pong buffers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J3/00—Time-division multiplex systems
    • H04J3/02—Details
    • H04J3/06—Synchronising arrangements
    • H04J3/062—Synchronisation of signals having the same nominal but fluctuating bit rates, e.g. using buffers
    • H04J3/0626—Synchronisation of signals having the same nominal but fluctuating bit rates, e.g. using buffers plesiochronous multiplexing systems, e.g. plesiochronous digital hierarchy [PDH], jitter attenuators

Definitions

  • CCITT (recommendation G.709) defines several different mapping modes (asynchronous, bit synchronous and byte synchronous) for a 2048 bit/s signal in the frame structure of the SDH system, depending on the type of the incoming 2048 kbit/s signal [i.e.
  • bits arrive for instance asynchronously, or is there, in addition to the clock signal, for instance byte synchronization data (indicating which 8 bits are included in the same byte), frame synchronization data or multiframe synchronization data included] .
  • Asynchronous, bit synchronous and byte synchronous signals are defined in CCITT recommendations G.703 and G.704.
  • the synchronization is passed through a buffer typically so that together with every data bit, a separate synchronization bit is transferred.
  • the object of the present invention is to pro ** **: de a solution which allows a combined bit and byte buf:....r to be implemented in the simplest possible manner.
  • This object is achieved with the method and the buffer of the invention, the method being characterized by what is described in the characterizing part of the appended claim 1, and the buffer being characterized by what is described in the characterizing part of the appended claim 2.
  • the idea of the invention is to implement the buffer in a certain length with respect to the frame and byte lengths of the data to be transferred and to utilize this length in passing through a synchronization signal by forming a memory location for the synchronization signal bit adjacent to only one data bit. This allows the synchronization signal to be passed in the simplest possible manner through the buffer correctly, i.e.
  • Figure 1A illustrates the principal features of the bit buffer of the invention
  • Figure IB illustrates the interdependence between the frame structure of the data coming into the buffer and the buffer
  • FIG. 2 shows a more detailed structural alternative of the bit buffer of the invention.
  • Figure 1 shows the principle of the elastic bit buffer of the invention in simplified form.
  • the core of the buffer consists of a buffer memory 13 which functions as a temporary data storage and with which is associated in a manner known per se (a) a write counter 11, which controls the writing into the buffer memory by giving write addresses to the write input of the buffer memory and (b) a read counter 12, which controls the reading from the buffer memory by giving read addresses to the read input of the buffer memory.
  • the write counter steps in synchronism with a write clock WR_CLK and the read counter in synchronism with a read clock RD_CLK.
  • the buffer memory consists of M pieces of one-bit data memory locations 14, which are numbered from zero to (M-l), and of one memory location 15 which is arranged for the synchronization bit and which is adjacent to one data memory location 14.
  • the buffer memory length M is connected with a frame 16 ( Figure IB) of an incoming signal in such a way that the frame length in bits corresponds to the multiple of the buffer memory length.
  • the buffer memory length M must be divisible by the byte length (which is typically eight).
  • the frame length F and the buffer memory length M correlate thus with each other in the following way:
  • the synchronization is passed through the buffer by writing a synchronization bit SB to said adjacent memory location 15.
  • the synchronization bit is written to the memory location adjacent to the data memory location in address zero, but the synchronization memory location can in principle be situated in any address 0...(M-1) (adjacent to the data memory location situated in said address).
  • FIG. 2 shows a more detailed embodiment of the buffer of the invention.
  • Data memory locations consist in this case of M pieces of D-flip-flops 21, to data inputs D of which is connected incoming data R_DATA.
  • the data memory locations are separated from each other by references M(0)...M(M-l) referring to their respective addresses.
  • the write clock signal WR_CLK is connected to the clock inputs of D-flip-flops 24 and 25 and to the clock inputs of the data memory locations 21.
  • a signal WR_EN enabling writing is connected to enable inputs EN of the write counter 22, of the D-flip-flop 25 and of a decoder 23.
  • the synchronization signal WR_S which is passed through the buffer, is connected to the synchronization input LD of the write counter and to the data input D of the D-flip-flop 25.
  • the pulse of the synchronization signal constitutes a synchronization bit, which appears in the output of the D-flip-flop 25 at the same time as the write counter output has the value zero.
  • the output Q of the write counter 22 is connected to the decoder 23, which codes from the counter value an enable signal for each data memory location, this signal enabling writing to said memory location if the enable signal coming to the decoder is active.
  • the enable signal acquired from the decoder output zero is connected to the enable input EN of a separate synchronization memory location 24 implemented by one D-flip-flop. In this case, the data memory location 21/M(0) and the synchronization memory location 24 are thus adjacent to each other in the address zero.
  • each data memory location 21 is connected to a corresponding input of a data multiplexer 26, i.e. the output of the memory location zero (M(0)) is connected to the input zero of the data multiplexer, the input of the memory location one (M(l)) is connected to the input one of the multiplexer, etc. , and the output of the data memory location (M(M-l)) in the address M-l is connected to the input (M-l) of the multiplexer.
  • the output Q of the synchronization memory location 24 is connected to the first data input (input zero) of the multiplexer 26.
  • a fixed value F zero, for instance
  • F zero, for instance
  • SEL selection input
  • a synchronization signal RD_S is thus acquired from the output of the multiplexer 27.
  • the write counter 22 steps in synchronism with the write clock signal R_CLK continuously from zero to value (M-l), thus counting incoming bits.
  • the data bits are written into the data memory locations 21 in succession in such a way that the first bit is written in the address zero, the second bit in the address one etc., and after M bits, the whole procedure is restarted by writing again in the address zero (from which the previous value has by then been read out).
  • the read counter steps in a similar manner in synchronism with the read clock signal RD_CLK.
  • the read counter has the value zero, the synchronization bit is selected to the output of the multiplexer 27, and with the other values of the counter, a predetermined fixed value F is selected to the output.
  • each data memory 0...(M-l) is selected one after another to the output of the data multiplexer 26, whereby a data signal passed through the buffer is acquired from the output of the data multiplexer (this signal being indicated by reference RD_DATA), and the synchronization signal RD_S passed through the buffer is acquired from the output of the multiplexer 27.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Hardware Design (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Synchronisation In Digital Transmission Systems (AREA)
  • Information Transfer Systems (AREA)
  • Communication Control (AREA)

Abstract

L'invention porte sur un procédé de mise en mémoire tampon dans un système numérique de télécommunication, dans lequel les données sont transférées par blocs de F bits et selon lequel elles sont inscrites dans la mémoire tampon en synchronisme avec un signal d'horloge d'écriture (WR-CLK), et lues dans ladite mémoire en synchronisme avec un signal d'horloge de lecture (RD-CLK). Pour mettre en application la mémoire tampon pour bits et octets le plus simplement possible, celle-ci est divisée en M parties correspondant chacune à un site (14; 21) de mémorisation de données d'un bit, M étant choisi tel que la longueur F du bloc soit divisible par M, que M soit divisible par la longueur de l'octet, et qu'enfin, les données de synchronisation traversant la mémoire tampon soient emmagasinées dans des sites de mémorisation d'un bit (15; 24) contigus à l'un des sites (14; 21) de mémorisation de données
PCT/FI1994/000462 1993-10-14 1994-10-13 Procede de mise en memoire tampon et memoire tampon associee WO1995010897A1 (fr)

Priority Applications (4)

Application Number Priority Date Filing Date Title
GB9607820A GB2297464B (en) 1993-10-14 1994-10-13 A buffering method and a buffer
DE4497707A DE4497707B4 (de) 1993-10-14 1994-10-13 Pufferungsverfahren und Puffer
AU78153/94A AU7815394A (en) 1993-10-14 1994-10-13 A buffering method and a buffer
DE4497707T DE4497707T1 (de) 1993-10-14 1994-10-13 Pufferungsverfahren und Puffer

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FI934544A FI94697C (fi) 1993-10-14 1993-10-14 Menetelmä digitaalisessa tietoliikennejärjestelmässä suoritettavan puskuroinnin toteuttamiseksi sekä puskuri
FI934544 1993-10-14

Publications (1)

Publication Number Publication Date
WO1995010897A1 true WO1995010897A1 (fr) 1995-04-20

Family

ID=8538782

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/FI1994/000462 WO1995010897A1 (fr) 1993-10-14 1994-10-13 Procede de mise en memoire tampon et memoire tampon associee

Country Status (5)

Country Link
AU (1) AU7815394A (fr)
DE (2) DE4497707B4 (fr)
FI (1) FI94697C (fr)
GB (1) GB2297464B (fr)
WO (1) WO1995010897A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1996021897A1 (fr) * 1995-01-11 1996-07-18 Telefonaktiebolaget Lm Ericsson (Publ) Systeme de transmission de donnees
EP0758770A1 (fr) * 1995-08-14 1997-02-19 Deutsche Thomson-Brandt Gmbh Méthode et circuit pour la resynchronisation de la commande d'une mémoire
EP0798863A1 (fr) * 1996-03-29 1997-10-01 Koninklijke Philips Electronics N.V. Convertisseur analogique/numérique à fréquence d'échantillonnage élevée

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0251588A2 (fr) * 1986-06-19 1988-01-07 General Datacomm, Inc. Multiplexeur entrelacé de bits avec synchronisation d'octets pour des équipements en communication

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI94812C (fi) * 1993-05-18 1995-10-25 Nokia Telecommunications Oy Menetelmä ja laite tasauspäätöksen aikaansaamiseksi synkronisen digitaalisen tietoliikennejärjestelmän solmupisteessä

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0251588A2 (fr) * 1986-06-19 1988-01-07 General Datacomm, Inc. Multiplexeur entrelacé de bits avec synchronisation d'octets pour des équipements en communication

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
PATENT ABSTRACTS OF JAPAN, Vol. 10, No. 248, E-431; & JP,A,61 075 649 (HITACHI LTD), 18 April 1986. *
PATENT ABSTRACTS OF JAPAN, Vol. 7, No 288, E-218; & JP,A,58 164 350 (YOKOGAWA DENKI SEISAKUSHO K.K.), 29 Sept. 1983. *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1996021897A1 (fr) * 1995-01-11 1996-07-18 Telefonaktiebolaget Lm Ericsson (Publ) Systeme de transmission de donnees
US6009107A (en) * 1995-01-11 1999-12-28 Telefonaktiebolaget Lm Ericsson Data transmission system
EP0758770A1 (fr) * 1995-08-14 1997-02-19 Deutsche Thomson-Brandt Gmbh Méthode et circuit pour la resynchronisation de la commande d'une mémoire
EP0798863A1 (fr) * 1996-03-29 1997-10-01 Koninklijke Philips Electronics N.V. Convertisseur analogique/numérique à fréquence d'échantillonnage élevée
FR2746987A1 (fr) * 1996-03-29 1997-10-03 Philips Electronics Nv Convertisseur analogique/numerique a frequence d'echantillonnage elevee

Also Published As

Publication number Publication date
FI934544A (fi) 1995-04-15
GB9607820D0 (en) 1996-06-19
DE4497707B4 (de) 2004-12-23
DE4497707T1 (de) 1996-10-31
FI94697B (fi) 1995-06-30
GB2297464A (en) 1996-07-31
AU7815394A (en) 1995-05-04
FI934544A0 (fi) 1993-10-14
FI94697C (fi) 1995-10-10
GB2297464B (en) 1997-12-10

Similar Documents

Publication Publication Date Title
JP3429308B2 (ja) ポインタを含むフレーム構造を分解及び組立する方法
CA2031054C (fr) Methode de multiplexage et de demultiplexage a inversion
US4667324A (en) Network multiplex structure
EP0437197A2 (fr) Appareil de brassage numérique
US4392234A (en) PCM Signal interface apparatus
US5978377A (en) STM-based ATM cell physical layer processing circuit
US7245641B2 (en) Variable length packet switching system
JP3429307B2 (ja) 同期デジタル遠隔通信システムにおけるエラスティックバッファ方法及び装置
JP3429309B2 (ja) 同期デジタル遠隔通信システムにおけるエラスティックバッファメモリの充填率を監視する方法及び装置
EP0543327B1 (fr) Système synchrone de multiplexage optique
US7924938B2 (en) Context-sensitive overhead processor
WO1995010897A1 (fr) Procede de mise en memoire tampon et memoire tampon associee
JPH04211535A (ja) 特定フレーム構造体への情報ビットの挿入装置
US7016344B1 (en) Time slot interchanging of time slots from multiple SONET signals without first passing the signals through pointer processors to synchronize them to a common clock
US20020026568A1 (en) Serial data mapping apparatus for synchronous digital hierarchy
KR100271311B1 (ko) 광가입자 전송장치에서의 관리단위신호에 대한 관리단위 포인터및 계위단위 포인터 처리장치
KR0153688B1 (ko) 동기식 전송장치에 있어서 dram을 이용한 tu신호 정렬장치
JP2548709B2 (ja) 多重フレ−ムアライナ
JP2976732B2 (ja) 同期光多重化装置
JP3010634B2 (ja) フレーム同期多重処理方式
KR100201330B1 (ko) 동기식 다중화장치에서 tu포인터 버퍼 리셋에 따른v5클럭 보상회로
JPH0758753A (ja) インタフェース回路
JPH098761A (ja) ポインタ処理回路
JPH11284590A (ja) 多重化送信装置、分離化受信装置および多重分離化送受信装置
JPH08107416A (ja) Ａｔｍセル信号フォーマット変換装置

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AM AT AU BB BG BR BY CA CH CN CZ DE DK EE ES FI GB GE HU JP KE KG KP KR KZ LK LR LT LU LV MD MG MN MW NL NO NZ PL PT RO RU SD SE SI SK TJ TT UA US UZ VN

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): KE MW SD SZ AT BE CH DE DK ES FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
RET De translation (de og part 6b)

Ref document number: 4497707

Country of ref document: DE

Date of ref document: 19961031

WWE Wipo information: entry into national phase

Ref document number: 4497707

Country of ref document: DE

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: CA

REG Reference to national code

Ref country code: DE

Ref legal event code: 8607