US20080205567A1 - Methods and Receives of Data Transmission Using Clock Domains - Google Patents

Methods and Receives of Data Transmission Using Clock Domains Download PDF

Info

Publication number
US20080205567A1
US20080205567A1 US11/917,083 US91708306A US2008205567A1 US 20080205567 A1 US20080205567 A1 US 20080205567A1 US 91708306 A US91708306 A US 91708306A US 2008205567 A1 US2008205567 A1 US 2008205567A1
Authority
US
United States
Prior art keywords
data
primary
transmitter
receiver
clock
Prior art date
Legal status (The legal status 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 status listed.)
Abandoned
Application number
US11/917,083
Other languages
English (en)
Inventor
Andrei Radulescu
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Koninklijke Philips NV
Original Assignee
Koninklijke Philips Electronics NV
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 Koninklijke Philips Electronics NV filed Critical Koninklijke Philips Electronics NV
Assigned to KONINKLIJKE PHILIPS ELECTRONICS N V reassignment KONINKLIJKE PHILIPS ELECTRONICS N V ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: RADULESCU, ANDREI
Publication of US20080205567A1 publication Critical patent/US20080205567A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/26—Flow control; Congestion control using explicit feedback to the source, e.g. choke packets
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L7/00—Arrangements for synchronising receiver with transmitter
    • H04L7/02—Speed or phase control by the received code signals, the signals containing no special synchronisation information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L7/00—Arrangements for synchronising receiver with transmitter
    • H04L7/04—Speed or phase control by synchronisation signals
    • H04L7/041—Speed or phase control by synchronisation signals using special codes as synchronising signal
    • H04L2007/045—Fill bit or bits, idle words

