The present invention relates broadly to devices in communication over a network. Specifically, the present invention relates to data flow management between devices transmitting and receiving data at different transmission rates. More specifically, the present invention relates to controlling data flow through a buffer by monitoring the buffer and adjusting data transmission based on buffer conditions.
A “bus” is a collection of signals interconnecting two or more electrical devices that permits one device to transmit information to one or more other devices. There are many different types of busses used in computers and computer-related products. Examples include the Peripheral Component Interconnect (“PCI”) bus, the Industry Standard Architecture (“ISA”) bus and Universal Serial Bus (“USB”), to name a few. The operation of a bus is usually defined by a standard which specifies various concerns such as the electrical characteristics of the bus, how data is to be transmitted over the bus, how requests for data are acknowledged, and the like. Using a bus to perform an activity, such as transmitting data, requesting data, etc., is generally called running a “cycle.” Standardizing a bus protocol helps to ensure effective communication between devices connected to the bus, even if such devices are made by different manufacturers. Any company wishing to make and sell a device to be used on a particular bus, provides that device with an interface unique to the bus to which the device will connect. Designing a device to particular bus standard ensures that device will be able to communicate properly with all other devices connected to the same bus, even if such other devices are made by different manufacturers. Thus, for example, an internal fax/modem (ie., internal to a personal computer) designed for operation on a PCI bus will be able to transmit and receive data to and from other devices on the PCI bus, even if each device on the PCI bus is made by a different manufacturer.
Currently, there is a market push to incorporate various types of consumer electronic equipment with a bus interface that permits such equipment to be connected to other equipment with a corresponding bus interface. For example, digital cameras, digital video recorders, digital video disks (“DVDs”), printers are becoming available with an IEEE 1394 bus interface. The IEEE (“Institute of Electrical and Electronics Engineers”) 1394 bus, for example, permits a digital camera to be connected to a printer or computer so that an image acquired by the camera can be printed on the printer or stored electronically in the computer. Further, digital televisions can be coupled to a computer or computer network via an IEEE 1394 bus.
However, many devices exist without any sort of IEEE 1394 interface. This presents a problem as such devices are unable to be to be connected with other devices as described above. There is a heartfelt need to overcome this problem to provide connectivity to devices that otherwise cannot be connected to a IEEE 1394 bus.
In one aspect of the invention, controlling the transmission of data from a computer to a video client via an interface device that buffers the data frames sent and communicates to the computer and the video client using different protocols is disclosed. In an embodiment, the present invention provides a method of performing data transmission flow control by polling the interface a first time to determine the size of the buffer on the interface; receiving a first buffer size value from the interface; sending a plurality of frames of video and audio data to the buffer on the interface such that a delay period exists between the sending of each frame; polling the interface a second time to determine buffer size after the frames are sent to the interface; and receiving a second buffer size value from the interface. If the second buffer size value is larger than the optimal size, and larger than the first buffer size value, then the delay period between transmission of frames from the computer to the interface is increased.
In another embodiment, the present invention provides a method of performing data transmission flow control, by polling the interface a first time to determine the size of the buffer on the interface; receiving a first buffer size value from the interface; sending a plurality of frames of video and audio data to the buffer on the interface such that a delay period exists between the sending of each frame; polling the interface a second time to determine buffer size after the frames are sent to the interface; and receiving a second buffer size value from the interface.
If the second buffer size value is smaller than optimal size, and smaller than the first buffer size value, then the delay period between transmission of frames from the computer to the interface is decreased.
In a second aspect of the invention, a method of performing data transmission flow control is disclosed for use in a system having a computer, a video client, and an interface coupled between the computer and the video client, the interface having a buffer adapted to store data frames received from the computer to be sent to the video client. In one embodiment, the method comprises determining a first buffer fill amount of the buffer; sending frames of data in an isochronous manner to the buffer via the interface such that a number of cycles exists between the sending of at least a portion of the frames; determining a second buffer fill amount after the are sent to the buffer on the interface; and changing the number of cycles between transmission of frames from the computer to the buffer on the interface based in part on the relative size of the second buffer fill amount as compared with the first buffer fill amount.
In a third aspect of the invention, a computer readable apparatus that performs data transmission flow control is disclosed. In one embodiment, the computer readable apparatus has a storage medium containing instructions which, when executed by a computer: polls an interface buffer in communication with the computer to determine a first buffer fill amount, the buffer storing a number of data frames received from the computer, the buffer having a fill amount that varies with the number of data frames contained in the buffer; sends the number of data frames in an isochronous manner to the buffer of the interface such that a number of cycles exists between the sending of at least some of the frames; polls the interface to determine a second buffer fill amount, the polling to determine the second buffer fill amount occurring after the number of data frames are sent to the buffer; and modulates the number of cycles between frames in a subsequent transmission from the computer to the buffer based at least in part on the relative size of the second buffer fill amount as compared with the first buffer fill amount.
In a fourth aspect of the invention, an apparatus for performing data transmission flow control is disclosed. In one embodiment, the apparatus includes first apparatus adapted to determine a first buffer fill amount of the buffer on an interface at a first time; second apparatus adapted to send frames of data in an isochronous manner to the buffer on the interface such that a delay period exists between the sending of at least a portion of the plurality of frames; third apparatus adapted to determine a second buffer fill amount after the frames are sent to the buffer on the interface; and where if the second buffer fill amount value is smaller than an optimal buffer fill amount value, and smaller than the first buffer fill amount value, the second apparatus decreases the delay period, and if the second buffer fill amount value is larger than the optimal buffer fill amount value, and larger than the first buffer fill amount value, the second apparatus increases the delay period.
Many other features and advantages of the present invention will be realized by reading the following detailed description, when considered in conjunction with the accompanying drawings, in which:
Directing attention to
The format of frame 108 is illustrated in
Interface 106, upon converting the input received from client 102 and converting it to scan lines and organizing it into frames 108, sends a frame at each vertical blanking interval to provide synchronization with computer 100. Computer 100 can derive the vertical blanking interval from the frequency of frames received and synchronize itself with the audio and video data of the incoming frames 108 received from interface 106. In this manner, processing resources are preserved, as there is no need to perform synchronization on each frame as it is received, thus providing higher quality performance of audio and video display on computer 100.
As illustrated in
In an alternative embodiment of the present invention, frames adhering to the serial digital interface (SDI) standard can be utilized as illustrated in
As shown in
In another aspect of the present invention, external clocking can be utilized to synchronize data transmission between computer 100, interface 106 and client 102. In an embodiment, client 102 includes a high-quality reference clock 180 (
Interface 106 includes a serial unit 300 for enabling communication across bus 104. Serial unit 300 includes a unit directory 302 as shown in Table 1.
The Unit_Spec_ID value specifies the organization responsible for the architectural definition of serial unit 300. The Unit_SW_Version value, in combination with Unit_Spec_ID value, specifies the software interface of the unit. The Unit_Register_location value specifies the offset in the target device's initial address space of the serial unit registers. The Unit_Signals_Supported value specifies which RS-232 signals are supported, as shown in the Table 2. If this entry is omitted from the serial unit directory 302, then none of these signals are supported.
Also included in serial unit 300 is a serial unit register map 304 that references registers contained in serial unit 300. The organization of serial unit register map 304 is shown in Table 3.
Serial unit register map 304 references a login register. A device attempting to communicate with serial unit 300, is referred to herein as an initiator. For example, an initiator can be computer 100, or other nodes connected on a network via a high-speed serial bus and in communication with interface 106. The initiator writes the 64 bit address of the base of its serial register map to the login register to log into serial unit 300. If another initiator is already logged in, serial unit 300 returns a conflict error response message. The high 32 bits of the address are written to the Login address, the lower 32 bits to Login+4. The serial unit register map also references a logout register. The initiator writes any value to this register to log out of the serial unit. After every bus reset the initiator must write its (possibly changed) nodeID to the reconnect register. If the initiator fails to do so within one second after the bus reset it is automatically logged out. The 16-bit nodeID is written to the bottom 16 bits of this register, the top 16 bits should be written as zero. A read of the TxFIFOSize register returns the size in bytes of the serial unit's transmit FIFO. A read of the RxFIFOSize register returns the size in bytes of serial unit 300's receive FIFO. A read of the status register returns the current state of CTS/DSR/RI/CAR (if supported). The status register is organized as shown in Table 4.
A write to the control register sets the state of DTR and RTS (if supported). The organization of the control register is shown in Table 5.
A write of any value to the FlushTxFIFO register causes serial unit 300 to flush its transmit FIFO, discarding any bytes currently in it. A write of any value to the FlushRxFIFO register causes the serial unit to flush its receive FIFO, discarding any bytes currently in it. A write of any value to the send break register causes serial unit 300 to set a break condition on its serial port, after transmitting the current contents of the TxFIFO. A write to the set baud rate register sets serial unit 300's serial port's baud rate. The set baud rate register is organized as shown in Table 6.
The set char size register sets the bit size of the characters sent and received. The organization of the set char size register is shown in Table 7. 7 bit characters are padded to 8 bits by adding a pad bit as the most significant bit.
The set stop size register designates the number of stop bits. The set stop size register is organized as shown in Table 8.
The set parity register sets the serial port parity. The organization of the set parity register is shown in Table 9.
The set flow control register sets the type of flow control used by the serial port. The organization of the set flow register is shown in Table 10.
The send data register is used when the initiator sends block write requests to this register to write characters into the transmit FIFO. Block writes must not be larger than the transmit FIFO size specified by the TxFIFOSize register. If there isn't enough room in the Tx FIFO for the whole block write, then a conflict error response message is returned and no characters are copied into the FIFO.
Also included in serial unit 300 is an initiator register map having a plurality of registers, organized as shown in Table 11.
When serial unit 300 detects a break condition on its serial port, it writes an arbitrary value to this register. When serial unit 300 detects a framing error on its serial port, it writes the received character to the framing register. When serial unit 300 detects a parity error on its serial port, it writes the received character to the parity error register. When serial unit 300's receive FIFO overflows, serial unit 300 writes an arbitrary value to the RxFIFO overflow register. When serial unit 300 detects a change in state of any of CTS/DSR/RI/CAR it writes to the status change register indicating the new serial port signal state. The organization of the status register is shown in table 12.
When serial unit 300 receives characters from its serial port it writes the received characters to the received data register with a block write transaction. It never writes more bytes than the receive FIFO size specified by the RxFIFOSize register. If the initiator cannot receive all the characters sent it responds with a conflict error response message and receives none of the characters sent.
In another embodiment of the present invention, a synthesized vertical blanking signal is derived by polling a vertical blanking register on interface 106. The vertical blanking signal invokes code to programs running on computer 100. In an embodiment, timing information may also be provided to programs running on computer 100, either in combination with the invoked code or instead of the invoked code. In an embodiment of the invention, interface 106 contains a register that holds a counter indicating current progress in the frame, from which the next vertical retrace can be extrapolated or otherwise derived. By deriving boundaries on frame transmission, other data that is within the frame and synchronized to the occurrence of a vertical blanking interval can be located and accessed, such as for sampling operations. Additionally, an embodiment of the present invention derives frame boundaries for locating data that is coincident with the vertical blanking interval but includes no information about the vertical blanking In an embodiment, the present invention is used to obtain data that is valid for a period after the occurrence of a video blanking interval, such as a time code contained within the frame, can be read, and used in various processing applications. In an embodiment, computer 100 can then schedule an interrupt to fire at this extrapolated time, thus sending out a frame.
This application is a continuation of Ser. No. 10/746,283, filed Dec. 23, 2003 and claims priority to co-owned U.S. Pat. No. 7,353,284 entitled “Synchronized transmission of audio and video data from a computer to a client via an interface” issued Apr. 1, 2008 which claims priority to U.S. Provisional Patent Application Ser. No. 60/478,336 of the same title filed Jun. 13, 2003, each of the foregoing incorporated herein by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
4156798 | Doelz | May 1979 | A |
4194113 | Fulks et al. | Mar 1980 | A |
4616359 | Fontenot | Oct 1986 | A |
5014262 | Harshavardhana | May 1991 | A |
5243596 | Port et al. | Sep 1993 | A |
5274631 | Bhardwaj | Dec 1993 | A |
5297139 | Okura et al. | Mar 1994 | A |
5321812 | Benedict et al. | Jun 1994 | A |
5343461 | Barton et al. | Aug 1994 | A |
5394556 | Oprescu | Feb 1995 | A |
5406643 | Burke et al. | Apr 1995 | A |
5452330 | Goldstein | Sep 1995 | A |
5490250 | Reschke et al. | Feb 1996 | A |
5490253 | Laha et al. | Feb 1996 | A |
5495481 | Duckwall | Feb 1996 | A |
5524254 | Morgan et al. | Jun 1996 | A |
5539390 | Nagano et al. | Jul 1996 | A |
5541670 | Hanai | Jul 1996 | A |
5568487 | Sitbon et al. | Oct 1996 | A |
5568641 | Nelson et al. | Oct 1996 | A |
5583922 | Davis et al. | Dec 1996 | A |
5621659 | Matsumoto et al. | Apr 1997 | A |
5630173 | Oprescu | May 1997 | A |
5632016 | Hoch et al. | May 1997 | A |
5640595 | Baugher et al. | Jun 1997 | A |
5642515 | Jones et al. | Jun 1997 | A |
5654657 | Pearce | Aug 1997 | A |
5684715 | Palmer | Nov 1997 | A |
5701476 | Fenger | Dec 1997 | A |
5701492 | Wadsworth et al. | Dec 1997 | A |
5706278 | Robillard et al. | Jan 1998 | A |
5712834 | Nagano et al. | Jan 1998 | A |
5719862 | Lee et al. | Feb 1998 | A |
5754765 | Danneels et al. | May 1998 | A |
5764930 | Staats | Jun 1998 | A |
5784648 | Duckwall | Jul 1998 | A |
5802048 | Duckwall | Sep 1998 | A |
5802057 | Duckwall et al. | Sep 1998 | A |
5802365 | Kathail et al. | Sep 1998 | A |
5805073 | Nagano et al. | Sep 1998 | A |
5805822 | Long et al. | Sep 1998 | A |
5809331 | Staats et al. | Sep 1998 | A |
5819115 | Hoese et al. | Oct 1998 | A |
5826027 | Pedersen et al. | Oct 1998 | A |
5832298 | Sanchez et al. | Nov 1998 | A |
5835761 | Ishii et al. | Nov 1998 | A |
5845152 | Anderson et al. | Dec 1998 | A |
5867730 | Leyda | Feb 1999 | A |
5875301 | Duckwall et al. | Feb 1999 | A |
5877812 | Krause et al. | Mar 1999 | A |
5923663 | Bontemps et al. | Jul 1999 | A |
5930480 | Staats | Jul 1999 | A |
5935208 | Duckwall et al. | Aug 1999 | A |
5938764 | Klein | Aug 1999 | A |
5940600 | Staats et al. | Aug 1999 | A |
5954796 | McCarty et al. | Sep 1999 | A |
5968152 | Staats | Oct 1999 | A |
5970052 | Lo et al. | Oct 1999 | A |
5987605 | Hill et al. | Nov 1999 | A |
5991842 | Takayama | Nov 1999 | A |
6006275 | Picazo et al. | Dec 1999 | A |
6009480 | Pleso | Dec 1999 | A |
6032202 | Lea et al. | Feb 2000 | A |
6032261 | Hulyalkar | Feb 2000 | A |
6038234 | LaFollette et al. | Mar 2000 | A |
6038625 | Ogino et al. | Mar 2000 | A |
6070187 | Subramaniam et al. | May 2000 | A |
6073206 | Piwonka et al. | Jun 2000 | A |
6091726 | Crivellari et al. | Jul 2000 | A |
6115764 | Chisholm et al. | Sep 2000 | A |
6122248 | Murakoshi et al. | Sep 2000 | A |
6131129 | Ludtke et al. | Oct 2000 | A |
6131134 | Huang et al. | Oct 2000 | A |
6131163 | Wiegel | Oct 2000 | A |
6133938 | James | Oct 2000 | A |
6138163 | Nam et al. | Oct 2000 | A |
6138196 | Takayama et al. | Oct 2000 | A |
6141702 | Ludtke et al. | Oct 2000 | A |
6141767 | Hu et al. | Oct 2000 | A |
6145018 | LaFollette et al. | Nov 2000 | A |
6157972 | Newman et al. | Dec 2000 | A |
6160796 | Zou | Dec 2000 | A |
6167532 | Wisecup | Dec 2000 | A |
6173327 | De Borst et al. | Jan 2001 | B1 |
6188700 | Kato et al. | Feb 2001 | B1 |
6192189 | Fujinami et al. | Feb 2001 | B1 |
6199119 | Duckwall et al. | Mar 2001 | B1 |
6202210 | Ludtke | Mar 2001 | B1 |
6212171 | LaFollette et al. | Apr 2001 | B1 |
6212633 | Levy et al. | Apr 2001 | B1 |
6219697 | Lawande et al. | Apr 2001 | B1 |
6226680 | Boucher et al. | May 2001 | B1 |
6233615 | Van Loo | May 2001 | B1 |
6233624 | Hyder et al. | May 2001 | B1 |
6243778 | Fung et al. | Jun 2001 | B1 |
6247063 | Ichimi et al. | Jun 2001 | B1 |
6247083 | Hake et al. | Jun 2001 | B1 |
6253114 | Takihara | Jun 2001 | B1 |
6253255 | Hyder et al. | Jun 2001 | B1 |
6256059 | Fichtner | Jul 2001 | B1 |
6260063 | Ludtke et al. | Jul 2001 | B1 |
6266334 | Duckwall | Jul 2001 | B1 |
6266344 | Fujimori et al. | Jul 2001 | B1 |
6266701 | Sridhar et al. | Jul 2001 | B1 |
6275889 | Saito | Aug 2001 | B1 |
6282597 | Kawamura | Aug 2001 | B1 |
6292840 | Blomfield Brown et al. | Sep 2001 | B1 |
6295479 | Shima et al. | Sep 2001 | B1 |
6298057 | Guy et al. | Oct 2001 | B1 |
6308222 | Krueger et al. | Oct 2001 | B1 |
6311228 | Ray | Oct 2001 | B1 |
6314461 | Duckwall et al. | Nov 2001 | B2 |
6330286 | Lyons et al. | Dec 2001 | B1 |
6343321 | Patki et al. | Jan 2002 | B2 |
6345315 | Mishra | Feb 2002 | B1 |
6347362 | Schoinas et al. | Feb 2002 | B1 |
6353868 | Takayama et al. | Mar 2002 | B1 |
6356558 | Hauck et al. | Mar 2002 | B1 |
6363085 | Samuels | Mar 2002 | B1 |
6373821 | Staats | Apr 2002 | B2 |
6385679 | Duckwall et al. | May 2002 | B1 |
6405247 | Lawande et al. | Jun 2002 | B1 |
6411628 | Hauck et al. | Jun 2002 | B1 |
6418150 | Staats | Jul 2002 | B1 |
6425019 | Tateyama et al. | Jul 2002 | B1 |
6426962 | Cabezas et al. | Jul 2002 | B1 |
6442630 | Takayama et al. | Aug 2002 | B1 |
6446116 | Burridge | Sep 2002 | B1 |
6446142 | Shima et al. | Sep 2002 | B1 |
6452975 | Hannah | Sep 2002 | B1 |
6457086 | Duckwall | Sep 2002 | B1 |
6466982 | Ruberg | Oct 2002 | B1 |
6496862 | Akatsu et al. | Dec 2002 | B1 |
6501732 | Xu et al. | Dec 2002 | B1 |
6502144 | Accarie | Dec 2002 | B1 |
6513085 | Gugel et al. | Jan 2003 | B1 |
6516465 | Paskins | Feb 2003 | B1 |
6519657 | Stone et al. | Feb 2003 | B1 |
6519662 | Clapp et al. | Feb 2003 | B2 |
6529522 | Ito et al. | Mar 2003 | B1 |
6574588 | Shapiro et al. | Jun 2003 | B1 |
6580694 | Baker | Jun 2003 | B1 |
6587904 | Hauck et al. | Jul 2003 | B1 |
6591300 | Yurkovic | Jul 2003 | B1 |
6606320 | Nomura et al. | Aug 2003 | B1 |
6618750 | Staats | Sep 2003 | B1 |
6618785 | Whitby Streves | Sep 2003 | B1 |
6621832 | Staats | Sep 2003 | B2 |
6628607 | Hauck et al. | Sep 2003 | B1 |
6631426 | Staats | Oct 2003 | B1 |
6636914 | Teener | Oct 2003 | B1 |
6639918 | Hauck et al. | Oct 2003 | B1 |
6643714 | Chrysanthakopoulos | Nov 2003 | B1 |
6671768 | Brown | Dec 2003 | B1 |
6686838 | Rezvani et al. | Feb 2004 | B1 |
6691096 | Staats | Feb 2004 | B1 |
6700895 | Kroll | Mar 2004 | B1 |
6711574 | Todd et al. | Mar 2004 | B1 |
6718497 | Whitby Strevens | Apr 2004 | B1 |
20010001151 | Duckwall et al. | May 2001 | A1 |
20010019561 | Staats | Sep 2001 | A1 |
20010024423 | Duckwall et al. | Sep 2001 | A1 |
20010040872 | Haglund | Nov 2001 | A1 |
20020057655 | Staats | May 2002 | A1 |
20020085581 | Hauck et al. | Jul 2002 | A1 |
20020101231 | Staats | Aug 2002 | A1 |
20020101885 | Pogrebinsky et al. | Aug 2002 | A1 |
20020103947 | Duckwall et al. | Aug 2002 | A1 |
20020105951 | Hannuksela et al. | Aug 2002 | A1 |
20020120797 | Fabre | Aug 2002 | A1 |
20020140851 | Laksono | Oct 2002 | A1 |
20020172226 | Staats | Nov 2002 | A1 |
20020188780 | Duckwall | Dec 2002 | A1 |
20020188783 | Duckwall et al. | Dec 2002 | A1 |
20020191116 | Kessler et al. | Dec 2002 | A1 |
20030037158 | Yano et al. | Feb 2003 | A1 |
20030037161 | Duckwall et al. | Feb 2003 | A1 |
20030053416 | Ribas-Corbera et al. | Mar 2003 | A1 |
20030055999 | Duckwall et al. | Mar 2003 | A1 |
20030215017 | Fang | Nov 2003 | A1 |
20040037309 | Hauck et al. | Feb 2004 | A1 |
Number | Date | Country |
---|---|---|
1 085 706 | Oct 2002 | EP |
WO 0041400 | Jul 2000 | WO |
Number | Date | Country | |
---|---|---|---|
20080250469 A1 | Oct 2008 | US |
Number | Date | Country | |
---|---|---|---|
60478336 | Jun 2003 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10746283 | Dec 2003 | US |
Child | 12079832 | US |