US20040008640A1 - Method and system for implementing a system acquisition function for use with a communication device - Google Patents
Method and system for implementing a system acquisition function for use with a communication device Download PDFInfo
- Publication number
- US20040008640A1 US20040008640A1 US10/067,496 US6749602A US2004008640A1 US 20040008640 A1 US20040008640 A1 US 20040008640A1 US 6749602 A US6749602 A US 6749602A US 2004008640 A1 US2004008640 A1 US 2004008640A1
- Authority
- US
- United States
- Prior art keywords
- sequence
- computational units
- sequences
- configurable
- communication device
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/76—Architectures of general purpose stored program computers
- G06F15/78—Architectures of general purpose stored program computers comprising a single central processing unit
- G06F15/7867—Architectures of general purpose stored program computers comprising a single central processing unit with reconfigurable architecture
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/707—Spread spectrum techniques using direct sequence modulation
- H04B1/7073—Synchronisation aspects
- H04B1/7075—Synchronisation aspects with code phase acquisition
- H04B1/708—Parallel implementation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B2201/00—Indexing scheme relating to details of transmission systems not covered by a single group of H04B3/00 - H04B13/00
- H04B2201/69—Orthogonal indexing scheme relating to spread spectrum techniques in general
- H04B2201/707—Orthogonal indexing scheme relating to spread spectrum techniques in general relating to direct sequence modulation
- H04B2201/70707—Efficiency-related aspects
- H04B2201/7071—Efficiency-related aspects with dynamic control of receiver resources
- H04B2201/70711—Efficiency-related aspects with dynamic control of receiver resources with modular structure
Definitions
- the present invention generally relates to a system acquisition function. More specifically, the present invention relates to a method and system for implementing a system acquisition function for use with a communication device.
- each base station differentiates amongst one another by using an unique PN code.
- a communication device such as a mobile phone
- a system acquisition function typically embodied in a searcher, to search for and locate the PN codes of the base stations within the vicinity of the mobile phone.
- Upon power-on, one of the initial tasks of the mobile phone is to find the strongest pilot signal from the nearby base stations as soon as possible.
- the task of finding the strongest pilot signal is commonly known as system or pilot acquisition and is usually performed by a searcher within the mobile phone.
- the system acquisition function within the mobile phone is implemented in the form of the searcher using a serial search technique that only utilizes a set of complex correlators to search for the correlation peak from one PN code offset to another.
- This approach consumes less power and requires less hardware; however, the search for the correlation peak may take longer.
- the searcher within the mobile phone is implemented using a traditional parallel search technique that utilizes several sets of fixed, dedicated correlators to compute the correlation peak in a concurrent manner.
- This other approach may shorten the search time but it does so at cost of incurring more hardware and power consumption.
- the acquisition mode is typically less active than other modes, the exclusive use of fixed, dedicated correlators often results in a waste of hardware resources within the mobile phone.
- system or pilot acquisition in a CDMA communication system is typically performed as follows.
- Each base station continually broadcasts its own unique PN code in a periodic manner.
- One PN code from one base station differs from another PN code from another base station by an offset.
- the mobile phone first searches for signals at a particular frequency. As a result, only signals from base stations transmitting at that particular frequency are received by the mobile phone.
- the PN code of the base station which transmits the strongest pilot signal is identified and synchronized.
- the mobile phone receives signals from different base stations and these received signals are added up. Typically, the received signals are stored by the mobile phone before the correlation process begins.
- the mobile phone has a local PN sequence generator which is capable of generating sequences of PN codes. Initially, before the PN code of the base station which transmits the strongest pilot signal is identified, the PN sequence generator generates an initial PN code. This initial PN code is correlated with the received signals by a correlator residing in the mobile phone. Correlation is done to determine the power level of the received signals.
- the correlation results are examined to determine if the received signals representing the PN code of the transmitting base station fall within an acceptable time delay from the initial PN code to qualify as the strongest pilot signal. If the correlation results are below a predetermined threshold, i.e., the initial PN code generated by the local PN sequence generator does not qualify as the strongest pilot signal, then the local PN sequence generator shifts by one chip to generate another PN code and this other PN code is correlated with the received signals. The generation of PN codes and the correlation of these codes with the received signals continue until the strongest pilot signal is identified.
- the PN code generated by the PN sequence generator and used to identify the strongest pilot signal is synchronized with the PN code of the base station which transmits the strongest pilot signal. Once the synchronization of the PN code is achieved, the mobile phone is able to communicate with the base station.
- the mobile phone continues searching for nearby strong pilot signals and maintains a list to keep track of such signals.
- This process is commonly called set maintenance. That is, in addition to the strongest pilot signal, the mobile phone also searches for and keeps track of a number of additional pilot signals (and their associated PN codes) with different levels of signal strength. For example, the mobile phone may maintain an active set which keeps track of additional multipaths associated with the pilot signal of the base station that the mobile phone is currently communicating with, a candidate set with pilot signals whose strengths exceed certain threshold, and a neighbor set that includes pilot signals from cells that are in the vicinity of the cells that the mobile phone is communicating with. Maintaining a number of additional pilot signals (and their associated PN codes) facilitates the handoff process.
- a handoff typically occurs when a mobile phone is roaming from one area to another. This happens when a pilot signal transmitted from another base station is stronger than the one that the mobile phone is currently communicating with.
- the candidate set may be used to more efficiently identify the new base station transmitting the strongest pilot signal. This is because the strongest pilot signal is more likely to be one of the signals included in the candidate set. Hence, the associated PN code can be retrieved more quickly and communication with the new base station likewise can be established in a shorter period of time.
- the received signals need to be stored by the mobile phone so they can be subsequently used for correlation purposes. Furthermore, generation of the PN codes by the PN sequence generator is done in a sequential manner by shifting the current PN code.
- a method and system for implementing a system acquisition function for use with a communication device is provided.
- the system acquisition function is embodied in a searcher.
- the searcher is embedded in the communication device, such as, a mobile phone.
- the searcher includes one or more computational units which are used to perform a PN sequence generation function to generate PN sequences.
- Each PN sequence is comprised of a number of PN codes.
- the searcher further includes a number of computational units which are used to correlate received signal samples with the PN codes generated by the PN sequence generation function. As each signal sample is received by the communication device, the received signal sample is correlated (complex multiplied) with a PN sequence in a parallel manner using the computational units.
- the sample correlation results are then respectively accumulated within each computational unit that conducts the corresponding sample correlation. As the next signal sample is received, this newly received signal sample is similarly correlated with the next PN sequence in a parallel manner. Likewise, the sample correlation results are also accumulated. The foregoing process is repeated until all the signal samples needed to complete a signal correlation are received and correlated with the PN sequences.
- the number of PN codes within a PN sequence used to correlate with each received signal sample is equivalent to a correlation length chosen such that the correlation results between each received signal sample and the locally generated PN sequence are sufficiently reliable to determine whether the strongest pilot is found.
- the computational units are implemented using adaptive hardware resources.
- the number of computational units which are used to implement the PN sequence generation function and the correlation function are adjustable depending on, for example, the amount of available adaptive hardware resources.
- FIG. 1 is a simplified diagram illustrating an exemplary embodiment of an M-node having four (4) computational units in accordance with the present invention
- FIG. 2 is a simplified diagram illustrating an exemplary method for performing correlations in accordance with the present invention
- FIG. 3 is a simplified diagram illustrating the exemplary method as shown in FIG. 2 for performing an additional round of correlations in accordance with the present invention
- FIG. 4 is a simplified diagram illustrating a second exemplary method for performing correlations in accordance with the present invention.
- FIG. 5 is a simplified diagram illustrating a third exemplary method for performing correlations in accordance with the present invention.
- FIG. 1 is a simplified diagram illustrating an exemplary embodiment of the present invention.
- a searcher 10 having a number of computational units 12 a - m.
- the searcher 10 can be located in any type of communication device, such as a mobile phone.
- each computational unit 12 a - m correlates the received signal samples with a corresponding PN code.
- these computational units 12 a - m are implemented using reconfigurable hardware resources within an adaptive computing architecture. Details relating to the adaptive computing architecture and how reconfigurable hardware resources are used to implement functions on an on-demand basis are disclosed in U.S. patent application Ser.
- the computational units 12 a - m are arranged in a sequential order and configured to calculate the correlations between the received signal samples and a number of PN sequences. The start of any two adjacent PN sequences are offset by one chip. More specifically, the computational units 12 a - m correlate each received signal sample with their corresponding components of a PN sequence in a parallel manner.
- the PN sequences used by the computational units 12 a - m are generated in a successive, offset order. The starting position of each successive PN sequence is only one chip off from the preceding PN sequence.
- the PN codes of each PN sequence can be provided to the computational units 12 a - m in a number of ways.
- the PN codes can be generated by either a PN sequence generator implemented in the form of another computational unit (not shown) or a RISC processor.
- each PN code is shifted into a corresponding computational unit 12 a - m.
- Each computational unit 12 a - m includes a local memory for storing its corresponding PN code.
- FIG. 2 there are m computational units 20 a - m within the searcher 10 .
- signal sample R 0 is received by a receiver (not shown) located within the communication device.
- Signal sample R 0 is then correlated with the PN sequence, P 0 P 1 . . . P M ⁇ 1 .
- the PN sequence, P 0 P 1 . . . P M ⁇ 1 is generated by a PN sequence generator (not shown) located within the communication device. Since there are M PN codes within the PN sequence, M computational units 20 a - m are used to do the correlations in parallel. Hence, each computational unit 20 a - m correlates the signal sample R 0 with one PN code.
- computational unit 20 a correlates R 0 with P 0 to generate correlation result R 0 P 0 .
- the collective correlation results generated by the computational units 20 a - m are as follows: R 0 P 0 , R 0 P 1 . . . ,R 0 P M ⁇ 1 .
- the correlations are performed and the correlation results are respectively accumulated into the computational units 20 a - m before the next signal sample R 1 is received at time t 1 .
- the signal sample R 0 may then be discarded after the correlations are performed.
- signal sample R 1 is received.
- Signal sample R 1 is then correlated with a second PN sequence, P 1 P 2 . . . P M .
- the PN sequence, P 1 P 2 . . . P M is only a shift of the PN sequence used at time t 0 plus a newly generated PN code P M . That is, the start of the new PN sequence is offset by one chip from the preceding PN sequence. Consequently, the new PN sequence can be supplied to or propagated through the computational units 20 a - m as follows. Except for the last computational unit 20 m, each computational unit 20 a - l receives its corresponding PN code for the next correlation from its neighbor.
- the last computational unit 20 m receives its corresponding PN code P M from the PN sequence generator. In other words, except for the first computational unit 20 a, each remaining computational unit 20 b - m passes its current PN code to its neighbor in the same direction. As to the first computational unit 20 a, its current PN code is discarded; and as to the last computational unit 20 m, as mentioned above, the PN sequence generator provides the next PN code.
- computational unit 20 a discards its current PN code P 0 and receives its next PN code (which will be P 1 ) from computational unit 20 b;
- computational unit 20 m passes its current PN code P M ⁇ 1 to its neighboring computational unit 20 l (not shown) and receives its next PN code P M from the PN sequence generator; and the remaining computational units 20 b - l pass their current PN codes respectively to their neighbors in one direction and receive their next PN codes respectively from their neighbors in the other direction.
- the correlation results for the received signal samples, R 0 R 1 . . . R n ⁇ 1 , with n different PN sequences that are offset by one chip between the start of any two adjacent PN sequences, are then obtained.
- R 0 P 0 +R 1 P 1 +. . . +R n ⁇ 1 P n ⁇ 1 represent the correlation results accumulated at computational unit 20 a.
- M different PN code offsets have been searched. If the number of PN codes that need to be searched is M or fewer, then the entire search process is completed at the end of the time period t n ⁇ 1 +T d .
- a second round of search or correlations may be performed.
- the length (time-wise) of a round of correlations is the time period t n ⁇ 1 +T d .
- FIG. 3 illustrates this second round of correlations.
- the received signal sample R n is correlated by the computational units 20 a - m with the PN sequence, P n+M P n+M+1 . . . P n+2M ⁇ 1 at time t n .
- the correlation results are then accumulated at each of the computational unit 20 - a - m.
- the signal sample R n+1 is correlated with the next PN sequence, P n+M+1 P n+M+2 . . . P n+2M .
- the start of this next PN sequence is offset from the preceding PN sequence by one chip and a new PN code is added at the end. This process will continue until the second round of correlations is completed.
- another M PN offsets (P M , P M+1 , . . . , P 2M+1 ) are searched.
- the correlation results are then stored and cleared from each computational unit 20 a - m before the next round of correlations starts.
- all the received signal samples R x are not stored first and then later used for correlation purposes. Instead, as each signal sample R x is received, the signal sample R x is correlated with M PN codes and then accumulated. The collective correlation results for all the received signal samples R x are then examined to identify the PN sequence which corresponds to the strongest pilot signal. Hence, the collective correlation results for the received signal samples R x can be derived much faster. In addition, since all the received signal samples R x need not be stored before the correlation function is performed, the memory overhead and hardware requirements and costs correspondingly become less.
- M computational units 20 a - m are used to correlate a received signal sample R x with a PN sequence which has M PN codes.
- each computational unit 20 a - m performs one correlation.
- M correlations are collectively performed.
- the number of computational units 20 a - m which are used to perform the correlations is scalable. That is, the number of computational units 20 a - m may vary depending on the amount of hardware resources available and the clock rate that is used to drive each computational unit.
- each computational unit performs one correlation thereby resulting in M correlations being performed.
- each computational unit is not necessarily restricted to performing one correlation during each time period T d .
- Each computational unit may perform two or more correlations per time period T d . While M correlations are to be performed per time period T d , these M correlations may be collectively performed by a fewer number of computational units. For example, referring to FIG. 4, there are M/2 computational units. In this case, each of the M/2 computational units is driven to perform two (2) correlations within the time period T d ; for instance, computational unit 30 a performs two (2) correlations and generates correlation results R 0 P 0 and R 0 P 1 . In order to perform two (2) correlations with the time period T d , each computational unit is driven at a higher clock rate to increase the speed of execution.
- each of the M/4 computational units is driven to perform four (4) correlations within the time period T d ; for instance, computational unit 40 a performs four (4) correlations and generates correlation results R 0 P 0 , R 0 P 1 , R 0 P 2 and R 0 P 3 .
- each computational unit is driven at an even higher clock rate to increase the speed of execution.
- a person of ordinary skill in the art should be able to determine the appropriate number of computational units to be used to implement the PN sequence generation function and the correlation function in accordance with the present invention.
- the number of computational units which can be used depends on a number of factors, such as the availability of the configurable hardware resources, the incoming signal rate or, conversely, the signal period, and the available clock rates, etc. For instance, if only a limited number of computational units can be used, then the clock rate may need to be driven higher in order to perform the requisite number of correlations. Conversely, if additional hardware resources are available, additional computational units driven at a lower clock rate may be implemented to perform the same number of correlations. For another instance, if the signal period is shortened, then additional computational units may be needed to perform the requisite number of correlations within the signal period.
- the present invention as described above can also be used to provide more efficient set maintenance. Signals from the base station which previously transmitted the strongest pilot signal can be searched and correlated more quickly to confirm that this base station continues to be the one transmitting the strongest pilot signal. Likewise, signals from the base stations which correspond to the candidate set and the neighbor set respectively can also be searched and correlated more quickly to update the status of the neighbor set and the neighbor set. A candidate set may be searched more frequently than a neighbor set. As a result, the set maintenance update cycle is reduced.
Abstract
Description
- The present application is a continuation-in-part application of U.S. patent application Ser. No. 09/815,122 entitled “ADAPTIVE INTEGRATED CIRCUITRY WITH HETEROGENEOUS AND RECONFIGURABLE MATRICES OF DIVERSE AND ADAPTIVE COMPUTATIONAL UNITS HAVING FIXED, APPLICATION SPECIFIC COMPUTATIONAL ELEMENTS,” filed on Mar. 22, 2001, the disclosure of which is hereby incorporated by reference in their entirety as if set forth in full herein for all purposes.
- The present invention generally relates to a system acquisition function. More specifically, the present invention relates to a method and system for implementing a system acquisition function for use with a communication device.
- In CDMA communication systems, each base station differentiates amongst one another by using an unique PN code. A communication device, such as a mobile phone, is equipped with a system acquisition function, typically embodied in a searcher, to search for and locate the PN codes of the base stations within the vicinity of the mobile phone. Upon power-on, one of the initial tasks of the mobile phone is to find the strongest pilot signal from the nearby base stations as soon as possible. The task of finding the strongest pilot signal is commonly known as system or pilot acquisition and is usually performed by a searcher within the mobile phone.
- Under one conventional approach, the system acquisition function within the mobile phone is implemented in the form of the searcher using a serial search technique that only utilizes a set of complex correlators to search for the correlation peak from one PN code offset to another. This approach consumes less power and requires less hardware; however, the search for the correlation peak may take longer.
- Under another conventional approach, the searcher within the mobile phone is implemented using a traditional parallel search technique that utilizes several sets of fixed, dedicated correlators to compute the correlation peak in a concurrent manner. This other approach may shorten the search time but it does so at cost of incurring more hardware and power consumption. Furthermore, since the acquisition mode is typically less active than other modes, the exclusive use of fixed, dedicated correlators often results in a waste of hardware resources within the mobile phone.
- More specifically, system or pilot acquisition in a CDMA communication system is typically performed as follows. Each base station continually broadcasts its own unique PN code in a periodic manner. One PN code from one base station differs from another PN code from another base station by an offset. Before a PN code can be identified by the mobile phone, the mobile phone first searches for signals at a particular frequency. As a result, only signals from base stations transmitting at that particular frequency are received by the mobile phone.
- Next, the PN code of the base station which transmits the strongest pilot signal is identified and synchronized. The mobile phone receives signals from different base stations and these received signals are added up. Typically, the received signals are stored by the mobile phone before the correlation process begins. The mobile phone has a local PN sequence generator which is capable of generating sequences of PN codes. Initially, before the PN code of the base station which transmits the strongest pilot signal is identified, the PN sequence generator generates an initial PN code. This initial PN code is correlated with the received signals by a correlator residing in the mobile phone. Correlation is done to determine the power level of the received signals. The correlation results are examined to determine if the received signals representing the PN code of the transmitting base station fall within an acceptable time delay from the initial PN code to qualify as the strongest pilot signal. If the correlation results are below a predetermined threshold, i.e., the initial PN code generated by the local PN sequence generator does not qualify as the strongest pilot signal, then the local PN sequence generator shifts by one chip to generate another PN code and this other PN code is correlated with the received signals. The generation of PN codes and the correlation of these codes with the received signals continue until the strongest pilot signal is identified.
- When the strongest pilot signal is identified, the PN code generated by the PN sequence generator and used to identify the strongest pilot signal is synchronized with the PN code of the base station which transmits the strongest pilot signal. Once the synchronization of the PN code is achieved, the mobile phone is able to communicate with the base station.
- Furthermore, after pilot acquisition is completed, the mobile phone continues searching for nearby strong pilot signals and maintains a list to keep track of such signals. This process is commonly called set maintenance. That is, in addition to the strongest pilot signal, the mobile phone also searches for and keeps track of a number of additional pilot signals (and their associated PN codes) with different levels of signal strength. For example, the mobile phone may maintain an active set which keeps track of additional multipaths associated with the pilot signal of the base station that the mobile phone is currently communicating with, a candidate set with pilot signals whose strengths exceed certain threshold, and a neighbor set that includes pilot signals from cells that are in the vicinity of the cells that the mobile phone is communicating with. Maintaining a number of additional pilot signals (and their associated PN codes) facilitates the handoff process. A handoff typically occurs when a mobile phone is roaming from one area to another. This happens when a pilot signal transmitted from another base station is stronger than the one that the mobile phone is currently communicating with. The candidate set may be used to more efficiently identify the new base station transmitting the strongest pilot signal. This is because the strongest pilot signal is more likely to be one of the signals included in the candidate set. Hence, the associated PN code can be retrieved more quickly and communication with the new base station likewise can be established in a shorter period of time.
- As can be seen above, the received signals need to be stored by the mobile phone so they can be subsequently used for correlation purposes. Furthermore, generation of the PN codes by the PN sequence generator is done in a sequential manner by shifting the current PN code.
- Hence, it would be desirable to provide a method and system to implement a searcher for use with a mobile phone to more efficiently identify the PN code of the base station which transmits the strongest pilot signal.
- A method and system for implementing a system acquisition function for use with a communication device is provided. According to one exemplary embodiment of the system, the system acquisition function is embodied in a searcher. The searcher is embedded in the communication device, such as, a mobile phone. The searcher includes one or more computational units which are used to perform a PN sequence generation function to generate PN sequences. Each PN sequence is comprised of a number of PN codes. The searcher further includes a number of computational units which are used to correlate received signal samples with the PN codes generated by the PN sequence generation function. As each signal sample is received by the communication device, the received signal sample is correlated (complex multiplied) with a PN sequence in a parallel manner using the computational units. The sample correlation results are then respectively accumulated within each computational unit that conducts the corresponding sample correlation. As the next signal sample is received, this newly received signal sample is similarly correlated with the next PN sequence in a parallel manner. Likewise, the sample correlation results are also accumulated. The foregoing process is repeated until all the signal samples needed to complete a signal correlation are received and correlated with the PN sequences. The number of PN codes within a PN sequence used to correlate with each received signal sample is equivalent to a correlation length chosen such that the correlation results between each received signal sample and the locally generated PN sequence are sufficiently reliable to determine whether the strongest pilot is found.
- According to another aspect of the system, the computational units are implemented using adaptive hardware resources. The number of computational units which are used to implement the PN sequence generation function and the correlation function are adjustable depending on, for example, the amount of available adaptive hardware resources.
- Reference to the remaining portions of the specification, including the drawings and claims, will realize other features and advantages of the present invention. Further features and advantages of the present invention, as well as the structure and operation of various embodiments of the present invention, are described in detail below with respect to accompanying drawings, like reference numbers indicate identical or functionally similar elements.
- FIG. 1 is a simplified diagram illustrating an exemplary embodiment of an M-node having four (4) computational units in accordance with the present invention;
- FIG. 2 is a simplified diagram illustrating an exemplary method for performing correlations in accordance with the present invention;
- FIG. 3 is a simplified diagram illustrating the exemplary method as shown in FIG. 2 for performing an additional round of correlations in accordance with the present invention;
- FIG. 4 is a simplified diagram illustrating a second exemplary method for performing correlations in accordance with the present invention; and
- FIG. 5 is a simplified diagram illustrating a third exemplary method for performing correlations in accordance with the present invention.
- The present invention in the form of one or more exemplary embodiments will now be described. FIG. 1 is a simplified diagram illustrating an exemplary embodiment of the present invention. Referring to FIG. 1, there is shown a
searcher 10 having a number of computational units 12 a-m. Thesearcher 10 can be located in any type of communication device, such as a mobile phone. As will be further demonstrated below, each computational unit 12 a-m correlates the received signal samples with a corresponding PN code. In an exemplary embodiment, these computational units 12 a-m are implemented using reconfigurable hardware resources within an adaptive computing architecture. Details relating to the adaptive computing architecture and how reconfigurable hardware resources are used to implement functions on an on-demand basis are disclosed in U.S. patent application Ser. No. 09/815,122 entitled “ADAPTIVE INTEGRATED CIRCUITRY WITH HETEROGENEOUS AND RECONFIGURABLE MATRICES OF DIVERSE AND ADAPTIVE COMPUTATIONAL UNITS HAVING FIXED, APPLICATION SPECIFIC COMPUTATIONAL ELEMENTS,” filed on Mar. 22, 2001, the disclosure of which is hereby incorporated by reference in their entirety as if set forth in fall herein for all purposes. It should be understood that while the present invention is described as being in thesearcher 10, it will be appreciated by a person of ordinary skill in the art that the present invention can be implemented in other manners within a communication device. For example, some or all of the functionality of the present invention as described herein may be implemented outside of thesearcher 10 in other parts of the communication device. - In an exemplary embodiment, the computational units12 a-m are arranged in a sequential order and configured to calculate the correlations between the received signal samples and a number of PN sequences. The start of any two adjacent PN sequences are offset by one chip. More specifically, the computational units 12 a-m correlate each received signal sample with their corresponding components of a PN sequence in a parallel manner.
- The PN sequences used by the computational units12 a-m are generated in a successive, offset order. The starting position of each successive PN sequence is only one chip off from the preceding PN sequence. The PN codes of each PN sequence can be provided to the computational units 12 a-m in a number of ways. For example, the PN codes can be generated by either a PN sequence generator implemented in the form of another computational unit (not shown) or a RISC processor. As will described further below, each PN code is shifted into a corresponding computational unit 12 a-m. Each computational unit 12 a-m includes a local memory for storing its corresponding PN code.
- FIG. 2 illustrates an exemplary method for performing correlations in accordance with the present invention. Assume the time duration of a received signal sample is Td, that is, one signal sample is received every Td. Then, conversely, the frequency of the received signal sample is 1/Td=fd.
- Referring to FIG. 2, there are m
computational units 20 a-m within thesearcher 10. At time t0, signal sample R0 is received by a receiver (not shown) located within the communication device. Signal sample R0 is then correlated with the PN sequence, P0P1 . . . PM−1. The PN sequence, P0P1 . . . PM−1, is generated by a PN sequence generator (not shown) located within the communication device. Since there are M PN codes within the PN sequence, Mcomputational units 20 a-m are used to do the correlations in parallel. Hence, eachcomputational unit 20 a-m correlates the signal sample R0 with one PN code. For example, computational unit 20 a correlates R0 with P0 to generate correlation result R0P0. The collective correlation results generated by thecomputational units 20 a-m are as follows: R0P0, R0P1 . . . ,R0PM−1. The correlations are performed and the correlation results are respectively accumulated into thecomputational units 20 a-m before the next signal sample R1 is received at time t1. The signal sample R0 may then be discarded after the correlations are performed. - At time t1, signal sample R1 is received. Signal sample R1 is then correlated with a second PN sequence, P1P2 . . . PM. The PN sequence, P1P2 . . . PM, is only a shift of the PN sequence used at time t0 plus a newly generated PN code PM. That is, the start of the new PN sequence is offset by one chip from the preceding PN sequence. Consequently, the new PN sequence can be supplied to or propagated through the
computational units 20 a-m as follows. Except for the lastcomputational unit 20 m, eachcomputational unit 20 a-l receives its corresponding PN code for the next correlation from its neighbor. The lastcomputational unit 20 m receives its corresponding PN code PM from the PN sequence generator. In other words, except for the first computational unit 20 a, each remainingcomputational unit 20 b-m passes its current PN code to its neighbor in the same direction. As to the first computational unit 20 a, its current PN code is discarded; and as to the lastcomputational unit 20 m, as mentioned above, the PN sequence generator provides the next PN code. For example, after the correlations are completed for the received signal sample R0 (which is some time before time t1), computational unit 20 a discards its current PN code P0 and receives its next PN code (which will be P1) fromcomputational unit 20 b;computational unit 20 m passes its current PN code PM−1 to its neighboring computational unit 20 l (not shown) and receives its next PN code PM from the PN sequence generator; and the remainingcomputational units 20 b-l pass their current PN codes respectively to their neighbors in one direction and receive their next PN codes respectively from their neighbors in the other direction. - Again, since there are M PN codes within a PN sequence, M
computational units 20 a-m are used to do the correlations in parallel. This time around, the collective correlation results generated by thecomputational units 20 a-m are as follows: R1P1, R1P2, . . . ,R1PM. The correlations are performed and the results are accumulated with the correlation results that were done at time to before the next signal sample R2 is received at time t2. Hence, for example, before time t2, computational unit 20 a contains correlation results R0P0 and R1P1. The foregoing process is repeated until the last signal sample Rn−1 is received at time tn−1 and then correlated with the PN sequence, Pn−1Pn . . . PM+n−2 generating the following collective correlation results: Rn−1Pn−1, Rn−1Pn, . . . ,Rn−1PM+n−2. - At the end of the time period, tn−1+Td, the correlation results for the received signal samples, R0R1 . . . Rn−1, with n different PN sequences that are offset by one chip between the start of any two adjacent PN sequences, are then obtained. For example, R0P0+R1P1+. . . +Rn−1Pn−1 represent the correlation results accumulated at computational unit 20 a. Also, at the end of the time period, tn−1+Td, M different PN code offsets have been searched. If the number of PN codes that need to be searched is M or fewer, then the entire search process is completed at the end of the time period tn−1+Td.
- If the number of PN codes that need to be searched is more than M, then a second round of search or correlations (or additional rounds if necessary) may be performed. The length (time-wise) of a round of correlations is the time period tn−1+Td. For example, FIG. 3 illustrates this second round of correlations. Before the second round of correlations begins, the accumulated correlation results in each of the
computational unit 20 a-m are transferred and stored in other memory locations and then cleared. Referring to FIG. 3, in the second round of correlations, the received signal sample Rn is correlated by thecomputational units 20 a-m with the PN sequence, Pn+MPn+M+1 . . . Pn+2M−1 at time tn. The correlation results are then accumulated at each of the computational unit 20-a-m. - At time tn+1, the signal sample Rn+1 is correlated with the next PN sequence, Pn+M+1Pn+M+2 . . . Pn+2M. Similarly, the start of this next PN sequence is offset from the preceding PN sequence by one chip and a new PN code is added at the end. This process will continue until the second round of correlations is completed. For the second round of real-time correlations, another M PN offsets (PM, PM+1, . . . , P2M+1) are searched. The correlation results are then stored and cleared from each
computational unit 20 a-m before the next round of correlations starts. - According to the exemplary method shown in FIG. 2, all the received signal samples Rx are not stored first and then later used for correlation purposes. Instead, as each signal sample Rx is received, the signal sample Rx is correlated with M PN codes and then accumulated. The collective correlation results for all the received signal samples Rx are then examined to identify the PN sequence which corresponds to the strongest pilot signal. Hence, the collective correlation results for the received signal samples Rx can be derived much faster. In addition, since all the received signal samples Rx need not be stored before the correlation function is performed, the memory overhead and hardware requirements and costs correspondingly become less.
- As can be seen from FIG. 2, for each time period Td, M
computational units 20 a-m are used to correlate a received signal sample Rx with a PN sequence which has M PN codes. For each time period Td, eachcomputational unit 20 a-m performs one correlation. As a result, with Mcomputational units 20 a-m, M correlations are collectively performed. As will be further described below, the number ofcomputational units 20 a-m which are used to perform the correlations is scalable. That is, the number ofcomputational units 20 a-m may vary depending on the amount of hardware resources available and the clock rate that is used to drive each computational unit. - Referring back to FIG. 2, for each time period Td and a PN sequence with M PN codes, each computational unit performs one correlation thereby resulting in M correlations being performed. However, each computational unit is not necessarily restricted to performing one correlation during each time period Td.
- Each computational unit may perform two or more correlations per time period Td. While M correlations are to be performed per time period Td, these M correlations may be collectively performed by a fewer number of computational units. For example, referring to FIG. 4, there are M/2 computational units. In this case, each of the M/2 computational units is driven to perform two (2) correlations within the time period Td; for instance,
computational unit 30 a performs two (2) correlations and generates correlation results R0P0 and R0P1. In order to perform two (2) correlations with the time period Td, each computational unit is driven at a higher clock rate to increase the speed of execution. - In another example, as shown in FIG. 5, there are M/4 computational units. In this case, each of the M/4 computational units is driven to perform four (4) correlations within the time period Td; for instance,
computational unit 40 a performs four (4) correlations and generates correlation results R0P0, R0P1, R0P2 and R0P3. In order to perform four (4) correlations with the time period Td, each computational unit is driven at an even higher clock rate to increase the speed of execution. - Based on the disclosure provided herein, a person of ordinary skill in the art should be able to determine the appropriate number of computational units to be used to implement the PN sequence generation function and the correlation function in accordance with the present invention. The number of computational units which can be used depends on a number of factors, such as the availability of the configurable hardware resources, the incoming signal rate or, conversely, the signal period, and the available clock rates, etc. For instance, if only a limited number of computational units can be used, then the clock rate may need to be driven higher in order to perform the requisite number of correlations. Conversely, if additional hardware resources are available, additional computational units driven at a lower clock rate may be implemented to perform the same number of correlations. For another instance, if the signal period is shortened, then additional computational units may be needed to perform the requisite number of correlations within the signal period.
- The present invention as described above can also be used to provide more efficient set maintenance. Signals from the base station which previously transmitted the strongest pilot signal can be searched and correlated more quickly to confirm that this base station continues to be the one transmitting the strongest pilot signal. Likewise, signals from the base stations which correspond to the candidate set and the neighbor set respectively can also be searched and correlated more quickly to update the status of the neighbor set and the neighbor set. A candidate set may be searched more frequently than a neighbor set. As a result, the set maintenance update cycle is reduced.
- Moreover, while the above disclosure provided above is described in connection with a
searcher 10, it should be understood that the present invention is not restricted to use with a searcher and that the present invention is applicable to and can be used with any communication devices which are capable of performing a system acquisition function. - It is understood that the present invention as described above is applicable to a CDMA communication system but that a person of ordinary skill in the art should know of other ways and/or methods to apply the present invention to other types of communication systems.
- Furthermore, it is to be understood that the present invention as described above can be implemented in the form of control logic using software, hardware or a combination of both. Based on the disclosure provided herein, a person of ordinary skill in the art will know of other ways and/or methods to implement the present invention.
- It is further understood that the examples and embodiments described herein are for illustrative purposes only and that various modifications or changes in light thereof will be suggested to persons skilled in the art and are to be included within the spirit and purview of this application and scope of the appended claims. All publications, patents, and patent applications cited herein are hereby incorporated by reference for all purposes in their entirety.
Claims (58)
Priority Applications (7)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/067,496 US7400668B2 (en) | 2001-03-22 | 2002-02-04 | Method and system for implementing a system acquisition function for use with a communication device |
PCT/US2003/003301 WO2003067780A1 (en) | 2002-02-04 | 2003-02-03 | Acquisition in cdma receiver using reconfigurable hardware |
AU2003207832A AU2003207832A1 (en) | 2002-02-04 | 2003-02-03 | Acquisition in cdma receiver using reconfigurable hardware |
US12/141,822 US20080247443A1 (en) | 2001-03-22 | 2008-06-18 | Method and system for implementing a system acquisition function for use with a communication device |
US12/343,220 US20090104930A1 (en) | 2001-03-22 | 2008-12-23 | Apparatus, module, and method for implementing communications functions |
US12/343,333 US7620097B2 (en) | 2001-03-22 | 2008-12-23 | Communications module, device, and method for implementing a system acquisition function |
US12/607,916 US8406281B2 (en) | 2001-03-22 | 2009-10-28 | Apparatus, module, and method for implementing communications functions |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/815,122 US6836839B2 (en) | 2001-03-22 | 2001-03-22 | Adaptive integrated circuitry with heterogeneous and reconfigurable matrices of diverse and adaptive computational units having fixed, application specific computational elements |
US10/067,496 US7400668B2 (en) | 2001-03-22 | 2002-02-04 | Method and system for implementing a system acquisition function for use with a communication device |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/815,122 Continuation-In-Part US6836839B2 (en) | 2001-03-22 | 2001-03-22 | Adaptive integrated circuitry with heterogeneous and reconfigurable matrices of diverse and adaptive computational units having fixed, application specific computational elements |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/141,822 Continuation US20080247443A1 (en) | 2001-03-22 | 2008-06-18 | Method and system for implementing a system acquisition function for use with a communication device |
Publications (2)
Publication Number | Publication Date |
---|---|
US20040008640A1 true US20040008640A1 (en) | 2004-01-15 |
US7400668B2 US7400668B2 (en) | 2008-07-15 |
Family
ID=27732231
Family Applications (5)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/067,496 Expired - Lifetime US7400668B2 (en) | 2001-03-22 | 2002-02-04 | Method and system for implementing a system acquisition function for use with a communication device |
US12/141,822 Abandoned US20080247443A1 (en) | 2001-03-22 | 2008-06-18 | Method and system for implementing a system acquisition function for use with a communication device |
US12/343,333 Expired - Lifetime US7620097B2 (en) | 2001-03-22 | 2008-12-23 | Communications module, device, and method for implementing a system acquisition function |
US12/343,220 Abandoned US20090104930A1 (en) | 2001-03-22 | 2008-12-23 | Apparatus, module, and method for implementing communications functions |
US12/607,916 Expired - Lifetime US8406281B2 (en) | 2001-03-22 | 2009-10-28 | Apparatus, module, and method for implementing communications functions |
Family Applications After (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/141,822 Abandoned US20080247443A1 (en) | 2001-03-22 | 2008-06-18 | Method and system for implementing a system acquisition function for use with a communication device |
US12/343,333 Expired - Lifetime US7620097B2 (en) | 2001-03-22 | 2008-12-23 | Communications module, device, and method for implementing a system acquisition function |
US12/343,220 Abandoned US20090104930A1 (en) | 2001-03-22 | 2008-12-23 | Apparatus, module, and method for implementing communications functions |
US12/607,916 Expired - Lifetime US8406281B2 (en) | 2001-03-22 | 2009-10-28 | Apparatus, module, and method for implementing communications functions |
Country Status (3)
Country | Link |
---|---|
US (5) | US7400668B2 (en) |
AU (1) | AU2003207832A1 (en) |
WO (1) | WO2003067780A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10599365B2 (en) | 2018-03-20 | 2020-03-24 | Toshiba Memory Corporation | Storage system |
Families Citing this family (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7911993B2 (en) | 2000-07-19 | 2011-03-22 | Ipr Licensing, Inc. | Method and apparatus for allowing soft handoff of a CDMA reverse link utilizing an orthogonal channel structure |
US8537656B2 (en) | 2000-07-19 | 2013-09-17 | Ipr Licensing, Inc. | Method for compensating for multi-path of a CDMA reverse link utilizing an orthogonal channel structure |
US7400668B2 (en) * | 2001-03-22 | 2008-07-15 | Qst Holdings, Llc | Method and system for implementing a system acquisition function for use with a communication device |
US6917581B2 (en) | 2001-07-17 | 2005-07-12 | Ipr Licensing, Inc. | Use of orthogonal or near orthogonal codes in reverse link |
US7403981B2 (en) * | 2002-01-04 | 2008-07-22 | Quicksilver Technology, Inc. | Apparatus and method for adaptive multimedia reception and transmission in communication environments |
WO2007135472A1 (en) * | 2006-05-24 | 2007-11-29 | Nokia Corporation | Method in a CDMA Receiver Using Hardware and Software in Acquisition, Tracking and Hosting |
US9135203B2 (en) | 2013-05-01 | 2015-09-15 | Jonathan Glickman | Computer system and a computer device |
US10175945B2 (en) * | 2016-06-17 | 2019-01-08 | Nextnav, Llc | Methods and systems for improving correlation |
Citations (98)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3938639A (en) * | 1973-11-28 | 1976-02-17 | The Cornelius Company | Portable dispenser for mixed beverages |
US4076145A (en) * | 1976-08-09 | 1978-02-28 | The Cornelius Company | Method and apparatus for dispensing a beverage |
US4143793A (en) * | 1977-06-13 | 1979-03-13 | The Cornelius Company | Apparatus and method for dispensing a carbonated beverage |
US4252253A (en) * | 1978-02-21 | 1981-02-24 | Mcneil Corporation | Drink dispenser having central control of plural dispensing stations |
US4377246A (en) * | 1977-06-13 | 1983-03-22 | The Cornelius Company | Apparatus for dispensing a carbonated beverage |
US4578799A (en) * | 1983-10-05 | 1986-03-25 | Codenoll Technology Corporation | Method and apparatus for recovering data and clock information from a self-clocking data stream |
US4577782A (en) * | 1983-05-02 | 1986-03-25 | The Cornelius Company | Beverage dispensing station |
US4719056A (en) * | 1984-06-25 | 1988-01-12 | Isoworth Limited | Fluid treatment |
US4726494A (en) * | 1986-02-10 | 1988-02-23 | Isoworth Limited | Beverage dipensing apparatus |
US4800492A (en) * | 1987-05-13 | 1989-01-24 | The Coca-Cola Company | Data logger for a post-mix beverage dispensing system |
US4811214A (en) * | 1986-11-14 | 1989-03-07 | Princeton University | Multinode reconfigurable pipeline computer |
US4901887A (en) * | 1988-08-08 | 1990-02-20 | Burton John W | Beverage dispensing system |
US4982876A (en) * | 1986-02-10 | 1991-01-08 | Isoworth Limited | Carbonation apparatus |
US4993604A (en) * | 1985-09-13 | 1991-02-19 | The Coca-Cola Company | Low-cost post-mix beverage dispenser and syrup supply system therefor |
US5090015A (en) * | 1989-02-06 | 1992-02-18 | Motorola, Inc. | Programmable array logic self-checking system |
US5190083A (en) * | 1990-02-27 | 1993-03-02 | The Coca-Cola Company | Multiple fluid space dispenser and monitor |
US5190189A (en) * | 1990-10-30 | 1993-03-02 | Imi Cornelius Inc. | Low height beverage dispensing apparatus |
US5193151A (en) * | 1989-08-30 | 1993-03-09 | Digital Equipment Corporation | Delay-based congestion avoidance in computer networks |
US5193718A (en) * | 1991-06-25 | 1993-03-16 | Imi Cornelius Inc. | Quick electronic disconnect for a beverage dispensing valve |
US5280711A (en) * | 1993-02-25 | 1994-01-25 | Imi Cornelius Inc. | Low cost beverage dispensing apparatus |
US5297400A (en) * | 1993-02-17 | 1994-03-29 | Maytag Corporation | Liquid dispensing assembly for a refrigerator |
US5379343A (en) * | 1993-02-26 | 1995-01-03 | Motorola, Inc. | Detection of unauthorized use of software applications in communication units |
US5381546A (en) * | 1987-04-13 | 1995-01-10 | Gte Laboratories Incorporated | Control process for allocating services in communications systems |
US5381550A (en) * | 1991-12-13 | 1995-01-10 | Thinking Machines Corporation | System and method for compiling a source code supporting data parallel variables |
US5388212A (en) * | 1993-02-26 | 1995-02-07 | Motorola Inc. | Detecting unauthorized modification of communication unit based on comparison between stored hardware identification code and hardware identification code generated from operational platform identification code |
US5392960A (en) * | 1992-11-13 | 1995-02-28 | Wilshire Partners | Postmix beverage dispenser and a method for making a beverage dispenser |
US5490165A (en) * | 1993-10-28 | 1996-02-06 | Qualcomm Incorporated | Demodulation element assignment in a system capable of receiving multiple signals |
US5491823A (en) * | 1994-01-25 | 1996-02-13 | Silicon Graphics, Inc. | Loop scheduler |
US5594657A (en) * | 1993-09-27 | 1997-01-14 | Lucent Technologies Inc. | System for synthesizing field programmable gate array implementations from high level circuit descriptions |
US5600810A (en) * | 1994-12-09 | 1997-02-04 | Mitsubishi Electric Information Technology Center America, Inc. | Scaleable very long instruction word processor with parallelism matching |
US5600844A (en) * | 1991-09-20 | 1997-02-04 | Shaw; Venson M. | Single chip integrated circuit system architecture for document installation set computing |
US5603043A (en) * | 1992-11-05 | 1997-02-11 | Giga Operations Corporation | System for compiling algorithmic language source code for implementation in programmable hardware |
US5602833A (en) * | 1994-12-19 | 1997-02-11 | Qualcomm Incorporated | Method and apparatus for using Walsh shift keying in a spread spectrum communication system |
US5607083A (en) * | 1992-05-22 | 1997-03-04 | Imi Cornelius Inc. | Beverage dispensing valve |
US5608643A (en) * | 1994-09-01 | 1997-03-04 | General Programming Holdings, Inc. | System for managing multiple dispensing units and method of operation |
US5611867A (en) * | 1995-04-12 | 1997-03-18 | Maytag Corporation | Method of selecting a wash cycle for an appliance |
US5706191A (en) * | 1995-01-19 | 1998-01-06 | Gas Research Institute | Appliance interface apparatus and automated residence management system |
US5706976A (en) * | 1995-12-21 | 1998-01-13 | Purkey; Jay Floyd | Vending machine inventory control device |
US5712996A (en) * | 1993-03-15 | 1998-01-27 | Siemens Aktiengesellschaft | Process for dividing instructions of a computer program into instruction groups for parallel processing |
US5720002A (en) * | 1993-06-14 | 1998-02-17 | Motorola Inc. | Neural network and method of using same |
US5721854A (en) * | 1993-11-02 | 1998-02-24 | International Business Machines Corporation | Method and apparatus for dynamic conversion of computer instructions |
US5721693A (en) * | 1995-01-07 | 1998-02-24 | Lg Electronics Inc. | Electric home appliance real use state information collection and analysis apparatus |
US5732563A (en) * | 1993-09-22 | 1998-03-31 | Imi Cornelius Inc. | Electronically controlled beverage dispenser |
US5734808A (en) * | 1993-09-28 | 1998-03-31 | Namco Ltd. | Pipeline processing device, clipping processing device, three-dimensional simulator device and pipeline processing method |
US5860021A (en) * | 1997-04-24 | 1999-01-12 | Klingman; Edwin E. | Single chip microcontroller having down-loadable memory organization supporting "shadow" personality, optimized for bi-directional data transfers over a communication channel |
US5862961A (en) * | 1993-10-26 | 1999-01-26 | Imi Cornelius Inc. | Connection device for dispensing fluid from a bottle |
US5870427A (en) * | 1993-04-14 | 1999-02-09 | Qualcomm Incorporated | Method for multi-mode handoff using preliminary time alignment of a mobile station operating in analog mode |
US5873045A (en) * | 1997-10-29 | 1999-02-16 | International Business Machines Corporation | Mobile client computer with radio frequency transceiver |
US5881106A (en) * | 1994-09-05 | 1999-03-09 | Sgs-Thomson Microelectronics S.A. | Signal processing circuit to implement a Viterbi algorithm |
US5884284A (en) * | 1995-03-09 | 1999-03-16 | Continental Cablevision, Inc. | Telecommunication user account management system and method |
US5886537A (en) * | 1997-05-05 | 1999-03-23 | Macias; Nicholas J. | Self-reconfigurable parallel processor made from regularly-connected self-dual code/data processing cells |
US5887174A (en) * | 1996-06-18 | 1999-03-23 | International Business Machines Corporation | System, method, and program product for instruction scheduling in the presence of hardware lookahead accomplished by the rescheduling of idle slots |
US5889816A (en) * | 1996-02-02 | 1999-03-30 | Lucent Technologies, Inc. | Wireless adapter architecture for mobile computing |
US5890014A (en) * | 1996-08-05 | 1999-03-30 | Micronet Technology, Inc. | System for transparently identifying and matching an input/output profile to optimal input/output device parameters |
US6016395A (en) * | 1996-10-18 | 2000-01-18 | Samsung Electronics Co., Ltd. | Programming a vector processor and parallel programming of an asymmetric dual multiprocessor comprised of a vector processor and a risc processor |
US6021186A (en) * | 1995-04-17 | 2000-02-01 | Ricoh Company Ltd. | Automatic capture and processing of facsimile transmissions |
US6021492A (en) * | 1996-10-09 | 2000-02-01 | Hewlett-Packard Company | Software metering management of remote computing devices |
US6023742A (en) * | 1996-07-18 | 2000-02-08 | University Of Washington | Reconfigurable computing architecture for providing pipelined data paths |
US6028610A (en) * | 1995-08-04 | 2000-02-22 | Sun Microsystems, Inc. | Geometry instructions for decompression of three-dimensional graphics data |
US6175892B1 (en) * | 1998-06-19 | 2001-01-16 | Hitachi America. Ltd. | Registers and methods for accessing registers for use in a single instruction multiple data system |
US6175854B1 (en) * | 1996-06-11 | 2001-01-16 | Ameritech Services, Inc. | Computer system architecture and method for multi-user, real-time applications |
US6181981B1 (en) * | 1996-05-15 | 2001-01-30 | Marconi Communications Limited | Apparatus and method for improved vending machine inventory maintenance |
US6185418B1 (en) * | 1997-11-07 | 2001-02-06 | Lucent Technologies Inc. | Adaptive digital radio communication system |
US6192388B1 (en) * | 1996-06-20 | 2001-02-20 | Avid Technology, Inc. | Detecting available computers to participate in computationally complex distributed processing problem |
US6192070B1 (en) * | 1998-01-02 | 2001-02-20 | Mitsubishi Electric Research Laboratories, Inc. | Universal modem for digital video, audio and data communications |
US6192255B1 (en) * | 1992-12-15 | 2001-02-20 | Texas Instruments Incorporated | Communication system and methods for enhanced information transfer |
US6195788B1 (en) * | 1997-10-17 | 2001-02-27 | Altera Corporation | Mapping heterogeneous logic elements in a programmable logic device |
US20020010848A1 (en) * | 2000-05-29 | 2002-01-24 | Shoichi Kamano | Data processing system |
US20020013937A1 (en) * | 1999-02-17 | 2002-01-31 | Ostanevich Alexander Y. | Register economy heuristic for a cycle driven multiple issue instruction scheduler |
US20020013799A1 (en) * | 2000-05-11 | 2002-01-31 | Blaker David M. | Accelerated montgomery multiplication using plural multipliers |
US20020015439A1 (en) * | 1996-04-25 | 2002-02-07 | Sanjai Kohli | GPS system for navigating a vehicle |
US20020015435A1 (en) * | 2000-07-31 | 2002-02-07 | Keith Rieken | Apparatus and method for configurable multi-dwell search engine for spread spectrum applications |
US6346824B1 (en) * | 1996-04-09 | 2002-02-12 | Xilinx, Inc. | Dedicated function fabric for use in field programmable gate arrays |
US6347346B1 (en) * | 1999-06-30 | 2002-02-12 | Chameleon Systems, Inc. | Local memory unit system with global access for use on reconfigurable chips |
US6349394B1 (en) * | 1999-03-31 | 2002-02-19 | International Business Machines Corporation | Performance monitoring in a NUMA computer |
US20020023210A1 (en) * | 2000-04-12 | 2002-02-21 | Mark Tuomenoksa | Method and system for managing and configuring virtual private networks |
US20020024942A1 (en) * | 2000-08-30 | 2002-02-28 | Nec Corporation | Cell search method and circuit in W-CDMA system |
US20020024993A1 (en) * | 1999-12-30 | 2002-02-28 | Ravi Subramanian | Method and apparatus to support multi standard, multi service base-stations for wireless voice and data networks |
US20030007606A1 (en) * | 2001-02-01 | 2003-01-09 | Estech Systems, Inc. | Service observing in a voice over IP telephone system |
US6507947B1 (en) * | 1999-08-20 | 2003-01-14 | Hewlett-Packard Company | Programmatic synthesis of processor element arrays |
US20030012270A1 (en) * | 2000-10-06 | 2003-01-16 | Changming Zhou | Receiver |
US6510138B1 (en) * | 1999-02-25 | 2003-01-21 | Fairchild Semiconductor Corporation | Network switch with head of line input buffer queue clearing |
US6510510B1 (en) * | 1996-01-25 | 2003-01-21 | Analog Devices, Inc. | Digital signal processor having distributed register file |
US20030018700A1 (en) * | 2001-03-26 | 2003-01-23 | Giroti Sudhir K. | Unified XML voice and data media converging switch and application delivery system |
US20030018446A1 (en) * | 2001-06-29 | 2003-01-23 | National Instruments Corporation | Graphical program node for generating a measurement program |
US20030023830A1 (en) * | 2001-07-25 | 2003-01-30 | Hogenauer Eugene B. | Method and system for encoding instructions for a VLIW that reduces instruction memory requirements |
US20030026242A1 (en) * | 1997-06-18 | 2003-02-06 | Harri Jokinen | Method for identifying base stations of a time division cellular network in a mobile station and mobile station |
US20030030004A1 (en) * | 2001-01-31 | 2003-02-13 | General Electric Company | Shared memory control between detector framing node and processor |
US6675265B2 (en) * | 2000-06-10 | 2004-01-06 | Hewlett-Packard Development Company, L.P. | Multiprocessor cache coherence system and method in which processor nodes and input/output nodes are equal participants |
US20040006584A1 (en) * | 2000-08-08 | 2004-01-08 | Ivo Vandeweerd | Array of parallel programmable processing engines and deterministic method of operating the same |
US20040010645A1 (en) * | 2002-06-25 | 2004-01-15 | Quicksilver Technology, Inc. | Uniform interface for a functional node in an adaptive computing engine |
US20040015970A1 (en) * | 2002-03-06 | 2004-01-22 | Scheuermann W. James | Method and system for data flow control of execution nodes of an adaptive computing engine (ACE) |
US20040025159A1 (en) * | 2002-06-25 | 2004-02-05 | Quicksilver Technology, Inc. | Hardware task manager |
US6691148B1 (en) * | 1998-03-13 | 2004-02-10 | Verizon Corporate Services Group Inc. | Framework for providing quality of service requirements in a distributed object-oriented computer system |
US6985517B2 (en) * | 2000-11-09 | 2006-01-10 | Matsushita Electric Industrial Co., Ltd. | Matched filter and correlation detection method |
US6986021B2 (en) * | 2001-11-30 | 2006-01-10 | Quick Silver Technology, Inc. | Apparatus, method, system and executable module for configuration and operation of adaptive integrated circuitry having fixed, application specific computational elements |
US6988139B1 (en) * | 2002-04-26 | 2006-01-17 | Microsoft Corporation | Distributed computing of a job corresponding to a plurality of predefined tasks |
US7181242B2 (en) * | 2001-10-29 | 2007-02-20 | Ericsson Inc. | Systems and methods for communicating data at radio base station nodes |
Family Cites Families (111)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3409175A (en) | 1966-11-10 | 1968-11-05 | Thomas M. Byrne | Liquid dispensing device |
US3666143A (en) | 1970-06-22 | 1972-05-30 | Murray Weston | Automatic fluid dispensing apparatus with manual override |
US3665171A (en) | 1970-12-14 | 1972-05-23 | Bell Telephone Labor Inc | Nonrecursive digital filter apparatus employing delayedadd configuration |
USRE30301E (en) | 1972-03-10 | 1980-06-10 | The Cornelius Company | Beverage mixing and dispensing apparatus |
US4146793A (en) * | 1972-07-27 | 1979-03-27 | Siemens Ag | X-ray devices using epoxy resins strengthened with carbonic fibrous material |
US3960298A (en) | 1972-10-25 | 1976-06-01 | The Cornelius Company | Container assembly for use with a separator dispenser |
US3995441A (en) | 1973-08-20 | 1976-12-07 | The Cornelius Company | Beverage dispensing system |
US3991911A (en) | 1973-09-07 | 1976-11-16 | American Beverage Control | Automatic drink dispensing apparatus having programming means |
US3949903A (en) | 1973-11-07 | 1976-04-13 | General Motors Corporation | Water and beverage concentrate dispenser |
US3967062A (en) | 1975-03-05 | 1976-06-29 | Ncr Corporation | Method and apparatus for encoding data and clock information in a self-clocking data stream |
US4174872A (en) | 1978-04-10 | 1979-11-20 | The Cornelius Company | Beverage dispensing machine and cabinet therefor |
US4181242A (en) * | 1978-05-30 | 1980-01-01 | The Cornelius Company | Method and apparatus for dispensing a beverage |
US4172669A (en) | 1978-07-27 | 1979-10-30 | The Cornelius Company | Mixing and dispensing machine |
US4237536A (en) | 1978-10-12 | 1980-12-02 | M.R.E. Enterprises, Inc. | System for indicating and controlling dispensing of beverages |
US4302775A (en) | 1978-12-15 | 1981-11-24 | Compression Labs, Inc. | Digital video compression system and methods utilizing scene adaptive coding with rate buffer feedback |
US4413752A (en) | 1979-01-04 | 1983-11-08 | The Cornelius Company | Apparatus for dispensing a carbonated beverage |
US4222972A (en) | 1979-01-29 | 1980-09-16 | Caldwell Michael C | Method and means for carbonating liquids in situ |
US4218014A (en) | 1979-02-21 | 1980-08-19 | The Cornelius Company | Multiple flavor post-mix beverage dispensing head |
US4380046A (en) | 1979-05-21 | 1983-04-12 | Nasa | Massively parallel processor computer |
US4523697A (en) | 1979-07-11 | 1985-06-18 | Cadbury Schweppes Limited | Liquid dispensing package |
USRE32179E (en) | 1979-10-12 | 1986-06-10 | The Coca-Cola Company | Post-mix beverage dispensing system syrup package, valving system, and carbonator therefor |
US4333587A (en) | 1980-01-31 | 1982-06-08 | The Coca-Cola Company | Beverage dispenser |
US4354613A (en) | 1980-05-15 | 1982-10-19 | Trafalgar Industries, Inc. | Microprocessor based vending apparatus |
US4393468A (en) | 1981-03-26 | 1983-07-12 | Advanced Micro Devices, Inc. | Bit slice microprogrammable processor for signal processing applications |
US4560089A (en) | 1981-05-11 | 1985-12-24 | The Cornelius Company | Apparatus for dispensing a carbonated beverage |
US4936488A (en) | 1982-09-07 | 1990-06-26 | The Cornelius Company | Beverage dispensing valve |
US5129549A (en) | 1982-09-07 | 1992-07-14 | Imi Cornelius Inc. | Beverage dispensing valve |
US4549675A (en) | 1982-09-07 | 1985-10-29 | The Cornelius Co. | Beverage dispensing valve |
US4509690A (en) | 1982-12-06 | 1985-04-09 | The Cornelius Company | Carbonated beverage mixing nozzle for a dispenser |
US4475448A (en) | 1983-02-22 | 1984-10-09 | General Foods Corporation | Reactant/gas separation means for beverage carbonation device |
US4458584A (en) | 1983-02-22 | 1984-07-10 | General Foods Corporation | Beverage carbonation device |
US4466342A (en) | 1983-02-22 | 1984-08-21 | General Foods Corporation | Carbonation chamber with sparger for beverage carbonation |
GB2137839B (en) | 1983-04-09 | 1986-06-04 | Schlumberger Measurement | Digital signal processors |
US4553573A (en) | 1983-10-20 | 1985-11-19 | Pepsico Inc. | Bulk syrup delivery system |
US4824075A (en) | 1984-02-14 | 1989-04-25 | Walter Holzboog | Tilt action dispensing valve assembly |
US4870302A (en) | 1984-03-12 | 1989-09-26 | Xilinx, Inc. | Configurable electrical circuit having configurable logic elements and configurable interconnects |
US4658988A (en) | 1984-04-02 | 1987-04-21 | The Cornelius Company | Multiple flavor post-mix beverage dispensing apparatus |
US4694416A (en) | 1985-02-25 | 1987-09-15 | General Electric Company | VLSI programmable digital signal processor |
US4706216A (en) | 1985-02-27 | 1987-11-10 | Xilinx, Inc. | Configurable logic element |
US4967340A (en) | 1985-06-12 | 1990-10-30 | E-Systems, Inc. | Adaptive processing system having an array of individually configurable processing components |
US4713755A (en) | 1985-06-28 | 1987-12-15 | Hewlett-Packard Company | Cache memory consistency control with explicit software instructions |
US4765513A (en) | 1985-08-26 | 1988-08-23 | The Cornelius Company | Post-mix beverage dispenser with nozzle |
US4711374A (en) | 1985-09-13 | 1987-12-08 | The Coca-Cola Company | Low-cost post-mix beverage dispenser and syrup supply system therefor |
US4747516A (en) | 1985-12-23 | 1988-05-31 | Liquid Motion Industries, Co. | Soft drink maker |
US4748585A (en) | 1985-12-26 | 1988-05-31 | Chiarulli Donald M | Processor utilizing reconfigurable process segments to accomodate data word length |
US4974643A (en) | 1986-01-31 | 1990-12-04 | The Cornelius Company | Method of and apparatus for dispensing beverage into a tilted receptacle with automatic level responsive shut off |
US4960261A (en) | 1986-03-17 | 1990-10-02 | Isoworth Limited | Gas cylinder connector |
US5021947A (en) | 1986-03-31 | 1991-06-04 | Hughes Aircraft Company | Data-flow multiprocessor architecture with three dimensional multistage interconnection network for efficient signal and data processing |
US4760525A (en) | 1986-06-10 | 1988-07-26 | The United States Of America As Represented By The Secretary Of The Air Force | Complex arithmetic vector processor for performing control function, scalar operation, and set-up of vector signal processing instruction |
US4760544A (en) | 1986-06-20 | 1988-07-26 | Plessey Overseas Limited | Arithmetic logic and shift device |
US5165023A (en) | 1986-12-17 | 1992-11-17 | Massachusetts Institute Of Technology | Parallel processing system with processor array and network communications system for transmitting messages of variable length |
US4766548A (en) | 1987-01-02 | 1988-08-23 | Pepsico Inc. | Telelink monitoring and reporting system |
US4781309A (en) | 1987-02-19 | 1988-11-01 | The Cornelius Company | Dispenser with improved carbonated water manifold |
US5177700A (en) * | 1987-02-19 | 1993-01-05 | Ant Nachrichtentechnik Gmbh | Non-recursive half-band filter |
US4856684A (en) | 1987-04-06 | 1989-08-15 | William Gerstung | Valve for a pressurized dispensing can containing flowable materials |
US4827426A (en) | 1987-05-18 | 1989-05-02 | The Coca-Cola Company | Data acquisition and processing system for post-mix beverage dispensers |
US4850269A (en) | 1987-06-26 | 1989-07-25 | Aquatec, Inc. | Low pressure, high efficiency carbonator and method |
GB2210441B (en) | 1987-10-01 | 1992-03-04 | Isoworth Ltd | Pressure vessel |
US4921315A (en) | 1987-12-21 | 1990-05-01 | Whirlpool Corporation | Refrigerator door structure |
US4905231A (en) * | 1988-05-03 | 1990-02-27 | American Telephone And Telegraph Company, At&T Bell Laboratories | Multi-media virtual circuit |
US4932564A (en) | 1988-05-20 | 1990-06-12 | The Cornelius Company | Multiple flavor post-mix beverage dispensing head |
DE3829831A1 (en) | 1988-09-02 | 1990-03-15 | Hansa Metallwerke Ag | DEVICE FOR TAPING A SELECTABLE QUANTITY OF LIQUID, IN PARTICULAR QUANTITY OF WATER |
US4930666A (en) | 1988-10-28 | 1990-06-05 | The Coca-Cola Company | Juice dispensing system for a refrigerator door |
US6986142B1 (en) * | 1989-05-04 | 2006-01-10 | Texas Instruments Incorporated | Microphone/speaker system with context switching in processor |
US5240144A (en) | 1989-01-06 | 1993-08-31 | Joseph Feldman | Beverage dispensing apparatus |
US5007560A (en) | 1989-03-01 | 1991-04-16 | Sassak John J | Beer dispensing and monitoring method and apparatus |
US5261099A (en) | 1989-08-24 | 1993-11-09 | International Business Machines Corp. | Synchronous communications scheduler allowing transient computing overloads using a request buffer |
US4961533A (en) | 1989-09-27 | 1990-10-09 | Viac Inc. | Inventory control system |
GB2236736A (en) | 1989-09-27 | 1991-04-17 | Isoworth Ltd | Carbonation apparatus for dispensing drinks, with plural carbonation chambers |
US5044171A (en) | 1989-11-06 | 1991-09-03 | Eli Farkas | Counter with integral carbonated beverage dispenser |
US5099418A (en) * | 1990-06-14 | 1992-03-24 | Hughes Aircraft Company | Distributed data driven process |
US5203474A (en) | 1990-06-16 | 1993-04-20 | Alco Standard Corporation | Beverage dispensing nozzle |
US5144166A (en) | 1990-11-02 | 1992-09-01 | Concurrent Logic, Inc. | Programmable logic cell and array |
US5218240A (en) | 1990-11-02 | 1993-06-08 | Concurrent Logic, Inc. | Programmable logic cell and array with bus repeaters |
US5245227A (en) | 1990-11-02 | 1993-09-14 | Atmel Corporation | Versatile programmable logic cell for use in configurable logic arrays |
US5156301A (en) | 1990-12-17 | 1992-10-20 | Imi Cornelius Inc. | Constant ratio post-mix beverage dispensing valve |
US5202993A (en) | 1991-02-27 | 1993-04-13 | Sun Microsystems, Inc. | Method and apparatus for cost-based heuristic instruction scheduling |
US5176002A (en) * | 1991-04-10 | 1993-01-05 | Process Systems International, Inc. | Method of controlling vapor loss from containers of volatile chemicals |
US5156871A (en) | 1991-05-01 | 1992-10-20 | Imi Cornelius Inc. | Low cost beverage carbonating apparatus and method |
US5802290A (en) * | 1992-07-29 | 1998-09-01 | Virtual Computer Corporation | Computer network of distributed virtual computers which are EAC reconfigurable in response to instruction to be executed |
US5263509A (en) | 1992-11-12 | 1993-11-23 | General Electric Company | Refrigerator with door mounted dispenser supply mechanism |
US5388062A (en) * | 1993-05-06 | 1995-02-07 | Thomson Consumer Electronics, Inc. | Reconfigurable programmable digital filter architecture useful in communication receiver |
US5729754A (en) * | 1994-03-28 | 1998-03-17 | Estes; Mark D. | Associative network method and apparatus |
US5889989A (en) * | 1996-09-16 | 1999-03-30 | The Research Foundation Of State University Of New York | Load sharing controller for optimizing monetary cost |
US6628699B2 (en) | 1997-06-23 | 2003-09-30 | Schlumberger Resource Management Systems, Inc. | Receiving a spread spectrum signal |
US6036166A (en) * | 1997-09-25 | 2000-03-14 | Imi Cornelius Inc. | Chamber valve |
TW417082B (en) * | 1997-10-31 | 2001-01-01 | Yamaha Corp | Digital filtering processing method, device and Audio/Video positioning device |
US6173389B1 (en) * | 1997-12-04 | 2001-01-09 | Billions Of Operations Per Second, Inc. | Methods and apparatus for dynamic very long instruction word sub-instruction selection for execution time parallelism in an indirect very long instruction word processor |
US6269075B1 (en) * | 1998-01-26 | 2001-07-31 | Nokia Mobile Phones Limited | Finger assignment in a CDMA rake receiver |
GB9818377D0 (en) * | 1998-08-21 | 1998-10-21 | Sgs Thomson Microelectronics | An integrated circuit with multiple processing cores |
US6591283B1 (en) * | 1998-12-24 | 2003-07-08 | Stmicroelectronics N.V. | Efficient interpolator for high speed timing recovery |
US6526570B1 (en) * | 1999-04-23 | 2003-02-25 | Sun Microsystems, Inc. | File portability techniques |
KR100358427B1 (en) * | 1999-07-12 | 2002-10-25 | 한국전자통신연구원 | Hardware-Efficient Demodulator for CDMA Adaptive Antenna Array Systems |
US6349248B1 (en) * | 1999-10-28 | 2002-02-19 | General Electric Company | Method and system for predicting failures in a power resistive grid of a vehicle |
US6421372B1 (en) * | 1999-11-10 | 2002-07-16 | Itt Manufacturing Enterprises, Inc. | Sequential-acquisition, multi-band, multi-channel, matched filter |
US6694380B1 (en) * | 1999-12-27 | 2004-02-17 | Intel Corporation | Mapping requests from a processing unit that uses memory-mapped input-output space |
AU2915201A (en) | 1999-12-30 | 2001-07-16 | Morphics Technology, Inc. | A fast initial acquisition and search device for a spread spectrum communicationsystem |
US6701431B2 (en) * | 2000-01-28 | 2004-03-02 | Infineon Technologies Ag | Method of generating a configuration for a configurable spread spectrum communication device |
WO2001056199A1 (en) | 2000-01-28 | 2001-08-02 | Morphics Technology Inc. | Method and apparatus for processing a secondary synchronization channel in a spread spectrum system |
US6658048B1 (en) * | 2000-04-07 | 2003-12-02 | Nokia Mobile Phones, Ltd. | Global positioning system code phase detector with multipath compensation and method for reducing multipath components associated with a received signal |
US6259725B1 (en) | 2000-05-30 | 2001-07-10 | Linex Technologies, Inc. | Spread-spectrum acquisition using counters |
US7082174B1 (en) * | 2000-07-24 | 2006-07-25 | Qualcomm, Incorporated | Method and apparatus for processing a modulated signal using an equalizer and a rake receiver |
US7085310B2 (en) * | 2001-01-29 | 2006-08-01 | Qualcomm, Incorporated | Method and apparatus for managing finger resources in a communication system |
US7400668B2 (en) * | 2001-03-22 | 2008-07-15 | Qst Holdings, Llc | Method and system for implementing a system acquisition function for use with a communication device |
US7752419B1 (en) * | 2001-03-22 | 2010-07-06 | Qst Holdings, Llc | Method and system for managing hardware resources to implement system functions using an adaptive computing architecture |
US7151925B2 (en) * | 2001-09-10 | 2006-12-19 | Industrial Technology Research Institute | Software defined radio (SDR) architecture for wireless digital communication systems |
US7610366B2 (en) * | 2001-11-06 | 2009-10-27 | Canon Kabushiki Kaisha | Dynamic network device reconfiguration |
US20040062300A1 (en) * | 2002-10-01 | 2004-04-01 | Mcdonough John G. | System and method for detecting direct sequence spread spectrum signals using batch processing of independent parameters |
US6859434B2 (en) * | 2002-10-01 | 2005-02-22 | Comsys Communication & Signal Processing Ltd. | Data transfer scheme in a communications system incorporating multiple processing elements |
US8135057B2 (en) * | 2002-12-20 | 2012-03-13 | Texas Instruments Incorporated | Reconfigurable chip level equalizer architecture |
US7200837B2 (en) * | 2003-08-21 | 2007-04-03 | Qst Holdings, Llc | System, method and software for static and dynamic programming and configuration of an adaptive computing architecture |
-
2002
- 2002-02-04 US US10/067,496 patent/US7400668B2/en not_active Expired - Lifetime
-
2003
- 2003-02-03 AU AU2003207832A patent/AU2003207832A1/en not_active Abandoned
- 2003-02-03 WO PCT/US2003/003301 patent/WO2003067780A1/en not_active Application Discontinuation
-
2008
- 2008-06-18 US US12/141,822 patent/US20080247443A1/en not_active Abandoned
- 2008-12-23 US US12/343,333 patent/US7620097B2/en not_active Expired - Lifetime
- 2008-12-23 US US12/343,220 patent/US20090104930A1/en not_active Abandoned
-
2009
- 2009-10-28 US US12/607,916 patent/US8406281B2/en not_active Expired - Lifetime
Patent Citations (99)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3938639A (en) * | 1973-11-28 | 1976-02-17 | The Cornelius Company | Portable dispenser for mixed beverages |
US4076145A (en) * | 1976-08-09 | 1978-02-28 | The Cornelius Company | Method and apparatus for dispensing a beverage |
US4143793A (en) * | 1977-06-13 | 1979-03-13 | The Cornelius Company | Apparatus and method for dispensing a carbonated beverage |
US4377246A (en) * | 1977-06-13 | 1983-03-22 | The Cornelius Company | Apparatus for dispensing a carbonated beverage |
US4252253A (en) * | 1978-02-21 | 1981-02-24 | Mcneil Corporation | Drink dispenser having central control of plural dispensing stations |
US4577782A (en) * | 1983-05-02 | 1986-03-25 | The Cornelius Company | Beverage dispensing station |
US4578799A (en) * | 1983-10-05 | 1986-03-25 | Codenoll Technology Corporation | Method and apparatus for recovering data and clock information from a self-clocking data stream |
US4719056A (en) * | 1984-06-25 | 1988-01-12 | Isoworth Limited | Fluid treatment |
US4993604A (en) * | 1985-09-13 | 1991-02-19 | The Coca-Cola Company | Low-cost post-mix beverage dispenser and syrup supply system therefor |
US4726494A (en) * | 1986-02-10 | 1988-02-23 | Isoworth Limited | Beverage dipensing apparatus |
US4982876A (en) * | 1986-02-10 | 1991-01-08 | Isoworth Limited | Carbonation apparatus |
US4811214A (en) * | 1986-11-14 | 1989-03-07 | Princeton University | Multinode reconfigurable pipeline computer |
US5381546A (en) * | 1987-04-13 | 1995-01-10 | Gte Laboratories Incorporated | Control process for allocating services in communications systems |
US4800492A (en) * | 1987-05-13 | 1989-01-24 | The Coca-Cola Company | Data logger for a post-mix beverage dispensing system |
US4901887A (en) * | 1988-08-08 | 1990-02-20 | Burton John W | Beverage dispensing system |
US5090015A (en) * | 1989-02-06 | 1992-02-18 | Motorola, Inc. | Programmable array logic self-checking system |
US5193151A (en) * | 1989-08-30 | 1993-03-09 | Digital Equipment Corporation | Delay-based congestion avoidance in computer networks |
US5190083A (en) * | 1990-02-27 | 1993-03-02 | The Coca-Cola Company | Multiple fluid space dispenser and monitor |
US5190189A (en) * | 1990-10-30 | 1993-03-02 | Imi Cornelius Inc. | Low height beverage dispensing apparatus |
US5193718A (en) * | 1991-06-25 | 1993-03-16 | Imi Cornelius Inc. | Quick electronic disconnect for a beverage dispensing valve |
US5600844A (en) * | 1991-09-20 | 1997-02-04 | Shaw; Venson M. | Single chip integrated circuit system architecture for document installation set computing |
US5381550A (en) * | 1991-12-13 | 1995-01-10 | Thinking Machines Corporation | System and method for compiling a source code supporting data parallel variables |
US5607083A (en) * | 1992-05-22 | 1997-03-04 | Imi Cornelius Inc. | Beverage dispensing valve |
US5603043A (en) * | 1992-11-05 | 1997-02-11 | Giga Operations Corporation | System for compiling algorithmic language source code for implementation in programmable hardware |
US5392960A (en) * | 1992-11-13 | 1995-02-28 | Wilshire Partners | Postmix beverage dispenser and a method for making a beverage dispenser |
US6192255B1 (en) * | 1992-12-15 | 2001-02-20 | Texas Instruments Incorporated | Communication system and methods for enhanced information transfer |
US5297400A (en) * | 1993-02-17 | 1994-03-29 | Maytag Corporation | Liquid dispensing assembly for a refrigerator |
US5280711A (en) * | 1993-02-25 | 1994-01-25 | Imi Cornelius Inc. | Low cost beverage dispensing apparatus |
US5379343A (en) * | 1993-02-26 | 1995-01-03 | Motorola, Inc. | Detection of unauthorized use of software applications in communication units |
US5388212A (en) * | 1993-02-26 | 1995-02-07 | Motorola Inc. | Detecting unauthorized modification of communication unit based on comparison between stored hardware identification code and hardware identification code generated from operational platform identification code |
US5712996A (en) * | 1993-03-15 | 1998-01-27 | Siemens Aktiengesellschaft | Process for dividing instructions of a computer program into instruction groups for parallel processing |
US5870427A (en) * | 1993-04-14 | 1999-02-09 | Qualcomm Incorporated | Method for multi-mode handoff using preliminary time alignment of a mobile station operating in analog mode |
US5720002A (en) * | 1993-06-14 | 1998-02-17 | Motorola Inc. | Neural network and method of using same |
US5732563A (en) * | 1993-09-22 | 1998-03-31 | Imi Cornelius Inc. | Electronically controlled beverage dispenser |
US5594657A (en) * | 1993-09-27 | 1997-01-14 | Lucent Technologies Inc. | System for synthesizing field programmable gate array implementations from high level circuit descriptions |
US5734808A (en) * | 1993-09-28 | 1998-03-31 | Namco Ltd. | Pipeline processing device, clipping processing device, three-dimensional simulator device and pipeline processing method |
US5862961A (en) * | 1993-10-26 | 1999-01-26 | Imi Cornelius Inc. | Connection device for dispensing fluid from a bottle |
US5490165A (en) * | 1993-10-28 | 1996-02-06 | Qualcomm Incorporated | Demodulation element assignment in a system capable of receiving multiple signals |
US5721854A (en) * | 1993-11-02 | 1998-02-24 | International Business Machines Corporation | Method and apparatus for dynamic conversion of computer instructions |
US5491823A (en) * | 1994-01-25 | 1996-02-13 | Silicon Graphics, Inc. | Loop scheduler |
US5608643A (en) * | 1994-09-01 | 1997-03-04 | General Programming Holdings, Inc. | System for managing multiple dispensing units and method of operation |
US5881106A (en) * | 1994-09-05 | 1999-03-09 | Sgs-Thomson Microelectronics S.A. | Signal processing circuit to implement a Viterbi algorithm |
US5600810A (en) * | 1994-12-09 | 1997-02-04 | Mitsubishi Electric Information Technology Center America, Inc. | Scaleable very long instruction word processor with parallelism matching |
US5602833A (en) * | 1994-12-19 | 1997-02-11 | Qualcomm Incorporated | Method and apparatus for using Walsh shift keying in a spread spectrum communication system |
US5721693A (en) * | 1995-01-07 | 1998-02-24 | Lg Electronics Inc. | Electric home appliance real use state information collection and analysis apparatus |
US5706191A (en) * | 1995-01-19 | 1998-01-06 | Gas Research Institute | Appliance interface apparatus and automated residence management system |
US5884284A (en) * | 1995-03-09 | 1999-03-16 | Continental Cablevision, Inc. | Telecommunication user account management system and method |
US5611867A (en) * | 1995-04-12 | 1997-03-18 | Maytag Corporation | Method of selecting a wash cycle for an appliance |
US6021186A (en) * | 1995-04-17 | 2000-02-01 | Ricoh Company Ltd. | Automatic capture and processing of facsimile transmissions |
US6028610A (en) * | 1995-08-04 | 2000-02-22 | Sun Microsystems, Inc. | Geometry instructions for decompression of three-dimensional graphics data |
US5706976A (en) * | 1995-12-21 | 1998-01-13 | Purkey; Jay Floyd | Vending machine inventory control device |
US6510510B1 (en) * | 1996-01-25 | 2003-01-21 | Analog Devices, Inc. | Digital signal processor having distributed register file |
US5889816A (en) * | 1996-02-02 | 1999-03-30 | Lucent Technologies, Inc. | Wireless adapter architecture for mobile computing |
US6346824B1 (en) * | 1996-04-09 | 2002-02-12 | Xilinx, Inc. | Dedicated function fabric for use in field programmable gate arrays |
US20020015439A1 (en) * | 1996-04-25 | 2002-02-07 | Sanjai Kohli | GPS system for navigating a vehicle |
US6181981B1 (en) * | 1996-05-15 | 2001-01-30 | Marconi Communications Limited | Apparatus and method for improved vending machine inventory maintenance |
US6175854B1 (en) * | 1996-06-11 | 2001-01-16 | Ameritech Services, Inc. | Computer system architecture and method for multi-user, real-time applications |
US5887174A (en) * | 1996-06-18 | 1999-03-23 | International Business Machines Corporation | System, method, and program product for instruction scheduling in the presence of hardware lookahead accomplished by the rescheduling of idle slots |
US6192388B1 (en) * | 1996-06-20 | 2001-02-20 | Avid Technology, Inc. | Detecting available computers to participate in computationally complex distributed processing problem |
US6023742A (en) * | 1996-07-18 | 2000-02-08 | University Of Washington | Reconfigurable computing architecture for providing pipelined data paths |
US5890014A (en) * | 1996-08-05 | 1999-03-30 | Micronet Technology, Inc. | System for transparently identifying and matching an input/output profile to optimal input/output device parameters |
US6021492A (en) * | 1996-10-09 | 2000-02-01 | Hewlett-Packard Company | Software metering management of remote computing devices |
US6016395A (en) * | 1996-10-18 | 2000-01-18 | Samsung Electronics Co., Ltd. | Programming a vector processor and parallel programming of an asymmetric dual multiprocessor comprised of a vector processor and a risc processor |
US5860021A (en) * | 1997-04-24 | 1999-01-12 | Klingman; Edwin E. | Single chip microcontroller having down-loadable memory organization supporting "shadow" personality, optimized for bi-directional data transfers over a communication channel |
US5886537A (en) * | 1997-05-05 | 1999-03-23 | Macias; Nicholas J. | Self-reconfigurable parallel processor made from regularly-connected self-dual code/data processing cells |
US20030026242A1 (en) * | 1997-06-18 | 2003-02-06 | Harri Jokinen | Method for identifying base stations of a time division cellular network in a mobile station and mobile station |
US6195788B1 (en) * | 1997-10-17 | 2001-02-27 | Altera Corporation | Mapping heterogeneous logic elements in a programmable logic device |
US5873045A (en) * | 1997-10-29 | 1999-02-16 | International Business Machines Corporation | Mobile client computer with radio frequency transceiver |
US6185418B1 (en) * | 1997-11-07 | 2001-02-06 | Lucent Technologies Inc. | Adaptive digital radio communication system |
US6192070B1 (en) * | 1998-01-02 | 2001-02-20 | Mitsubishi Electric Research Laboratories, Inc. | Universal modem for digital video, audio and data communications |
US6691148B1 (en) * | 1998-03-13 | 2004-02-10 | Verizon Corporate Services Group Inc. | Framework for providing quality of service requirements in a distributed object-oriented computer system |
US6175892B1 (en) * | 1998-06-19 | 2001-01-16 | Hitachi America. Ltd. | Registers and methods for accessing registers for use in a single instruction multiple data system |
US20020013937A1 (en) * | 1999-02-17 | 2002-01-31 | Ostanevich Alexander Y. | Register economy heuristic for a cycle driven multiple issue instruction scheduler |
US6510138B1 (en) * | 1999-02-25 | 2003-01-21 | Fairchild Semiconductor Corporation | Network switch with head of line input buffer queue clearing |
US6349394B1 (en) * | 1999-03-31 | 2002-02-19 | International Business Machines Corporation | Performance monitoring in a NUMA computer |
US6347346B1 (en) * | 1999-06-30 | 2002-02-12 | Chameleon Systems, Inc. | Local memory unit system with global access for use on reconfigurable chips |
US6507947B1 (en) * | 1999-08-20 | 2003-01-14 | Hewlett-Packard Company | Programmatic synthesis of processor element arrays |
US20020024993A1 (en) * | 1999-12-30 | 2002-02-28 | Ravi Subramanian | Method and apparatus to support multi standard, multi service base-stations for wireless voice and data networks |
US20020023210A1 (en) * | 2000-04-12 | 2002-02-21 | Mark Tuomenoksa | Method and system for managing and configuring virtual private networks |
US20020013799A1 (en) * | 2000-05-11 | 2002-01-31 | Blaker David M. | Accelerated montgomery multiplication using plural multipliers |
US20020010848A1 (en) * | 2000-05-29 | 2002-01-24 | Shoichi Kamano | Data processing system |
US6675265B2 (en) * | 2000-06-10 | 2004-01-06 | Hewlett-Packard Development Company, L.P. | Multiprocessor cache coherence system and method in which processor nodes and input/output nodes are equal participants |
US20020015435A1 (en) * | 2000-07-31 | 2002-02-07 | Keith Rieken | Apparatus and method for configurable multi-dwell search engine for spread spectrum applications |
US20040006584A1 (en) * | 2000-08-08 | 2004-01-08 | Ivo Vandeweerd | Array of parallel programmable processing engines and deterministic method of operating the same |
US20020024942A1 (en) * | 2000-08-30 | 2002-02-28 | Nec Corporation | Cell search method and circuit in W-CDMA system |
US20030012270A1 (en) * | 2000-10-06 | 2003-01-16 | Changming Zhou | Receiver |
US6985517B2 (en) * | 2000-11-09 | 2006-01-10 | Matsushita Electric Industrial Co., Ltd. | Matched filter and correlation detection method |
US20030030004A1 (en) * | 2001-01-31 | 2003-02-13 | General Electric Company | Shared memory control between detector framing node and processor |
US20030007606A1 (en) * | 2001-02-01 | 2003-01-09 | Estech Systems, Inc. | Service observing in a voice over IP telephone system |
US20030018700A1 (en) * | 2001-03-26 | 2003-01-23 | Giroti Sudhir K. | Unified XML voice and data media converging switch and application delivery system |
US20030018446A1 (en) * | 2001-06-29 | 2003-01-23 | National Instruments Corporation | Graphical program node for generating a measurement program |
US20030023830A1 (en) * | 2001-07-25 | 2003-01-30 | Hogenauer Eugene B. | Method and system for encoding instructions for a VLIW that reduces instruction memory requirements |
US7181242B2 (en) * | 2001-10-29 | 2007-02-20 | Ericsson Inc. | Systems and methods for communicating data at radio base station nodes |
US6986021B2 (en) * | 2001-11-30 | 2006-01-10 | Quick Silver Technology, Inc. | Apparatus, method, system and executable module for configuration and operation of adaptive integrated circuitry having fixed, application specific computational elements |
US20060031660A1 (en) * | 2001-11-30 | 2006-02-09 | Master Paul L | Apparatus, method, system and executable module for configuration and operation of adaptive integrated circuitry having fixed, application specific computational elements |
US20040015970A1 (en) * | 2002-03-06 | 2004-01-22 | Scheuermann W. James | Method and system for data flow control of execution nodes of an adaptive computing engine (ACE) |
US6988139B1 (en) * | 2002-04-26 | 2006-01-17 | Microsoft Corporation | Distributed computing of a job corresponding to a plurality of predefined tasks |
US20040025159A1 (en) * | 2002-06-25 | 2004-02-05 | Quicksilver Technology, Inc. | Hardware task manager |
US20040010645A1 (en) * | 2002-06-25 | 2004-01-15 | Quicksilver Technology, Inc. | Uniform interface for a functional node in an adaptive computing engine |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10599365B2 (en) | 2018-03-20 | 2020-03-24 | Toshiba Memory Corporation | Storage system |
Also Published As
Publication number | Publication date |
---|---|
US20090103594A1 (en) | 2009-04-23 |
US20080247443A1 (en) | 2008-10-09 |
US7400668B2 (en) | 2008-07-15 |
US8406281B2 (en) | 2013-03-26 |
WO2003067780A1 (en) | 2003-08-14 |
US20100220706A1 (en) | 2010-09-02 |
US20090104930A1 (en) | 2009-04-23 |
AU2003207832A1 (en) | 2003-09-02 |
US7620097B2 (en) | 2009-11-17 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7620097B2 (en) | Communications module, device, and method for implementing a system acquisition function | |
US6144649A (en) | Method and apparatus for acquiring a pilot signal in a CDMA receiver | |
US7085246B1 (en) | Method and apparatus for acquisition of a spread-spectrum signal | |
KR100557509B1 (en) | Cell search schedule in umts | |
US20030202541A1 (en) | Cell search apparatus and method for supporting multisearch functions in a mobile communication system | |
AU2001253057A1 (en) | Dynamic recognition of an empty general paging message | |
EP1048178B1 (en) | Apparatus and method of searching for pn sequence phase in multi-carrier cdma mobile communication system | |
CN100433582C (en) | Exdended frequency spectrum communication system and over-district switching method | |
KR100584337B1 (en) | Apparatus and method for cell search and multi-path search in mobile communication | |
JP2001007732A (en) | Method for starting spread spectrum radio telephone receiver and apparatus thereof | |
US20040165566A1 (en) | Dual mode modem and method for integrated cell searching | |
JPH1094041A (en) | Reception method of cdma radio communication and receiver | |
CA2404297A1 (en) | Prioritization of searching by a remote unit in a wireless communication system | |
US6724738B1 (en) | Method and apparatus for acquiring a pilot signal in a CDMA receiver | |
US6704577B1 (en) | Efficient searching by a remote unit in a slotted mode communication system | |
KR100404485B1 (en) | Communication terminal and method for cell search | |
AU2001251241A1 (en) | Reacquisition and handoff in a slotted mode communication system | |
GB2364487A (en) | Pilot signal acquisition in a spread spectrum communication system such as a cdma cellular telephone system | |
KR100629680B1 (en) | Apparatus and method for off-line cell search in asynchronous CDMA communication system | |
MXPA00004922A (en) | Method for starting spread spectrum radio telephone receiver and apparatus thereof |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: QUICKSILVER TECHNOLOGY, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HEIDARI, GHOBAD;CHANG, KUOR-HSIN;REEL/FRAME:012594/0207 Effective date: 20020131 |
|
AS | Assignment |
Owner name: TECHFARM VENTURES, L.P., CALIFORNIA Free format text: SECURITY INTEREST;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:012886/0001 Effective date: 20020426 Owner name: TECHFARM VENTURES (Q) L.P., CALIFORNIA Free format text: SECURITY INTEREST;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:012886/0001 Effective date: 20020426 Owner name: EMERGING ALLIANCE FUND L.P., CALIFORNIA Free format text: SECURITY INTEREST;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:012886/0001 Effective date: 20020426 Owner name: SELBY VENTURES PARTNERS II, L.P., CALIFORNIA Free format text: SECURITY INTEREST;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:012886/0001 Effective date: 20020426 Owner name: WILSON SONSINI GOODRICH & ROSATI, P.C., CALIFORNIA Free format text: SECURITY INTEREST;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:012886/0001 Effective date: 20020426 |
|
AS | Assignment |
Owner name: TECHFARM VENTURES, L.P., CALIFORNIA Free format text: SECURITY AGREEMENT;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:012951/0764 Effective date: 20020426 Owner name: TECHFARM VENTURES (Q), L.P., CALIFORNIA Free format text: SECURITY AGREEMENT;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:012951/0764 Effective date: 20020426 Owner name: EMERGING ALLIANCE FUND L.P., CALIFORNIA Free format text: SECURITY AGREEMENT;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:012951/0764 Effective date: 20020426 Owner name: SELBY VENTURE PARTNERS II, L.P., CALIFORNIA Free format text: SECURITY AGREEMENT;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:012951/0764 Effective date: 20020426 Owner name: WILSON SONSINI GOODRICH & ROSATI, P.C., CALIFORNIA Free format text: SECURITY AGREEMENT;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:012951/0764 Effective date: 20020426 Owner name: PORTVIEW COMMUNICATIONS PARTNERS L.P., CALIFORNIA Free format text: SECURITY AGREEMENT;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:012951/0764 Effective date: 20020426 |
|
AS | Assignment |
Owner name: TECHFARM VENTURES, L.P., CALIFORNIA Free format text: SECURITY AGREEMENT;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:013422/0294 Effective date: 20020614 Owner name: TECHFARM VENTURES, L.P., AS AGENT FOR THE BENEFIT Free format text: SECURITY AGREEMENT;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:013422/0294 Effective date: 20020614 Owner name: TECHFARM VENTURES (Q), L.P., CALIFORNIA Free format text: SECURITY AGREEMENT;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:013422/0294 Effective date: 20020614 Owner name: EMERGING ALLIANCE FUND L.P., CALIFORNIA Free format text: SECURITY AGREEMENT;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:013422/0294 Effective date: 20020614 Owner name: SELBY VENTURE PARTNERS II, L.P., CALIFORNIA Free format text: SECURITY AGREEMENT;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:013422/0294 Effective date: 20020614 Owner name: WILSON SONSINI GOODRICH & ROSATI, P.C., CALIFORNIA Free format text: SECURITY AGREEMENT;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:013422/0294 Effective date: 20020614 Owner name: PORTVIEW COMMUNICATIONS PARTNERS L.P., CALIFORNIA Free format text: SECURITY AGREEMENT;ASSIGNOR:QUICKSILVER TECHNOLOGY INCORPORATED;REEL/FRAME:013422/0294 Effective date: 20020614 |
|
AS | Assignment |
Owner name: QUICKSILVER TECHNOLOGY, INC., CALIFORNIA Free format text: RELEASE OF SECURITY INTEREST IN PATENTS;ASSIGNORS:TECHFARM VENTURES, L.P., AS AGENT;TECHFARM VENTURES, L.P.;;TECHFARM VENTURES (Q), L.P.;;AND OTHERS;REEL/FRAME:018367/0729 Effective date: 20061005 |
|
AS | Assignment |
Owner name: TECHFARM VENTURES MANAGEMENT, LLC,CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:QUICKSILVER TECHNOLOGY, INC.;REEL/FRAME:018407/0637 Effective date: 20051013 Owner name: TECHFARM VENTURES MANAGEMENT, LLC, CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:QUICKSILVER TECHNOLOGY, INC.;REEL/FRAME:018407/0637 Effective date: 20051013 |
|
AS | Assignment |
Owner name: QST HOLDINGS, LLC, CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:TECHFARM VENTURES MANAGEMENT LLC;REEL/FRAME:019927/0230 Effective date: 20060831 Owner name: QST HOLDINGS, LLC,CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:TECHFARM VENTURES MANAGEMENT LLC;REEL/FRAME:019927/0230 Effective date: 20060831 |
|
AS | Assignment |
Owner name: QST HOLDINGS, LLC, CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MASTER, PAUL L.;HOGENAUER, EUGENE B.;SCHEUERMANN, WALTER JAMES;REEL/FRAME:020030/0579;SIGNING DATES FROM 20070810 TO 20070927 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
FPAY | Fee payment |
Year of fee payment: 8 |
|
AS | Assignment |
Owner name: CORNAMI, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:QST HOLDINGS, LLC;REEL/FRAME:050409/0253 Effective date: 20170105 |
|
FEPP | Fee payment procedure |
Free format text: 11.5 YR SURCHARGE- LATE PMT W/IN 6 MO, SMALL ENTITY (ORIGINAL EVENT CODE: M2556); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YR, SMALL ENTITY (ORIGINAL EVENT CODE: M2553); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY Year of fee payment: 12 |