1. A method, comprising:
capturing information about an event, that has occurred above a predetermined threshold, by at least one mobile device, the information comprising location information and event type information;
identifying the event via an event alert server by associating the event type information with a specific event and associating the location information with a location associated with the specific event;
performing a lookup of at least one other mobile device associated with at least one service provider site;
identifying a location of the at least one other mobile device; and
sending an alert of the event to the at least one other mobile device if the at least one other mobile device is within a predetermined distance of the event based on the location associated with the specific event;
wherein the sending of the alert comprises sending at least one of:
a first alert to a first mobile device of the at least one other mobile device moving towards the event; and
a second alert to a second mobile device of the at least one other mobile device moving away from the event.
2. The method of claim 1, comprising sending the information from the at least one mobile device to the event alert server.
3. The method of claim 1, comprising receiving an alert of the event at the least one other mobile device if at least one of a following occurs:
the event is the specific event;
the event occurs at or near the geographical location; and
the at least one other mobile device is located at or near the geographical location.
4. The method of claim 1, wherein at least one of:
determining if the event is a specific event; and
if the event occurred at or near a geographical location, comprises at least one of:
processing information related to the event, wherein the processing comprises:
recognizing an image from the information about the event;
identifying the type of the event based on the image; and
identifying the location of the event based on the location of the at least one mobile device.
5. The method of claim 1, comprising sending an alert of the event to the at least one other mobile device comprises performing a lookup of the at least one other mobile device associated with at least one service provider site.
6. The method of claim 5, comprising sending the alert to the at least one other mobile device associated with at least one service provider site.
7. The method of claim 1, comprising sending an alert of the event to the at least one other mobile device comprises at least one of:
sending the alert to at least one service provider site; and
forwarding the alert from the at least one service provider site to the at least one other mobile device associated with the at least one service provider site.
8. The method of claim 1, comprising sending an alert of the event to the at least one other mobile device comprises at least one of:
identifying a location of at least one service provider site from a geographical information system;
sending the alert to the at least one service provider site within a predetermined distance of the event based on the location; and
forwarding the alert from the at least one service provider site to the at least one other mobile device associated with the at least one service provider site.
9. The method of claim 1, wherein at least one of the first mobile device and the second mobile device is the at least one mobile device.
10. The method of claim 1, comprising sending an alert of the event to the at least one other mobile device comprises sending the alert to the at least one other mobile device based on a period of time the at least one other mobile device is registered with a service provider site.
11. A non-transitory computer readable storage medium comprising instructions that when executed by a processor cause the processor to perform:
capturing information about an event, that has occurred above a predetermined threshold, by at least one mobile device, the information comprising location information and event type information;
identifying the event via an event alert server by associating the event type information with a specific event and associating the location information with a location associated with the specific event;
performing a lookup of at least one other mobile device associated with at least one service provider site;
identifying a location of the at least one other mobile device; and
sending an alert of the event to the at least one other mobile device if the at least one other mobile device is within a predetermined distance of the event based on the location associated with the specific event;
wherein the sending of the alert comprises sending at least one of:
a first alert to a first mobile device of the at least one other mobile device moving towards the event; and
a second alert to a second mobile device of the at least one other mobile device moving away from the event.
12. A system, comprising:
an event alert system configured to:
identify an event, that has occurred above a predetermined threshold, based on information from at least one mobile device, the information comprising location information and event type information, the event identified by an association of the event type information with a specific event stored in the repository and an association of the location information with a particular location associated with the specific event;
perform a lookup of at least one other mobile device associated with at least one service provider site;
receive a location of the at least one other mobile device; and
send an alert of the event to the at least one other mobile device if the at least one other mobile device is within a predetermined distance of the event based on the location associated with the specific event;
wherein the alert sent comprises at least one of:
a first alert sent to a first mobile device of the at least one other mobile device that moves towards the event; and
a second alert sent to a second mobile device of the at least one other mobile device that moves away from the event.
13. The system of claim 12, further comprising at least one event monitor operable to perform at least one of a following:
sense an occurrence of the event;
determine if the event is above the predetermined threshold; and
notify the event alert system of the occurrence of the event if the event is above the predetermined threshold.
14. The system of claim 12, wherein the event alert system is configured to receive information about the event from the at least one mobile device.
15. The system of claim 12, wherein the event alert system is further operable to perform at least one of a following:
send the alert to at least one service provider site; and
cause the at least one service provider site to forward the alert from the at least one service provider site to the at least one other mobile device associated with the at least one service provider site.
16. The system of claim 12, wherein information about the event is received if at least one of the following occurs:
the event is the specific event;
the event occurs at or near the geographical location; and
the at least one mobile device is located at or near the geographical location.
17. The system of claim 12, further comprising at least one geographical information system, wherein
the at least one geographical information system sends the location of the at least one other mobile device.
18. The system of claim 12, further comprising at least one geographical information system, wherein the event alert system is further operable to perform at least one of a following:
identify a location of at least one service provider site from the at least one geographical information system;
send the alert to the at least one service provider site within a predetermined distance of the event based on the location; and
forward the alert from the at least one service provider site to at least one of: the at least one mobile device associated with the at least one service provider site and the at least one other mobile device.
19. The system of claim 12, further comprising:
at least one image recognition system; and
at least one geographical information system;
wherein the at least one image recognition system is operable to recognize an image from the information about the event;
wherein the event alert system is operable to identify at least one of:
a type of the event based on the image; and
a location of the event based on a location of the at least one mobile device from the at least one geographical information system.
20. The system of claim 12, wherein the event alert system is further operable to perform at least one of a following:
register at least one mobile user associated with the at least one mobile device;
monitor a specific event;
determine if the monitored event is the specific event based on a type of the event and a location of the event; and
send an alert of the event, if the event is the specific event, to at least one of: the at least one mobile device and the at least one other mobile device.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method for determining a final state, comprising n bits and iterated N times, for a shift register arrangement from a given initial state, comprising n bits, for the shift register arrangement, the iteration rule for the shift register arrangement being given by the characteristic polynomial
f(x)=1+c1\xb7x+c2\xb7x2+. . . +cn\u22121\xb7xn\u22121+xn
\u2003with c1, c2, . . . , cn\u22121 \u03b5 {0; 1}, where a shift register arrangement state change which corresponds to a number N\u2032 of shift register operations, where 0<N\u2032\u2266N, is calculated by:
a) determining a tap mask which is characteristic of N\u2032 shift register operations; and
b) performing n shift register operations, as a result of which the tap mask is used for each shift register operation to obtain one bit from n bits of an N\u2032-fold iterated state of the shift register arrangement, wherein step a) comprises:
\u2003splitting N\u2032 on the basis of
N
\u2032
=
\u2211
j
=
1
k
\u2032
\u2062
\u2062
N
i
\u2061
(
j
)
;
\u2003and
determining the tap mask which is characteristic of N\u2032 shift register operations using k\u2032 tap masks mi(j)(x), where j=1, . . . , k\u2032, each of the k\u2032 tap masks mi(j)(x) being characteristic of the respective Ni(j) shift register operations,
wherein the method is used in CDMA transmission systems in order to produce a spreading sequence with an offset of N bits.
2. The method as claimed in claim 1, wherein the tap mask is defined by the polynomial
m(x)=xN\u2032mod f
\u2003in the form
m(x)=m0+m1\xb7x+m2\xb7x2+. . . +mn\u22121\xb7xn\u22121
with the coefficient set m0, m1, . . . , mn\u22121 \u03b5 {0; 1}, wherein
the i-th cell of the shift register arrangement is tapped off at the precise instant when mi=1, and
for each shift register operation a modulo two addition is performed for the bits which have been tapped off.
3. The method as claimed in claim 2, wherein step a) comprises
a1) splitting N into a sum comprising k whole numbers Ni in line with
N
=
\u2211
i
=
1
k
\u2062
\u2062
N
i
,
\u2003where k>1;
a2) if N\u2032=N, determining the tap mask which is characteristic of N shift register operations from the tap masks which are characteristic of the Ni, i=1, . . . , k, shift register operations on the basis of
m
\u2061
(
x
)
=
\u220f
i
=
1
k
\u2062
\u2062
m
i
\u2061
(
x
)
\u2062
mod
\u2062
\u2062
f
,
\u2003wherein mi(x) =xNimod f, andor
a2\u2032) if N\u2032<N,
choosing Ni(j) for which
N
\u2032
=
\u2211
j
=
1
k
\u2032
\u2062
\u2062
N
i
\u2061
(
j
)
\u2062
\u2062
where
\u2062
\u2062
k
\u2032
<
k
;
\u2003and
determining the tap mask which is characteristic of N\u2032 shift register operations from the tap masks which are characteristic of the Ni(j), j=1, . . . , k\u2032, shift register operations on the basis of
m
\u2061
(
x
)
=
\u2211
j
=
1
k
\u2032
\u2062
\u2062
m
i
\u2061
(
j
)
\u2062
\u2062
(
x
)
\u2062
mod
\u2062
\u2062
f
,
where
\u2062
\u2062
m
i
\u2061
(
j
)
\u2061
(
x
)
=
\u230a
x
N
i
\u2061
(
j
)
\u230b
\u2062
\u2062
mod
\u2062
\u2062
f
.
4. The method as claimed in claim 3, wherein the split is based on a splitting basis in which Ni can assume the values 2i\u22121, i=1, 2, . . . .
5. The method as claimed in claim 3, wherein the split is based on a splitting basis in which Ni can assume the values 2i\u22121, 2\xb72i\u22121, 3\xb72i\u22121, 2i+2, 2\xb72i+2, 3\xb72i+2, . . . , i=1, 2, . . . .
6. The method as claimed in claim 3, wherein N is represented as a binary number, and the associated bit word is split into groups of adjacent bits; and wherein the split for N is based on a splitting basis in which, for each group, Ni can assume the values which are given by the binary numbers in which all bits apart from the bits in the group in question are 0.
7. The method as claimed in claim 3, wherein coefficient sets of the polynomials mi(j)(x) required for the possible values of Ni(j) are stored in a memory, having the following step:
reading the coefficient sets of the polynomials mi(j)(x) for the split
N
\u2032
=
\u2211
j
=
1
k
\u2032
\u2062
\u2062
N
i
\u2061
(
j
)
\u2003from the memory.
8. The method as claimed in claim 1, wherein the final state, comprising n bits and iterated N times, is used as initialization state for generating a pseudo noise sequence shifted through N bits.
9. The method as claimed in claim 1, comprising the following step, which is to be performed after step b):
c) writing the final state, comprising n bits and iterated N times, as initialization state into a shift register, comprising n shift register cells, with external function circuitry which is defined by the characteristic polynomial f(x).
10. The method as claimed in claim 9, wherein the shift register is also provided with tap circuitry which can be controlled by the tap mask, and wherein this tap mask is used, when step b) is performed, to produce the state comprising n bits and iterated N\u2032 times.
11. The method as claimed in claim 1, wherein the method is used in CDMA transmission systems using the transmission standards UMTS or IS-95.
12. The method as claimed in claim 11, wherein the method is used to produce the scrambling codes defined in the UMTS standard.
13. The method as claimed in claim 11, wherein a prescribed code number stipulates the offset for a spreading sequence, with the final state, comprising n bits and iterated N times, being used as initialization state for producing the spreading sequence associated with the code number N.
14. The method as claimed in claim 12, wherein a prescribed code number stipulates the offset for a spreading sequence, with the final state, comprising n bits and iterated N times, being used as initialization state for producing the spreading sequence associated with the code number N.
15. A device for producing a spreading sequence with an offset of N bits in a CDMA transmission system, the device configured to determine a final state, comprising n bits and iterated N times, for a shift register arrangement from a given initial state, comprising n bits, for the shift register arrangement, the iteration rule for the shift register arrangement being given by the characteristic polynomial
f(x)=1+c1\xb7x+c2\xb7x2+. . . +cn\u22121\xb7xn\u22121+xn
\u2003with c1, c2, . . . , cn\u22121 \u03b5 {0; 1}, the device comprising:
a means for determining a tap mask which is characteristic of N\u2032 shift register operations in this shift register arrangement, where N\u2032 is a whole number and 0<N\u2032\u2266N; and
a means for performing n shift register operations, as a result of which the tap mask is used for each shift register operation to obtain one bit from the n bits of an N\u2032-fold iterated state of the shift register arrangement,
wherein the means for determining a tap mask which is characteristic of N\u2032 shift register operations comprises:
a means for calculating a split for N\u2032 on the basis of
N
\u2032
=
\u2211
j
=
1
k
\u2032
\u2062
\u2062
N
i
\u2061
(
j
)
\u2003and
a means for determining the tap mask which is characteristic of N\u2032 shift register operations using K\u2032 tap masks mi(j)(x), where j=1, . . . , k\u2032, each of the k\u2032 tap masks mi(j)(x) being characteristic of the respective Ni(j) shift register operations,
wherein the device is used in CDMA transmission systems in order to produce a spreading sequence with an offset of N bits.
16. The device as claimed in claim 15, wherein the tap mask is defined by the polynomial
m(x)=xN\u2032modf
\u2003in the form
m(x)=m0+m1\xb7x+m2\xb7x2+. . . +mn\u22121\xb7xn\u22121
with the coefficient set m0, m1, . . . , mn\u22121 \u03b5 {0; 1}, where
the i-th cell of the shift register arrangement is tapped off at the precise instant when mi=1, and
for each shift register operation a modulo two addition is performed for the bits which have been tapped off.
17. The device as claimed in claim 16, wherein the device further comprises a memory, which stores the coefficient sets for a plurality of tap masks, which are characteristic of Ni shift register operations, for the characteristic polynomials mi(x), where mi(x)=xNimod f.
18. The device as claimed in claim 17, wherein the means for determining a tap mask which is characteristic of N\u2032 shift register operations comprises:
a means for calculating a split for N into a sum comprising k whole numbers
N
=
\u2211
i
=
1
k
\u2062
N
i
,
where
\u2062
\u2062
k
>
1
,
\u2003a means for producing addresses for reading the coefficient sets for the characteristic polynomials mi(j)(x) of the split
N
\u2032
=
\u2211
j
=
1
K
\u2032
\u2062
N
i
\u2061
(
j
)
\u2062
\u2062
where
\u2062
\u2062
k
\u2032
<
k
\u2062
\u2062
if
\u2062
\u2062
N
\u2032
<
N
.
19. The device as claimed in claim 17, wherein the device further comprises a further shift register, comprising n shift register cells, with external function circuitry defined by the characteristic polynomial f(x), into which the n-bit final state of the shift register arrangement is written as initialization state.
20. The device as claimed in claim 15, wherein the means for determining a tap mask which is characteristic of N\u2032 shift register operations in the shift register arrangement and the means for performing n shift register operations using the tap mask are produced in form of a processor.
21. The device as claimed in claim 15, wherein the means for determining a tap mask which is characteristic of N\u2032 shift register operations in the shift register arrangement is produced in the form of a processor, and wherein the means for performing n shift register operations using the tap mask is produced in the form of a shift register, comprising n shift register cells, with external function circuitry defined by the characteristic polynomial f(x) and tap circuitry which can be controlled by the calculated tap mask.
22. The device as claim in claim 15, wherein the CDMA transmission system is a CDMA transmission system in line with one of the transmission standards UMTS and IS-95.
23. The device as claimed in claim 22, wherein a prescribed code number N stipulates the offset for a spreading sequence, where the final state, comprising n bits and iterated N times, is used as initialization state for producing the spreading sequence associated with the code number N.
24. A method for determining a final state, comprising n bits and iterated N times, for a shift register arrangement from a given initial state, comprising n bits, for the shift register arrangement, the iteration rule for the shift register arrangement being given by the characteristic polynomial
f(x)=1+c1\xb7x+c2\xb7x2+. . . +cn\u22121\xb7xn\u22121+xn
\u2003with c1, c2, . . . , cn\u22121 \u03b5 {0; 1}, where a shift register arrangement state change which corresponds to a number N\u2032 of shift register operations, where 0<N\u2032\u2266N, is calculated by:
a) determining a tap mask which is characteristic of N\u2032 shift register operations;
b) performing n shift register operations, as a result of which the tap mask is used for each shift register operation to obtain one bit from n bits of an N\u2032-fold iterated state of the shift register arrangement, wherein step a) comprises:
splitting N\u2032 on the basis of
N
\u2032
=
\u2211
j
=
1
k
\u2032
\u2062
N
i
\u2061
(
j
)
;
\u2003and
determining the tap mask which is characteristic of N\u2032 shift register operations using k\u2032 tap masks mi(j)(x), where j=1, . . . , k\u2032, each of the k\u2032 tap masks mi(j)(x) being characteristic of the respective Ni(j) shift register operations; and
c) producing the final state in the shift register,
wherein the method is used in CDMA transmission systems in order to produce a spreading sequence with an offset of N bits.