Definitions

  • the present invention relates to a transmitter.
  • the present invention further relates to a method of transmitting.
  • the present invention further relates to a receiver.
  • the present invention further relates to a method of receiving.
  • the present invention further relates to a data handing unit.
  • the present invention further relates to a network.
  • the present invention further relates to a mobile device.
  • the interconnect centric approach offers a powerful way to rapidly develop new systems.
  • the system is developed as a plurality of nodes.
  • the nodes also denoted as data handling units, comprise functional units e.g. storage units, dedicated processors, general processors and data routing units such as routers and switches.
  • the functional units are arranged in a network formed by the data routing units. It is noted that such a network may be a network on chip, a network coupling various integrating circuits, or a network coupling various computers. It is a fact that the communication protocol of the nodes tends to be standardized, and that a network like architecture may easily be expanded with new nodes, facilitating design.
  • the data is sampled in the destination node (receiver) using the clock of the transmitter sent together with the data. Using one of the known clock-domain crossing techniques, data is then transferred to the clock domain of the receiver.
  • One cost-effective way of achieving this is to define frames of slots in which slots are reserved for guaranteed-throughput communication. This data for which a guaranteed throughput is required will also be denoted as primary data in the sequel. Data used for control of various functions will be denoted as control data. Such a system requires that frames in all devices and switches are synchronized.
  • this purpose is achieved with a method of transmitting according to claim 8 .
  • a receiver according to claim 1 and a transmitter according to claim 7 are combined in a data handling unit as claimed in claim 12 .
  • a plurality of data handling units may be combined in a network as claimed in claim 13 .
  • the receiver communicates to the transmitter the number of slots with primary data that it has received, and converted to its own clock domain.
  • the transmitter uses this information to determine whether the receiver is lagging or leading. If it determines that the receiver is lagging it interrupts its transmission of primary data and signals this to the receiver by transmission of a pause symbol, which is a particular form of control data. In this way the transmitter and the receiver are mutually synchronized.
  • a node will comprise both a receiver and a transmitter as is schematically shown in FIG. 8 . They share a counter: ‘ns’.
  • the transmitter sends data to all its neighbours to signal it slows down.
  • the receivers are those part of a node that run being driven by the clocks in the neighbours.
  • a standard clock domain crossing e.g., 2 flip-flops, or a fifo
  • the received data is transferred in the node's clock domain which comprises the transmitter.
  • the transmitter doesn't signal PAUSEs to the receivers, but sends PAUSE messages to its neighbours.
  • the goal is to synchronize the node and the neighbours.
  • the mutual synchronization of each pair of nodes results in a global synchronization of network allowing for a global scheduling of primary data traffic.
  • FIG. 1 schematically shows a data processing system in which the present invention may be applied
  • FIG. 2 schematically illustrates a scheme of data transfer between two nodes.
  • FIG. 3 shows an example of a data packet in more detail.
  • FIG. 3A shows an example of a data packet in another embodiment of the invention
  • FIG. 3B shows an example of an escape symbol in said another embodiment
  • FIG. 4A schematically shows a method for receiving data
  • FIG. 4B schematically shows a method for transmitting data
  • FIG. 5 schematically shows the interaction between a transmitter and a receiver as a function of time
  • FIG. 6 schematically shows an embodiment of a transmitter according to the invention
  • FIG. 7 schematically shows an embodiment of a receiver according to the invention.
  • FIG. 8 schematically shows a pair of nodes both comprising a combination of a transmitter and a receiver according to the invention.
  • FIG. 1 schematically shows a data processing system in which the present invention may be applied.
  • the data processing system shown is a camera having various functional units, such as a modem 1 , a communication accelerator 2 , a first and a second general purpose processing engine 3 , 6 , a media accelerator 4 , a camera 8 , a display 9 and a mass storage units 5 and 10 as well as an auxiliary device 7 .
  • the functional units are coupled in a network by switches S 1 , S 2 , S 3 and S 4 .
  • the various functional units and switches each operate at their own clock. Although the clocks may approximately have the same speed, an exact synchronization of the clocks cannot be provided.
  • the present invention provides a communication scheme that guarantees that this condition is fulfilled.
  • FIG. 2 schematically illustrates a scheme of data transfer between two nodes.
  • the available time for data transmission is subdivided in time-slots (SL), which are indicated as rectangles.
  • SL time-slots
  • Each time-slot is available for transfer of a packet of data.
  • Part of the time slots is reserved for data requiring a guaranteed throughput, here denoted as primary data such as isochronous data.
  • primary data such as isochronous data.
  • these time slots are indicated by areas ISL.
  • the other time slots are not reserved in advance, but can be granted at run-time for use by other data, also denoted as secondary data.
  • Arbitration mechanisms known as such, e.g. round robin, priority scheduling may be used to select a data packet if two or more data sources want to transfer data along the same link.
  • the remaining data can be transferred as bulk data BD, or as separate chunks of data.
  • the slot reservations repeat after a fixed number of slots.
  • This fixed number of slots is denoted here as a frame.
  • a frame comprises 128 slots, but any number could be applied.
  • a packet comprises for example 131 bytes and slot has a duration of approximately 1 ⁇ s. This corresponds to a data transmission rate of 1 Gbps. In this example, where a frame comprises 128 slots, the frame repetition rate is 8 kHz.
  • FIG. 3 shows an example of a data packet in more detail.
  • the data packet shown comprises a header H, a payload PL and a trailer T.
  • the header H, payload PL and trailer T respectively comprise 2, 128 and 1 byte.
  • header H comprises the following information about the remainder of the packet:
  • a type indicator T 1 , T 2 encode the following types:
  • An empty type of packet indicates that the link is active, but that the transmitted packet contains no data.
  • Isochronous indicates a prescheduled package of a stream requiring a guaranteed throughput. This type of data is indicated as primary data.
  • Best_effort or secondary data, the transmission of which is scheduled at run-time.
  • the escape type allows for a different format of the remainder of the header, which can be useful for various control functions, e.g. for activate a link via which the data is communicated, to deactivate the link, or to indicate an error.
  • the flow control bits F 1 , . . . , F 5 serve to indicate to the receiver of the packet a number of credits. This number indicates the number of packets that can be accepted until buffer overflow occurs.
  • a packet may be returned with the error flag E set.
  • the device receiving the returned packet will execute a retransmission.
  • the number of bytes used in a packet is indicated by the bits L 1 , . . . , L 7 .
  • the last packet in a sequence of BE packets is indicated by the EoP flag.
  • the trailer of the packet is preferably used for an error correction/detection code.
  • FIG. 3A An alternative data format is shown in FIG. 3A .
  • this format a greater number of different types of packets is provided for so that for example flow-control and error information is sent as separate messages, instead of sending them together with a payload.
  • type bits T 1 , T 2 , T 3 are encoded with type bits T 1 , T 2 , T 3 .
  • types are for example
  • BE control data e.g. data for controlling a setting of the device, e.g. volume control, contrast control, which usually only comprises a single packet.
  • ESC symbols The latter may be of normal or urgent type.
  • the header may in addition comprise further data for indicating a source and a destination in the data. For isochronous this information may be encoded in the slot table.
  • FIG. 3B shows in more detail the format of an escape symbol. Whereas the type bits T 1 , T 2 , T 3 indicate that an escape symbol is present, the bits E 1 , . . . , E 5 identify the nature of the escape symbol: Escape symbols may be of type normal or urgent:
  • An example of a normal escape symbol is ESC_FC, which is used for flow control.
  • the payload P 1 , . . . , P 8 indicates the receiver the number of credits, i.e. the number of data units, which the transmitter of the escape symbol is ready to accept.
  • ESC_ERROR to indicate that a received package has an irrecoverable error, and should be retransmitted.
  • the payload comprises a slot number.
  • ESC_PAUSE is used to indicate that the transmitter temporarily stops transmitting primary data to allow the receiver to remain in pace with the transmitter.
  • the ESC symbol includes a trailer for error checking and correction.
  • Panic ESC symbols such as ERROR, SYNC and PAUSE. 2. Isochronous datatraffic, and 3. Normal ESC symbols: FLOW_CTRL 4. BE control 5. (lowest priority) BE bulk
  • FIG. 4A schematically shows a method for receiving data
  • FIG. 4B schematically shows a method for transmitting data.
  • the steps carried out by the transmitter are indicated by T 1 , . . . , T 8 .
  • the steps carried out by the receiver are indicated by R 1 , . . . , R 7
  • step T 1 of the transmitter after startup a slot counter slot and a difference indicator ns are both initialized at 0.
  • step T 2 it is determined for which connected nodes data is available. Subsequently the links connecting those nodes are activated.
  • step T 3 those links connecting to nodes for which no data is available, are set into a sleep-mode.
  • all links may be kept active continuously.
  • step T 4 the available data is transmitted in the form of a packet to its destination.
  • the packet comprises primary data as a payload, and control data in the form of a header and/or a trailer.
  • the control data in the header indicates whether it is followed by primary data in the form of a payload.
  • the control data may indicate the length of the payload.
  • step T 5 the slot counter is incremented, which is representative for the transmitted number of units of primary data.
  • the step of incrementing the counter may be executed before the step of transmitting the primary data.
  • step T 6 it is verified whether the value of the difference indicator ns is greater than 0.
  • the value of ns is the number of transmitted primary data units slot minus the number of primary data units which are received rcv_slot.
  • step T 7 a PAUSE symbol is transmitted. Subsequently the difference indicator ns is decreased by 1.
  • the PAUSE symbol forms control data indicating to the receiving node (receiver) that there is no primary data. In this embodiment the PAUSE symbol replaces one packet of primary data. In other embodiments a different granularity may be selected, e.g. a PAUSE symbol replacing a single byte of primary data, or a PAUSE symbol replacing number of packets.
  • step R 1 the receiver enters active power mode. Active power mode may be initiated by a special control word from the transmitter, or by power on of the data-processing system.
  • step R 2 it receives a control word indicative for a slot number of the next unit of primary data that will be transmitted by the transmitter. It initializes a slot counter with this data.
  • step R 3 the receiver receives a next unit of control data.
  • step R 4 the receiver determines whether this control data unit indicates whether it is followed by primary data or whether it is a PAUSE symbol. In the latter case the receiver waits for the next data unit in step R 3 .
  • the receiver confirms receipt in step R 5 , increments its slot counter in step R 6 , and receives the primary data in the form of a payload and eventually further control data in the form of a trailer.
  • the steps of confirming, incrementing and receiving may be executed in any order or executed in parallel. After steps R 5 , R 6 and R 7 the receiver continues with step R 3 .
  • the slot counter rcv_slot will also be incremented upon receipt of a packet of type EMPTY, or a packet containing secondary (best-effort) data. However, a bonus packet of secondary data, for which the rcv_slot is not incremented, may be transmitted immediately following the PAUSE symbol.
  • ESC_STOP_SLOT for example, which, when preceeding an EMPTY or BE-packet suppresses an incrementation of the rcv_slot counter.
  • the transmitter Upon receipt of the confirmation in step T 8 the transmitter calculates the difference d between the number of transmitted slots of primary data slot and the number of received slots rcv_slot of primary data.
  • the counters slot and rcv_slot are wrap around counters, which can have a relatively low maximum value, in a practical embodiment for example 128. Due to the tight frame synchronization, the difference between the counters is limited to a small value, e.g. 1 or 2, so that aliasing is avoided.
  • ‘d’ is initialized with (slot-rcv_slot). Following this, ‘d’ is incremented when the node's slot is incremented, and decremented when a data for a slot has been received from the neighbour.
  • the difference indicator ns is equal to this difference.
  • the transmitter has to adapt to the slowest one.
  • the difference indicator is calculated as:
  • ns max( ns, d )
  • FIG. 5 schematically shows the interaction between a transmitter and a receiver as a function of time.
  • the receiver has a slower clock than the transmitter.
  • this difference in clock speed is strongly exaggerated in the Figure.
  • the difference in clock speed is for example in the order of 0.1%.
  • the transmitter sends a first packet comprising a header, a payload and a trailer.
  • the payload comprises of primary data and the header and trailer comprise control data
  • the receiver has recognized the header and sends a message announce rcv_slot. After this message is received by the transmitter of the packet of data the counter rcv_slot is incremented at t 1 a .
  • the difference indicator ns is recalculated, and obtains the value minus one.
  • the transmitter has completed transmission of the packet and increases the slotcounter slot.
  • the difference-indicator ns is recalculated and obtains the value 0 again.
  • the transmitter verifies the value of ns in step T 6 and decides that a new packet can be transmitted.
  • the receiving module recognizes the header at t 2 and sends a message announce rcv_slot.
  • the transmitting module increments the counter rcv_slot and recalculates the value of ns, which obtains the value ⁇ 1.
  • the transmitter has completed transmission of the packet, increments counter slot, and recalculates the value of ns, which becomes 0 again. As this value is again 0, when the transmitter executes step T 6 , it decides to send a next packet.
  • the receiver has received and processed the header of this packet and transmits a message announce_rcv slot.
  • the transmitter has received this message, and increments the counter rcv_slot.
  • the latter has already finished transmitting its packet before this point in time, at t 3 b , and has increased its slot counter before t 3 a . Consequently, at the moment that the transmitter executes step T 6 it finds that the difference indicator is greater than 0. Consequently, instead of transmitting a packet, it now transmits a Pause symbol PS. After transmission of the Pause symbol it refrains from sending a payload and a trailer, so that the receiver has time to process the previous packet.
  • the transmitter decrements the difference indicator ns with 1 to 0, and subsequently it transmits a next packet.
  • the transmitter may continue transmitting Pause symbols. Alternatively it may enter a low-power mode. In again another embodiment it may transmit secondary data, e.g. best effort data.
  • the Pause symbol indicates that the receiver refrains from transmitting 1 packet of primary data.
  • the transmitter may interrupt transmission of primary data for a period longer than one packet. In that case the duration may have a predetermined duration e.g. the duration of a fixed number of packets.
  • the Pause symbol may include an indication for the length of the period during which transmission of primary data is interrupted.
  • the receiver can now immediately start to process the next data packet transmitted by the transmitter at t 3 c , and send an ‘announce-receive slot at t 4 . From that point in time the procedure repeats. At t 6 b the delay of the receiver is again incremented to such an amount that the difference indicator is greater than 0, and the transmitter again transmits a Pause symbol.
  • FIG. 6 schematically shows an embodiment of a transmitter TRM according to the invention.
  • a controller CTRL controls a multiplexer M 1 that selects one of a plurality of data sources to provide data for the output.
  • a data source HEAD is comprised, which provides a header for a data packet.
  • a second data source TRAIL provides a trailer, which may comprise for example an error correction code.
  • a third data source provides a PAUSE symbol to indicate that the transmitter interrupts transmission of primary data.
  • a fourth data source PRIMARY provides the primary data.
  • a fifth data source SECONDARY provides secondary data.
  • Various other data sources may be present for selection, e.g. to provide various control symbols, e.g. for activate a link via which the data is communicated, to deactivate the link, or to indicate an error.
  • the transmitter has an output TO for providing the selected data to a receiver.
  • the transmitter further has an input TI for receiving the announced number of received slots.
  • the controller observes the value of difference indicator ns.
  • the difference indicator is decremented with signal DEC when a PAUSE symbol is transmitted and when the number of transmitted slots slot or the number of received slots, announced by the receiver, is updated.
  • the difference indicator is coupled to a subtractor S 2 via a maximum function module MAX.
  • the latter module has apart from a first input coupled to the subtractor S 2 a second input coupled to difference indicator register.
  • the subtractor calculates a difference between the actual number of transmitted primary data units (slot), and the number of primary data units rcv_slot that the receiver has announced it has received.
  • FIG. 7 schematically shows an embodiment of a receiver according to the invention.
  • the receiver RCV has an input RI for receiving a stream of data from the transmitter TRM at a data rate corresponding to the clock of the transmitter. It further has a first comparator PRIM for determining whether the data it is receiving is the header of a packet of primary data. In that case it transmits a message announce_rcvslot to the transmitter.
  • the receiver further has a second comparator PAUSE, for recognizing whether it has received a PAUSE symbol. This comparator control a gate GT which couples a buffer BUF to the input I. If a PAUSE symbol is recognized, the gate is closed so that filling of the buffer is interrupted during a length of time corresponding to a data packet.
  • the gate GT is opened, so that the buffer can be filled at the speed of the clock CLT of the transmitter.
  • the clock CLT is provided via a separate connection.
  • the clock is embedded in the data stream.
  • the buffer is read out by a data processing unit DPU at a clock rate CLR of the receiver. Instead of interrupting the filling of the buffer when a PAUSE symbol is recognized, all data may be loaded in the buffer. In that case a read pointer indicative for the current position that is read from the buffer may be advanced with a number of positions corresponding to the size of a packet. Alternatively the PAUSE symbol may include information indicating the number of positions in the buffer that may be skipped.
  • FIG. 8 schematically shows a pair of nodes.
  • the first node N 1 comprises a combination of a transmitter TRI and a receiver RC 1 .
  • the second node N 2 comprises a combination of a transmitter TR 2 and a receiver RC 2 .
US11/917,083 2005-06-13 2006-06-12 Methods and Receives of Data Transmission Using Clock Domains Abandoned US20080205567A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
EP05105166 2005-06-13
EP05105166.2 2005-06-13
PCT/IB2006/051856 WO2006134537A1 (fr) 2005-06-13 2006-06-12 Emetteur, recepteur, procede d'emission, procede de reception, unite de manipulation de donnees, reseau ainsi que dispositif mobile

Publications (1)

Publication Number Publication Date
US20080205567A1 true US20080205567A1 (en) 2008-08-28

Family

ID=37074244

Family Applications (1)

Application Number Title Priority Date Filing Date
US11/917,083 Abandoned US20080205567A1 (en) 2005-06-13 2006-06-12 Methods and Receives of Data Transmission Using Clock Domains

Country Status (5)

Country Link
US (1) US20080205567A1 (fr)
EP (1) EP1894337A1 (fr)
JP (1) JP2008544623A (fr)
CN (1) CN101199156A (fr)
WO (1) WO2006134537A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2503473A (en) * 2012-06-27 2014-01-01 Nordic Semiconductor Asa Data transfer from lower frequency clock domain to higher frequency clock domain
FR3036241B1 (fr) * 2015-05-12 2017-06-02 Peugeot Citroen Automobiles Sa Procede et dispositif de controle de la transmission de trames dans un reseau video bidirectionnel
CN108958701A (zh) * 2017-05-22 2018-12-07 深圳市中兴微电子技术有限公司 一种数据传输控制方法、装置及存储介质

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5918020A (en) * 1997-02-28 1999-06-29 International Business Machines Corporation Data processing system and method for pacing information transfers in a communications network
US6768742B1 (en) * 1999-10-08 2004-07-27 Advanced Micro Devices, Inc. On-chip local area network
US20050123048A1 (en) * 2003-11-20 2005-06-09 Seiko Epson Corporation Image data compression device and encoder
US7003059B1 (en) * 1999-11-01 2006-02-21 Intel Corporation Jabber counter mechanism for elastic buffer operation
US20060077898A1 (en) * 2003-07-18 2006-04-13 Tomoyuki Yamaguchi Transmission base flow control device
US20070038793A1 (en) * 2001-08-24 2007-02-15 Wehage Eric R General input/output architecture, protocol and related methods to manage data integrity
US7224984B2 (en) * 2000-08-15 2007-05-29 University Of Maryland, College Park Method, system and computer program product for positioning and synchronizing wireless communications nodes
US7272672B1 (en) * 2003-04-01 2007-09-18 Extreme Networks, Inc. High speed bus with flow control and extended burst enhancements between sender and receiver wherein counter is maintained at sender for free buffer space available
US7355735B1 (en) * 2000-06-14 2008-04-08 Yona Sivan Real time fax over packet based network
US7362772B1 (en) * 2002-12-13 2008-04-22 Nvidia Corporation Network processing pipeline chipset for routing and host packet processing
US7500004B1 (en) * 1999-12-29 2009-03-03 Gregg Homer System for tracking files transmitted over the internet

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5894567A (en) * 1995-09-29 1999-04-13 Intel Corporation Mechanism for enabling multi-bit counter values to reliably cross between clocking domains
US6813275B1 (en) * 2000-04-21 2004-11-02 Hewlett-Packard Development Company, L.P. Method and apparatus for preventing underflow and overflow across an asynchronous channel
GB2362777B (en) * 2000-05-25 2002-05-08 3Com Corp System for detection of asynchronous packet rates and maintenance of maximum theoretical packet rate

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5918020A (en) * 1997-02-28 1999-06-29 International Business Machines Corporation Data processing system and method for pacing information transfers in a communications network
US6768742B1 (en) * 1999-10-08 2004-07-27 Advanced Micro Devices, Inc. On-chip local area network
US7003059B1 (en) * 1999-11-01 2006-02-21 Intel Corporation Jabber counter mechanism for elastic buffer operation
US7500004B1 (en) * 1999-12-29 2009-03-03 Gregg Homer System for tracking files transmitted over the internet
US7355735B1 (en) * 2000-06-14 2008-04-08 Yona Sivan Real time fax over packet based network
US7224984B2 (en) * 2000-08-15 2007-05-29 University Of Maryland, College Park Method, system and computer program product for positioning and synchronizing wireless communications nodes
US20070038793A1 (en) * 2001-08-24 2007-02-15 Wehage Eric R General input/output architecture, protocol and related methods to manage data integrity
US7362772B1 (en) * 2002-12-13 2008-04-22 Nvidia Corporation Network processing pipeline chipset for routing and host packet processing
US7272672B1 (en) * 2003-04-01 2007-09-18 Extreme Networks, Inc. High speed bus with flow control and extended burst enhancements between sender and receiver wherein counter is maintained at sender for free buffer space available
US20060077898A1 (en) * 2003-07-18 2006-04-13 Tomoyuki Yamaguchi Transmission base flow control device
US20050123048A1 (en) * 2003-11-20 2005-06-09 Seiko Epson Corporation Image data compression device and encoder

