US20100150354A1 - Low i/o bandwidth method and system for implementing detection and identification of scrambling codes - Google Patents
Low i/o bandwidth method and system for implementing detection and identification of scrambling codes Download PDFInfo
- Publication number
- US20100150354A1 US20100150354A1 US12/710,171 US71017110A US2010150354A1 US 20100150354 A1 US20100150354 A1 US 20100150354A1 US 71017110 A US71017110 A US 71017110A US 2010150354 A1 US2010150354 A1 US 2010150354A1
- Authority
- US
- United States
- Prior art keywords
- correlators
- component
- scrambling code
- correlation
- base station
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- 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/70735—Code identification
-
- 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/70751—Synchronisation aspects with code phase acquisition using partial detection
- H04B1/70752—Partial correlation
-
- 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
- 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/709—Correlator structure
- H04B1/7095—Sliding correlator type
-
- 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/7083—Cell search, e.g. using a three-step approach
Definitions
- the present invention generally relates to scrambling codes. More specifically, the present invention relates to a method and system for detecting scrambling codes within a W-CDMA communication system.
- Code acquisition is a fundamental algorithm required in any direct sequence spread spectrum (DSSS) receiver.
- DSSS direct sequence spread spectrum
- Prior to de-spreading, demodulating and decoding frames, such a receiver needs to acquire knowledge of timing information relating to the underlying spreading waveform being used to spread the data-bearing signal.
- W-CDMA wide-band code division multiple access
- a 3-step initial cell search procedure needs to be performed to acquire the primary scrambling code which is used to spread the data bearing channels. Examples of such channels are the primary common pilot channel (P-CPICH) and the dedicated physical channel (DPCH).
- P-CPICH primary common pilot channel
- DPCH dedicated physical channel
- the first step of the 3-step initial cell search procedure relates to slot timing.
- each base station transmits its own scrambling code in frames over the air to a mobile terminal.
- Each frame is made up of fifteen (15) slots.
- the start of a slot needs to be identified first. Once the start of a slot is identified, then it can be assured that one of the next fifteen (15) slots represents the start of a frame.
- the start of a slot is identified.
- the second step of the 3-step initial cell search procedure relates to frame timing.
- the start of a slot is identified. Once that is achieved, the start of a frame can then be identified.
- the base stations are identified in the network by a network matrix.
- the network matrix has sixty-four groups (64) and each group has eight (8) cells.
- a particular base station is identified by its group and its cell position within the group.
- the start of a frame is identified and the mobile terminal can then synchronize to the identified frame and obtain information relating to group identification.
- the group which contains the base station that sent out the frame (or scrambling code) is identified, i.e., one out of sixty-four (64) group is identified.
- the receiver Upon completing the first two steps of the initial cell search procedure, the receiver has knowledge of the slot and frame timing of the received scrambling code, such as a P-CPICH signal.
- the receiver also has knowledge of the group identification of the base station or cell being acquired.
- the group identification information contains information on all eight (8) primary cells within the group. Since there are eight (8) cells in a group, using the group identification information, the receiver needs only to identify one (1) out of eight (8) possible primary cells from the group.
- the receiver may use one of two conventional approaches.
- the receiver may perform a correlation of the received signals with a parallel bank of eight (8) scrambling code generators (typical correlation length N ranges from 64 to 256 chips based on frequency offset in the received signals). All the eight (8) correlations are performed within N chips, at the expense of using eight (8) parallel scrambling code generators.
- the receiver may sequentially correlate the received signals with eight (8) possible scrambling codes for N chips each.
- the receiver may attain all eight (8) correlation results after slightly greater than 8*N chips (this number of chips is needed to allow for reassigning the scrambling code generator to another phase offset, after each correlation is performed),
- Implementations may not be limited to the above two conventional approaches.
- the above two approaches were explained for the case of real time processing of the CDMA signal, i.e. no buffering of received data was assumed for these two cases.
- both of these approaches require additional power consumption/silicon area. Under the first approach, additional scrambling code generators are needed; and under the second approach, additional memory storage is needed to store the received signals and it takes additional time to generate and process the necessary scrambling codes in a sequential manner.
- An exemplary method of the present invention is used to perform scrambling code detection of eight (8) primary cells (each scrambling code's X-component being spaced sixteen (16) chips apart) in a group.
- a single scrambling code generator is used to generate a master scrambling code.
- the master scrambling code is then used to create individual scrambling codes which are used in correlation with received signals to detect in parallel which one of the eight (8) possible primary cells in the group transmitted the received signals.
- Each individual scrambling code has a X-component and a Y-component.
- the individual scrambling codes are created based on the fact that the X-component of each cell station's scrambling code's phase reference is spaced sixteen (16) chips apart.
- this exemplary method reduces the complexity of scrambling code or PN generator(s) in the parallel search implementation. More specifically, the use of this exemplary method avoids the need to utilize parallel logic to generate eight (8) scrambling codes. Since the X-component of each primary scrambling code within a group is sixteen (16) chips apart, a pair of buffers (one for the X-component and one for the Y-component) is used to store a sequential stream of X- and Y-components of the master scrambling code (typically the first primary code with a group) output respectively from a single scrambling code generator.
- the Y-component is correlated with different portions of the X-component (each portion being offset by a multiple of sixteen (16) locations from the X-component buffer) to generate all eight (8) individual scrambling codes in the group. That is, using different 16-chip offsets in the X-component buffers (complex samples) and a common Y-component buffer (complex samples), all eight (8) different complex individual scrambling codes can be generated.
- the received data is then correlated in parallel with each of the eight (8) individual scrambling codes generated from the master scrambling code. Eight dimensions are mapped to a single dimension at the expense of a slight increase in storage size.
- This exemplary method can be used as part of an overall 3-step initial cell search procedure to acquire the downlink of a 3GPP WCDMA cell, which more specifically corresponds to part of the stage 3 portion of the cell search procedure.
- the exemplary implementation includes a single scrambling code generator and eight (8) correlators arranged in sequential order. Each of the correlators maintains a corresponding segment of the master scrambling code's X-component and a common segment of the Y-component.
- a new segment of the master scrambling code's X-component is introduced into one of the correlators by the scrambling code generator, a segment of the master scrambling code's X-component is dropped from another correlator, and segments of the master scrambling code's X-component are sequentially shifted or propagated through the remaining correlators; and concurrent correlations are performed by the correlators using their respective corresponding segments of the master scrambling code and newly received signals. The foregoing process is repeated until a desired correlation length is achieved.
- FIG. 1 a is a simplified diagram illustrating the timing of the X-components of the scrambling codes of the eight (8) cells within a group;
- FIG. 1 b is a simplified diagram illustrating the timing of the Y-components of the scrambling codes of the eight (8) cells within a group;
- FIG. 2 is a flow diagram illustrating an exemplary method of the present invention
- FIG. 3 is a simplified diagram illustrating parallel correlations of eight (8) cells in a group using a single scrambling code generator according to the present invention
- FIG. 4 is a simplified diagram illustrating one exemplary implementation of the exemplary method according to the present invention.
- FIG. 5 is a flow diagram illustrating one exemplary implementation of the exemplary method in accordance with the present invention.
- FIGS. 6 a and 6 b are simplified diagrams illustrating a second exemplary implementation of the exemplary method in accordance with the present invention.
- FIG. 7 a is a diagram illustrating correlation results generated by the exemplary method shown in FIG. 3 in accordance with the present invention.
- FIG. 7 b is a diagram illustrating correlation results generated after one iteration by the exemplary implementation shown in FIG. 6 in accordance with the present invention.
- FIG. 1 a is a simplified diagram illustrating the timing of the X-components of the scrambling codes of the eight (8) cells within a group.
- the scrambling code of each cell is transmitted on a periodic basis and the period of the scrambling code of each cell is thirty-eight thousand and four hundred (38,400) chips, i.e., the scrambling code of each cell is repeated after 38,400 chips.
- X 0 is generated internally within a scrambling code generator at t 0 and at t 38,400 .
- the X-components of the scrambling codes of any two adjacent cells are offset by sixteen (16) chips.
- cells “0” and “1” transmit X 0 and X 16 respectively at t 0 .
- the scrambling codes of all the cells within the group are transmitted at the same frame boundary.
- FIG. 1 b is a simplified diagram illustrating the timing of the Y-components of the scrambling codes of the eight (8) cells within a group.
- FIG. 2 is a flow diagram illustrating an exemplary method of the present invention.
- the correlation length N is first determined.
- the correlation length N is the amount of time during which correlation between the received signals and the generated scrambling codes is summed up.
- the correlation length N is selected such that reasonable correlation results can be obtained. Typical values of the correlation length N range from sixty-four (64) to two hundred and fifty-six (256), depending on the relative carrier frequency offset between the transmitted and received signals. A person of ordinary skill in the art will know how to select the proper correlation length.
- the chip offset (CO) between two adjacent scrambling codes, and the number of cells (C) within a group a master scrambling code is generated.
- the master scrambling code has a X-component and a Y-component.
- the X-component and the Y-component are respectively stored in a X-component buffer and a Y-component buffer for subsequent use in generating possible scrambling codes from all the cells in an identified group.
- the master scrambling code has a period, e.g., 38,400 chips, which is sufficient to allow correlations to be performed reliably.
- N+CO*(C ⁇ 1) corresponds to the amount of the code's X-component that needs to be generated to perform a correlation of length N with C cells spaced CO chips apart. Also, at the same time, N complex samples of the code's Y-component need to be generated.
- the product term CO*C represents the chip offset between the X-components of the respective scrambling codes of the first cells of two adjacent groups of base stations or cells.
- group identification information relating to the group which includes the cell that transmitted the received signals is available. With this information, the group which includes the cell that transmitted the received signals is identified. Moreover, using this information, the proper master scrambling code which covers all the possible scrambling codes from all the cells within the identified group can be generated.
- portions of the master scrambling code's X-component buffer are used, along with the common Y-component buffer, to create individual scrambling codes which correspond to the cells within the identified group. These individual scrambling codes are then correlated with the received signals in a parallel manner to determine which of the cells within the identified group transmitted the received signals.
- the following is an example illustrating the exemplary method of the present invention.
- the example is based on the following assumptions: the correlation length N is two hundred and fifty-six (256); the chip offset CO is sixteen (16); and the number of cells C within the identified group is eight (8).
- the period of the master scrambling code is thirty-eight thousand and four hundred (38,400) chips.
- three hundred and sixty-eight (368) chips (X 0 ⁇ X 367 ) of the master scrambling code's X-component, as well as two hundred and fifty-six (256) chips (Y 0 ⁇ Y 255 ) of the master scrambling code's Y-component, are generated from a single scrambling code generator tuned to the first primary cell of the underlying identified group.
- the length of chips for the Y-component is determined by the correlation length N, which in this case is two hundred and fifty-six (256). It should be noted that it is not necessary to generate all three hundred and sixty-eight (368) chips and all two hundred and fifty-six (256) Y-component chips prior to correlation. The generation of three hundred and sixty-eight (368) chips is specified to emphasize the total number of chips required out of the scrambling code generator's X-component to implement eight (8) parallel correlations of two hundred and fifty-six (256) chips each.
- FIG. 3 is a simplified diagram illustrating parallel correlations of eight (8) cells in a group using a single scrambling code generator.
- each of the eight (8) correlators correlates the received signals or real-time data (D 0 ⁇ D 255 ) with two hundred and fifty-six (256) X-component chips and two hundred and fifty-six (256) Y-component chips.
- the respective X-component chips for the correlators are each generated by operating on different portions of the X-component buffer.
- the X-component buffer contains the X-component of the master scrambling code.
- the respective X-component chips of two adjacent correlators are started at an offset of sixteen (16) chips.
- the Y-component chips are the same for all correlators. It should be noted that the contents of the X-component buffer and the Y-component buffer are complex.
- the first correlator correlates the received signals (D 0 ⁇ D 255 ) with the X-component chips (X 0 ⁇ X 255 ) and with the Y-component chips (Y 0 ⁇ Y 255 );
- the second correlator correlates the received signals (D 0 ⁇ D 255 ) with the X-component chips (X 16 ⁇ X 271 ) and again with the Y-component chips (Y 0 ⁇ Y 255 ); and so on
- the final correlator correlates the received signals (D 0 ⁇ D 255 ) with the X-component chips (X 112 ⁇ X 367 ) and also with the Y-component chips (Y 0 ⁇ Y 255 ).
- the correlation results are then obtained from each of the correlators.
- FIG. 4 is a simplified diagram illustrating an exemplary implementation of the exemplary method described above in accordance with the present invention. It is to be noted that the received signals are processed simultaneously in real-time by eight (8) parallel correlators.
- the scrambling code generator generates and X-component buffer that is three hundred and sixty-eight (368) chips long, i.e., N+112 chips, and a Y-component buffer that is two hundred and fifty-six (256) chips long. This is in contrast to 8*N*2 (*8N for the X-component and *8N for the Y-component) complex chips that must be generated for the alternative approach in the parallel search implementation.
- the exemplary method of the present invention as described may be implemented in software, hardware or a combination of both.
- the exemplary method of the present invention may be implemented as control logic using software embedded in a mobile terminal.
- the exemplary method may be implemented in a modular or integrated manner within the mobile terminal. Based on disclosure provided herein, a person of ordinary skill in the art will know of other ways and/or methods to implement the present invention.
- a master scrambling code with a period of thirty-eight thousand and four hundred (38,400) chips is generated. This would require a global storage access of 8N*2 locations (since data is complex) for every N chips of correlation. If hardware resources are not limited, then the master scrambling code and the received signals can be stored in memory registers and each correlator can then read out the corresponding 256-chip scrambling code that it needs to perform the correlation.
- FIG. 5 is a flow diagram illustrating an exemplary implementation of the exemplary method described above in accordance with the present invention. As will be illustrated below, the exemplary implementation reduces the storage and access requirements needed to implement the exemplary method in accordance with the present invention.
- a portion of the master scrambling code is generated to populate the correlators. The generation of the master scrambling code by a single scrambling code generator is described above. As previously described, the master scrambling code has a X-component and a Y-component.
- the number of correlators and the length of each correlator respectively depend on the number of cells within a group and the chip offset between the X-components of the respective scrambling codes of two adjacent cells within the group.
- the correlators collectively contain the entire generated portion of the master scrambling code, i.e., each correlator is populated with segments of the X- and Y-components of the generated portion of the master scrambling code.
- the length of the portion of the master scrambling code's X-component to be generated depends on the chip offset between the X-components of the respective scrambling codes of two adjacent groups of cells.
- a set of received signals are captured.
- the duration of the capture period equals to the chip offset between the X-components of the respective scrambling codes of two adjacent cells within a group. For a W-CDMA communication system, the duration of the capture period is thus sixteen (16) chips.
- the set of received signals are correlated with the generated portion of the master scrambling code by the correlators and the correlation results are stored.
- each correlator shifts or propagates its segment of the X-component of the generated portion of the master scrambling code to its neighboring correlator and shares a common Y-component segment.
- the first correlator discards its current segment of the X-component and the last correlator receives a newly generated segment of the X-component from the single scrambling code generator.
- segments of the Y-component from all the correlators are discarded and a newly generated segment of the Y-component is loaded into all the correlators in parallel. As a result, at any given time, all the correlators share the same segment of the Y-component. Then, the process returns to 52 where the next set of received signals are captured and correlated. The foregoing process is repeated until the entire master scrambling code is generated and correlated. From an alternative perspective, this can be viewed as segments of the X-component of the master scrambling code being correlated in a pipelined fashion on a first-in-first-out basis.
- FIGS. 6 a and 6 b are simplified block diagrams illustrating an exemplary physical implementation of the exemplary method described above.
- an exemplary system 60 having a single scrambling code generator 62 and eight (8) correlators 64 - 78 .
- This exemplary system 60 operates based on the following assumptions: there are eight (8) cells in a group; the chip offset between the X-components of the respective scrambling codes of two adjacent cells in a group is sixteen (16) chips; and the correlation length N is selected to be two hundred and fifty-six (256).
- the exemplary system 60 operates as follows. Initially, before any correlation is performed, the correlators COR 0 -COR 7 64 - 78 are collectively populated with a portion of the master scrambling code's X- and Y-components by the single scrambling code generator 62 .
- correlator COR 3 78 includes scrambling code segment X 0 -X 15 ; correlator COR 1 76 includes segment X 16 -X 31 ; and correlator COR 7 64 includes segment X 112 -X 127 ; and so on.
- all the correlators COR 0 -COR 7 64 - 78 also include scrambling code segment Y 0 -Y 15 . It should be noted that the initial generation of all one hundred and twenty-eight (128) chips of the portion of the X-component of the master scrambling code and the sixteen (16) chips of the portion of the Y-component of the master scrambling code before starting any of the correlations is not required.
- One of the correlators 64 - 78 can be started every sixteen (16) chips in a pipelined fashion.
- a set of complex data signals or samples which is sixteen (16) chips in length, D 0 -D 15 are received and fed to each of the correlators 64 - 78 .
- each correlator partially correlates the same set of received complex data samples with the complex conjugate of its corresponding scrambling code segment.
- the corresponding scrambling segment includes a portion of the X-component and a portion of the Y-component. It is to be noted that the respective X-components of the scrambling code segments of any two adjacent correlators have a chip offset of sixteen (16) chips and that the same portion of the Y-component is shared by all the correlators 64 - 78 .
- the first correlator COR 0 78 correlates the received data samples, D 0 -D 15 , with the complex conjugate of its corresponding scrambling code segment, (X 0 ⁇ X 15 )+j(Y 0 ⁇ Y 15 ); the second correlator COR 1 76 correlates the received data samples, D 0 -D 15 , with the complex conjugate of its corresponding scrambling code segment, (X 16 ⁇ X 31 )+j(Y 0 ⁇ Y 15 ); and so on, and the final correlator COR 7 64 correlates the received data samples, D 0 -D 15 , with the complex conjugate of its corresponding scrambling code segment, (X 112 ⁇ X 127 )+j(Y 0 ⁇ Y 15 ).
- the correlations of the eight (8) correlators 64 - 78 are performed concurrently in a parallel manner and the correlation results are stored for subsequent evaluation.
- each correlator After this first iteration of correlations, each correlator passes its current corresponding scrambling code segment (X-component) to a neighboring correlator. It should be noted that each correlator has two neighboring correlators. In effect, with two exceptions which will be described below, this means each correlator also receives a new corresponding scramble code segment (X-component) from another neighboring correlator. Graphically, this is shown as follows: COR 0 ⁇ COR 0 , COR 2 ⁇ COR 1 , COR 3 ⁇ COR 2 , COR 4 ⁇ COR 3 , COR 5 ⁇ COR 4 , COR 6 ⁇ COR 5 .
- the scrambling code segments (X-components) are shifted or propagated along the correlators 64 - 78 .
- the two exceptions are the first correlator COR 0 78 and the last correlator COR 7 64 .
- For the first correlator COR 0 78 its current corresponding scramble code segment (X-component) is discarded; and for the last correlator COR 7 64 , a new scrambling code segment (X-component) generated by the single scrambling code generator 62 is fed to the last correlator COR 7 64 .
- the newly generated scrambling code segment (X-component) is the next segment of the master scrambling code that follows the scrambling code segment (X-component) that was in the last correlator COR 7 64 before that scrambling code segment (X-component) was transferred to correlator COR 6 66 .
- the newly generated scrambling code segment (X-component) to be fed into the last correlator COR 7 64 is X 128 -X 143 . This is because scrambling code segment (X-component) X 128 -X 143 follows scrambling code segment (X-component) X 112 -X 127 within the master scrambling code.
- the entire master scrambling code is propagated along all the correlators 64 - 78 and is eventually correlated with the received data samples as described in FIG. 3 .
- a new scrambling code segment (Y-component) is also generated.
- the new scrambling code segment (Y-component) is Y 16 -Y 31 following the previous scrambling code (Y-component) Y 0 -Y 15 .
- the new scrambling code (Y-component) is loaded into all the correlators 64 - 78 in parallel.
- the next set of complex data samples are received, D 16 -D 31 , and loaded into the correlators 64 - 78 .
- Another iteration of concurrent correlations by the correlators 64 - 78 is then performed again.
- the foregoing process of shifting the scrambling code segments, receiving the next set of complex data samples and performing another iteration of correlations is repeated until the master scrambling code is correlated or, conversely, the collective length of all the received complex data samples reaches the correlation length.
- FIG. 7 a illustrates the correlation results generated using the exemplary method shown in FIG. 3 .
- FIG. 7 b illustrates the correlation results after the first iteration of correlations by the exemplary system 60 . Comparing FIGS. 7 a and 7 b , it can be seen that by using the exemplary system 60 shown in FIG. 6 , sixteen (16) terms are generated by each of the eight (8) correlations after one iteration. Hence, in order to generate the complete results as shown in FIG. 7 a based on a correlation length of two hundred and fifty-six (256), sixteen (16) total iterations are executed.
- scrambling code segments (X- and Y-components) which make up the master scrambling code are internally shared amongst correlators 64 - 78 .
- the corresponding scrambling code segment (X-component) of each correlator is refreshed or updated.
- This sharing of scrambling code segments reduces the access to the otherwise globally stored master scrambling code by a factor of eight (8) (for cases using the above assumptions), i.e., 2N scrambling code read accesses are required every N chips of correlations.
- the scrambling code generator 62 transfers or generates only 2*2N/16 binary values to one of the correlators 64 - 78 .
- the rest of the correlators 66 - 78 internally share the scrambling code segments which are already present amongst the correlators 64 - 78 .
- the technique of packing and unpacking bits may be used. If the above binary values were packed into a word and then unpacked at the time of correlation, the scrambling code generator 62 then needs to transfer only 2*2N/(16*16) 16-bit words to the group of correlators 64 - 78 . That is, the working size of each correlator may be reduced to 2*2N/(16*16) by packing sixteen (16) bits at a time. This also reduces scrambling code storage access to 2*2N/16.
- the present invention as described herein may be implemented in a number of ways.
- the present invention may be implemented using the adaptive computing architecture as 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 full herein for all purposes.
- the scrambling code generator 62 and the correlators 64 - 78 may be implemented on demand within a mobile terminal. Based on the disclosure provided herein, a person of ordinary skill in the art will know of other ways and/or methods to implement and apply the present invention.
Abstract
A system for detecting and identifying the identity of a base station or cell which transmits a scrambling code is provided. According to one aspect of the system, the system is used to perform scrambling code detection of eight (8) primary cells (each scrambling code's X-component being spaced sixteen (16) chips apart) in a group. According to another aspect of the system, a single scrambling code generator is used to generate a master scrambling code. The master scrambling code is then used to create individual scrambling codes which are used in correlation with received signals to detect in parallel which one of the eight (8) possible primary cells in the group transmitted the received signals. According to yet another aspect of the system, each of the correlators maintains a corresponding X-component segment of the master scrambling code. For every sixteen (16) chips, a new X-component segment of the master scrambling code is introduced into one of the correlators, a X-component segment of the master scrambling code is dropped from another correlator, and X-component segments of the master scrambling code are sequentially shifted or propagated through the remaining correlators; and concurrent correlations are performed by the correlators using their respective corresponding X-component segments of the master scrambling code and newly received signals.
Description
- The present application is a continuation-in-part application of pending, commonly assigned U.S. patent application Ser. No. 10/015,531, filed on Dec. 12, 2001, entitled “A LOW I/O BANDWIDTH METHOD AND SYSTEM FOR IMPLEMENTING DETECTION AND IDENTIFICATION OF SCRAMBLING CODES,” by Sharad Sambhwani et al., the disclosure of which is hereby incorporated by reference in its entirety as if set forth in full herein for all purposes.
- The present invention generally relates to scrambling codes. More specifically, the present invention relates to a method and system for detecting scrambling codes within a W-CDMA communication system.
- Code acquisition is a fundamental algorithm required in any direct sequence spread spectrum (DSSS) receiver. Prior to de-spreading, demodulating and decoding frames, such a receiver needs to acquire knowledge of timing information relating to the underlying spreading waveform being used to spread the data-bearing signal. According to the wide-band code division multiple access (W-CDMA) communication system of the 3GPP standards body, upon turning on a mobile terminal or device, a 3-step initial cell search procedure needs to be performed to acquire the primary scrambling code which is used to spread the data bearing channels. Examples of such channels are the primary common pilot channel (P-CPICH) and the dedicated physical channel (DPCH).
- The first step of the 3-step initial cell search procedure relates to slot timing. In a W-CDMA communication system, each base station transmits its own scrambling code in frames over the air to a mobile terminal. Each frame is made up of fifteen (15) slots. Before the start of a frame can be located, the start of a slot needs to be identified first. Once the start of a slot is identified, then it can be assured that one of the next fifteen (15) slots represents the start of a frame. Upon conclusion of the first step, the start of a slot is identified.
- The second step of the 3-step initial cell search procedure relates to frame timing. As mentioned above, at the end of the first step, the start of a slot is identified. Once that is achieved, the start of a frame can then be identified. Within a W-CDMA communication system, there are five hundred and twelve (512) base stations within the network. The base stations are identified in the network by a network matrix. The network matrix has sixty-four groups (64) and each group has eight (8) cells. A particular base station is identified by its group and its cell position within the group. During this second step, the start of a frame is identified and the mobile terminal can then synchronize to the identified frame and obtain information relating to group identification. Upon conclusion of the second step, the group which contains the base station that sent out the frame (or scrambling code) is identified, i.e., one out of sixty-four (64) group is identified.
- Upon completing the first two steps of the initial cell search procedure, the receiver has knowledge of the slot and frame timing of the received scrambling code, such as a P-CPICH signal. The receiver also has knowledge of the group identification of the base station or cell being acquired. The group identification information contains information on all eight (8) primary cells within the group. Since there are eight (8) cells in a group, using the group identification information, the receiver needs only to identify one (1) out of eight (8) possible primary cells from the group.
- To achieve this goal, the receiver may use one of two conventional approaches. Under the first approach, the receiver may perform a correlation of the received signals with a parallel bank of eight (8) scrambling code generators (typical correlation length N ranges from 64 to 256 chips based on frequency offset in the received signals). All the eight (8) correlations are performed within N chips, at the expense of using eight (8) parallel scrambling code generators.
- Under the second approach, the receiver may sequentially correlate the received signals with eight (8) possible scrambling codes for N chips each. Using a single scrambling code generator, one may attain all eight (8) correlation results after slightly greater than 8*N chips (this number of chips is needed to allow for reassigning the scrambling code generator to another phase offset, after each correlation is performed),
- Implementations may not be limited to the above two conventional approaches. The above two approaches were explained for the case of real time processing of the CDMA signal, i.e. no buffering of received data was assumed for these two cases.
- As mentioned above, the eight (8) scrambling codes may be generated in parallel, using eight (8) separate scrambling code generators each operating independently, or the eight (8) scrambling codes may be generated using a single scrambling code generator using eight (8) sets of masks (a set=4 18-bit masks). However, both of these approaches require additional power consumption/silicon area. Under the first approach, additional scrambling code generators are needed; and under the second approach, additional memory storage is needed to store the received signals and it takes additional time to generate and process the necessary scrambling codes in a sequential manner.
- Hence, it would be desirable to provide a method and system which is capable of generating scrambling codes for correlation to identify a received scrambling code in a more efficient manner.
- An exemplary method of the present invention is used to perform scrambling code detection of eight (8) primary cells (each scrambling code's X-component being spaced sixteen (16) chips apart) in a group. According to the exemplary method, a single scrambling code generator is used to generate a master scrambling code. The master scrambling code is then used to create individual scrambling codes which are used in correlation with received signals to detect in parallel which one of the eight (8) possible primary cells in the group transmitted the received signals. Each individual scrambling code has a X-component and a Y-component. The individual scrambling codes are created based on the fact that the X-component of each cell station's scrambling code's phase reference is spaced sixteen (16) chips apart.
- The use of this exemplary method reduces the complexity of scrambling code or PN generator(s) in the parallel search implementation. More specifically, the use of this exemplary method avoids the need to utilize parallel logic to generate eight (8) scrambling codes. Since the X-component of each primary scrambling code within a group is sixteen (16) chips apart, a pair of buffers (one for the X-component and one for the Y-component) is used to store a sequential stream of X- and Y-components of the master scrambling code (typically the first primary code with a group) output respectively from a single scrambling code generator. Since the Y-component is common to all primary cells in the group, the Y-component is correlated with different portions of the X-component (each portion being offset by a multiple of sixteen (16) locations from the X-component buffer) to generate all eight (8) individual scrambling codes in the group. That is, using different 16-chip offsets in the X-component buffers (complex samples) and a common Y-component buffer (complex samples), all eight (8) different complex individual scrambling codes can be generated. The received data is then correlated in parallel with each of the eight (8) individual scrambling codes generated from the master scrambling code. Eight dimensions are mapped to a single dimension at the expense of a slight increase in storage size.
- This exemplary method can be used as part of an overall 3-step initial cell search procedure to acquire the downlink of a 3GPP WCDMA cell, which more specifically corresponds to part of the
stage 3 portion of the cell search procedure. - According to an exemplary implementation of the exemplary method of the present invention, the exemplary implementation includes a single scrambling code generator and eight (8) correlators arranged in sequential order. Each of the correlators maintains a corresponding segment of the master scrambling code's X-component and a common segment of the Y-component. For every sixteen (16) chips, a new segment of the master scrambling code's X-component is introduced into one of the correlators by the scrambling code generator, a segment of the master scrambling code's X-component is dropped from another correlator, and segments of the master scrambling code's X-component are sequentially shifted or propagated through the remaining correlators; and concurrent correlations are performed by the correlators using their respective corresponding segments of the master scrambling code and newly received signals. The foregoing process is repeated until a desired correlation length is achieved.
- 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 a is a simplified diagram illustrating the timing of the X-components of the scrambling codes of the eight (8) cells within a group; -
FIG. 1 b is a simplified diagram illustrating the timing of the Y-components of the scrambling codes of the eight (8) cells within a group; -
FIG. 2 is a flow diagram illustrating an exemplary method of the present invention; -
FIG. 3 is a simplified diagram illustrating parallel correlations of eight (8) cells in a group using a single scrambling code generator according to the present invention; -
FIG. 4 is a simplified diagram illustrating one exemplary implementation of the exemplary method according to the present invention; -
FIG. 5 is a flow diagram illustrating one exemplary implementation of the exemplary method in accordance with the present invention; -
FIGS. 6 a and 6 b are simplified diagrams illustrating a second exemplary implementation of the exemplary method in accordance with the present invention; -
FIG. 7 a is a diagram illustrating correlation results generated by the exemplary method shown inFIG. 3 in accordance with the present invention; and -
FIG. 7 b is a diagram illustrating correlation results generated after one iteration by the exemplary implementation shown inFIG. 6 in accordance with the present invention. - The present invention in the form of one or more exemplary embodiments will now be discussed. The present invention can be applied to the third step of the initial cell search procedure when a mobile terminal is initially powered on to identify the base station or cell which transmitted the received signals containing a scrambling code.
FIG. 1 a is a simplified diagram illustrating the timing of the X-components of the scrambling codes of the eight (8) cells within a group. Referring toFIG. 1 a, the scrambling code of each cell is transmitted on a periodic basis and the period of the scrambling code of each cell is thirty-eight thousand and four hundred (38,400) chips, i.e., the scrambling code of each cell is repeated after 38,400 chips. For example, for cell “0”, X0 is generated internally within a scrambling code generator at t0 and at t38,400. Furthermore, the X-components of the scrambling codes of any two adjacent cells are offset by sixteen (16) chips. For example, cells “0” and “1” transmit X0 and X16 respectively at t0. The scrambling codes of all the cells within the group are transmitted at the same frame boundary. By having a 16-chip offset between two adjacent cells, the X-components of the scrambling codes between two adjacent groups of cells are offset by one hundred and twenty-eight (128) (16*8=128). It should be noted that the Y-components of all the scrambling codes for a group of cells are the same, i.e., there is no offset between the Y-components of adjacent scrambling codes.FIG. 1 b is a simplified diagram illustrating the timing of the Y-components of the scrambling codes of the eight (8) cells within a group. - According to one exemplary method of the present invention, a scrambling code represented by the received signals is identified by using a single scrambling code generator to attain N chip correlation of the received signals with eight (8) primary scrambling codes in a group within N+16*7=N+112 chips.
-
FIG. 2 is a flow diagram illustrating an exemplary method of the present invention. Referring toFIG. 2 , at 20, the correlation length N is first determined. The correlation length N is the amount of time during which correlation between the received signals and the generated scrambling codes is summed up. The correlation length N is selected such that reasonable correlation results can be obtained. Typical values of the correlation length N range from sixty-four (64) to two hundred and fifty-six (256), depending on the relative carrier frequency offset between the transmitted and received signals. A person of ordinary skill in the art will know how to select the proper correlation length. Next, at 22, using the selected correlation length, the chip offset (CO) between two adjacent scrambling codes, and the number of cells (C) within a group, a master scrambling code is generated. The master scrambling code has a X-component and a Y-component. The X-component and the Y-component are respectively stored in a X-component buffer and a Y-component buffer for subsequent use in generating possible scrambling codes from all the cells in an identified group. The master scrambling code has a period, e.g., 38,400 chips, which is sufficient to allow correlations to be performed reliably. N+CO*(C−1) corresponds to the amount of the code's X-component that needs to be generated to perform a correlation of length N with C cells spaced CO chips apart. Also, at the same time, N complex samples of the code's Y-component need to be generated. It should be noted that the product term CO*C represents the chip offset between the X-components of the respective scrambling codes of the first cells of two adjacent groups of base stations or cells. As mentioned above, during the first two steps of the initial cell search procedure, the start of the frame containing the scrambling code is identified and group identification information relating to the group which includes the cell that transmitted the received signals is available. With this information, the group which includes the cell that transmitted the received signals is identified. Moreover, using this information, the proper master scrambling code which covers all the possible scrambling codes from all the cells within the identified group can be generated. At 24, portions of the master scrambling code's X-component buffer are used, along with the common Y-component buffer, to create individual scrambling codes which correspond to the cells within the identified group. These individual scrambling codes are then correlated with the received signals in a parallel manner to determine which of the cells within the identified group transmitted the received signals. - The following is an example illustrating the exemplary method of the present invention. The example is based on the following assumptions: the correlation length N is two hundred and fifty-six (256); the chip offset CO is sixteen (16); and the number of cells C within the identified group is eight (8). The period of the master scrambling code is thirty-eight thousand and four hundred (38,400) chips.
- Next, three hundred and sixty-eight (368) chips (X0→X367) of the master scrambling code's X-component, as well as two hundred and fifty-six (256) chips (Y0→Y255) of the master scrambling code's Y-component, are generated from a single scrambling code generator tuned to the first primary cell of the underlying identified group. The length of three hundred and sixty-eight (368) chips is determined based on the formula N+CO*(C−1) which, in this case, equals to 256+16*(8-1)=256+16*7=256+112=368. The length of chips for the Y-component is determined by the correlation length N, which in this case is two hundred and fifty-six (256). It should be noted that it is not necessary to generate all three hundred and sixty-eight (368) chips and all two hundred and fifty-six (256) Y-component chips prior to correlation. The generation of three hundred and sixty-eight (368) chips is specified to emphasize the total number of chips required out of the scrambling code generator's X-component to implement eight (8) parallel correlations of two hundred and fifty-six (256) chips each.
-
FIG. 3 is a simplified diagram illustrating parallel correlations of eight (8) cells in a group using a single scrambling code generator. As shown inFIG. 3 , each of the eight (8) correlators correlates the received signals or real-time data (D0→D255) with two hundred and fifty-six (256) X-component chips and two hundred and fifty-six (256) Y-component chips. The respective X-component chips for the correlators are each generated by operating on different portions of the X-component buffer. As mentioned above, the X-component buffer contains the X-component of the master scrambling code. Furthermore, the respective X-component chips of two adjacent correlators are started at an offset of sixteen (16) chips. The Y-component chips are the same for all correlators. It should be noted that the contents of the X-component buffer and the Y-component buffer are complex. For example, the first correlator correlates the received signals (D0→D255) with the X-component chips (X0→X255) and with the Y-component chips (Y0→Y255); the second correlator correlates the received signals (D0→D255) with the X-component chips (X16→X271) and again with the Y-component chips (Y0→Y255); and so on, and the final correlator correlates the received signals (D0→D255) with the X-component chips (X112→X367) and also with the Y-component chips (Y0→Y255). The correlation results are then obtained from each of the correlators. By evaluating the correlation results, the scrambling code represented by the received signals can be identified and, hence, the identity of the base station or cell which transmitted the received signals can also be determined. -
FIG. 4 is a simplified diagram illustrating an exemplary implementation of the exemplary method described above in accordance with the present invention. It is to be noted that the received signals are processed simultaneously in real-time by eight (8) parallel correlators. The scrambling code generator generates and X-component buffer that is three hundred and sixty-eight (368) chips long, i.e., N+112 chips, and a Y-component buffer that is two hundred and fifty-six (256) chips long. This is in contrast to 8*N*2 (*8N for the X-component and *8N for the Y-component) complex chips that must be generated for the alternative approach in the parallel search implementation. Hence, there is a factor of 8N*2/(2N+128) savings on the scrambling code generation complexity using the present invention, which equals to 6.4 for N=256 (an 85% reduction in complexity). [Please check some of the numbers in the above paragraph. Information provided in the other application for the same paragraph is slightly different.] - The exemplary method of the present invention as described may be implemented in software, hardware or a combination of both. For example, the exemplary method of the present invention may be implemented as control logic using software embedded in a mobile terminal. When implemented using software, the exemplary method may be implemented in a modular or integrated manner within the mobile terminal. Based on disclosure provided herein, a person of ordinary skill in the art will know of other ways and/or methods to implement the present invention.
- Referring to
FIG. 3 , it can be seen that in accordance with the exemplary method, for a correlation length of two hundred and fifty-six (256), a 16-chip offset between the X-components of the scrambling codes and eight (8) cells within a group, a master scrambling code with a period of thirty-eight thousand and four hundred (38,400) chips is generated. This would require a global storage access of 8N*2 locations (since data is complex) for every N chips of correlation. If hardware resources are not limited, then the master scrambling code and the received signals can be stored in memory registers and each correlator can then read out the corresponding 256-chip scrambling code that it needs to perform the correlation. -
FIG. 5 is a flow diagram illustrating an exemplary implementation of the exemplary method described above in accordance with the present invention. As will be illustrated below, the exemplary implementation reduces the storage and access requirements needed to implement the exemplary method in accordance with the present invention. Referring toFIG. 5 , at 50, a portion of the master scrambling code is generated to populate the correlators. The generation of the master scrambling code by a single scrambling code generator is described above. As previously described, the master scrambling code has a X-component and a Y-component. The number of correlators and the length of each correlator respectively depend on the number of cells within a group and the chip offset between the X-components of the respective scrambling codes of two adjacent cells within the group. The correlators collectively contain the entire generated portion of the master scrambling code, i.e., each correlator is populated with segments of the X- and Y-components of the generated portion of the master scrambling code. The length of the portion of the master scrambling code's X-component to be generated depends on the chip offset between the X-components of the respective scrambling codes of two adjacent groups of cells. As mentioned above, this chip offset, in turn, depends on the number of cells within a group and the chip offset between the X-components of the respective scrambling codes of two adjacent cells within the group. For instance, for a W-CDMA communication system, there are eight (8) cells in a group and the chip offset between the X-components of the scrambling codes of two adjacent cells within the group is sixteen (16). Hence, the length of the portion of the X-component of the master scrambling code to be initially generated is one hundred and twenty-eight (128=16*8) chips. - At 52, a set of received signals are captured. The duration of the capture period equals to the chip offset between the X-components of the respective scrambling codes of two adjacent cells within a group. For a W-CDMA communication system, the duration of the capture period is thus sixteen (16) chips.
- At 54, the set of received signals are correlated with the generated portion of the master scrambling code by the correlators and the correlation results are stored. After the correlations are performed, at 56, each correlator shifts or propagates its segment of the X-component of the generated portion of the master scrambling code to its neighboring correlator and shares a common Y-component segment. The exception being that, at 58, the first correlator discards its current segment of the X-component and the last correlator receives a newly generated segment of the X-component from the single scrambling code generator. In addition, at 58, segments of the Y-component from all the correlators are discarded and a newly generated segment of the Y-component is loaded into all the correlators in parallel. As a result, at any given time, all the correlators share the same segment of the Y-component. Then, the process returns to 52 where the next set of received signals are captured and correlated. The foregoing process is repeated until the entire master scrambling code is generated and correlated. From an alternative perspective, this can be viewed as segments of the X-component of the master scrambling code being correlated in a pipelined fashion on a first-in-first-out basis.
-
FIGS. 6 a and 6 b are simplified block diagrams illustrating an exemplary physical implementation of the exemplary method described above. Referring toFIGS. 6 a and 6 b, there is shown anexemplary system 60 having a singlescrambling code generator 62 and eight (8) correlators 64-78. Thisexemplary system 60 operates based on the following assumptions: there are eight (8) cells in a group; the chip offset between the X-components of the respective scrambling codes of two adjacent cells in a group is sixteen (16) chips; and the correlation length N is selected to be two hundred and fifty-six (256). - The
exemplary system 60 operates as follows. Initially, before any correlation is performed, the correlators COR0-COR7 64-78 are collectively populated with a portion of the master scrambling code's X- and Y-components by the singlescrambling code generator 62. The portion of the X-component of the master scrambling code that is initially generated is one hundred and twenty-eight (128=16*8) in length (X0→X127) and the portion of the Y-component that is initially generated is sixteen (16) chips in length. The portion of the X-component of the master scrambling code is segmented and populated into the correlators COR0-COR7 64-78 and the portion of the Y-component is loaded in parallel into all the correlators COR0-COR7 64-78. Each correlator has a length of sixteen (16). For example, after initial population,correlator COR 3 78 includes scrambling code segment X0-X15; correlatorCOR 1 76 includes segment X16-X31; andcorrelator COR 7 64 includes segment X112-X127; and so on. In addition, all the correlators COR0-COR7 64-78 also include scrambling code segment Y0-Y15. It should be noted that the initial generation of all one hundred and twenty-eight (128) chips of the portion of the X-component of the master scrambling code and the sixteen (16) chips of the portion of the Y-component of the master scrambling code before starting any of the correlations is not required. One of the correlators 64-78 can be started every sixteen (16) chips in a pipelined fashion. - Next, a set of complex data signals or samples which is sixteen (16) chips in length, D0-D15, are received and fed to each of the correlators 64-78. Then, each correlator partially correlates the same set of received complex data samples with the complex conjugate of its corresponding scrambling code segment. The corresponding scrambling segment includes a portion of the X-component and a portion of the Y-component. It is to be noted that the respective X-components of the scrambling code segments of any two adjacent correlators have a chip offset of sixteen (16) chips and that the same portion of the Y-component is shared by all the correlators 64-78. For example, the
first correlator COR 0 78 correlates the received data samples, D0-D15, with the complex conjugate of its corresponding scrambling code segment, (X0→X15)+j(Y0→Y15); thesecond correlator COR 1 76 correlates the received data samples, D0-D15, with the complex conjugate of its corresponding scrambling code segment, (X16→X31)+j(Y0→Y15); and so on, and thefinal correlator COR 7 64 correlates the received data samples, D0-D15, with the complex conjugate of its corresponding scrambling code segment, (X112→X127)+j(Y0→Y15). The correlations of the eight (8) correlators 64-78 are performed concurrently in a parallel manner and the correlation results are stored for subsequent evaluation. - After this first iteration of correlations, each correlator passes its current corresponding scrambling code segment (X-component) to a neighboring correlator. It should be noted that each correlator has two neighboring correlators. In effect, with two exceptions which will be described below, this means each correlator also receives a new corresponding scramble code segment (X-component) from another neighboring correlator. Graphically, this is shown as follows: COR0→COR0, COR2→COR1, COR3→COR2, COR4→COR3, COR5→COR4, COR6→COR5. In essence, the scrambling code segments (X-components) are shifted or propagated along the correlators 64-78. The two exceptions are the
first correlator COR 0 78 and thelast correlator COR 7 64. For thefirst correlator COR 0 78, its current corresponding scramble code segment (X-component) is discarded; and for thelast correlator COR 7 64, a new scrambling code segment (X-component) generated by the singlescrambling code generator 62 is fed to thelast correlator COR 7 64. The newly generated scrambling code segment (X-component) is the next segment of the master scrambling code that follows the scrambling code segment (X-component) that was in thelast correlator COR 7 64 before that scrambling code segment (X-component) was transferred tocorrelator COR 6 66. For example, after the first iteration, the newly generated scrambling code segment (X-component) to be fed into thelast correlator COR 7 64 is X128-X143. This is because scrambling code segment (X-component) X128-X143 follows scrambling code segment (X-component) X112-X127 within the master scrambling code. By shifting or transferring the scrambling code segments as described above, the entire master scrambling code is propagated along all the correlators 64-78 and is eventually correlated with the received data samples as described inFIG. 3 . Furthermore, along with the generation of the new scrambling code segment (X-component), a new scrambling code segment (Y-component) is also generated. In the present example, the new scrambling code segment (Y-component) is Y16-Y31 following the previous scrambling code (Y-component) Y0-Y15. As described above, the new scrambling code (Y-component) is loaded into all the correlators 64-78 in parallel. - The next set of complex data samples are received, D16-D31, and loaded into the correlators 64-78. Another iteration of concurrent correlations by the correlators 64-78 is then performed again. The foregoing process of shifting the scrambling code segments, receiving the next set of complex data samples and performing another iteration of correlations is repeated until the master scrambling code is correlated or, conversely, the collective length of all the received complex data samples reaches the correlation length.
-
FIG. 7 a illustrates the correlation results generated using the exemplary method shown inFIG. 3 .FIG. 7 b illustrates the correlation results after the first iteration of correlations by theexemplary system 60. ComparingFIGS. 7 a and 7 b, it can be seen that by using theexemplary system 60 shown inFIG. 6 , sixteen (16) terms are generated by each of the eight (8) correlations after one iteration. Hence, in order to generate the complete results as shown inFIG. 7 a based on a correlation length of two hundred and fifty-six (256), sixteen (16) total iterations are executed. - As can be seen above, scrambling code segments (X- and Y-components) which make up the master scrambling code are internally shared amongst correlators 64-78. For every predetermined period (that is defined by the chip offset between the respective scrambling codes of any two adjacent cells within a group), e.g., sixteen (16) chips, the corresponding scrambling code segment (X-component) of each correlator is refreshed or updated. This sharing of scrambling code segments reduces the access to the otherwise globally stored master scrambling code by a factor of eight (8) (for cases using the above assumptions), i.e., 2N scrambling code read accesses are required every N chips of correlations.
- In addition, for every iteration of correlations, the
scrambling code generator 62 transfers or generates only 2*2N/16 binary values to one of the correlators 64-78. As mentioned above, the rest of the correlators 66-78 internally share the scrambling code segments which are already present amongst the correlators 64-78. - To further reduce scrambling code memory access as well as each correlator's working size, the technique of packing and unpacking bits may be used. If the above binary values were packed into a word and then unpacked at the time of correlation, the
scrambling code generator 62 then needs to transfer only 2*2N/(16*16) 16-bit words to the group of correlators 64-78. That is, the working size of each correlator may be reduced to 2*2N/(16*16) by packing sixteen (16) bits at a time. This also reduces scrambling code storage access to 2*2N/16. - Furthermore, it is understood that while the present invention as described above is applicable to a W-CDMA communication system, it should be clear to a person of ordinary skill in the art that the present invention can be applied to other types of communication systems.
- Moreover, it should be noted that the present invention as described herein may be implemented in a number of ways. For example, the present invention may be implemented using the adaptive computing architecture as 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 full herein for all purposes. For instance, using the adaptive computing architecture, the
scrambling code generator 62 and the correlators 64-78 may be implemented on demand within a mobile terminal. Based on the disclosure provided herein, a person of ordinary skill in the art will know of other ways and/or methods to implement and apply 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 (53)
1. A system for identifying a scrambling code from signals received from a base station, comprising:
a scrambling code generator configured to generate a plurality of X-component segments in a sequential manner, the plurality of codex-component segments making up a master scrambling code; and
a plurality of correlators arranged in a sequential manner, each correlator maintaining a corresponding X-component segment and configured to correlate a set of received signals with its corresponding X-component segment and generate corresponding correlation results, the plurality of correlators collectively performing their correlations in a parallel manner in one or more iterations;
wherein after each performed iteration, all but one of the plurality of correlators shift their corresponding X-component segments to their respective neighboring correlators and a new X-component segment is generated by the scrambling code generator and fed to one of the plurality of correlators.
2. The system according to claim 1 wherein the scrambling code generator is configured to generate a plurality of Y-component segments in a sequential manner,
wherein each correlator is further configure to maintain a corresponding Y-component segment and correlate the set of received signals with its corresponding Y-component segment and generate the corresponding correlation results; and
wherein after each performed iteration, a new Y-component segment is generated by the scrambling code generator and loaded into the plurality of correlators.
3. The system according to claim 1 wherein the number of iterations performed by the plurality of correlators depends on a selected correlation length and a predetermined chip offset; and
wherein the length of each correlator depends on the predetermined chip offset.
4. The system according to claim 1 wherein after each performed iteration, a new set of received signals is received by each correlator.
5. The system according to claim 1 wherein the correlation results generated by the plurality of correlators are evaluated to identify the scrambling code from the received signals thereby allowing the identity of the base station which transmitted the received signals to be identified.
6. The system according to claim 1 wherein the plurality of correlators perform their correlations in a real-time manner.
7. A mobile terminal incorporating the system as recited in claim 1 .
8. The system according to claim 1 wherein the base station is located in a W-CDMA communication network.
9. A system for identifying a scrambling code from signals received from a base station, the base station belonging to one of a plurality of base station groups in a communication network, the system comprising:
a scrambling code generator configured to generate a plurality of X-component segments and a plurality of Y-component segments, the plurality of X-component segments and the plurality of Y-component segments being respectively in a sequential order, the plurality of X-component and Y-component segments making up a master scrambling code; and
a plurality of correlators arranged in a sequential manner, each correlator maintaining a corresponding X-component segment and a corresponding Y-component segment and configured to correlate a set of received signals with its corresponding X-component and Y-component segments and generate corresponding correlation results, the plurality of correlators collectively performing their correlations in a parallel manner in one or more iterations;
wherein after each performed iteration, all but one of the plurality of correlators shift their corresponding X-component segments to their respective neighboring correlators and a new X-component segment is generated by the scrambling code generator and fed to one of the plurality of correlators, and a new Y-component segment is generated by the scrambling code generator and loaded into the plurality of correlators.
10. The system according to claim 9 wherein the number of iterations performed by the plurality of correlators depends on a selected correlation length and a predetermined chip offset; and
wherein the length of each correlator depends on the predetermined chip offset.
11. The system according to claim 9 wherein after each performed iteration, a new set of received signals is received by each correlator.
12. The system according to claim 9 wherein the correlation results generated by the plurality of correlators are evaluated to identify the scrambling code from the received signals thereby allowing the identity of the base station which transmitted the received signals to be identified.
13. The system according to claim 9 wherein the master scrambling code has a period determined by a selected correlation length and a predetermined group chip offset.
14. The system according to claim 13 wherein the predetermined group chip offset is determined by the number of base stations within a base station group and a predetermined chip offset.
15. The system according to claim 9 wherein the number of the plurality of correlators depends on the number of base stations within a base station group.
16. The system according to claim 9 wherein the plurality of correlators perform their correlations in a real-time manner.
17. A mobile terminal incorporating the system as recited in claim 9 .
18. The system according to claim 9 wherein the communication network is a W-CDMA communication network.
19. A system for identifying a scrambling code from signals received from a base station, the base station belonging to one of a plurality of base station groups in a communication network, the system comprising:
a scrambling code generator configured to generate a plurality of X-component segments in a sequential manner, the plurality of X-component segments making up a master scrambling code; and
a plurality of correlators coupled in a sequential manner and having a first correlator, a last correlator and a plurality of intermediate correlators coupled between the first correlator and the last correlator, the plurality of correlators configured to perform correlations in a parallel manner in one or more iterations;
wherein:
the plurality of correlators are each populated with corresponding X-component segments generated by the scrambling code generator;
each of the plurality of correlators receives a set of received data samples;
the plurality of correlators correlate the set of received data samples with their corresponding X-component segments in parallel in one iteration;
after each iteration is completed, the plurality of intermediate correlators and the last correlator shift their corresponding X-component segments to their respective neighboring correlator, the corresponding X-component segment of the first correlator is discarded, and a new X-component segment is generated by the scrambling code generator and fed to the last correlator.
20. The system according to claim 19 wherein the scrambling code generator is further configured to generate a plurality of Y-component segments in a sequential manner;
wherein the plurality of correlators are each populated with corresponding Y-component segments;
wherein the plurality of correlators correlate the set of received data samples with their corresponding Y-component segments in parallel in one iteration; and
wherein after each iteration is completed, a new Y-component segment is generated by the scrambling code generator and loaded into the plurality of correlators in parallel.
21. The system according to claim 20 wherein the new Y-component segment follows the Y-component segment that was previously in the plurality of correlators.
22. The system according to claim 19 wherein after the one iteration is completed, a new set of received data samples is received by the plurality of correlators.
23. The system according to claim 19 wherein the master scrambling code has a period determined by a selected correlation length and a predetermined group chip offset.
24. The system according to claim 23 wherein the predetermined group chip offset is determined by the number of base stations within a base station group and a predetermined chip offset.
25. The system according to claim 19 wherein the number of the plurality of correlators depends on the number of base stations within a base station group.
26. The system according to claim 19 wherein the plurality of correlators perform their correlations in a real-time manner.
27. The system according to claim 19 wherein the new X-component segment follows the corresponding X-component segment which was in the last correlator before that corresponding X-component segment was shifted.
28. A mobile terminal incorporating the system as recited in claim 19 .
29. The system according to claim 19 wherein the communication network is a W-CDMA communication network and the system is used in connection with acquisition of a downlink of a 3GPP W-CDMA cell during stage 3 of a cell search procedure.
30. A method for identifying a scrambling code from signals received from a base station, comprising:
selecting a correlation length;
identifying a master scrambling code using the selected correlation length, the master scrambling code comprising a plurality of X-component segments arranged in a sequential manner;
populating each of a plurality of correlators with a corresponding X-component segment in a sequential manner,
providing a set of received data samples to each of the plurality of correlators;
causing each of the plurality of correlators to correlate the set of received data samples with its corresponding X-component segment and store corresponding correlation results;
shifting the corresponding X-component segments of all but one of the plurality of correlators to their respective neighboring correlators;
populating one of the plurality of correlators with a new X-component segment, the new X-component segment sequentially following the corresponding X-component segments which are in the plurality of correlators; and
repeating the providing step, the causing step, the shifting step and the populating step with the new X-component segment with successive sets of received data samples until the selected correlation length is achieved.
31. The method of claim 30 wherein the master scrambling code further includes a plurality of Y-component segments; and further comprising:
populating each of the plurality of correlators with a Y-component segment;
causing each of the plurality of correlators to correlate the set of received data samples with its corresponding Y-component segment and store the corresponding correlation results;
after each correlation, generating a new Y-component segment, the new Y-component segment sequentially following the previous Y-component segment that was in the plurality of correlators, and populating each of the plurality of correlators with the new Y-component segment.
32. The method of claim 30 further comprising:
evaluating the stored correlation results generated by the plurality of correlators to identify the scrambling code from the signals received from the base station thereby allowing the identity of the base station to be identified.
33. The method of claim 30 wherein the causing step further comprises:
causing each of the plurality of correlators to correlate in a concurrent and real-time manner.
34. A mobile terminal utilizing the method as recited in claim 30 .
35. The method according to claim 30 wherein the base station is located in a W-CDMA communication network and the method is used in connection with acquisition of a downlink of a 3GPP W-CDMA cell during stage 3 of a cell search procedure.
36. A method for identifying a scrambling code from signals received from a base station, the base station belonging to one of a plurality of base station groups in a communication network, the method comprising:
identifying a master scrambling code, the master scrambling code comprising a plurality of X-component segments arranged in a sequential manner;
performing a series of successive correlation iterations using a number of X-component segments taken from the plurality of X-component segments and corresponding sets of received data samples; and
for each correlation iteration:
providing a new set of received data samples;
correlating the new set of received data samples with the number of X-component segments and storing correlation results; and
refreshing the number of X-component segments in a first-in-first-out basis by discarding one X-component segment and adding another X-component segment.
37. The method of claim 36 wherein the master scrambling code further comprises a plurality of Y-component segments, and further comprising:
performing a series of successive correlation iterations using a number of Y-component segments taken from the plurality of Y-component segments and corresponding sets of received data samples; and
for each correlation iteration:
correlating the new set of received data samples with a Y-component segment and storing the correlation results; and
after each correlation iteration is completed, replacing the current Y-component segment with a new Y-component segment.
38. The method of claim 36 further comprising:
evaluating the collectively stored correlation results to identify the scrambling code from the signals received from the base station thereby allowing the identity of the base station to be identified.
39. The method of claim 36 wherein for each correlation iteration, the correlating step further comprises:
correlating the new set of received data samples with each of the number of X-component segments in a concurrent manner.
40. The method of claim 36 further comprising:
selecting a correlation length; and
wherein the period of the master scrambling code depends on the correlation length and a predetermined group chip offset.
41. The method of claim 40 wherein the predetermined group chip offset depends on the number of base stations within a base station group and a predetermined chip offset between two adjacent base stations within the base station group.
42. The method of claim 40 wherein the number of successive correlation iterations depends on the selected correlation length and the number of X-component segments being correlated during each correlation iteration.
43. A mobile terminal utilizing the method as recited in claim 36 .
44. The method according to claim 36 wherein the communication network is a W-CDMA communication network and the method is used in connection with acquisition of a downlink of a 3GPP W-CDMA cell during stage 3 of a cell search procedure.
45. A method for identifying a scrambling code from signals received from a base station, the base station belonging to one of a plurality of base station groups in a communication network, the method comprising:
identifying a master scrambling code, the master scrambling code comprising a plurality of X-component segments arranged in a sequential manner;
configuring a scrambling code generator to generate the plurality of X-component segments one X-component segment at a time;
configuring a plurality of correlators in a sequential manner to perform correlations, the plurality of correlators having a first correlator, a last correlator and a plurality of intermediate correlators coupled between the first correlator and the last correlator;
populating each of the plurality of correlators with a corresponding X-component segment generated from the scrambling code generator;
causing the plurality of correlators to perform a series of successive correlation iterations using their corresponding X-component segments and corresponding sets of received data samples; and
for each correlation iteration:
providing a new set of received data samples;
causing the plurality of correlators to respectively correlate the new set of received data samples with their corresponding X-component segments and store respective correlation results;
shifting the corresponding X-component segments of the plurality of intermediate correlators and the last correlator to their respective neighboring correlators;
transferring a new X-component segment generated by the scrambling code generator to the last correlator, the new X-component segment being in sequence with the corresponding X-component segment which was previously present in the last correlator.
46. The method of claim 47 wherein the master scrambling code further includes a plurality of Y-component segments in a sequential manner, and further comprising:
configuring the scrambling code generator to generate the plurality of Y-component segments one Y-component segment at a time; and
causing the plurality of correlators to perform a series of correlation iterations using their corresponding sets of received data samples and the plurality of Y-component segments;
for each correlation iteration:
causing the plurality of correlators to respectively correlate the new set of received data samples with one Y-component segment and store the respective correlation results; and
directing the plurality of correlators to receive a new Y-component segment from the scrambling code generator, the new Y-component segment being in sequence with the Y-component segment that was used in the previous correlation iteration.
47. The method of claim 45 further comprising:
for each correlation iteration, discarding the corresponding X-component segment of the first correlator.
48. The method of claim 45 wherein the causing step further comprises:
causing the plurality of correlators to correlate in a concurrent manner.
49. The method of claim 45 further comprising:
selecting a correlation length; and
wherein the period of the master scrambling code depends on the correlation length and a predetermined group chip offset.
50. The method of claim 49 wherein the predetermined group chip offset depends on the number of base stations within a base station group and a predetermined chip offset between two adjacent base stations within the base station group.
51. The method of claim 49 wherein the number of successive correlation iterations depends on the selected correlation length and the length of each X-component segment.
52. A mobile terminal utilizing the method as recited in claim 45 .
53. The method according to claim 45 wherein the communication network is a W-CDMA communication network and the method is used in connection with acquisition of a downlink of a 3GPP W-CDMA cell during stage 3 of a cell search procedure.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/710,171 US20100150354A1 (en) | 2001-12-12 | 2010-02-22 | Low i/o bandwidth method and system for implementing detection and identification of scrambling codes |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/015,531 US7088825B2 (en) | 2001-12-12 | 2001-12-12 | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes |
US10/295,692 US7215701B2 (en) | 2001-12-12 | 2002-11-14 | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes |
US11/797,583 US7668229B2 (en) | 2001-12-12 | 2007-04-04 | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes |
US12/710,171 US20100150354A1 (en) | 2001-12-12 | 2010-02-22 | Low i/o bandwidth method and system for implementing detection and identification of scrambling codes |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/797,583 Continuation US7668229B2 (en) | 2001-12-12 | 2007-04-04 | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes |
Publications (1)
Publication Number | Publication Date |
---|---|
US20100150354A1 true US20100150354A1 (en) | 2010-06-17 |
Family
ID=26687507
Family Applications (5)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/295,692 Expired - Fee Related US7215701B2 (en) | 2001-12-12 | 2002-11-14 | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes |
US11/724,076 Expired - Lifetime US7512173B2 (en) | 2001-12-12 | 2007-03-13 | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes |
US11/797,583 Expired - Lifetime US7668229B2 (en) | 2001-12-12 | 2007-04-04 | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes |
US12/499,756 Expired - Lifetime US8442096B2 (en) | 2001-12-12 | 2009-07-08 | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes |
US12/710,171 Abandoned US20100150354A1 (en) | 2001-12-12 | 2010-02-22 | Low i/o bandwidth method and system for implementing detection and identification of scrambling codes |
Family Applications Before (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/295,692 Expired - Fee Related US7215701B2 (en) | 2001-12-12 | 2002-11-14 | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes |
US11/724,076 Expired - Lifetime US7512173B2 (en) | 2001-12-12 | 2007-03-13 | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes |
US11/797,583 Expired - Lifetime US7668229B2 (en) | 2001-12-12 | 2007-04-04 | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes |
US12/499,756 Expired - Lifetime US8442096B2 (en) | 2001-12-12 | 2009-07-08 | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes |
Country Status (4)
Country | Link |
---|---|
US (5) | US7215701B2 (en) |
AU (1) | AU2002366954A1 (en) |
TW (1) | TW200304291A (en) |
WO (1) | WO2003055093A1 (en) |
Families Citing this family (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7215701B2 (en) | 2001-12-12 | 2007-05-08 | Sharad Sambhwani | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes |
US20040116122A1 (en) * | 2002-09-20 | 2004-06-17 | Interdigital Technology Corporation | Enhancing reception using intercellular interference cancellation |
US20080101301A1 (en) * | 2006-10-27 | 2008-05-01 | Motorola, Inc. | Handover in a cellular communication system |
US7864875B2 (en) * | 2007-02-02 | 2011-01-04 | Research In Motion Limited | Apparatus, and associated method, for communicating a data block in a multi carrier modulation communication scheme together with an identification sequence superimposed thereon |
US8755515B1 (en) | 2008-09-29 | 2014-06-17 | Wai Wu | Parallel signal processing system and method |
US9204349B2 (en) * | 2009-02-10 | 2015-12-01 | Qualcomm Incorporated | Method and apparatus for facilitating a hand-in of user equipment to femto cells |
US9642105B2 (en) | 2009-11-17 | 2017-05-02 | Qualcomm Incorporated | Access terminal-assisted time and/or frequency tracking |
US9392562B2 (en) | 2009-11-17 | 2016-07-12 | Qualcomm Incorporated | Idle access terminal-assisted time and/or frequency tracking |
US9271248B2 (en) | 2010-03-02 | 2016-02-23 | Qualcomm Incorporated | System and method for timing and frequency synchronization by a Femto access point |
US9756553B2 (en) | 2010-09-16 | 2017-09-05 | Qualcomm Incorporated | System and method for assisted network acquisition and search updates |
US8717887B2 (en) * | 2011-08-08 | 2014-05-06 | Telefonaktiebolaget Lm Ericsson (Publ) | Scrambling code planning device and method for using same in wireless communication network |
US9155057B2 (en) | 2012-05-01 | 2015-10-06 | Qualcomm Incorporated | Femtocell synchronization enhancements using access probes from cooperating mobiles |
US9237530B2 (en) | 2012-11-09 | 2016-01-12 | Qualcomm Incorporated | Network listen with self interference cancellation |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020141489A1 (en) * | 2001-04-03 | 2002-10-03 | Ichiro Imaizumi | Correlation circuit for spread spectrum |
US20030063656A1 (en) * | 2001-09-19 | 2003-04-03 | Rao Subramanya P. | Method & apparatus for step two W-CDMA searching |
US20030099223A1 (en) * | 2001-11-28 | 2003-05-29 | Chang Li Fung | Acquisition matched filter for W-CDMA systems providing frequency offset robustness |
US6985517B2 (en) * | 2000-11-09 | 2006-01-10 | Matsushita Electric Industrial Co., Ltd. | Matched filter and correlation detection method |
Family Cites Families (550)
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 |
US3960298A (en) | 1972-10-25 | 1976-06-01 | The Cornelius Company | Container assembly for use with a separator dispenser |
US6556044B2 (en) | 2001-09-18 | 2003-04-29 | Altera Corporation | Programmable logic device including multipliers and configurations thereof to reduce resource utilization |
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 |
US3938639A (en) | 1973-11-28 | 1976-02-17 | The Cornelius Company | Portable dispenser for mixed beverages |
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 |
US4076145A (en) | 1976-08-09 | 1978-02-28 | The Cornelius Company | Method and apparatus for dispensing a beverage |
US4377246A (en) | 1977-06-13 | 1983-03-22 | The Cornelius Company | Apparatus for dispensing a carbonated 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 |
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 |
GB2067800B (en) | 1979-04-03 | 1983-10-12 | Lewin G F | Adding device |
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 |
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 |
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 |
DK279985A (en) | 1984-06-25 | 1985-12-26 | Isoworth Ltd | METHOD AND APPARATUS FOR CARBONIZATION |
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 |
US4993604A (en) | 1985-09-13 | 1991-02-19 | The Coca-Cola Company | Low-cost post-mix beverage dispenser and syrup supply system therefor |
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 |
US4982876A (en) | 1986-02-10 | 1991-01-08 | Isoworth Limited | Carbonation apparatus |
GB2186265B (en) | 1986-02-10 | 1989-11-01 | Isoworth Ltd | Beverage dispensing apparatus |
US4960261A (en) | 1986-03-17 | 1990-10-02 | Isoworth Limited | Gas cylinder connector |
GB2218767A (en) | 1988-05-17 | 1989-11-22 | Isoworth Ltd | 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 |
US4811214A (en) | 1986-11-14 | 1989-03-07 | Princeton University | Multinode reconfigurable pipeline computer |
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 |
US5177700A (en) | 1987-02-19 | 1993-01-05 | Ant Nachrichtentechnik Gmbh | Non-recursive half-band filter |
US4781309A (en) | 1987-02-19 | 1988-11-01 | The Cornelius Company | Dispenser with improved carbonated water manifold |
US4856684A (en) | 1987-04-06 | 1989-08-15 | William Gerstung | Valve for a pressurized dispensing can containing flowable materials |
US5381546A (en) | 1987-04-13 | 1995-01-10 | Gte Laboratories Incorporated | Control process for allocating services in communications systems |
US5818603A (en) | 1996-03-29 | 1998-10-06 | Ricoh Company, Ltd. | Method and system for controlling and communicating with machines using multiple communication formats |
US4800492A (en) | 1987-05-13 | 1989-01-24 | The Coca-Cola Company | Data logger for a post-mix beverage dispensing system |
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 |
EP0395694A4 (en) | 1987-11-05 | 1992-03-04 | The Playcount Company | Video cassette rental system and method and record playback counter therefor |
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 |
US5572572A (en) | 1988-05-05 | 1996-11-05 | Transaction Technology, Inc. | Computer and telephone apparatus with user friendly interface and enhanced integrity features |
US4932564A (en) | 1988-05-20 | 1990-06-12 | The Cornelius Company | Multiple flavor post-mix beverage dispensing head |
WO1990001192A1 (en) | 1988-07-22 | 1990-02-08 | United States Department Of Energy | Data flow machine for data driven computing |
US4901887A (en) | 1988-08-08 | 1990-02-20 | Burton John W | Beverage dispensing system |
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 |
US5090015A (en) | 1989-02-06 | 1992-02-18 | Motorola, Inc. | Programmable array logic self-checking system |
ES2104580T3 (en) | 1989-02-24 | 1997-10-16 | At & T Corp | ADAPTIVE PLANNING OF TASKS FOR MULTIPROCESS SYSTEMS. |
US5007560A (en) | 1989-03-01 | 1991-04-16 | Sassak John J | Beer dispensing and monitoring method and apparatus |
EP0478624B1 (en) | 1989-06-23 | 1997-04-02 | Isoworth Limited | Apparatus for making or dispensing drinks |
US5261099A (en) | 1989-08-24 | 1993-11-09 | International Business Machines Corp. | Synchronous communications scheduler allowing transient computing overloads using a request buffer |
US5193151A (en) | 1989-08-30 | 1993-03-09 | Digital Equipment Corporation | Delay-based congestion avoidance in computer networks |
US5163131A (en) | 1989-09-08 | 1992-11-10 | Auspex Systems, Inc. | Parallel i/o network file server architecture |
GB2236736A (en) | 1989-09-27 | 1991-04-17 | Isoworth Ltd | Carbonation apparatus for dispensing drinks, with plural carbonation chambers |
US4961533A (en) | 1989-09-27 | 1990-10-09 | Viac Inc. | Inventory control system |
US5044171A (en) | 1989-11-06 | 1991-09-03 | Eli Farkas | Counter with integral carbonated beverage dispenser |
US5450557A (en) | 1989-11-07 | 1995-09-12 | Loral Aerospace Corp. | Single-chip self-configurable parallel processor |
GB2237908B (en) | 1989-11-08 | 1993-06-16 | British Aerospace | Method and apparatus for parallel processing data |
US5428793A (en) | 1989-11-13 | 1995-06-27 | Hewlett-Packard Company | Method and apparatus for compiling computer programs with interproceduural register allocation |
WO1991012991A1 (en) | 1990-02-27 | 1991-09-05 | The Coca-Cola Company | Multiple fluid space dispenser and monitor |
JP3210319B2 (en) | 1990-03-01 | 2001-09-17 | 株式会社東芝 | Neurochip and neurocomputer using the chip |
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 |
US5303846A (en) | 1990-09-17 | 1994-04-19 | Abcc/Techcorp. | Method and apparatus for generating and dispensing flavoring syrup in a post mix system |
US5274832A (en) | 1990-10-04 | 1993-12-28 | National Semiconductor Corporation | Systolic array for multidimensional matrix computations |
US5190189A (en) | 1990-10-30 | 1993-03-02 | Imi Cornelius Inc. | Low height beverage dispensing apparatus |
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 |
US5144166A (en) | 1990-11-02 | 1992-09-01 | Concurrent Logic, Inc. | Programmable logic cell and array |
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 |
DE69229517T2 (en) | 1991-03-11 | 2000-05-04 | Sun Microsystems Inc | Method and device for optimizing cost-based heuristic instruction scheduling |
US5301100A (en) | 1991-04-29 | 1994-04-05 | Wagner Ferdinand H | Method of and apparatus for constructing a control system and control system created thereby |
US5156871A (en) | 1991-05-01 | 1992-10-20 | Imi Cornelius Inc. | Low cost beverage carbonating apparatus and method |
US5193718A (en) | 1991-06-25 | 1993-03-16 | Imi Cornelius Inc. | Quick electronic disconnect for a beverage dispensing valve |
US5440752A (en) | 1991-07-08 | 1995-08-08 | Seiko Epson Corporation | Microprocessor architecture with a switch network for data transfer between cache, memory port, and IOU |
US5338984A (en) | 1991-08-29 | 1994-08-16 | National Semiconductor Corp. | Local and express diagonal busses in a configurable logic array |
US5339428A (en) | 1991-09-04 | 1994-08-16 | Digital Equipment Corporation | Compiler allocating a register to a data item used between a use and store of another data item previously allocated to the register |
WO1994009595A1 (en) * | 1991-09-20 | 1994-04-28 | Shaw Venson M | Method and apparatus including system architecture for multimedia communications |
US5625669A (en) | 1991-09-27 | 1997-04-29 | Telemac Cellular Corporation | Mobile phone with internal call accounting controls |
JP3124074B2 (en) | 1991-09-30 | 2001-01-15 | 富士通株式会社 | Information vending machine |
US5504891A (en) | 1991-10-17 | 1996-04-02 | Ricoh Company, Ltd. | Method and apparatus for format conversion of a hierarchically structured page description language document |
CA2073516A1 (en) | 1991-11-27 | 1993-05-28 | Peter Michael Kogge | Dynamic multi-mode parallel processor array architecture computer system |
US5278986A (en) | 1991-12-13 | 1994-01-11 | Thinking Machines Corporation | System and method for compiling a source code supporting data parallel variables |
AU3247393A (en) | 1991-12-23 | 1993-07-28 | Intel Corporation | Circuitry for decoding huffman codes |
US5522070A (en) | 1992-03-19 | 1996-05-28 | Fujitsu Limited | Computer resource distributing method and system for distributing a multiplicity of processes to a plurality of computers connected in a network |
US5269442A (en) | 1992-05-22 | 1993-12-14 | The Cornelius Company | Nozzle for a beverage dispensing valve |
US5768561A (en) | 1992-06-30 | 1998-06-16 | Discovision Associates | Tokens-based adaptive video processing arrangement |
US5684980A (en) | 1992-07-29 | 1997-11-04 | Virtual Computer Corporation | FPGA virtual computer for executing a sequence of program instructions by successively reconfiguring a group of FPGA in response to those instructions |
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 |
US5368198A (en) | 1992-08-26 | 1994-11-29 | Imi Cornelius Inc. | Beverage dispenser |
US5437395A (en) | 1992-09-15 | 1995-08-01 | Imi Cornelius Inc. | Modular beverage dispenser |
GB9222840D0 (en) | 1992-10-31 | 1992-12-16 | Smiths Industries Plc | Electronic assemblies |
US5603043A (en) * | 1992-11-05 | 1997-02-11 | Giga Operations Corporation | System for compiling algorithmic language source code for implementation in programmable hardware |
US5263509A (en) | 1992-11-12 | 1993-11-23 | General Electric Company | Refrigerator with door mounted dispenser supply mechanism |
US5392960A (en) * | 1992-11-13 | 1995-02-28 | Wilshire Partners | Postmix beverage dispenser and a method for making a beverage dispenser |
US5367651A (en) | 1992-11-30 | 1994-11-22 | Intel Corporation | Integrated register allocation, instruction scheduling, instruction reduction and loop unrolling |
US6192255B1 (en) * | 1992-12-15 | 2001-02-20 | Texas Instruments Incorporated | Communication system and methods for enhanced information transfer |
US5335276A (en) | 1992-12-16 | 1994-08-02 | Texas Instruments Incorporated | Communication system and methods for enhanced information transfer |
US5452457A (en) | 1993-01-29 | 1995-09-19 | International Business Machines Corporation | Program construct and methods/systems for optimizing assembled code for execution |
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 |
US5483658A (en) * | 1993-02-26 | 1996-01-09 | Grube; Gary W. | Detection of unauthorized use of software applications in processing devices |
US5379343A (en) | 1993-02-26 | 1995-01-03 | Motorola, Inc. | Detection of unauthorized use of software applications in communication units |
WO1994022079A1 (en) * | 1993-03-15 | 1994-09-29 | Siemens Aktiengesellschaft | Process for the machine-generation of secondarily processable command groups from a program for super-scalar microprocessors |
JP3499252B2 (en) | 1993-03-19 | 2004-02-23 | 株式会社ルネサステクノロジ | Compiling device and data processing device |
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 |
US5388062A (en) | 1993-05-06 | 1995-02-07 | Thomson Consumer Electronics, Inc. | Reconfigurable programmable digital filter architecture useful in communication receiver |
FI932605A (en) | 1993-06-07 | 1994-12-08 | Nokia Telecommunications Oy | Receiver device for base station |
US5517667A (en) * | 1993-06-14 | 1996-05-14 | Motorola, Inc. | Neural network that does not require repetitive training |
US5343716A (en) | 1993-06-29 | 1994-09-06 | Imi Cornelius Inc. | Beverage dispenser with improved cold plate |
JP3159345B2 (en) | 1993-07-02 | 2001-04-23 | 日本電気株式会社 | Pipeline arithmetic processing unit |
JPH0728786A (en) | 1993-07-15 | 1995-01-31 | Hitachi Ltd | Vector processor |
US5507009A (en) | 1993-08-13 | 1996-04-09 | Motorola, Inc. | Method for reprogramming a communication unit's access to a wireless communication system |
US5701482A (en) | 1993-09-03 | 1997-12-23 | Hughes Aircraft Company | Modular array processor architecture having a plurality of interconnected load-balanced parallel processing nodes |
US5732563A (en) * | 1993-09-22 | 1998-03-31 | Imi Cornelius Inc. | Electronically controlled beverage dispenser |
CA2126265A1 (en) * | 1993-09-27 | 1995-03-28 | Michael Robert Cantone | System for synthesizing field programmable gate array implementations from high level circuit descriptions |
GB2288677B (en) * | 1993-09-28 | 1998-05-13 | 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 |
BR9304369A (en) | 1993-10-26 | 1995-06-20 | Imi Cornelius Brasil Ltda | Liquid extractor assembly from a container |
US6111935A (en) | 1993-10-27 | 2000-08-29 | Canon Kabushiki Kaisha | Adaptive expansion table in a digital telephone receiver |
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 |
EP0950946B1 (en) | 1993-11-05 | 2001-08-16 | Intergraph Corporation | Software scheduled superscaler computer architecture |
KR960010668B1 (en) | 1993-11-06 | 1996-08-07 | 엘지전자 주식회사 | Refrigerator |
US5530435A (en) | 1993-12-09 | 1996-06-25 | Steelcase Inc. | Utility distribution system for modular furniture and the like |
JP2655068B2 (en) | 1993-12-30 | 1997-09-17 | 日本電気株式会社 | Spread spectrum receiver |
US5491823A (en) * | 1994-01-25 | 1996-02-13 | Silicon Graphics, Inc. | Loop scheduler |
US5635940A (en) | 1994-02-02 | 1997-06-03 | Hickman; Paul L. | Communication configurator and method for implementing same |
US5519694A (en) | 1994-02-04 | 1996-05-21 | Massachusetts Institute Of Technology | Construction of hierarchical networks through extension |
GB9403030D0 (en) | 1994-02-17 | 1994-04-06 | Austin Kenneth | Re-configurable application specific device |
BR7400414U (en) | 1994-03-04 | 1994-07-26 | Spal Ind Brasileira De Bebidas | Soft drink dispensing machine |
US5729754A (en) | 1994-03-28 | 1998-03-17 | Estes; Mark D. | Associative network method and apparatus |
US5454406A (en) | 1994-05-13 | 1995-10-03 | Eaton Corporation | Automatic beverage dispenser |
US5694546A (en) | 1994-05-31 | 1997-12-02 | Reisman; Richard R. | System for automatic unattended electronic information transport between a server and a client by a vendor provided transport software with a manifest list |
US5701398A (en) | 1994-07-01 | 1997-12-23 | Nestor, Inc. | Adaptive classifier having multiple subnetworks |
GB2291567B (en) | 1994-07-01 | 1999-02-24 | Roke Manor Research | Apparatus for use in equipment providing a digital radio link between a fixed and a mobile radio unit |
FI943249A (en) | 1994-07-07 | 1996-01-08 | Nokia Mobile Phones Ltd | Procedure for controlling recipients and recipients |
US5745366A (en) | 1994-07-14 | 1998-04-28 | Omnicell Technologies, Inc. | Pharmaceutical dispensing device and methods |
US5655140A (en) | 1994-07-22 | 1997-08-05 | Network Peripherals | Apparatus for translating frames of data transferred between heterogeneous local area networks |
US5630206A (en) | 1994-08-11 | 1997-05-13 | Stanford Telecommunications, Inc. | Position enhanced cellular telephone system |
US5499758A (en) | 1994-08-19 | 1996-03-19 | Mccann's Engineering & Manufacturing Co. | Liquid dispenser for use with containers |
US6056194A (en) | 1995-08-28 | 2000-05-02 | Usa Technologies, Inc. | System and method for networking and controlling vending machines |
US5608643A (en) * | 1994-09-01 | 1997-03-04 | General Programming Holdings, Inc. | System for managing multiple dispensing units and method of operation |
FR2724273B1 (en) * | 1994-09-05 | 1997-01-03 | Sgs Thomson Microelectronics | SIGNAL PROCESSING CIRCUIT FOR IMPLEMENTING A VITERBI ALGORITHM |
JP3525353B2 (en) | 1994-09-28 | 2004-05-10 | 株式会社リコー | Digital electronic still camera |
JPH08106375A (en) | 1994-10-03 | 1996-04-23 | Ricoh Co Ltd | Signal processing computing element |
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 |
US5636368A (en) | 1994-12-23 | 1997-06-03 | Xilinx, Inc. | Method for programming complex PLD having more than one function block type |
DE4446882B4 (en) | 1994-12-27 | 2004-02-12 | BSH Bosch und Siemens Hausgeräte GmbH | Device for repeated, independent dosing of precisely metered amounts of a powdery cleaning agent in water-carrying cleaning machines, in particular household dishwashers and household washing machines |
KR0146100B1 (en) * | 1995-01-07 | 1998-09-15 | 이헌조 | Information acquisition and analysis device |
US5706191A (en) * | 1995-01-19 | 1998-01-06 | Gas Research Institute | Appliance interface apparatus and automated residence management system |
US5742180A (en) | 1995-02-10 | 1998-04-21 | Massachusetts Institute Of Technology | Dynamically programmable gate array with multiple contexts |
US5892900A (en) | 1996-08-30 | 1999-04-06 | Intertrust Technologies Corp. | Systems and methods for secure transaction management and electronic rights protection |
DE69638018D1 (en) | 1995-02-13 | 2009-10-15 | Intertrust Tech Corp | Systems and procedures for managing secure transactions and protecting electronic rights |
US5892961A (en) | 1995-02-17 | 1999-04-06 | Xilinx, Inc. | Field programmable gate array having programming instructions in the configuration bitstream |
US5696906A (en) * | 1995-03-09 | 1997-12-09 | Continental Cablevision, Inc. | Telecommunicaion user account management system and method |
US5669001A (en) | 1995-03-23 | 1997-09-16 | International Business Machines Corporation | Object code compatible representation of very long instruction word programs |
CA2171570C (en) | 1995-03-29 | 1999-09-21 | Swee Boon Lim | Compiler with generic front end and dynamically loadable back ends |
US6085740A (en) | 1996-02-21 | 2000-07-11 | Aerogen, Inc. | Liquid dispensing apparatus and methods |
US5737631A (en) | 1995-04-05 | 1998-04-07 | Xilinx Inc | Reprogrammable instruction set accelerator |
US5835753A (en) | 1995-04-12 | 1998-11-10 | Advanced Micro Devices, Inc. | Microprocessor with dynamically extendable pipeline stages and a classifying circuit |
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 |
US5794062A (en) | 1995-04-17 | 1998-08-11 | Ricoh Company Ltd. | System and method for dynamically reconfigurable computing using a processing unit having changeable internal hardware organization |
US5933642A (en) | 1995-04-17 | 1999-08-03 | Ricoh Corporation | Compiling system and method for reconfigurable computing |
WO1996033558A1 (en) | 1995-04-18 | 1996-10-24 | Advanced Micro Devices, Inc. | Method and apparatus for hybrid vlc bitstream decoding |
US5534796A (en) | 1995-04-21 | 1996-07-09 | Intergraph Corporation | Self-clocking pipeline register |
US5751295A (en) | 1995-04-27 | 1998-05-12 | Control Systems, Inc. | Graphics accelerator chip and method |
US5704053A (en) | 1995-05-18 | 1997-12-30 | Hewlett-Packard Company | Efficient explicit data prefetching analysis and code generation in a low-level optimizer for inserting prefetch instructions into loops of applications |
US5646544A (en) | 1995-06-05 | 1997-07-08 | International Business Machines Corporation | System and method for dynamically reconfiguring a programmable gate array |
US5787237A (en) | 1995-06-06 | 1998-07-28 | Apple Computer, Inc. | Uniform interface for conducting communications in a heterogeneous computing network |
US5634190A (en) | 1995-06-06 | 1997-05-27 | Globalstar L.P. | Low earth orbit communication satellite gateway-to-gateway relay system |
US5613004A (en) | 1995-06-07 | 1997-03-18 | The Dice Company | Steganographic method and device |
US5553755A (en) | 1995-06-09 | 1996-09-10 | Summit Packaging Systems, Inc. | Whipped cream dispenser |
US5542265A (en) | 1995-06-30 | 1996-08-06 | Rutland; Michael D. | External refrigerator-mounted liquid dispenser |
FR2736787B1 (en) | 1995-07-11 | 1997-08-08 | Alcatel Business Systems | COMMUNICATION SYSTEM AND CORRESPONDING EQUIPMENT FOR SUBSCRIBER INSTALLATION |
US5768594A (en) | 1995-07-14 | 1998-06-16 | Lucent Technologies Inc. | Methods and means for scheduling parallel processors |
US5822308A (en) | 1995-07-17 | 1998-10-13 | National Semiconductor Corporation | Multi-tasking sequencer for a TDMA burst mode controller |
US5842004A (en) * | 1995-08-04 | 1998-11-24 | Sun Microsystems, Inc. | Method and apparatus for decompression of compressed geometric three-dimensional graphics data |
US5778439A (en) | 1995-08-18 | 1998-07-07 | Xilinx, Inc. | Programmable logic device with hierarchical confiquration and state storage |
US5784313A (en) | 1995-08-18 | 1998-07-21 | Xilinx, Inc. | Programmable logic device including configuration data or user data memory slices |
US5646545A (en) | 1995-08-18 | 1997-07-08 | Xilinx, Inc. | Time multiplexed programmable logic device |
US5991308A (en) | 1995-08-25 | 1999-11-23 | Terayon Communication Systems, Inc. | Lower overhead method for data transmission using ATM and SCDMA over hybrid fiber coax cable plant |
US5623545A (en) | 1995-08-31 | 1997-04-22 | National Semiconductor Corporation | Automatic data generation for self-test of cryptographic hash algorithms in personal security devices |
DE19532422C1 (en) | 1995-09-01 | 1997-01-23 | Philips Patentverwaltung | Local network operating according to the asynchronous transfer mode (ATM) with at least two ring systems |
US5822360A (en) | 1995-09-06 | 1998-10-13 | Solana Technology Development Corporation | Method and apparatus for transporting auxiliary data in audio signals |
US5845815A (en) | 1995-09-08 | 1998-12-08 | Imi Cornelius Inc. | Flow control for beverage dispensing valve |
US5774737A (en) | 1995-10-13 | 1998-06-30 | Matsushita Electric Industrial Co., Ltd. | Variable word length very long instruction word instruction processor with word length register or instruction number register |
US5742821A (en) | 1995-11-08 | 1998-04-21 | Lucent Technologies Inc. | Multiprocessor scheduling and execution |
EP0778240A1 (en) | 1995-12-08 | 1997-06-11 | IMI Cornelius Inc. | Electro-mechanical refrigeration system |
US6473609B1 (en) | 1995-12-11 | 2002-10-29 | Openwave Systems Inc. | Method and architecture for interactive two-way communication devices to interact with a network |
US5734582A (en) | 1995-12-12 | 1998-03-31 | International Business Machines Corporation | Method and system for layout and schematic generation for heterogeneous arrays |
KR100187284B1 (en) | 1995-12-19 | 1999-05-01 | 김광호 | Water dispenser of a refrigerator |
US5706976A (en) * | 1995-12-21 | 1998-01-13 | Purkey; Jay Floyd | Vending machine inventory control device |
US6247036B1 (en) | 1996-01-22 | 2001-06-12 | Infinite Technology Corp. | Processor with reconfigurable arithmetic data path |
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 |
US5791517A (en) | 1996-02-21 | 1998-08-11 | Menachem M. Deren | Beverage dispenser device |
US6237029B1 (en) | 1996-02-26 | 2001-05-22 | Argosystems, Inc. | Method and apparatus for adaptable digital protocol processing |
US5894473A (en) | 1996-02-29 | 1999-04-13 | Ericsson Inc. | Multiple access communications system and method using code and time division |
FR2745649B1 (en) | 1996-03-01 | 1998-04-30 | Bull Sa | SYSTEM FOR CONFIGURING PRECONFIGURED SOFTWARE ON NETWORK OPEN SYSTEMS IN A DISTRIBUTED ENVIRONMENT AND METHOD IMPLEMENTED BY SUCH A SYSTEM |
US5854929A (en) | 1996-03-08 | 1998-12-29 | Interuniversitair Micro-Elektronica Centrum (Imec Vzw) | Method of generating code for programmable processors, code generator and application thereof |
US6393046B1 (en) * | 1996-04-25 | 2002-05-21 | Sirf Technology, Inc. | Spread spectrum receiver with multi-bit correlator |
US6055314A (en) | 1996-03-22 | 2000-04-25 | Microsoft Corporation | System and method for secure purchase and delivery of video content programs |
US6381293B1 (en) | 1996-04-03 | 2002-04-30 | United Microelectronics Corp. | Apparatus and method for serial data communication between plurality of chips in a chip set |
US6346824B1 (en) * | 1996-04-09 | 2002-02-12 | Xilinx, Inc. | Dedicated function fabric for use in field programmable gate arrays |
US5956518A (en) | 1996-04-11 | 1999-09-21 | Massachusetts Institute Of Technology | Intermediate-grain reconfigurable processing device |
US5802055A (en) | 1996-04-22 | 1998-09-01 | Apple Computer, Inc. | Method and apparatus for dynamic buffer allocation in a bus bridge for pipelined reads |
US5903886A (en) | 1996-04-30 | 1999-05-11 | Smartlynx, Inc. | Hierarchical adaptive state machine for emulating and augmenting software |
US5626407A (en) | 1996-05-10 | 1997-05-06 | Emplast, Inc. | Storage system for refrigerators |
US6181981B1 (en) * | 1996-05-15 | 2001-01-30 | Marconi Communications Limited | Apparatus and method for improved vending machine inventory maintenance |
US5822313A (en) | 1996-05-24 | 1998-10-13 | National Semiconductor Corporation | Seamless handover in a cordless TDMA system |
US5784636A (en) | 1996-05-28 | 1998-07-21 | National Semiconductor Corporation | Reconfigurable computer architecture for use in signal processing applications |
US5907580A (en) | 1996-06-10 | 1999-05-25 | Morphics Technology, Inc | Method and apparatus for communicating information |
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 |
US5867145A (en) | 1996-07-01 | 1999-02-02 | Sun Microsystems, Inc. | Graphical image recasting |
US6360256B1 (en) | 1996-07-01 | 2002-03-19 | Sun Microsystems, Inc. | Name service for a redundant array of internet servers |
US6023742A (en) * | 1996-07-18 | 2000-02-08 | University Of Washington | Reconfigurable computing architecture for providing pipelined data paths |
CA2210582C (en) | 1996-07-24 | 2001-01-30 | Ntt Mobile Communications Network Inc. | Method and apparatus for receiving cdma radio communication |
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 |
US5892950A (en) | 1996-08-09 | 1999-04-06 | Sun Microsystems, Inc. | Interface for telecommunications network management |
JP3123440B2 (en) | 1996-08-14 | 2001-01-09 | 日本電気株式会社 | Channel selection method for wireless communication system |
US5838165A (en) | 1996-08-21 | 1998-11-17 | Chatter; Mukesh | High performance self modifying on-the-fly alterable logic FPGA, architecture and method |
US5819255A (en) | 1996-08-23 | 1998-10-06 | Tandem Computers, Inc. | System and method for database query optimization |
US6041970A (en) | 1996-08-30 | 2000-03-28 | Imi Cornelius Inc. | Pre-mix beverage dispensing system and components thereof |
US6226387B1 (en) | 1996-08-30 | 2001-05-01 | Regents Of The University Of Minnesota | Method and apparatus for scene-based video watermarking |
US5889989A (en) | 1996-09-16 | 1999-03-30 | The Research Foundation Of State University Of New York | Load sharing controller for optimizing monetary cost |
US5828858A (en) | 1996-09-16 | 1998-10-27 | Virginia Tech Intellectual Properties, Inc. | Worm-hole run-time reconfigurable processor field programmable gate array (FPGA) |
US5790817A (en) | 1996-09-25 | 1998-08-04 | Advanced Micro Devices, Inc. | Configurable digital wireless and wired communications system architecture for implementing baseband functionality |
US5825202A (en) | 1996-09-26 | 1998-10-20 | Xilinx, Inc. | Integrated circuit with field programmable and application specific logic areas |
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 |
US5950131A (en) | 1996-10-29 | 1999-09-07 | Motorola, Inc. | Method and apparatus for fast pilot channel acquisition using a matched filter in a CDMA radiotelephone |
US6005943A (en) | 1996-10-29 | 1999-12-21 | Lucent Technologies Inc. | Electronic identifiers for network terminal devices |
US5892962A (en) | 1996-11-12 | 1999-04-06 | Lucent Technologies Inc. | FPGA-based processor |
US5913172A (en) | 1996-11-15 | 1999-06-15 | Glenayre Electronics, Inc. | Method and apparatus for reducing phase cancellation in a simulcast paging system |
US7607147B1 (en) | 1996-12-11 | 2009-10-20 | The Nielsen Company (Us), Llc | Interactive service device metering systems |
US6246883B1 (en) | 1996-12-24 | 2001-06-12 | Lucent Technologies, Inc. | Mobile base station |
US5987611A (en) | 1996-12-31 | 1999-11-16 | Zone Labs, Inc. | System and methodology for managing internet access on a per application basis for client computers connected to the internet |
US5953322A (en) | 1997-01-31 | 1999-09-14 | Qualcomm Incorporated | Cellular internet telephone |
US5940438A (en) | 1997-02-18 | 1999-08-17 | Mitsubishi Electric Information Technology Center America, Inc (Ita) | Universal modem for digital video, audio and data communications |
US6289488B1 (en) | 1997-02-24 | 2001-09-11 | Lucent Technologies Inc. | Hardware-software co-synthesis of hierarchical heterogeneous distributed embedded systems |
US6061580A (en) | 1997-02-28 | 2000-05-09 | Randice-Lisa Altschul | Disposable wireless telephone and method for call-out only |
US6289434B1 (en) | 1997-02-28 | 2001-09-11 | Cognigine Corporation | Apparatus and method of implementing systems on silicon using dynamic-adaptive run-time reconfigurable circuits for processing multiple, independent data and control streams of varying rates |
JP3340343B2 (en) | 1997-03-13 | 2002-11-05 | 株式会社東芝 | Processor and information processing device |
US6059840A (en) | 1997-03-17 | 2000-05-09 | Motorola, Inc. | Automatic scheduling of instructions to reduce code size |
DE19711479C2 (en) | 1997-03-19 | 2002-10-24 | Bauer Maschinen Gmbh | Method for operating a work module and device |
US5912572A (en) | 1997-03-28 | 1999-06-15 | Cypress Semiconductor Corp. | Synchronizing clock pulse generator for logic derived clock signals with synchronous clock suspension capability for a programmable device |
US5991302A (en) | 1997-04-10 | 1999-11-23 | Cisco Technology, Inc. | Technique for maintaining prioritization of data transferred among heterogeneous nodes of a computer network |
US6115751A (en) | 1997-04-10 | 2000-09-05 | Cisco Technology, Inc. | Technique for capturing information needed to implement transmission priority routing among heterogeneous nodes of a computer network |
EP0872991B1 (en) | 1997-04-15 | 2006-07-26 | Hewlett-Packard Company, A Delaware Corporation | Method and apparatus for device interaction by format |
US6041322A (en) | 1997-04-18 | 2000-03-21 | Industrial Technology Research Institute | Method and apparatus for processing data in a neural network |
JP3555729B2 (en) | 1997-04-22 | 2004-08-18 | 日本ビクター株式会社 | Method and apparatus for processing variable-length encoded data |
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 |
US6219697B1 (en) | 1997-05-02 | 2001-04-17 | 3Com Corporation | Method and apparatus for operating the internet protocol over a high-speed serial bus |
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 |
US6047115A (en) | 1997-05-29 | 2000-04-04 | Xilinx, Inc. | Method for configuring FPGA memory planes for virtual hardware computation |
US5917852A (en) | 1997-06-11 | 1999-06-29 | L-3 Communications Corporation | Data scrambling system and method and communications system incorporating same |
US5949415A (en) | 1997-06-16 | 1999-09-07 | Intel Corporation | Method and apparatus for tracking program usage in a computer system |
FI105251B (en) * | 1997-06-18 | 2000-06-30 | Nokia Mobile Phones Ltd | A method for identifying base stations in a time division cellular network in a mobile station and a mobile station |
US6292827B1 (en) | 1997-06-20 | 2001-09-18 | Shore Technologies (1999) Inc. | Information transfer systems and method with dynamic distribution of data, control and management of information |
US6628699B2 (en) | 1997-06-23 | 2003-09-30 | Schlumberger Resource Management Systems, Inc. | Receiving a spread spectrum signal |
US5987105A (en) | 1997-06-25 | 1999-11-16 | Fisher & Paykel Limited | Appliance communication system |
US5966534A (en) | 1997-06-27 | 1999-10-12 | Cooke; Laurence H. | Method for compiling high level programming languages into an integrated processor with reconfigurable logic |
US5970254A (en) | 1997-06-27 | 1999-10-19 | Cooke; Laurence H. | Integrated processor and programmable data path chip for reconfigurable computing |
WO1999003776A1 (en) | 1997-07-14 | 1999-01-28 | Isoworth Uk Limited | Temperature controlled beverage dispensing apparatus |
DE69839197T2 (en) | 1997-07-17 | 2009-03-05 | Matsushita Electric Industrial Co., Ltd., Kadoma-shi | Synchronization method in a code division multiple access system |
US6111893A (en) | 1997-07-31 | 2000-08-29 | Cisco Technology, Inc. | Universal protocol conversion |
US6760833B1 (en) | 1997-08-01 | 2004-07-06 | Micron Technology, Inc. | Split embedded DRAM processor |
US6292830B1 (en) | 1997-08-08 | 2001-09-18 | Iterations Llc | System for optimizing interaction among agents acting on multiple levels |
US6311149B1 (en) | 1997-08-18 | 2001-10-30 | National Instruments Corporation | Reconfigurable test system |
US6006249A (en) | 1997-08-19 | 1999-12-21 | The Chase Manhattan Bank | Method and apparatus for concurrent data processing |
US6078736A (en) | 1997-08-28 | 2000-06-20 | Xilinx, Inc. | Method of designing FPGAs for dynamically reconfigurable computing |
IL126149A (en) | 1997-09-09 | 2003-07-31 | Sanctum Ltd | Method and system for protecting operations of trusted internal networks |
KR100246399B1 (en) | 1997-09-23 | 2000-04-01 | 구자홍 | Dispenser assembly for refrigerator and control method thereof |
US6036166A (en) | 1997-09-25 | 2000-03-14 | Imi Cornelius Inc. | Chamber valve |
US6120551A (en) | 1997-09-29 | 2000-09-19 | Xilinx, Inc. | Hardwire logic device emulating an FPGA |
US6363411B1 (en) | 1998-08-05 | 2002-03-26 | Mci Worldcom, Inc. | Intelligent network |
US6590415B2 (en) | 1997-10-09 | 2003-07-08 | Lattice Semiconductor Corporation | Methods for configuring FPGA's having variable grain components for providing time-shared access to interconnect resources |
US6195788B1 (en) * | 1997-10-17 | 2001-02-27 | Altera Corporation | Mapping heterogeneous logic elements in a programmable logic device |
EP1025503A4 (en) | 1997-10-20 | 2002-03-27 | Quickflex Inc | Reconfigurable secure hardware apparatus and method of operation |
US5999734A (en) | 1997-10-21 | 1999-12-07 | Ftl Systems, Inc. | Compiler-oriented apparatus for parallel compilation, simulation and execution of computer programs and hardware models |
US5993739A (en) | 1997-10-29 | 1999-11-30 | Chaircare | Continuous washing system |
US5873045A (en) * | 1997-10-29 | 1999-02-16 | International Business Machines Corporation | Mobile client computer with radio frequency transceiver |
US6122670A (en) | 1997-10-30 | 2000-09-19 | Tsi Telsys, Inc. | Apparatus and method for constructing data for transmission within a reliable communication protocol by performing portions of the protocol suite concurrently |
FR2770659A1 (en) | 1997-10-31 | 1999-05-07 | Sgs Thomson Microelectronics | IMPROVED PROCESSING PROCESSOR |
TW417082B (en) | 1997-10-31 | 2001-01-01 | Yamaha Corp | Digital filtering processing method, device and Audio/Video positioning device |
US6359897B1 (en) | 1997-11-03 | 2002-03-19 | Harris Corporation | Control system for controlling the processing data of a first in first out memory and method therefor |
US6185418B1 (en) * | 1997-11-07 | 2001-02-06 | Lucent Technologies Inc. | Adaptive digital radio communication system |
GB9724779D0 (en) | 1997-11-24 | 1998-01-21 | Rpc Containers Ltd | Containers |
US6119178A (en) | 1997-11-25 | 2000-09-12 | 8×8 Inc. | Communication interface between remote transmission of both compressed video and other data and data exchange with local peripherals |
US6128307A (en) | 1997-12-01 | 2000-10-03 | Advanced Micro Devices, Inc. | Programmable data flow processor for performing data transfers |
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 |
JP3985204B2 (en) | 1997-12-09 | 2007-10-03 | ソニー株式会社 | Information broadcasting method, receiver, information center, and receiving method |
US6091263A (en) | 1997-12-12 | 2000-07-18 | Xilinx, Inc. | Rapidly reconfigurable FPGA having a multiple region architecture with reconfiguration caches useable as data RAM |
US6046603A (en) | 1997-12-12 | 2000-04-04 | Xilinx, Inc. | Method and apparatus for controlling the partial reconfiguration of a field programmable gate array |
DE69827589T2 (en) | 1997-12-17 | 2005-11-03 | Elixent Ltd. | Configurable processing assembly and method of using this assembly to build a central processing unit |
US6279020B1 (en) | 1997-12-23 | 2001-08-21 | U.S. Philips Corporation | Programmable circuit for realizing a digital filter |
DE69838374T2 (en) | 1997-12-23 | 2008-05-29 | Texas Instruments Inc., Dallas | Processor and method for reducing its power consumption |
JPH11184674A (en) | 1997-12-24 | 1999-07-09 | Fujitsu Ltd | Register file |
US6192070B1 (en) * | 1998-01-02 | 2001-02-20 | Mitsubishi Electric Research Laboratories, Inc. | Universal modem for digital video, audio and data communications |
US5959811A (en) | 1998-01-13 | 1999-09-28 | Read-Rite Corporation | Magnetoresistive transducer with four-lead contact |
US6039219A (en) | 1998-01-20 | 2000-03-21 | Bach; Lanae E. | Liquid dispensing system for a refrigerator |
US6230307B1 (en) | 1998-01-26 | 2001-05-08 | Xilinx, Inc. | System and method for programming the hardware of field programmable gate arrays (FPGAs) and related reconfiguration resources as if they were software by creating hardware objects |
US6366999B1 (en) | 1998-01-28 | 2002-04-02 | Bops, Inc. | Methods and apparatus to support conditional execution in a VLIW-based array processor with subword execution |
US6378072B1 (en) | 1998-02-03 | 2002-04-23 | Compaq Computer Corporation | Cryptographic system |
US6094726A (en) | 1998-02-05 | 2000-07-25 | George S. Sheng | Digital signal processor using a reconfigurable array of macrocells |
US6076174A (en) | 1998-02-19 | 2000-06-13 | United States Of America | Scheduling framework for a heterogeneous computer network |
US6360263B1 (en) | 1998-02-25 | 2002-03-19 | International Business Machines Corporation | Dynamic resource allocation for user management in multi-processor time shared computer systems |
JPH11261440A (en) | 1998-03-11 | 1999-09-24 | Oki Electric Ind Co Ltd | Receiver |
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 |
US6073132A (en) | 1998-03-27 | 2000-06-06 | Lsi Logic Corporation | Priority arbiter with shifting sequential priority scheme |
US6112218A (en) | 1998-03-30 | 2000-08-29 | Texas Instruments Incorporated | Digital filter with efficient quantization circuitry |
US6134605A (en) | 1998-04-15 | 2000-10-17 | Diamond Multimedia Systems, Inc. | Redefinable signal processing subsystem |
US6202130B1 (en) | 1998-04-17 | 2001-03-13 | Motorola, Inc. | Data processing system for processing vector data and method therefor |
US6088043A (en) | 1998-04-30 | 2000-07-11 | 3D Labs, Inc. | Scalable graphics processor architecture |
US6226735B1 (en) | 1998-05-08 | 2001-05-01 | Broadcom | Method and apparatus for configuring arbitrary sized data paths comprising multiple context processing elements |
US6292822B1 (en) | 1998-05-13 | 2001-09-18 | Microsoft Corporation | Dynamic load balancing among processors in a parallel computer |
US6223222B1 (en) | 1998-05-14 | 2001-04-24 | 3Com Corporation | Method and system for providing quality-of-service in a data-over-cable system using configuration protocol messaging |
US6411612B1 (en) | 1998-05-19 | 2002-06-25 | Harris Communication | Selective modification of antenna directivity pattern to adaptively cancel co-channel interference in TDMA cellular communication system |
KR20010043794A (en) | 1998-06-05 | 2001-05-25 | 샌제이브 사이두 | Computer implemented scheduling system and process using abstract local search technique |
US6272616B1 (en) | 1998-06-17 | 2001-08-07 | Agere Systems Guardian Corp. | Method and apparatus for executing multiple instruction streams in a digital processor with multiple data paths |
GB2338558A (en) | 1998-06-17 | 1999-12-22 | Isoworth Uk Ltd | Drink dispenser, concentrate detector and concentrate container |
US6305014B1 (en) | 1998-06-18 | 2001-10-16 | International Business Machines Corporation | Lifetime-sensitive instruction scheduling mechanism and method |
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 |
US6282627B1 (en) | 1998-06-29 | 2001-08-28 | Chameleon Systems, Inc. | Integrated processor and programmable data path chip for reconfigurable computing |
KR100333724B1 (en) | 1998-06-30 | 2002-09-17 | 주식회사 하이닉스반도체 | Mehod for forming metal wire of semiconductor device by using TiAlN antireflection layer |
US6356994B1 (en) | 1998-07-09 | 2002-03-12 | Bops, Incorporated | Methods and apparatus for instruction addressing in indirect VLIW processors |
US6604085B1 (en) | 1998-07-20 | 2003-08-05 | Usa Technologies, Inc. | Universal interactive advertising and payment system network for public access electronic commerce and business related products and services |
EP0974898A3 (en) | 1998-07-24 | 2008-12-24 | Interuniversitair Microelektronica Centrum Vzw | A method for determining a storage-bandwidth optimized memory organization of an essentially digital device |
US6587684B1 (en) | 1998-07-28 | 2003-07-01 | Bell Atlantic Nynex Mobile | Digital wireless telephone system for downloading software to a digital telephone using wireless data link protocol |
GB9818377D0 (en) | 1998-08-21 | 1998-10-21 | Sgs Thomson Microelectronics | An integrated circuit with multiple processing cores |
US6377983B1 (en) | 1998-08-31 | 2002-04-23 | International Business Machines Corporation | Method and system for converting expertise based on document usage |
US6158031A (en) | 1998-09-08 | 2000-12-05 | Lucent Technologies, Inc. | Automated code generating translator for testing telecommunication system devices and method |
US6442672B1 (en) | 1998-09-30 | 2002-08-27 | Conexant Systems, Inc. | Method for dynamic allocation and efficient sharing of functional unit datapaths |
US6381735B1 (en) | 1998-10-02 | 2002-04-30 | Microsoft Corporation | Dynamic classification of sections of software |
US6360259B1 (en) | 1998-10-09 | 2002-03-19 | United Technologies Corporation | Method for optimizing communication speed between processors |
US6467009B1 (en) | 1998-10-14 | 2002-10-15 | Triscend Corporation | Configurable processor system unit |
US6301653B1 (en) | 1998-10-14 | 2001-10-09 | Conexant Systems, Inc. | Processor containing data path units with forwarding paths between two data path units and a unique configuration or register blocks |
US6219780B1 (en) | 1998-10-27 | 2001-04-17 | International Business Machines Corporation | Circuit arrangement and method of dispatching instructions to multiple execution units |
US6289375B1 (en) | 1998-10-30 | 2001-09-11 | International Business Machines Corporation | Method and apparatus for invoking network agent functions using a hash table |
US6446258B1 (en) | 1998-11-03 | 2002-09-03 | Intle Corporation | Interactive instruction scheduling and block ordering |
US6052600A (en) | 1998-11-23 | 2000-04-18 | Motorola, Inc. | Software programmable radio and method for configuring |
US6138693A (en) | 1998-11-23 | 2000-10-31 | Matz; Warren W. | Automatic detergent dispenser |
US6563891B1 (en) | 1998-11-24 | 2003-05-13 | Telefonaktiebolaget L M Ericsson (Publ) | Automatic gain control for slotted mode operation |
US6292938B1 (en) | 1998-12-02 | 2001-09-18 | International Business Machines Corporation | Retargeting optimized code by matching tree patterns in directed acyclic graphs |
US6405214B1 (en) | 1998-12-17 | 2002-06-11 | Hewlett-Packard Company | Method of gathering usage information and transmitting to a primary server and a third party server by a client program |
US6202189B1 (en) | 1998-12-17 | 2001-03-13 | Teledesic Llc | Punctured serial concatenated convolutional coding system and method for low-earth-orbit satellite data communication |
US6591283B1 (en) | 1998-12-24 | 2003-07-08 | Stmicroelectronics N.V. | Efficient interpolator for high speed timing recovery |
US6385751B1 (en) | 1998-12-30 | 2002-05-07 | Texas Instruments Incorporated | Programmable, reconfigurable DSP implementation of a Reed-Solomon encoder/decoder |
JP3444216B2 (en) | 1999-01-28 | 2003-09-08 | 日本電気株式会社 | Programmable device |
EP1073951A1 (en) | 1999-02-15 | 2001-02-07 | Koninklijke Philips Electronics N.V. | Data processor with a configurable functional unit and method using such a data processor |
JP3033575B1 (en) | 1999-02-17 | 2000-04-17 | 日本電気株式会社 | Image processing device |
US20020083423A1 (en) | 1999-02-17 | 2002-06-27 | Elbrus International | List scheduling algorithm for a cycle-driven instruction scheduler |
US6718541B2 (en) * | 1999-02-17 | 2004-04-06 | Elbrus International Limited | Register economy heuristic for a cycle driven multiple issue instruction scheduler |
US6980515B1 (en) | 1999-02-23 | 2005-12-27 | Alcatel | Multi-service network switch with quality of access |
US6510138B1 (en) * | 1999-02-25 | 2003-01-21 | Fairchild Semiconductor Corporation | Network switch with head of line input buffer queue clearing |
US6150838A (en) | 1999-02-25 | 2000-11-21 | Xilinx, Inc. | FPGA configurable logic block with multi-purpose logic/memory circuit |
US6271679B1 (en) | 1999-03-24 | 2001-08-07 | Altera Corporation | I/O cell configuration for multiple I/O standards |
US6349394B1 (en) * | 1999-03-31 | 2002-02-19 | International Business Machines Corporation | Performance monitoring in a NUMA computer |
US6141283A (en) | 1999-04-01 | 2000-10-31 | Intel Corporation | Method and apparatus for dynamically placing portions of a memory in a reduced power consumption state |
US6570877B1 (en) | 1999-04-07 | 2003-05-27 | Cisco Technology, Inc. | Search engine for forwarding table content addressable memory |
US6832250B1 (en) | 1999-04-13 | 2004-12-14 | Lexmark International, Inc. | Usage-based billing and management system and method for printers and other assets |
US6286134B1 (en) | 1999-04-23 | 2001-09-04 | Sun Microsystems, Inc. | Instruction selection in a multi-platform environment |
US6526570B1 (en) | 1999-04-23 | 2003-02-25 | Sun Microsystems, Inc. | File portability techniques |
GB2349548A (en) | 1999-04-27 | 2000-11-01 | Roke Manor Research | Downloading software to mobile telecommunication users |
JP2002544588A (en) | 1999-05-06 | 2002-12-24 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | Data processing apparatus, method of executing load or store instruction, and method of compiling program |
DE60025196T2 (en) | 1999-05-07 | 2006-09-07 | Infineon Technologies Ag | HETEROGICAL PROGRAMMABLE GATE FIELD |
US6263057B1 (en) | 1999-05-07 | 2001-07-17 | Lucent Technologies Inc. | Automatic telecommunications provider selection system |
KR100450789B1 (en) | 1999-05-25 | 2004-10-01 | 삼성전자주식회사 | Apparatus for acquiring PN code and DS-CDMA receiver comprising it |
JP4248703B2 (en) | 1999-05-31 | 2009-04-02 | パナソニック株式会社 | Stream multiplexing device, data broadcasting device |
JP2000353099A (en) | 1999-06-01 | 2000-12-19 | Tektronix Inc | Flow control method in active pipeline |
EP1061437A1 (en) | 1999-06-16 | 2000-12-20 | STMicroelectronics S.r.l. | Improved control unit for electronic microcontrollers or microprocessors |
US6347346B1 (en) * | 1999-06-30 | 2002-02-12 | Chameleon Systems, Inc. | Local memory unit system with global access for use on reconfigurable chips |
US6901440B1 (en) | 1999-07-02 | 2005-05-31 | Agilent Technologies, Inc. | System and method for universal service activation |
KR100358427B1 (en) | 1999-07-12 | 2002-10-25 | 한국전자통신연구원 | Hardware-Efficient Demodulator for CDMA Adaptive Antenna Array Systems |
US6359248B1 (en) | 1999-08-02 | 2002-03-19 | Xilinx, Inc. | Method for marking packaged integrated circuits |
WO2001011281A1 (en) | 1999-08-09 | 2001-02-15 | Imi Cornelius Brasil Ltda. | Universal connector for interconnecting fluid carrying components of beverage dispensing devices |
US6507947B1 (en) * | 1999-08-20 | 2003-01-14 | Hewlett-Packard Company | Programmatic synthesis of processor element arrays |
US6349346B1 (en) | 1999-09-23 | 2002-02-19 | Chameleon Systems, Inc. | Control fabric unit including associated configuration memory and PSOP state machine adapted to provide configuration address to reconfigurable functional unit |
US6430624B1 (en) | 1999-10-21 | 2002-08-06 | Air2Web, Inc. | Intelligent harvesting and navigation system and method |
US6421372B1 (en) | 1999-11-10 | 2002-07-16 | Itt Manufacturing Enterprises, Inc. | Sequential-acquisition, multi-band, multi-channel, matched filter |
US6539467B1 (en) | 1999-11-15 | 2003-03-25 | Texas Instruments Incorporated | Microprocessor with non-aligned memory access |
EP1107512A1 (en) | 1999-12-03 | 2001-06-13 | Sony International (Europe) GmbH | Communication device and software for operating multimedia applications |
JP2001166947A (en) | 1999-12-06 | 2001-06-22 | Nec Corp | Compile processing system |
GB2357226B (en) | 1999-12-08 | 2003-07-16 | Hewlett Packard Co | Security protocol |
US6694380B1 (en) | 1999-12-27 | 2004-02-17 | Intel Corporation | Mapping requests from a processing unit that uses memory-mapped input-output space |
WO2001050624A1 (en) * | 1999-12-30 | 2001-07-12 | Morphics Technology, Inc. | Method and apparatus to support multi standard, multi service base-stations for wireless voice and data networks |
AU2915201A (en) | 1999-12-30 | 2001-07-16 | Morphics Technology, Inc. | A fast initial acquisition and search device for a spread spectrum communicationsystem |
US6601158B1 (en) | 1999-12-30 | 2003-07-29 | Pmc-Sierra, Inc. | Count/address generation circuitry |
AU2001236590A1 (en) | 2000-01-28 | 2001-08-07 | Morphics Technology, Inc. | Method and apparatus for processing a secondary synchronization channel in a spread spectrum system |
JP5075313B2 (en) | 2000-01-28 | 2012-11-21 | インフィネオン テヒノロジース アクチェンゲゼルシャフト | Method of generating a configuration for a configurable spread spectrum communication device |
US6711617B1 (en) | 2000-02-09 | 2004-03-23 | International Business Machines Corporation | Method and apparatus for providing automatic configuration of a computer system based on its physical location using an electronically read schedule |
US6438737B1 (en) | 2000-02-15 | 2002-08-20 | Intel Corporation | Reconfigurable logic for a computer |
US6735621B1 (en) | 2000-02-18 | 2004-05-11 | Nortel Networks Limited | Method and apparatus for messaging between disparate networks |
US7509420B2 (en) | 2000-02-18 | 2009-03-24 | Emc Corporation | System and method for intelligent, globally distributed network storage |
US6778212B1 (en) | 2000-02-22 | 2004-08-17 | Pixim, Inc. | Digital image sensor with on -chip programmable logic |
US7082456B2 (en) | 2000-03-17 | 2006-07-25 | Filesx Ltd. | Accelerating responses to requests made by users to an internet |
US6326806B1 (en) | 2000-03-29 | 2001-12-04 | Xilinx, Inc. | FPGA-based communications access point and system for reconfiguration |
CA2375749A1 (en) | 2000-03-31 | 2001-10-11 | Motorola, Inc. | Scalable cryptographic engine |
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 |
DE10019085A1 (en) | 2000-04-10 | 2001-12-06 | Francotyp Postalia Gmbh | Arrangement and method for providing a message when loading service data for a terminal |
US7181542B2 (en) * | 2000-04-12 | 2007-02-20 | Corente, Inc. | Method and system for managing and configuring virtual private networks |
DE10018374A1 (en) | 2000-04-13 | 2001-10-18 | Siemens Ag | Mobile terminal such as personal digital assistant or communications terminal |
US6804357B1 (en) | 2000-04-28 | 2004-10-12 | Nokia Corporation | Method and system for providing secure subscriber content data |
US6820105B2 (en) * | 2000-05-11 | 2004-11-16 | Cyberguard Corporation | Accelerated montgomery exponentiation using plural multipliers |
CN1315086C (en) | 2000-05-20 | 2007-05-09 | 林荣姬 | On demand contents providing method and system |
US6604189B1 (en) | 2000-05-22 | 2003-08-05 | Lsi Logic Corporation | Master/slave processor memory inter accessability in an integrated embedded system |
US20020010848A1 (en) * | 2000-05-29 | 2002-01-24 | Shoichi Kamano | Data processing system |
US6601086B1 (en) | 2000-06-06 | 2003-07-29 | Emware, Inc. | Service provider for providing data, applications and services to embedded devices and for facilitating control and monitoring of embedded devices |
US6606529B1 (en) | 2000-06-09 | 2003-08-12 | Frontier Technologies, Inc. | Complex scheduling method and device |
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 |
US6469540B2 (en) | 2000-06-15 | 2002-10-22 | Nec Corporation | Reconfigurable device having programmable interconnect network suitable for implementing data paths |
US6410941B1 (en) | 2000-06-30 | 2002-06-25 | Motorola, Inc. | Reconfigurable systems using hybrid integrated circuits with optical ports |
WO2002011404A2 (en) * | 2000-07-31 | 2002-02-07 | Morphics Technology, Inc. | Apparatus and method for configurable multi-dwell search engine for spread spectrum applications |
WO2002011309A1 (en) | 2000-07-31 | 2002-02-07 | Morphics Technology, Inc. | Generic finger architecture for spread spectrum applications |
AU2001278148A1 (en) | 2000-08-01 | 2002-02-13 | Hrl Laboratories, Llc | Apparatus and method for context-sensitive dynamic information service |
US6754805B1 (en) | 2000-08-07 | 2004-06-22 | Transwitch Corporation | Method and apparatus for configurable multi-cell digital signal processing employing global parallel configuration |
US20020032551A1 (en) | 2000-08-07 | 2002-03-14 | Jabari Zakiya | Systems and methods for implementing hash algorithms |
GB0019341D0 (en) * | 2000-08-08 | 2000-09-27 | Easics Nv | System-on-chip solutions |
FR2813409A1 (en) | 2000-08-29 | 2002-03-01 | Canon Res Ct France Sa | Configuration of a peripheral for processing of electronic documents in a communication network, uses user data to access level of service available to that user on a network and prepares configuration from user data and service level data |
JP3473695B2 (en) * | 2000-08-30 | 2003-12-08 | Necエレクトロニクス株式会社 | Cell search method and circuit in W-CDMA system |
US6754470B2 (en) | 2000-09-01 | 2004-06-22 | Telephia, Inc. | System and method for measuring wireless device and network usage and performance metrics |
US6751723B1 (en) | 2000-09-02 | 2004-06-15 | Actel Corporation | Field programmable gate array and microcontroller system-on-a-chip |
KR100342483B1 (en) | 2000-09-09 | 2002-06-28 | 윤종용 | Apparatus and method for searching base station in umts |
US6538470B1 (en) | 2000-09-18 | 2003-03-25 | Altera Corporation | Devices and methods with programmable logic and digital signal processing regions |
US6718182B1 (en) | 2000-09-18 | 2004-04-06 | Compal Electronics, Inc. | Modularized functionality enhancement for a cellular telephone |
US6771688B1 (en) | 2000-09-19 | 2004-08-03 | Lucent Technologies Inc. | Segmented architecture for multiple sequence detection and identification in fading channels |
US20020089348A1 (en) | 2000-10-02 | 2002-07-11 | Martin Langhammer | Programmable logic integrated circuit devices including dedicated processor components |
JP3933380B2 (en) | 2000-10-05 | 2007-06-20 | 富士通株式会社 | compiler |
EP1241817A4 (en) * | 2000-10-06 | 2003-01-22 | Yozan Inc | Receiver |
US20020042875A1 (en) | 2000-10-11 | 2002-04-11 | Jayant Shukla | Method and apparatus for end-to-end secure data communication |
US6941336B1 (en) | 2000-10-26 | 2005-09-06 | Cypress Semiconductor Corporation | Programmable analog system architecture |
US7035932B1 (en) | 2000-10-27 | 2006-04-25 | Eric Morgan Dowling | Federated multiprotocol communication |
US6748360B2 (en) | 2000-11-03 | 2004-06-08 | International Business Machines Corporation | System for selling a product utilizing audio content identification |
US20020107962A1 (en) | 2000-11-07 | 2002-08-08 | Richter Roger K. | Single chassis network endpoint system with network processor for load balancing |
JP2002164812A (en) * | 2000-11-24 | 2002-06-07 | Nec Corp | Path search circuit for spread spectrum communication |
US6766165B2 (en) | 2000-12-05 | 2004-07-20 | Nortel Networks Limited | Method and system for remote and local mobile network management |
US6738744B2 (en) | 2000-12-08 | 2004-05-18 | Microsoft Corporation | Watermark detection via cardinality-scaled correlation |
US7844666B2 (en) | 2000-12-12 | 2010-11-30 | Microsoft Corporation | Controls and displays for acquiring preferences, inspecting behavior, and guiding the learning and decision policies of an adaptive communications prioritization and routing system |
US6865664B2 (en) | 2000-12-13 | 2005-03-08 | Conexant Systems, Inc. | Methods, systems, and computer program products for compressing a computer program based on a compression criterion and executing the compressed program |
US6823448B2 (en) | 2000-12-15 | 2004-11-23 | Intel Corporation | Exception handling using an exception pipeline in a pipelined processor |
US6842895B2 (en) | 2000-12-21 | 2005-01-11 | Freescale Semiconductor, Inc. | Single instruction for multiple loops |
US6426649B1 (en) | 2000-12-29 | 2002-07-30 | Quicklogic Corporation | Architecture for field programmable gate array |
US6483343B1 (en) | 2000-12-29 | 2002-11-19 | Quicklogic Corporation | Configurable computational unit embedded in a programmable device |
EP2627008A3 (en) | 2000-12-29 | 2013-09-11 | Intel Mobile Communications GmbH | Channel codec processor configurable for multiple wireless communications standards |
US20020087829A1 (en) | 2000-12-29 | 2002-07-04 | Snyder Walter L. | Re-targetable communication system |
WO2002056538A2 (en) | 2001-01-12 | 2002-07-18 | Broadcom Corporation | Implementation of the shai algorithm |
US6836836B2 (en) | 2001-01-19 | 2004-12-28 | Sony Corporation | Memory protection control device and method |
US6871236B2 (en) | 2001-01-26 | 2005-03-22 | Microsoft Corporation | Caching transformed content in a mobile gateway |
US7085310B2 (en) | 2001-01-29 | 2006-08-01 | Qualcomm, Incorporated | Method and apparatus for managing finger resources in a communication system |
US20020133688A1 (en) | 2001-01-29 | 2002-09-19 | Ming-Hau Lee | SIMD/MIMD processing on a reconfigurable array |
US6753873B2 (en) * | 2001-01-31 | 2004-06-22 | General Electric Company | Shared memory control between detector framing node and processor |
US6925167B2 (en) * | 2001-02-01 | 2005-08-02 | Estech Systems, Inc. | Service observing in a voice over IP telephone system |
US20020107905A1 (en) | 2001-02-05 | 2002-08-08 | Roe Colleen A. | Scalable agent service system |
JP2005503047A (en) | 2001-02-06 | 2005-01-27 | エン ガルデ システムズ、インコーポレイテッド | Apparatus and method for providing a secure network |
KR100397353B1 (en) | 2001-02-07 | 2003-09-13 | 광주과학기술원 | One-Tap Equalizer Bank for the Orthogonal Frequency Division Multiplexing System |
US6760587B2 (en) | 2001-02-23 | 2004-07-06 | Qualcomm Incorporated | Forward-link scheduling in a wireless communication system during soft and softer handoff |
US7433942B2 (en) | 2001-02-27 | 2008-10-07 | Intel Corporation | Network management |
US20020147845A1 (en) | 2001-03-06 | 2002-10-10 | Juan-Antonio Sanchez-Herrero | Flexible user distribution between user's serving entities |
US6674999B2 (en) | 2001-03-16 | 2004-01-06 | Skyworks Solutions, Inc | Dynamically varying linearity system for an RF front-end of a communication device |
US20040133745A1 (en) | 2002-10-28 | 2004-07-08 | Quicksilver Technology, Inc. | Adaptable datapath for a digital processing system |
US7325123B2 (en) | 2001-03-22 | 2008-01-29 | Qst Holdings, Llc | Hierarchical interconnect for configuring separate interconnects for each group of fixed and diverse computational elements |
US6836839B2 (en) | 2001-03-22 | 2004-12-28 | Quicksilver Technology, Inc. | Adaptive integrated circuitry with heterogeneous and reconfigurable matrices of diverse and adaptive computational units having fixed, application specific computational elements |
US7225279B2 (en) * | 2002-06-25 | 2007-05-29 | Nvidia Corporation | Data distributor in a computation unit forwarding network data to select components in respective communication method type |
US7653710B2 (en) * | 2002-06-25 | 2010-01-26 | Qst Holdings, Llc. | Hardware task manager |
WO2002077854A1 (en) * | 2001-03-26 | 2002-10-03 | Azurn Networks Inc. | Unified xml voice and data media converging switch and application delivery system |
EP1255368A1 (en) | 2001-04-30 | 2002-11-06 | Siemens Information and Communication Networks S.p.A. | Method to perform link adaptation in enhanced cellular communication systems with several modulation and coding schemes |
US6577678B2 (en) | 2001-05-08 | 2003-06-10 | Quicksilver Technology | Method and system for reconfigurable channel coding |
US6785341B2 (en) | 2001-05-11 | 2004-08-31 | Qualcomm Incorporated | Method and apparatus for processing data in a multiple-input multiple-output (MIMO) communication system utilizing channel state information |
US6963890B2 (en) | 2001-05-31 | 2005-11-08 | Koninklijke Philips Electronics N.V. | Reconfigurable digital filter having multiple filtering modes |
US20020184291A1 (en) | 2001-05-31 | 2002-12-05 | Hogenauer Eugene B. | Method and system for scheduling in an adaptable computing engine |
US6618434B2 (en) | 2001-05-31 | 2003-09-09 | Quicksilver Technology, Inc. | Adaptive, multimode rake receiver for dynamic search and multipath reception |
US6912515B2 (en) | 2001-06-04 | 2005-06-28 | Xerox Corporation | Method and system for algorithm synthesis in problem solving |
US7032229B1 (en) | 2001-06-04 | 2006-04-18 | Palmsource, Inc. | Automatic tracking of user progress in a software application |
US6653859B2 (en) | 2001-06-11 | 2003-11-25 | Lsi Logic Corporation | Heterogeneous integrated circuit with reconfigurable logic cores |
US7266703B2 (en) | 2001-06-13 | 2007-09-04 | Itt Manufacturing Enterprises, Inc. | Single-pass cryptographic processor and method |
US7969431B2 (en) * | 2001-06-29 | 2011-06-28 | National Instruments Corporation | Graphical program node for generating a measurement program |
US6883084B1 (en) | 2001-07-25 | 2005-04-19 | University Of New Mexico | Reconfigurable data path processor |
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 |
US7257620B2 (en) | 2001-09-24 | 2007-08-14 | Siemens Energy & Automation, Inc. | Method for providing engineering tool services |
US20030061260A1 (en) | 2001-09-25 | 2003-03-27 | Timesys Corporation | Resource reservation and priority management |
US20030142818A1 (en) | 2001-09-28 | 2003-07-31 | Nec Usa, Inc. | Techniques for efficient security processing |
US20030074473A1 (en) | 2001-10-12 | 2003-04-17 | Duc Pham | Scalable network gateway processor architecture |
US7139263B2 (en) | 2001-10-19 | 2006-11-21 | Sentito Networks, Inc. | Voice over IP architecture |
US7146500B2 (en) | 2001-11-14 | 2006-12-05 | Compass Technology Management, Inc. | System for obtaining signatures on a single authoritative copy of an electronic record |
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 |
US8412915B2 (en) | 2001-11-30 | 2013-04-02 | Altera Corporation | Apparatus, system and method for configuration of adaptive integrated circuitry having heterogeneous computational elements |
US7088825B2 (en) | 2001-12-12 | 2006-08-08 | Quicksilver Technology, Inc. | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes |
US7215701B2 (en) | 2001-12-12 | 2007-05-08 | Sharad Sambhwani | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes |
US7631196B2 (en) | 2002-02-25 | 2009-12-08 | Intel Corporation | Method and apparatus for loading a trustable operating system |
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) |
US20030172138A1 (en) | 2002-03-11 | 2003-09-11 | Mccormack Jonathan I. | System and method for managing two or more electronic devices |
US20030212684A1 (en) | 2002-03-11 | 2003-11-13 | Markus Meyer | System and method for adapting preferences based on device location or network topology |
US20040039801A9 (en) | 2002-03-11 | 2004-02-26 | Venkatachary Srinivasan | System and method for delivering data in a network |
US7200735B2 (en) | 2002-04-10 | 2007-04-03 | Tensilica, Inc. | High-performance hybrid processor with configurable execution units |
US6732354B2 (en) | 2002-04-23 | 2004-05-04 | Quicksilver Technology, Inc. | Method, system and software for programming reconfigurable hardware |
US6988139B1 (en) * | 2002-04-26 | 2006-01-17 | Microsoft Corporation | Distributed computing of a job corresponding to a plurality of predefined tasks |
JP3860075B2 (en) | 2002-05-30 | 2006-12-20 | シャープ株式会社 | Self-synchronous logic circuit having test circuit and method for testing self-synchronous logic circuit |
US6735747B2 (en) | 2002-06-10 | 2004-05-11 | Lsi Logic Corporation | Pre-silicon verification path coverage |
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 |
US7317750B2 (en) | 2002-10-31 | 2008-01-08 | Lot 41 Acquisition Foundation, Llc | Orthogonal superposition coding for direct-sequence communications |
US7184472B2 (en) | 2003-03-07 | 2007-02-27 | Texas Instruments Incorporated | Time domain equalizer and method |
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 |
US7369607B2 (en) | 2004-02-26 | 2008-05-06 | 2Wire, Inc. | Multicarrier communication using a time domain equalizing filter |
-
2002
- 2002-11-14 US US10/295,692 patent/US7215701B2/en not_active Expired - Fee Related
- 2002-12-11 TW TW091135874A patent/TW200304291A/en unknown
- 2002-12-12 WO PCT/US2002/039723 patent/WO2003055093A1/en not_active Application Discontinuation
- 2002-12-12 AU AU2002366954A patent/AU2002366954A1/en not_active Abandoned
-
2007
- 2007-03-13 US US11/724,076 patent/US7512173B2/en not_active Expired - Lifetime
- 2007-04-04 US US11/797,583 patent/US7668229B2/en not_active Expired - Lifetime
-
2009
- 2009-07-08 US US12/499,756 patent/US8442096B2/en not_active Expired - Lifetime
-
2010
- 2010-02-22 US US12/710,171 patent/US20100150354A1/en not_active Abandoned
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6985517B2 (en) * | 2000-11-09 | 2006-01-10 | Matsushita Electric Industrial Co., Ltd. | Matched filter and correlation detection method |
US20020141489A1 (en) * | 2001-04-03 | 2002-10-03 | Ichiro Imaizumi | Correlation circuit for spread spectrum |
US20030063656A1 (en) * | 2001-09-19 | 2003-04-03 | Rao Subramanya P. | Method & apparatus for step two W-CDMA searching |
US20030099223A1 (en) * | 2001-11-28 | 2003-05-29 | Chang Li Fung | Acquisition matched filter for W-CDMA systems providing frequency offset robustness |
Also Published As
Publication number | Publication date |
---|---|
US20070217486A1 (en) | 2007-09-20 |
WO2003055093A1 (en) | 2003-07-03 |
US7215701B2 (en) | 2007-05-08 |
AU2002366954A1 (en) | 2003-07-09 |
US7512173B2 (en) | 2009-03-31 |
WO2003055093A8 (en) | 2003-10-30 |
AU2002366954A8 (en) | 2003-07-09 |
TW200304291A (en) | 2003-09-16 |
US20070153883A1 (en) | 2007-07-05 |
US7668229B2 (en) | 2010-02-23 |
US20030123666A1 (en) | 2003-07-03 |
US20090268789A1 (en) | 2009-10-29 |
US8442096B2 (en) | 2013-05-14 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7512173B2 (en) | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes | |
US7197645B2 (en) | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes | |
US6363108B1 (en) | Programmable matched filter searcher | |
US7072384B2 (en) | Fixed pattern detection apparatus and fixed pattern detection method | |
US20010048714A1 (en) | Method and apparatus for processing a secondary synchronization channel in a spread spectrum system | |
JP4426678B2 (en) | Simplified cell search method for first and second stages | |
KR100434262B1 (en) | Multi scrambling code generation method for down link | |
US8134981B2 (en) | Correlator for primary cell search using memory architecture | |
US7139256B2 (en) | Method and system for detecting and identifying scrambling codes | |
EP1475899A1 (en) | Process and device for the cell search procedure in cellular communication systems | |
US20090046668A1 (en) | Method and system for detecting and identifying scrambling codes | |
US7292664B2 (en) | Process and device for synchronization and codegroup identification in communication systems of the cellular type | |
US7123929B2 (en) | Method and device for synchronization and identification of the codegroup in cellular communication systems and computer program product therefor | |
KR100369659B1 (en) | Correlation apparatus and method for code acquisition in cdma system | |
KR100406520B1 (en) | Scrambling code serching method of W-CDMA system | |
KR100248094B1 (en) | Two pilot system and method for reducing interference | |
KR100376752B1 (en) | Receiver for supporting multi-channel | |
GB2361152A (en) | Identifying PN CODE in CDMA system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |