These and other aspects of the invention are described in more detail with reference to the drawings, in which:
An input of the weighted sum units 106a, 106b receives a plurality of the basic-code vectors 102a, 102b up to and including 102n. The output of the weighted sum units 106a, 106b is provided as input to the add unit 110, or, if the device 100 comprises one or more pre-processing units 108a, 108b, as input to the pre-processing units. If the device 100 comprises one or more pre-processing units 108a, 108b, then the output of the pre-processing units is provided as input to the add unit 110. The output of the add unit 110 is the composite-code vector 104. Alternatively, if a post-processing unit 112 is deployed in the device 100, then the output of the add unit 110 is provided as input to the post-processing unit 112. In that case, the output of the post-processing unit 112 is the composite-code vector 104.
The code configuration word 101 can be split into smaller configuration words 114a, 114b, 116a, 116b, 118, which can be fed to several components of the device 100. A configuration word is also a sequence of symbols in vector format and the length of such a configuration word may vary; it is not per definition equal to the length of the basic-code vectors 102a, 102b up to and including 102n, the composite-code vector 104 or intermediate-code vectors produced by the components of the device 100. The configuration words 114a, 114b, 116a, 116b, 118, are used to configure the functions performed by the components 106a, 106b, 108a, 108b, 112, of the device 100.
The cases Clong, Sdl, Cpre, Cc-acc, Cc-cd, Cshort, and C/A (GPS), represent the following codes:
Function fs is a function which can be performed by the weighted sum units 106a, 106b. In the specification, the elements of the intermediate-code vector are represented by on, wherein variable ‘n’ identifies the location of the elements within the intermediate-code vector. The elements of the incoming basic-code vectors 102a, 102b up to and including 102n, are represented by im[n], wherein variable ‘m’ identifies the basic-code vectors and variable ‘n’ identifies the location of the elements within a basic-code vector. In this case, the elements of the configuration words 114a, 114b are represented by ksm, wherein variable ‘m’ identifies the location of the elements. The number of elements of the configuration words 114a, 114b is 7, which is equal to the number of incoming basic-code vectors 102a, 102b up to and including 102n. According to the specification, the function selects a subset of the basic-code vectors 102a, 102b up to and including 102n, and calculates a bit-wise addition of them.
Function fr is a function which can be performed by the pre-processing units 108a, 108b. In the specification, the elements of the intermediate-code vector are represented by i2n, i2n+1, and o4n, o4n+1, o4n+2, o4n+3, respectively, wherein variable ‘n’ is used to identify the location of the elements. The incoming intermediate-code vector is represented by i2n, i2n+1 and the outgoing intermediate-code vector is represented by o4n, o4n+1, o4n+2, o4n+3. The elements of the configuration words 116a, 116b are represented by kr0, kr1. According to the specification, the function doubles the length of the incoming intermediate-code vector by repeating and reordering elements. The pre-processing units 108a, 108b can erase, repeat and reorder the elements of the intermediate-code vectors.
Function fm is another function which can be performed by the pre-processing units 108a, 108b. The elements of the incoming and outgoing intermediate-code vector are represented by in and on, respectively, wherein variable ‘n’ identifies the location of the elements. The elements of the configuration words 116a, 116b are represented by km(n mod 8), wherein variable ‘n’ is used to identify the location of the elements. According to the specification, the function applies a mask on the intermediate-code vector.
Function fa is a function which can be performed by the add unit 110. According to the specification, two intermediate-code vectors in and jn, wherein variable ‘n’ identifies the location of the elements within the intermediate-code vectors, are added using bit-wise addition and the result is output as the composite-code vector 104, represented by on, wherein variable ‘n’ represents the location of the elements within the composite-code vector.
Function fcn is a function which can be performed by the post-processing unit 112. The elements of the ingoing composite-code vector and outgoing composite-code vector are represented by in and on, respectively, wherein variable ‘n’ identifies the location of the elements. The elements of the configuration word 118 are represented by kcnn, wherein variable ‘n’ identifies the location of the elements. According to the specification, the function adds the contents of the configuration word to the composite-code vector 104 using bit-wise addition. This is also referred to as a conditional negation of the composite-code vector 104.
It is remarked that the scope of protection of the invention is not restricted to the embodiments described herein. Neither is the scope of protection of the invention restricted by the reference symbols in the claims. The word ‘comprising’ does not exclude other parts than those mentioned in a claim. The word ‘a(n)’ preceding an element does not exclude a plurality of those elements. Means forming part of the invention may both be implemented in the form of dedicated hardware or in the form of a programmed general-purpose processor. The invention resides in each new feature or combination of features.
Number | Date | Country | Kind |
---|---|---|---|
03102265.0 | Jul 2003 | EP | regional |
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/IB04/51201 | 7/13/2004 | WO | 00 | 1/20/2006 |