Also Published As

Publication number Publication date
WO2006134537A1 (fr) 2006-12-21
EP1894337A1 (fr) 2008-03-05
CN101199156A (zh) 2008-06-11
JP2008544623A (ja) 2008-12-04

Similar Documents

Publication Publication Date Title
US5761430A (en) Media access control for isochronous data packets in carrier sensing multiple access systems
US5761431A (en) Order persistent timer for controlling events at multiple processing stations
EP0525985B1 (fr) Interface de liaison bidirectionnelle de données à haute vitesse
US8111623B2 (en) Node, method and system for control of communication including a buffer
US6339584B1 (en) Media access control for isochronous data packets in carrier sensing multiple access systems
CN108599908B (zh) 通信系统和半导体设备
US20080205567A1 (en) Methods and Receives of Data Transmission Using Clock Domains
US11601375B2 (en) Electronic device and frame transmission method of electronic device
US6580711B1 (en) Serial interface circuit and signal processing method of the same
KR100967722B1 (ko) 전자 장치, 프레임 동기화 방법, 이동 장치 및 데이터 처리시스템
Hartwich et al. Introducing can xl into can networks
JP2010245638A (ja) 映像データ通信システム
JPH10224359A (ja) データ転送フロー制御方式
EP3671720B1 (fr) Système de transfert de données sur puce en temps réel
US7206881B2 (en) Arrangement and method for controlling dataflow on a data bus
US7286470B1 (en) Messaging system for a packet transport system and method of operation thereof
CN117675719A (zh) 队列调度方法及装置
JP2006128859A (ja) フレーム転送装置及びフレーム転送システム
JPH10285236A (ja) 信号処理回路
JP2001211191A (ja) データ伝送装置
JPS59107666A (ja) マルチアクセス通信装置
JPH05199242A (ja) データ通信装置
JPS5997248A (ja) コミユニケ−シヨン方式
JP2003348106A (ja) 帯域幅測定システム、ネットワークノード装置、帯域幅測定方法及びネットワーク
JPH06205018A (ja) シリアル多重通信システム

Legal Events

Date Code Title Description
AS Assignment

Owner name: KONINKLIJKE PHILIPS ELECTRONICS N V, NETHERLANDS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:RADULESCU, ANDREI;REEL/FRAME:020222/0165

Effective date: 20070213

Owner name: KONINKLIJKE PHILIPS ELECTRONICS N V,NETHERLANDS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:RADULESCU, ANDREI;REEL/FRAME:020222/0165

Effective date: 20070213

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION