Embodiments of the present invention relate to communication synchronization.
Clock synchronization devices attempt to synchronize communication between two devices in different or independent clock domains or time domains. For example, the communication between a processor in a fast clock domain and a memory device in a slow clock domain may require synchronization in order for the devices to communicate (e.g., for the processor to access data stored in the memory device). Memory access synchronization may require that the memory be aware of which address or resource is being accessed by a processor.
Thus, conventional synchronization designs have unfortunate pulse width restrictions or increased complexity and power requirements.
Accordingly, embodiments of the present invention are directed to a system and method for synchronizing device resource access information between independent time domains. The synchronization of the device resource access information allows a memory access device to reliably access memory in a time domain independent of the device issuing access requests. Embodiments of the present invention synchronize the device access information without restricting the pulse width of a read/write signal or requiring a high speed clock.
More specifically, an embodiment of the present invention is directed to a system for synchronizing independent time domain information including trigger logic for determining port busy information coupled to a read/write signal, synchronization logic for synchronizing the port busy information with a different time domain coupled to the trigger logic, load logic for ensuring that only one port is reported as busy at a time coupled to the synchronization logic, and clear request logic for clearing port busy information coupled to the trigger logic, the synchronization logic, and the load logic. The system may synchronize device resource information for requests made by a processor to access (e.g., read/write) locations of a memory device.
Another embodiment of the present invention is directed to a method for communicating device resource access information between independent time domains including receiving a request for access to one of a plurality of resources of a device, determining which device resource is to be accessed, synchronizing device resource information to another independent time domain, transmitting device resource information to a system for accessing the device resource, and clearing device resource information after the device resource has been accessed.
Another embodiment of the present invention is a system including a processor for performing computing operations, a memory device for storing data coupled to a memory access synchronizer, the memory access synchronizer for facilitating memory access between the processor and the memory device, a memory interface logic unit for forwarding memory access requests coupled to the processor and the memory access synchronizer, and a busy detection logic unit for synchronizing and providing resource information to the memory access synchronizer coupled to the memory interface logic.
Reference will now be made in detail to the preferred embodiments of the claimed subject matter, examples of which are illustrated in the accompanying drawings. While the invention will be described in conjunction with the preferred embodiments, it will be understood that they are not intended to limit the claimed subject matter to these embodiments. On the contrary, the claimed subject matter is intended to cover alternatives, modifications and equivalents, which may be included within the spirit and scope of the claimed subject matter as defined by the claims. Furthermore, in the detailed description of the present invention, numerous specific details are set forth in order to provide a thorough understanding of the claimed subject matter. However, it will be obvious to one of ordinary skill in the art that the claimed subject matter may be practiced without these specific details. In other instances, well known methods, procedures, components, and circuits have not been described in detail as not to unnecessarily obscure aspects of the claimed subject matter.
System 200 includes memory device 202, memory interface logic 206, busy detection logic unit 212, processor 208, and memory access synchronizer 203 which may include pre-fetch buffer(s) 204 and arbiter logic unit 210. As previously indicated, the present application is related to patent application Ser. No. 12/044,862, filed Mar. 7, 2008 and titled “Arbitration method for programmable multiple clock domain bi-directional interface,” by Gupta et al., which is incorporated herein by reference for all purposes.
Processor 208 may make requests to access data (e.g., read or write) in memory device 202. In one embodiment, processor 208 and memory device 202 are synchronized to independent or different clocks or time domains. It is appreciated that processor 208 and memory device 202 could be replaced with any logic circuits or devices in different time domains and embodiments of the present invention would facilitate communication without additional latency or synchronization uncertainty.
Memory interface logic unit 206 receives requests from processor 208 to access (e.g., read/write) resources or locations on memory device 202. In one embodiment, a request from processor 208 may include a read/write signal, a memory address, read/write data, a chip enable signal, and an output enable signal. Memory interface logic 206 forwards data and control information to memory access synchronizer 203.
Memory access synchronizer 203 synchronizes the performance of memory accesses between processor 208 and memory device 202 which reside in independent time domains. In one embodiment, memory access synchronizer 203 includes pre-fetch buffer(s) 204 and arbiter logic unit 210. Arbiter logic 210 coordinates synchronization of memory accesses via pre-fetch buffer(s) 204. Arbiter logic 210 further ensures that pre-fetch buffer(s) 204 do not overflow and lose write data or become empty and interrupt the data flow to processor 208.
Busy Detection Logic Unit 212 provides memory assess synchronizer 203 with information on the current resources requested by processor 208, based on information provided by memory interface logic 206, in a synchronized manner. Busy detection logic unit 212 synchronizes requests from processor 208 with the core clock or clock of memory device 202. For example, busy detection logic 212 may signal memory access synchronizer 203 that processor 208 is requesting access to a memory location in memory device 202.
Trigger logic 304 determines for which port or resource the processor is requesting access. In one embodiment, trigger logic 304 uses a read/write strobe signal as a clock and based on the address data 302 provided by memory interface logic 206, determines which port or resource information needs to be set as busy. For example, when a read/write signal clocks trigger logic 304, if the address provided corresponds to a first resource or memory location then information will be set accordingly which is used to inform memory access synchronizer 203 that the resource or memory location is busy. In one embodiment, trigger logic 304 is clocked based on the rising/falling edge of the read(adv)/write(WE) signal, which allows port or resource requests to be recorded without pulse width requirements or high speed clocks. For example, when the rising edge of the read/write signal and an address are received, trigger logic 304 will set a data element corresponding or qualified by the port or resource that the processor is requesting.
Synchronization logic 306 receives resource information from trigger logic 304 and synchronizes the information with the receiving core or memory clock domain. In one embodiment, synchronization logic 306 operates in the core or memory clock domain. After synchronizing the resource information with the core or memory clock domain, the resource information is provided to load logic 308.
Load logic 308 provides resource information to memory access synchronizer 203 so that memory access synchronizer 203 is aware of which resource or memory location a device (e.g., processor 208) is accessing. In one embodiment, load logic 308 provides the resource information to arbiter logic unit 210 of memory access synchronizer 203. Arbiter logic unit 210 may then use the resource information to service (e.g., load or pull data) from a plurality of pre-fetch buffers. Load logic 308 ensures that memory access synchronizer 203 sees only one busy port or resource at one time and that subsequent busy port or resource information is loaded, presented or sent to memory access synchronizer 203 only after the request on the previous busy port or resource request is handled or completed and cleared. Load logic 308 thus allows a one hot port busy setting. In other embodiment, load logic can be any priority other than one hot setting.
Clear request logic 310 generates a reset signal to clear requests or busy port or resource information from system 212A after a request has been performed. In one embodiment, clear request logic 310 may generate an asynchronous reset signal in the core clock domain to clear currently serviced resource information from trigger logic 304, synchronization logic 306, and load logic 308 after the request from processor (e.g., processor 208) has been serviced. In another embodiment, clear request logic generates a clear signal based on a signal generated by a processor after completing a request. For example, when a processor has finished reading a USB end point, the processor may generate a finished signal which is used by the clear request logic 310 to clear the endpoint busy information.
As described herein, trigger logic 304 receives address information from address source 302 and use a read/write signal as a clock. In one embodiment, trigger logic 304 includes a plurality of latches 410, 412 and corresponding D flip-flops 420a-b. Each pair of latch and D flip-flop may correspond to a resource (e.g., port) or memory location. The enable lines of the latches may be coupled to an address line and the clock coupled to a read/write signal 430. The clocks of the D flip-flops 420 may connected to the output of the latches and the data connection of the D flip-flops 420 may be connected to high. The clear of the D flip-flops 420 may be connected to reset signal 310. When an address is received by trigger logic 304 and the read/write signal rising edge is detected, the latch corresponding to the address will be enabled and will clock the corresponding D flip-flop. The D flip-flop then is set and represents that the processor is accessing the resource with the address received which is provided to the synchronization logic 306.
As described herein, synchronization logic 306 receives resource information and synchronizes the information with the core or memory clock domain. Synchronization logic 306 may include a plurality of D flip-flops 450a-b, 460a-b which are clocked by the core or memory clock 440 domain. The clear connector of the D flip-flops 450a-b, 460a-b may be connected to clear signal 310. Synchronization logic 306 then provides the resource information to load logic 308.
As described herein, load logic 308 provides resource information to memory access synchronizer 203 and ensures that memory access synchronizer 203 only sees a single resource busy or in use at a single time. In one embodiment, load logic 308 provides resource information via D flip-flops 470a-b which are clocked by core clock 440 to an arbiter logic unit 210 of memory access synchronizer 203.
As described herein, after the resource described by the resource information has been accessed (e.g., read/write), clear signal 310 clears resource information from trigger logic 304, synchronization logic 306, and load logic 308. Clear signal 310 may be connected to the clear connector of D flip-flops of trigger logic 304, synchronization logic 306, and load logic 308. In one embodiment, clear signal 310 may be sent to trigger logic 304, synchronization logic 306, and load logic 308 when a processor has signaled access to a resource has been completed.
With reference to
At block 502, a request to access one of a plurality of resources of a device is received. As described herein, a processor may make a request to access a device resource (e.g., port or memory location) of a device in another independent time domain.
At block 504, which device resource is to be accessed is determined. As described herein, address information may be used to determine which device resource is to be accessed and the corresponding device resource information is stored.
At block 506, device resource information is synchronized to another independent time domain. As described herein, the device resource information is synchronized to the time domain of the other device (e.g., memory device) and the resource information is passed to a system for performing access operations on the device.
At block 508, device resource information is transmitted to a system for accessing the device resources. As described herein, device resource information may be provided to a memory access synchronizer for performing and coordinating access (e.g., read or write) operations to a memory device.
At block 510, device resource information is cleared after the device resource has been accessed. As described herein, after the access to the device resource (e.g., port or memory location), device resource information is cleared from the systems determining, synchronizing, and transmitting device resource information.
Thus, embodiments of the present invention eliminate the restrictions on pulse width without fast clocks for synchronizing device access information between independent time domains. Thus, a substantial improvement in design and performance of time independent domain devices is achieved.
Embodiments of the present invention are thus described. While the present invention has been described in particular embodiments, it should be appreciated that the present invention should not be construed as limited by such embodiments, but rather construed according to the below claims.
This application is a continuation of U.S. application Ser. No. 12/044,831 filed Mar. 7, 2008, now U.S. Pat. No. 8,145,809 which claims the benefit of and priority to U.S. Provisional Application No. 60/906,042, filed Mar. 9, 2007, and to U.S. Provisional Application No. 60/934,664, filed Jun. 14, 2007, each of which are hereby incorporated by reference in their entirety. This application claims the benefit of and priority to provisional patent application, Ser. No. 60/906,042, entitled “Implementation of Logical End-Points in USB Device,” with filing date Mar. 9, 2007, and hereby incorporated by reference in its entirety. This application claims the benefit of and priority to the provisional patent application, Ser. No. 60/934,664, entitled “Busy Detection Logic for Asynchronous Communication Port,” with filing date Jun. 14, 2007, and hereby incorporated by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4899352 | Cucchi et al. | Feb 1990 | A |
4965794 | Smith | Oct 1990 | A |
4970499 | Ryherd et al. | Nov 1990 | A |
5166926 | Cisneros et al. | Nov 1992 | A |
5247626 | Firoozmand | Sep 1993 | A |
5289432 | Dhong et al. | Feb 1994 | A |
5384734 | Tsujihashi et al. | Jan 1995 | A |
5418781 | Kaufman et al. | May 1995 | A |
5424995 | Miyazaki et al. | Jun 1995 | A |
5428574 | Kuo et al. | Jun 1995 | A |
5434818 | Byers et al. | Jul 1995 | A |
5444853 | Lentz | Aug 1995 | A |
5502833 | Byrn et al. | Mar 1996 | A |
5586294 | Goodwin et al. | Dec 1996 | A |
5625625 | Oskouy et al. | Apr 1997 | A |
5638506 | Peterson et al. | Jun 1997 | A |
5649230 | Lentz | Jul 1997 | A |
5778250 | Dye | Jul 1998 | A |
5802546 | Chisholm et al. | Sep 1998 | A |
5804986 | Jones | Sep 1998 | A |
5805808 | Hasani et al. | Sep 1998 | A |
5812820 | Loram | Sep 1998 | A |
5815501 | Gaddis et al. | Sep 1998 | A |
5822383 | Muntz et al. | Oct 1998 | A |
5822776 | De Korte et al. | Oct 1998 | A |
5881269 | Dobbelstein | Mar 1999 | A |
5898687 | Harriman et al. | Apr 1999 | A |
5898893 | Alfke | Apr 1999 | A |
5912898 | Khoury | Jun 1999 | A |
5914757 | Dean et al. | Jun 1999 | A |
5963499 | Leong et al. | Oct 1999 | A |
5970229 | Thomas et al. | Oct 1999 | A |
5991295 | Tout et al. | Nov 1999 | A |
6005795 | Hawkins et al. | Dec 1999 | A |
6005796 | Sywyk et al. | Dec 1999 | A |
6047339 | Su et al. | Apr 2000 | A |
6049487 | Plants et al. | Apr 2000 | A |
6055607 | Bauman et al. | Apr 2000 | A |
6072715 | Holloway | Jun 2000 | A |
6104802 | Perlmutter | Aug 2000 | A |
6115379 | Flanders et al. | Sep 2000 | A |
6131123 | Hurst et al. | Oct 2000 | A |
6163810 | Bhagavath et al. | Dec 2000 | A |
6163842 | Barton | Dec 2000 | A |
6181595 | Hawkins et al. | Jan 2001 | B1 |
6181634 | Okita | Jan 2001 | B1 |
6212597 | Conlin et al. | Apr 2001 | B1 |
6246682 | Roy et al. | Jun 2001 | B1 |
6246692 | Dai et al. | Jun 2001 | B1 |
6262912 | Sywyk et al. | Jul 2001 | B1 |
6269413 | Sherlock | Jul 2001 | B1 |
6292877 | Ryan | Sep 2001 | B1 |
6295295 | Wicklund | Sep 2001 | B1 |
6304936 | Sherlock | Oct 2001 | B1 |
6339596 | Kozaki et al. | Jan 2002 | B1 |
6363077 | Wong et al. | Mar 2002 | B1 |
6421770 | Huch et al. | Jul 2002 | B1 |
6425045 | LaBerge | Jul 2002 | B2 |
6430088 | Plants et al. | Aug 2002 | B1 |
6430626 | Witkowski et al. | Aug 2002 | B1 |
6504204 | Hsu et al. | Jan 2003 | B1 |
6515991 | Mckeown | Feb 2003 | B1 |
6545935 | Hsu et al. | Apr 2003 | B1 |
6560668 | Ryan et al. | May 2003 | B2 |
6578118 | Raza et al. | Jun 2003 | B1 |
6581144 | Raza et al. | Jun 2003 | B1 |
6615304 | Ishizuka | Sep 2003 | B1 |
6631455 | Raza et al. | Oct 2003 | B1 |
6731566 | Sywyk et al. | May 2004 | B1 |
6760327 | Manchester et al. | Jul 2004 | B1 |
6816955 | Raza et al. | Nov 2004 | B1 |
6822960 | Manchester et al. | Nov 2004 | B1 |
6834378 | Augsburg et al. | Dec 2004 | B2 |
6907479 | Karnstedt et al. | Jun 2005 | B2 |
6934289 | Lee | Aug 2005 | B2 |
7016349 | Raza et al. | Mar 2006 | B1 |
7193994 | Payson | Mar 2007 | B1 |
7242686 | Dougherty et al. | Jul 2007 | B1 |
7284074 | Lee et al. | Oct 2007 | B2 |
20010014053 | Li | Aug 2001 | A1 |
20010044882 | Pille et al. | Nov 2001 | A1 |
20020010897 | Stark | Jan 2002 | A1 |
20020057893 | Wood et al. | May 2002 | A1 |
20020091916 | Dowling | Jul 2002 | A1 |
20040039938 | Katz et al. | Feb 2004 | A1 |
Number | Date | Country |
---|---|---|
01285088 | Nov 1989 | JP |
WO2004075447 | Feb 2004 | WO |
Entry |
---|
U.S. Appl. No. 12/044,831, filed Mar. 7, 2008, the parent application of this continuation application. |
USPTO Notice of Allowance for U.S. Appl. No. 12/044,831 dated Jan. 24, 2012; 5 pages. |
USPTO Notice of Allowance for U.S. Appl. No. 12/044,831 dated Jan. 9, 2012; 7 pages. |
USPTO Non-Final Rejection for U.S. Appl. No. 12/044,831 dated Sep. 19, 2011; 5 pages. |
USPTO Notice of Allowance for U.S. Appl. No. 12/044,831 dated Dec. 3, 2010; 7 pages. |
USPTO Notice of Allowance for U.S. Appl. No. 12/044,831 dated Jul. 13, 2010; 6 pages. |
USPTO Non-Final Rejection for U.S. Appl. No. 12/044,831 dated Feb. 2, 2010; 6 pages. |
Feipei Lai et al., “A New Design Methodology for Multiport SRAM Cell”, IEEE Transactions on Circuits and Systems I: Fundamentals Theory and Applications No. 11 (Nov. 1994) pp. 677-685. |
USPTO Advisory Action for U.S. Appl. No. 08/789,300 dated Apr. 15, 1998. |
USPTO Final Rejection for U.S. Appl. No. 08/789,299 dated Oct. 28, 1997. |
USPTO Final Rejection for U.S. Appl. No. 08/789,300 dated Oct. 28, 1997. |
USPTO Final Rejection for U.S. Appl. No. 09/876,429 dated Mar. 18, 2003. |
USPTO Final Rejection for U.S. Appl. No. 09/876,429 dated May 13, 2002. |
USPTO Non-Final Rejection for U.S. Appl. No. 08/789,299 dated May 7, 1997. |
USPTO Non-Final Rejection for U.S. Appl. No. 08/789,300 dated May 5, 1997. |
USPTO Non-Final Rejection for U.S. Appl. No. 08/789,300 dated Aug. 7, 1998. |
USPTO Non-Final Rejection for U.S. Appl. No. 08/789,300 dated Dec. 22, 1998. |
USPTO Non-Final Rejection for U.S. Appl. No. 09/443,062 dated Oct. 24, 2000. |
USPTO Non-Final Rejection for U.S. Appl. No. 09/676,169 dated Jun 4, 2003; 7 pages. |
USPTO Non-Final Rejection for U.S. Appl. No. 09/876,429 dated Jul. 30, 2003. |
USPTO Non-Final Rejection for U.S. Appl. No. 09/876,429 dated Nov. 8, 2002. |
USPTO Non-Final Rejection for U.S. Appl. No. 09/876,429 dated Dec. 3, 2001. |
USPTO Non-Final Rejection for U.S. Appl. No. 10/773,948 dated Jul. 31, 2007; 7 pages. |
USPTO Non-Final Rejection for U.S. Appl. No. 09/443,126 dated Mar. 14, 2000. |
USPTO Notice of Allowance for U.S. Appl. No. 08/789,299 dated Aug. 13, 1999. |
USPTO Notice of Allowance for U.S. Appl. No. 08/789,300 dated Aug. 13, 1999. |
USPTO Notice of Allowance for U.S. Appl. No. 09/443,062 dated Feb. 16, 2001. |
USPTO Notice of allowance for U.S. Appl. No. 09/443,126 dated Jul. 26, 2000. |
USPTO Notice of Allowance for U.S. Appl. No. 09/676,169 dated Jul. 14, 2004; 4 pages. |
USPTO Notice of Allowance for U.S. Appl. No. 09/676,170 dated Dec. 13, 2002; 5 pages. |
USPTO Notice of Allowance for U.S. Appl. No. 09/676,171 dated Dec. 6, 2002; 4 pages. |
USPTO Notice of Allowance for U.S. Appl. No. 09/676,704 dated Mar. 9, 2005; 8 pages. |
USPTO Notice of Allowance for U.S. Appl. No. 09/676,705 dated May 2, 2003; 5 pages. |
USPTO Notice of Allowance for U.S. Appl. No. 09/676,706 dated Oct. 19, 2005; 6 pages. |
USPTO Notice of Allowance for U.S. Appl. No. 09/876,429 dated Nov. 21, 2003. |
USPTO Notice of Allowance for U.S. Appl. No. 10/746,349 dated Dec. 21, 2010; 7 pages. |
USPTO Notice of Allowance for U.S. Appl. No. 10/773,948 dated Feb. 25, 2009; 6 pages. |
USPTO Notice of Allowance for U.S. Appl. No. 10/773,948 dated Jun. 26, 2009; 6 pages. |
USPTO Notice of Allowance for U.S. Appl. No. 10/773,948 dated Jul. 23, 2008; 8 pages. |
USPTO Reply Brief for U.S. Appl. No. 09/676,704 dated Dec. 23, 2003; 2 pages. |
USPTO Advisory Action for U.S. Appl. No. 08/789,299 dated Apr. 1, 1998. |
Helmut Liedl and Kurt Marquardt, “Dual-Port RAM for Cost-attractive Multi-Microcontroller Systems,” Siemens Components XXV No. 5 (Oct. 1990) pp. 163-166. |
“A Comprehensive Dictionary of Electrical Engineering,” Editor-in-Chief: Phillip A. Laplante; 1999, CRC Press; 3 pages. |
“Algorithm for Managing Multiple First-In, First-Out Queues from a Single Share Random-Access Memory,” IBM Technical Disclosure Bulletin, Aug. 1989; 5 pages. |
USPTO Non-Final Rejection for U.S. Appl. No. 09/676,169 dated Jul. 25, 2002; 6 pages. |
Feipei Lai et al., “A New Design Methodology for Multiport SRAM Cell”, IEEE Transactions on Cicuits and Systems I: Fundamentals Theory and Applications No. 11 (Nov. 1994) pp. 677-685. |
Julie K. Peterson, “The Telecommunications Illustrated Dictionary,” Second Edition, 2002, CRC Press; 3 pages. |
Merriam Webster Online Dictionary “Seperate,” retrieved on Feb. 10, 2004; 1 page. |
Ukitae et al., “A Single-Bit-Line Cross-Point Cell Activation (SCPA) Architecture for Utlra-Low-Power SRAMs,” IEEE Journal of Solid State Circuits, vol. 38, No. 11, Nov. 1993, pp. 1114-1118. |
USPTO Non-Final Rejection for U.S. Appl. No. 10/773,948 dated Jan. 14, 2008; 7 pages. |
USPTO Advisory Action for U.S. Appl. No. 09/676,169 dated Jan. 15, 2004; 1 page. |
USPTO Advisory Action for U.S. Appl. No. 09/676,169 dated Mar. 6, 2003; 5 pages. |
USPTO Advisory Action for U.S. Appl. No. 09/676,169 dated Dec. 11, 2003; 2 pages. |
USPTO Advisory Action for U.S. Appl. No. 09/676,704 dated Jun. 13, 2003; 2 pages. |
USPTO Advisory Action for U.S. Appl. No. 09/676,704 dated Jul. 25, 2003; 1 page. |
USPTO Advisory Action for U.S. Appl. No. 09/676,706 dated Aug. 10, 2005; 2 pages. |
USPTO Advisory Action for U.S. Appl. No. 09/876,429 dated Sep. 18, 2002. |
USPTO Advisory Action for U.S. Appl. No. 10/746,349 dated May 21, 2010; 2 pages. |
USPTO U.S. Appl. No. 12/044,862: “Arbitration Method for Programmable Multiple Clock Domain Bi-Directional Interface,” Gupta et al., filed Mar. 7, 2008; 33 pages. |
USPTO Non-Final Rejection for U.S. Appl. No. 10/746,349 dated Sep. 17, 2009; 8 pages. |
USPTO Non-Final Rejection for U.S. Appl. No. 10/746,349 dated Aug. 2, 2010; 7 pages. |
USPTO Final Rejection for U.S. Appl. No. 09/676,169 dated Sep. 24, 2003; 8 pages. |
USPTO Final Rejection for U.S. Appl. No. 09/676,169 dated Dec. 18, 2002; 10 pages. |
USPTO Final Rejection for U.S. Appl. No. 09/676,704 dated Apr. 14, 2003; 9 pages. |
USPTO Final Rejection for U.S. Appl. No. 09/676,706 dated Jun. 1, 2005; 7 pages. |
USPTO Non-Final Rejection for U.S. Appl. No. 09/676,706 dated Sep. 22, 2004; 7 pages. |
USPTO Non-Final Rejection for U.S. Appl. No. 09/676,705 dated Nov. 13, 2002; 65 pages. |
USPTO Final Rejection for U.S. Appl. No. 10/746,349 dated Feb. 18, 2010; 10 pages. |
USPTO Final Rejection for U.S. Appl. No. 10/746,349 dated Jun. 8, 2009; 11 pages. |
USPTO Non-Final Rejection for U.S. Appl. No. 09/676,704 dated Nov. 5, 2002; 6 pages. |
USPTO Non-Final Rejection for U.S. Appl. No. 09/676,171 dated Jun. 18, 2002; 16 pages. |
USPTO Non-Final Rejection for U.S. Appl. No. 09/676,170 dated Aug. 15, 2002; 25 pages. |
Number | Date | Country | |
---|---|---|---|
60906042 | Mar 2007 | US | |
60934664 | Jun 2007 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12044831 | Mar 2008 | US |
Child | 13154348 | US |