1. A mobile station for wirelessly transmitting to a base station by DS-CDMA a signal which is spread by multiplying a spreading code, comprising:
a chip-pattern generating unit which generates one or a plurality of predetermined chip patterns by chip repeating to a spreading chip sequence for a predetermined number of repetitions, thereby generating a signal comprising said predetermined chip pattern;
a multiplying unit which multiplies, to the signal comprising said predetermined chip pattern, one or a plurality of phases specific to said mobile station;
a transmission timing control unit which controls transmitting timings of transmitting signals so that timings of receiving at the base station from respective mobile stations coincide; and
a timing control switching unit which, when receiving a set of controlling information indicating a cell environment, selects, based on said cell environment, one of the low-precision timing control unit and a high-precision transmission control unit which controls transmitting timings of transmitting signals so that a time difference at the base station among timings of receiving from the mobile station approaches zero,
wherein said transmission timing control unit comprises a low-precision timing control unit which controls said transmitting timings of the transmitting signals so as to contain time differences among the timings of receiving at the base station from the respective mobile stations.
2. The mobile station as claimed in claim 1, wherein said chip-pattern generating unit, in accordance with a data rate specified by the mobile station, assigns to the mobile station at least one of one or a plurality of said chip patterns and one or a plurality of said phases.
3. The mobile station as claimed in claim 1, wherein the multiplying unit multiplies, to the signal comprising said predetermined chip pattern, one or a plurality of phase sequences specific to said mobile station.
4. The mobile station as claimed in claim 1, further comprising:
a variable controlling unit which variably controls at least one of a spreading factor of said spreading code and the number of chip repetitions, a scrambling code which is multiplied to the spreading chip sequence, and the phase sequence specific to the mobile station; and
an external controlling unit which controls, based on a set of controlling information, at least one of said spreading factor and number of chip repetitions, said scrambling code, and the phase sequence specific to the mobile station.
5. The mobile station as claimed in claim 1, further comprising a multiplexing unit which multiplexes a plurality of channels which are multiplied, when chip repeating for the predetermined number of repetitions, by different spreading codes, said mobile station chip repeating after said multiplexing.
6. The mobile station as claimed in claim 1, wherein said transmission timing control unit comprises a path-based timing control unit which performs, based on first paths, the transmission timing control so that said first paths are received at the base station at an identical timing.
7. The mobile station as claimed in claim 1, further comprising a guard interval inserting unit which inserts a guard interval per chip pattern to which the chip repetition is performed for the predetermined number of repetitions.
8. The mobile station as claimed in claim 1, further comprising a chip pattern length setting unit which sets, based on time difference at the base station of timings of receiving from respective mobile stations, length of chip pattern to which the chip repetition is performed for the predetermined number of repetitions.
9. The mobile station as claimed in claim 1, further comprising a pilot-signal transmitting unit which, after multiplexing to a transmitting signal a pilot signal having known amplitude and phase, performs said chip repetition.
10. A computer readable medium having stored therein a program for wireless transmission and for implementation into a mobile station which wirelessly transmits to a base station by DS-CDMA a signal which is spread by multiplying a spreading code, said program comprising:
a chip-pattern generating function of generating a predetermined chip pattern by chip repeating to a spreading chip sequence for a predetermined number of repetitions;
a multiplying function of multiplying, to the signal comprising said predetermined chip pattern, a phase specific to said mobile station;
a function of controlling transmission timings of transmitting signals so as to contain time differences at the base station among timings received from the mobile stations to within a predetermined time difference; and
a timing control switching function of, when receiving a set of controlling information indicating a cell environment, selecting, based on said cell environment, one of the low-precision timing control unit and a high-precision transmission control unit which controls transmitting timings of transmitting signals so that a time difference at the base station among timings of receiving from the mobile station approaches zero.
11. A method of wireless transmission, wherein a mobile station which wirelessly transmits to a base station by DS-CDMA a signal which is spread by multiplying a spreading code, the method comprising:
a chip-pattern generating step of generating a predetermined chip pattern by chip repeating to a spreading chip sequence for a predetermined number of repetitions;
a multiplying step of multiplying, to a signal comprising said predetermined chip pattern, a phase specific to said mobile station;
a step of controlling transmission timings of transmitting signals so as to contain time differences at the base station among timings received from the mobile stations to within a predetermined time difference; and
a timing control switching step of, when receiving a set of controlling information indicating a cell environment, selecting, based on said cell environment, one of the low-precision timing control unit and a high-precision transmission control unit which controls transmitting timings of transmitting signals so that a time difference at the base station among timings of receiving from the mobile station approaches zero.
12. The method of wireless transmission as claimed in claim 11, wherein said chip-pattern generating step, in accordance with a data rate desired by the mobile station, assigns to the mobile station at least one of one or more of said chip patterns and one or more of said phase sequences.
13. The method of wireless transmission as claimed in claim 11, further comprising a controlling step performed by said mobile station of variably controlling at least one of a spreading factor of said spreading code and number of chip repetitions, a scrambling code which is multiplied to the spreading chip sequence, and a phase sequence which is specific to a mobile station.
14. The method of wireless transmission as claimed in claim 11, further comprising the step of controlling, performed by said mobile station which wirelessly transmits to a base station by DS-CDMA a signal which is spread by multiplying the spreading code, transmitting timings of transmitting signals so that time difference at the base station among timings received from respective mobile stations approaches zero.
15. The method of wireless transmission as claimed in claim 11, the method further comprising: a variable controlling step of variably controlling at least one of a
spreading factor of said spreading code and the number of chip repetitions, a scrambling code which is multiplied to the spreading chip sequence, and the phase sequence specific to the mobile station; and an external controlling step of controlling, based on a set of controlling information, at least one of said spreading factor and number of chip repetitions, said scrambling code, and the phase sequence specific to the mobile station.
16. The method of wireless transmission as claimed in claim 11, further comprising a multiplexing step of multiplexing a plurality of channels which are multiplied, when chip repeating for the predetermined number of repetitions, by different spreading codes, said mobile station chip repeating after said multiplexing.
17. The method of wireless transmission as claimed in claim 11, further comprising a guard interval inserting step of inserting a guard interval per chip pattern to which a chip is repeated for the predetermined number of repetitions.
18. The method of wireless transmission as claimed in claim 11, further comprising a chip pattern length setting step of setting, based on time difference at the base station of timings of receiving from respective mobile stations, length of chip pattern to which a chip is repeated for the predetermined number of repetitions.
19. The method of wireless transmission as claimed in claim 11, further comprising a pilot-signal transmitting step of, after multiplexing to a transmitting signal a pilot signal having known amplitude and phase, performing said chip repetition.
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 identifying a streak in a data set, the method comprising:
identifying, by a computing device, a plurality of patterns within the data set;
converting, by a computing device, the data set into a linear graph including a plurality of nodes, wherein each node is assigned an initial value based on one of the patterns identified within the data set;
merging, by a computing device, one node with at least one adjacent node, thereby forming a merged node having an increased value based on the values of the first node and the adjacent node; and
identifying, by a computing device, a streak based on the value of the merged node.
2. The method of claim 1, wherein the data set includes time series data.
3. The method of claim 1, wherein the data set includes binary data.
4. The method of claim 1, wherein the initial value of each node is based on a group of data points within the data set.
5. The method of claim 1, wherein the steps of merging and identifying are repeated until at least one streak condition is satisfied.
6. The method of claim 5, wherein the streak condition corresponds to at least one of threshold performance, streak size, or streak separation.
7. A system for identifying a streak in a data set, the system comprising:
a computing device configured to identify a plurality of patterns within the data set;
a computing device configured to convert the data set into a linear graph including a plurality of nodes, wherein each node is assigned an initial value based on one of the patterns identified within the data set;
a computing device configured to merge one node with at least one adjacent node, thereby forming a merged node having an increased value based on the values of the first node and the adjacent node; and
a computing device configured to identify a streak based on the value of the merged node.
8. The system of claim 7, wherein the data set includes time series data.
9. The system of claim 7, wherein the data set includes binary data.
10. The system of claim 7, wherein the initial value of each node is based on a group of data points within the data set.
11. The system of claim 7, wherein the steps of merging and identifying are repeated until at least one streak condition is satisfied.
12. The method of claim 11, wherein the streak condition corresponds to at least one of threshold performance, streak size, or streak separation.
13. Computer-readable code stored on a computer-readable medium that, when executed by a processor, performs a method for identifying a streak in a data set, the method comprising:
identifying, with a computing device, a plurality of patterns within the data set;
converting, with a computing device, the data set into a linear graph including a plurality of nodes, wherein each node is assigned an initial value based on one of the patterns identified within the data set;
merging, with a computing device, one node with at least one adjacent node, thereby forming a merged node having an increased value based on the values of the first node and the adjacent node; and
identifying, with a computing device, a streak based on the value of the merged node.
14. The computer-readable code of claim 13, wherein the data set includes time series data.
15. The computer-readable code of claim 13, wherein the data set includes binary data.
16. The computer-readable code of claim 13, wherein the initial value of each node is based on a group of data points within the data set.
17. The computer-readable code of claim 13, wherein the steps of merging and identifying are repeated until at least one streak condition is satisfied.
18. The computer-readable code of claim 17, wherein the streak condition corresponds to at least one of threshold performance, streak size, or streak separation.
19. A method for identifying performance regions in time-series data, the method comprising:
identifying, with a computing device, one or more streaks in the time-series data based on at least one streak parameter;
ranking, with a computing device, the identified streaks based on at least one characteristic of the identified streaks; and
predicting, with a computing device, a future occurrence of at least one streak based on the characteristics of the identified streaks.
20. The method of claim 19, wherein the streak parameters include a threshold performance parameter and a streak length parameter.
21. The method of claim 19, wherein the steps of identifying and ranking are carried out using at least one of a linear graph method, a statistical based approach, a curve-line intersection method, and a hypothesis-based method.
22. The method of claim 19, wherein the characteristic used in the step of ranking the identified streaks includes the variations of the values inside the streaks.
23. The method of claim 19, wherein the step of predicting the future occurrence of at least one streak comprises predicting at least one of how long a current streak will continue, when a current streak will end, and when a new streak will begin.
24. A system for identifying performance regions in time-series data, the system comprising:
a computing device configured to identify one or more streaks in the time-series data based on at least one streak parameter;
a computing device configured to configured to rank the identified streaks based on at least one characteristic of the identified streaks; and
a computing device configured to predict a future occurrence of at least one streak based on the characteristics of the identified streaks.
25. The system of claim 24, wherein the streak parameters include a threshold performance parameter and a streak length parameter.
26. The system of claim 24, wherein the computing devices configured to identify and rank are further configured to identify and rank using at least one of a linear graph method, a statistical based approach, a curve-line intersection method, and a hypothesis-based method.
27. The system of claim 24, wherein the characteristic used to rank the identified streaks includes the variations of the values inside the streaks.
28. The system of claim 24, wherein the computing device configured to predict is further configured to predict the future occurrence of at least one streak by predicting at least one of how long a current streak will continue, when a current streak will end, and when a new streak will begin.
29. Computer-readable code stored on a computer-readable medium that, when executed by a processor, performs a method for identifying performance regions in time-series data, the method comprising:
identifying, with a computing device, one or more streaks in the time-series data based on at least one streak parameter;
ranking, with a computing device, the identified streaks based on at least one characteristic of the identified streaks; and
predicting, with a computing device, a future occurrence of at least one streak based on the characteristics of the identified streaks.
30. The computer-readable code of claim 29, wherein the streak parameters include a threshold performance parameter and a streak length parameter.
31. The computer-readable code of claim 29, wherein the steps of identifying and ranking are carried out using at least one of a linear graph method, a statistical based approach, a curve-line intersection method, and a hypothesis-based method.
32. The computer-readable code of claim 29, wherein the characteristic used in the step of ranking the identified streaks includes the variations of the values inside the streaks.
33. The computer-readable code of claim 29, wherein the step of predicting the future occurrence of at least one streak comprises predicting at least one of how long a current streak will continue, when a current streak will end, and when a new streak will begin.