A method of generating a code sequence in a wireless communication system is disclosed. More specifically, the method includes recognizing a desired length of the code sequence, generating a code sequence having a length different from the desired length, and modifying the length of the generated code sequence to equal the desired length. Here, the step of modifying includes discarding at least one element of the generated code sequence or inserting at least one null element to the generated code sequence.
|
0. 4. A method for transmitting a synchronization channel signal by generating a code sequence in a wireless communication system, the method comprising:
generating a first code sequence having a first length by using a first variable, wherein the first code sequence is a Zadoff-Chu CAZAC sequence;
generating a second code sequence having a second length by using a second variable, wherein the first variable and the second variable are different from each other;
generating the code sequence as a combination of the first code sequence and the second code sequence;
shifting the code sequence such that either a rear portion of the code sequence moves to a start portion of the code sequence, or a front portion of the code sequence moves to an end portion of the code sequence;
channel coding the shifted code sequence using one or more of convolution coding, turbo coding, and/or low density parity check coding to generate a channel coded signal;
modulating the channel-coded signal to generate a modulated signal;
mapping the modulated signal onto OFDM subcarriers to generate a mapped signal; and
transmitting the mapped signal including the shifted code sequence as the synchronization channel signal,
wherein at least one of the first length and the second length is a prime number length, and a sum of the first length and the second length corresponds to a length of the synchronization channel signal,
wherein the combination of the first code sequence and the second code sequence, each of which is generated using the different variables, provides a receiving end device with information about a cell identification and a location of the synchronization channel signal within a radio frame, and
wherein the synchronization channel signal is usable for one or more of initial synchronization, cell search and/or channel estimation.
0. 1. A method for transmitting a synchronization channel (SCH) signal by generating a code sequence in a wireless communication system, the method comprising:
generating a first code sequence (C1) having a first length by using a first variable (M1);
generating a second code sequence (C2) having a second length by using a second variable (M2), wherein the M1 and the M2 are different from each other;
generating the code sequence as a combination of the first code sequence (C1) and the second code sequence (C2); and
transmitting the code sequence as the SCH signal,
wherein at least one of the first length and the second length is a prime number length, and the sum of the first length and the second length corresponds to a length of the SCH signal,
wherein the combination of the first code sequence (C1) and the second code sequence (C2), each of which is generated using the different variables, provides a receiving end device with information about a cell identification and a location of the SCH within a radio frame.
0. 2. An apparatus for transmitting a synchronization channel (SCH) signal by generating a code sequence in a wireless communication system, the apparatus comprising:
a code sequence generating module for generating a first code sequence (C1) having a first length by using a first variable (M1), generating a second code sequence (C2) having a second length by using a second variable (M2), wherein the M1 and the M2 are different from each other, and generating the code sequence as a combination of the first code sequence (C1) and the second code sequence (C2); and
a transmission module for transmitting the code sequence as the SCH signal,
wherein at least one of the first length and the second length is a prime number length, and the sum of the first length and the second length corresponds to a length of the SCH signal,
wherein the combination of the first code sequence (C1) and the second code sequence (C2), each of which is generated using the different variables, provides a receiving end device with information about a cell identification and a location of the SCH within a radio frame.
0. 3. A method for receiving a synchronization channel (SCH) signal by using a code sequence in a wireless communication system, the method comprising:
receiving the code sequence as the SCH signal in a form of a combination of a first code sequence (C1) having a first length, which has been generated by using a first variable (M1), and a second code sequence (C2) having a second length, which has been generated by using a second variable (M2), wherein the M1 and the M2 are different from each other; and
acquiring information about a cell identification and a location of the SCH within a radio frame via the combination of the first code sequence (C1) and the second code sequence (C2),
wherein at least one of the first length and the second length is a prime number length, and the sum of the first length and the second length corresponds to a length of the SCH signal.
0. 5. The method of claim 4, further comprising multiplexing the shifted code sequence with traffic data.
0. 6. The method of claim 4, wherein modulating the channel-coded signal comprises using a modulation from a set that includes quadrature phase shift keying or 16-quadriture amplitude modulation.
|
RM
According to Equation 3, the CAZAC sequence always has a size of 1, and the CAZAC sequence of Equation 4 has an auto-correlation function denoted by a delta function. Here, the auto-correlation is based on circular correlation. Further, Equation 5 is a cross-correlation which is constant if N is a prime number.
If the length to be applied in the wireless communication system for generating the CAZAC sequence is denoted by L, a method for generating the CAZAC sequence sets N of Equations 1 and 2 to equal L (N=L)—identified as step (1). Step (2) can be identified by a method where a value of N is set to be a prime number greater than a value of length L for generating the CAZAC sequence.
Referring to the characteristics of the generated CAZAC sequence having a specified length of L, if L is not a prime number, the generated CAZAC sequence can include M=1, 2,. . . L−1 number of codes, some of which are repeated codes. In other words, the number of different codes is less than L−1 number of codes. On the contrary, if L is a prime number, there is L−1 number of different codes. The above descriptions may also be applied to other types of code sequences and are not limited to Zadoff-Chu CAZAC sequence.
Further, the following technique has been considered. More specifically, if the length of code to be applied to the system is not a prime number, and there are a large number of codes to be used, a smallest prime number greater than L was selected. Using the selected prime number, the CAZAC sequence was generated, and discards or removes at least one element of the generated CAZAC sequence for use. This technique is different than the technique introduced with respect to step 1.
For example, assume that a number of codes of a CAZAC code sequence (N) is 1024. The following equation can be used to express an algorithm for generating a Zadoff-Chu CAZAC code.
In Equation 6, A and M are natural numbers, and index (A)(=0,1,2, . . . , Nseq_M−1) is an index of A in ascending order. In order to extend the CAZAC sequence where N=1024, a smallest prime number greater than 1024 is used. That is, the smallest prime number greater than 1024 is 1031. As such, the code sequence set aNseq_NxM where M=1031 is applied to Equation 6.
Since M (=1031) is a prime number, Nseq_M=1030. Furthermore, A can be referred to as a seed value used to generate a code sequence maintaining CAZAC properties. If M is a prime number, a total of M−1 number of code sequences can be generated. In other words, for example, if M=1024, a total of 512 (=1024/2 or N/2) number of code sequences are generated. However, if M=1031, a total of 1030 number of code sequences (M−1) are generated. Moreover, the cross-correlation properties of the generated code sequence are better if M is a prime number than a composite number.
In order to adjust or modify the CAZAC code sequence set aNseq_NxM where M=1031 to a code sequence seta a Nseq_NxM whose length is N=1024, M−N number of elements can be removed from index n=N, . . . , M−1, generating a code sequence set aNseq_NxN.
In determining the value of M, although the number of code sequences can increase with increase in value of N, it is preferable to determine the value of M based on the code sequence whose length is N that promotes maintenance of good correlation properties. In case of the CAZAC code, optimum correlation properties can be attained if the value of length M is the smallest prime number greater than the value of length N.
If the code sequence set aNseq_NxN generated using length N=1024 is compared with the code sequence set aNseq_NxN, a total number code sequences of the former can be represented by N/2 or 512 (=1024/2) code sequences having an index 0,1,2, . . . , N/2−1 (N=1024), and a total number of code sequences of the latter can be represented by M−1 or 1030 having an index 0,1,2, . . . , M−2 (M=1031).
Further,
As discussed, the codes in addition to the CAZAC code are available, such as the PN code and the Hadamard code. The discussion with respect to the CAZAC code sequence can also be applied to the PN code and the Hadamard code. With respect to the PN code, a modular shift register generator is used to generate the code sequences. If a number of shift registers generated is represented by N, a code sequence having a length of 2N−1 is generated. Thereafter, a value “1” is added to the shift register, resulting in a length 2N+1−1, and then, adjust the length to equal 2N.
With respect to the Hadamard codes, a number of code sequences, which equal the length of the code sequence, make up a code sequence. However, for example, if M number of code sequences having length N is required (M>N), then M number of code sequences having length M are generated, followed by removing a specified number of elements to make the length of the code sequence equal length N.
Assuming that the code sequence having poor auto-correlation and cross-correlation properties are removed, the remaining number of code sequences may be less than L−1.
In order to attain a desired length and a maximum number of CAZAC sequence types corresponding to the desired length, a smallest prime number, X, greater than the desired length, L, (X>L) can be selected. Although the CAZAC sequence can be generated using X due to deterioration of the correlation properties, the correlations properties of CAZAC sequence as shown in Equations 4 and 5 cannot be attained. Further, when selecting a length of the generated code sequence, the length that is nearest to the desired length L which is between a smallest prime number larger than the desired length or a largest prime number smaller than the desired length can be selected.
Referring to
Referring to
Discussions of above relate to the methods of generating the sequence using the desired length L, and of increasing transmitted control information using the circular shift. If these methods are applied in generating the sequence, the following processes take place. First, select a smallest prime number greater than L or a largest prime number less than L, which is referred to as X. Second, remove or add a sequence unit having a length corresponding to X-L or L-X. Third, apply the circular shift to the resulting sequence.
Referring to
Referring to
Between
Between
Further, according to the discussion above, the desired length L (or required length) is first recognized. As illustrated with respect to
For example, if the desired length L is 75, the value of the smallest prime number greater than 75 is 79, and the value of the largest prime number smaller than the 75 is 73. Here, the prime number 73 can be selected since 73 is closer to 75 than 79 is to 75.
Although the illustration above selects the prime number closest to the desired length L, selection regarding removal or addition of the element(s) is not limited to the example of above and other implementations may be applied.
Regarding padding, there are five (5) schemes by which padding can be accomplished. As a first padding scheme, the padding portion can be comprised of a constant number (e.g., 0s). Although the padding portion is used to fill the portion of the code sequence so that the length of the code sequence coincides with the desired length, it is possible for the padding portion to be less then completely full. In other words, it is possible for that the length of the code sequence with padded portion is not equal to or is shorter than the code sequence with the desired length. That is, when the code sequence is used for functions deemed less important, such as for cell search or random access, it is not necessary to use the entire length of the code sequence, and as such, the padding portion does not need to be completely occupied to correspond to the desired length of the code sequence.
As a second padding scheme, the padding portion can be comprised of a repeated portion. In other words, the portion corresponding to L-X of the code sequence 1204 can be duplicated and inserted/attached to the end of the code sequence 1204. This can be referred to as cyclic postfix. Here, the code sequence uses the entire length L. When determining the identification (ID) of the code sequence, the entire length L is used to facilitate identifying of the code sequence ID. At the same time, the generated code sequence does not experience distortion by using the entire length L. In the discussion above, the cyclic postfix is used. Alternatively, cyclic prefix can also be used.
As a third padding scheme, the padding portion can be comprised of additional information through which different messages can be delivered. More specifically, the desired length L of the code sequence can be used to generate a supplemental code sequence whose length equals the desired length L (N=L). The code sequence portion corresponding to L-X is extracted from the supplemental code sequence and inserted/attached to the generated code sequence as the padded portion.
As a fourth padding scheme, a portion corresponding to length L-X is extracted from the code sequence and inserted as the padding portion. Here, the code sequence inserted to the padding portion may be a different code sequence than the code sequence 1204. Put differently, the code sequence inserted to the padding portion may be a CAZAC sequence having a length of M, for example, which is different from the code sequence 1204 having a length of L. Further, the code sequence inserted to the padding portion can be a different code sequence other than the CAZAC sequence. By using different code sequence, additional information can be delivered including information related to type of code sequence adjustments.
As a fifth padding scheme, the padding portion can be used as lower bandwidth guard interval. During transmission of control information using a prescribed sequence, the following possible scenarios can occur such as transmitting data without establishing synchronization with an access channel, transmitting data by a plurality of users within a communication system, and distortion of frequency of the received data.
Furthermore, the padding portions can be placed at both ends of the code sequence to use the padding portions as guard intervals of the lower bandwidth. Consequently, a more reliable acquisition of control information from the received data can take place despite distorted frequency signals. In the padding portions used as guard intervals, constant numbers (e.g., 0s) can be used or cyclic prefix or postfix of the generated code sequence can be used.
If the padding portions are placed at both ends of the code sequence and used as guard intervals of the lower bandwidth, the code sequences can be protected from frequency signal distortions. Moreover, if 0s are inserted between the guard intervals or put differently, within the code sequence, interference to neighboring codes can be reduced. Alternatively, if cyclic prefix/postfix is used as guard intervals, the code sequences can be protected from frequency distortions and can be used to transmit the control information containing the sequence ID if there is no frequency distortion.
In the discussions above, five (5) padding schemes are introduced. However, the padding schemes are not limited to the discussed schemes, and there can be other types of padding schemes.
Besides the first padding scheme in which no information is inserted, the other four padding schemes insert additional information in the padding portions to allow expansion of the code sequence and/or transmission of message(s). Various information can be inserted into the padding portion including, for example, initial access information, timing update information, resource request information, user ID information, channel quality information (CQI), user group ID information related to a random access channel (RACH). Furthermore, the information can include cell ID information, multi-input multi-output (MIMO) information, and synchronization channel information of a synchronization channel (SCH), for example. In addition, the padding portion can be used for transmitting data for message transmission as well as arbitrary information using a code sequence having a length of L-X.
Referring to
The code sequence that can be selected by the sequence selection unit 1602 has a length of L as illustrated in
Although it is preferable to use length X which is a smallest prime number greater than the length of L or a largest prime number smaller than the length of L, as long as the value of length X is a prime number, different or other prime numbers can be used as the value of length X.
The code sequence length adjustment unit 1702 further comprises a control unit 1702a, a code sequence removing unit 1702b, and a padding unit 1702c. More specifically, the control unit 1702a receives C2 as well as the value of length L. The control unit 1702a determines whether to remove a portion/section of C2 or insert/add a portion/section to C2. Based on the determination from the control unit 1702a, C2 is delivered to the sequence removing unit 1702b in which a portion/section of C2 corresponding to a length of X-L is removed. Alternatively, C2 can be delivered to the padding unit 1702c for inserting/adding a portion/section of C2 whose length corresponds to the length of L-X.
If C2 and the value of length L are provided to the control unit 1702a, the control unit 1702a compares the value of length X which identifies the length of C2 with the value of the length L. Here, if X is greater than L, then C2 is inputted into the sequence removing unit 1702b. From C2, the portion length of C2 corresponding to length X-L is removed, resulting in C3. However, if X is less than L, then C2 is inputted into the padding unit 1702c. From C2, the padding portion length corresponding to length L-X is inserted/added to C2, resulting in C4. Here, the padding portion can be inserted to either end or both ends of C2.
Referring to
In
However, regarding a code sequence generated with a padding portion with cyclic prefix/postfix attached thereto, there is no need to power boost since all of the code sequences corresponding to length L are used for acquiring sequence ID information.
In the receiving end, information related to the generated code sequence and length X used to generate the code sequence is received. From the code sequence, a portion corresponding to length X is processed to acquire the control information. To this end, it is important to first receive synchronization information of the received data. Equation 7 and Equation 8 can be used to acquire synchronization information. Here, Equation 7 relates to auto-correlation, and Equation 8 relates to cross-correlation.
Equation 7 is used to acquire auto-correlation value(s) from the received code sequence whose sequence ID is M. Further, the acquired auto-correlation value d, which is a value other than 0, is used to achieve synchronization.
Equation 8 is used to acquire cross-correlation value(s) of a code sequence whose ID is M2 from the received code sequence whose sequence ID is M1. Through the acquired value, synchronization can be achieved.
Typically, if the wireless communication system is a synchronous network, auto-correlation is used to acquire synchronization information, and if the system is an asynchronous network, cross-correlation is used to acquire synchronization information. However, according to the embodiments of the present invention, synchronization information can be acquired using any one or at least one of the correlation schemes.
After the synchronization information of the received code sequence is acquired, the receiving end analyzes the received code sequence to acquire the sequence ID, as shown in Equations 9 and 10.
σc(k;M,X)=c(k+1;M,X)·c*(k;M,X)(for k=0,1, . . . , L−1) [Equation 9]
σc(k;M,X)=c(k+1;M,X)·c*(k;M,X)(for k=0,1, . . . , X−1) [Equation 10]
In Equations 9 and 10, σc(k; M,X) denotes difference sequence of the received sequences. Equation 9 is used to acquire the ID information of the received sequence using the differential sequence corresponding to the total length of the received sequence. Equation 9 can also be used to acquire the ID information of the code sequence which has been generated with the cyclic prefix/postfix padded portion. Equation 10 is used to acquire the ID information of the received sequence using the smallest prime number corresponding to length X.
As discussed, if the differential sequence of the CAZAC sequence is calculated using Equations 9 or 10, k of the sequence index is generated, and the result therefrom is transformed by the Fourier transform scheme, to show a single peak value. Thereafter, by detecting the peak value, the ID information of the sequence can be acquired.
The discussion of above regarding a code sequence or a code sequence set can be applied to 3rd Generation Partnership Project (3GPP) system or 3GPP2 system as well as a Wibro system or a Wimax system.—
It will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from the spirit or scope of the inventions. Thus, it is intended that the present invention covers the modifications and variations of this invention provided they come within the scope of the appended claims and their equivalents.
Han, Seung Hee, Kwon, Yeong Hyeon, Noh, Min Seok, Lee, Hyun Woo, Kim, Dong Cheol, Park, Hyun Hwa
Patent | Priority | Assignee | Title |
Patent | Priority | Assignee | Title |
4621173, | Jun 14 1982 | PHILIPS COMMUNICATION D ENTREPRISE | Method of reducing the convergence time of an echo canceller and apparatus for carrying out said method |
5311176, | Mar 31 1992 | Motorola, Inc.; MOTOROLA, INC A CORPORATION OF DELAWARE | Method and apparatus for generating Walsh codes |
5363144, | Apr 16 1992 | GOLDSTAR CO , LTD | Television ghost canceling device |
5479444, | Mar 09 1993 | Nokia Mobile Phones LTD | Training sequence in digital cellular radio telephone system |
5553153, | Feb 10 1993 | NOISE CANCELLATION TECHNOLOGIES, INC | Method and system for on-line system identification |
6161160, | Sep 03 1998 | GLOBALFOUNDRIES Inc | Network interface device architecture for storing transmit and receive data in a random access buffer memory across independent clock domains |
6175559, | Jul 07 1999 | Google Technology Holdings LLC | Method for generating preamble sequences in a code division multiple access system |
6374080, | Jun 17 1999 | Mitsubishi Denki Kabushiki Kaisha | Mobile communication system |
6667708, | Dec 28 2001 | Google Technology Holdings LLC | Method and system for a programmable code generator |
6731673, | Feb 19 1999 | WSOU Investments, LLC | Synchronization channel with cyclic hierarchical sequences and method for cell site search with low detector complexity |
6944453, | Mar 06 2000 | Siemens Aktiengesellschaft | Method for controlling an intersystem link transfer |
7027444, | Nov 21 2000 | SAMSUNG ELECTRONICS CO , LTD | Apparatus and method for generating a preamble sequence in a wireless communication system |
7047009, | Dec 05 2003 | Qualcomm Incorporated | Base station based methods and apparatus for supporting break before make handoffs in a multi-carrier system |
7292641, | Jul 15 2003 | Qualcomm Incorporated | Apparatus and method for transmitting/receiving preamble sequence in orthogonal frequency division multiplexing communication system using plurality of transmission antennas |
7321645, | Aug 29 2003 | WSOU Investments, LLC | Method and arrangement for detecting a random access channel preamble using multiple antenna reception in a communication system |
7400573, | Apr 29 2003 | Intel Corporation | Dynamic allocation of cyclic extension in orthogonal frequency division multiplexing systems |
7417970, | Jun 02 2004 | InterDigital Technology Corporation | Configuring an interworking wireless local area network user equipment to access a 3GPP system |
7424067, | Oct 21 2002 | STMICROELECTRONICS N V | Methods and apparatus for synchronization of training sequences |
7426175, | Mar 30 2004 | Google Technology Holdings LLC | Method and apparatus for pilot signal transmission |
7433418, | Sep 28 2001 | Apple Inc | Method and apparatus for efficient storage of training sequences for peak to average power constrained modulation formats |
7447504, | Jul 25 2005 | Panasonic Intellectual Property Corporation of America | HARQ process restriction and transmission of non-scheduled control data via uplink channels |
7496113, | Aug 16 2004 | ZTE USA INC | Fast cell search and accurate synchronization in wireless communications |
7508792, | Sep 23 2003 | Panasonic Intellectual Property Corporation of America | Protocol context transfer in a mobile communication system |
7570618, | Nov 07 2003 | Samsung Electronics Co., Ltd. | System and method for performing handover in a broadband wireless access communication system |
7580400, | Nov 21 2003 | Samsung Electronics Co., Ltd | Apparatus and method for generating preamble signal for cell identification in an orthogonal frequency division multiplexing system |
7590183, | May 12 2005 | Qualcomm Incorporated | Generating signals for transmission of information |
7593732, | Jun 15 2004 | Nokia Technologies Oy | System and method for supporting soft handover in a broadband wireless access communication system |
7599327, | Jun 24 2004 | Google Technology Holdings LLC | Method and apparatus for accessing a wireless communication system |
7623439, | May 20 2004 | Intellectual Ventures I LLC | Cyclic diversity systems and methods |
7664076, | Dec 13 2004 | Electronics and Telecommunications Research Institute | Random access apparatus and method |
7675841, | Nov 19 2003 | Samsung Electronics Co., Ltd | Apparatus and method for generating a preamble sequence in an orthogonal frequency division multiplexing communication system |
7693517, | Aug 10 2004 | NEXTEL COMMUNICATIONS, INC | System and method for handoff between base stations |
7693924, | Nov 03 2004 | Electronics and Telecommunications Research Institute | 2N-point and N-point FFT/IFFT dual mode processor |
7701919, | May 01 2006 | WSOU Investments, LLC | Method of assigning uplink reference signals, and transmitter and receiver thereof |
7702028, | Oct 16 2003 | Samsung Electronics Co., Ltd. | Method of transmitting preamble for synchronization in a MIMO-OFDM communication system |
7746916, | Nov 28 2005 | EVOLVED WIRELESS LLC | Method and apparatus for generating and transmitting code sequence in a wireless communication system |
7961696, | Jun 24 2004 | Apple Inc | Preambles in OFDMA system |
7995967, | Mar 09 2004 | Neo Wireless LLC | Methods and apparatus for random access in multi-carrier communication systems |
8000305, | Jan 17 2006 | Google Technology Holdings LLC | Preamble sequencing for random access channel in a communication system |
8036256, | Nov 28 2005 | EVOLVED WIRELESS LLC | Method and apparatus for generating and transmitting code sequence in a wireless communication system |
8098745, | Mar 27 2006 | Texas Instruments Incorporated | Random access structure for wireless networks |
8116195, | Jul 27 2004 | ZTE USA INC | Transmission and reception of reference preamble signals in OFDMA or OFDM communication systems |
8121045, | Mar 21 2008 | Malikie Innovations Limited | Channel quality indicator transmission timing with discontinuous reception |
8131295, | Jun 20 2006 | InterDigital Technology Corporation | Methods and system for performing handover in a wireless communication system |
8180058, | Jun 21 2007 | Qualcomm, Incorporated | Encryption of the scheduled uplink message in random access procedure |
8199730, | Aug 07 2008 | Innovative Sonic Limited | Method and apparatus for handling uplink grant |
8340232, | Dec 09 2005 | Samsung Electronics Co., Ltd. | Apparatus and method for channel estimation using training signals with reduced signal overhead |
8448037, | Dec 20 2007 | CLUSTER, LLC; Optis Wireless Technology, LLC | Prescheduled retransmission for initial establishment |
8977258, | Sep 09 2005 | Intel Corporation | System and method for communicating with fixed and mobile subscriber stations in broadband wireless access networks |
9094202, | Aug 08 2008 | Qualcomm Incorporated | Utilizing HARQ for uplink grants received in wireless communications |
9204468, | Nov 05 2007 | TELEFONAKTIEBOLAGET LM ERICSSON PUBL | Timing alignment in an LTE system |
20020089957, | |||
20030043887, | |||
20030156624, | |||
20040032917, | |||
20040047284, | |||
20040170157, | |||
20050036481, | |||
20050041573, | |||
20050047325, | |||
20050084030, | |||
20050226140, | |||
20050226142, | |||
20050259567, | |||
20060018336, | |||
20060050799, | |||
20060126570, | |||
20060274843, | |||
20070058595, | |||
20070110172, | |||
20070253465, | |||
20070270273, | |||
20070291696, | |||
20070291708, | |||
20090163211, | |||
20090252260, | |||
CN1437416, | |||
CN1596020, | |||
CN1674467, | |||
EP1065855, | |||
EP1404079, | |||
EP1469697, | |||
EP1473838, | |||
EP1787414, | |||
EP179497151, | |||
JP2000354021, | |||
JP2001308823, | |||
JP2002077105, | |||
JP2003318704, | |||
JP2008511253, | |||
JP4463458, | |||
KR10062668, | |||
KR1020060066595, | |||
KR1020070055845, | |||
KR1020070103917, | |||
KR1020080004025, | |||
RU2242819, | |||
RU2258306, | |||
TW222790, | |||
TW576034, | |||
WO113531, | |||
WO141471, | |||
WO2101962, | |||
WO2003049295, | |||
WO2003075500, | |||
WO2004030392, | |||
WO2005043791, | |||
WO2005088882, | |||
WO2005104412, | |||
WO2006023423, | |||
WO2006023536, | |||
WO2007082409, | |||
WO2007138453, | |||
WO9605668, |
Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
Apr 01 2015 | EVOLVED WIRELESS LLC | (assignment on the face of the patent) | / |
Date | Maintenance Fee Events |
Dec 18 2018 | M1552: Payment of Maintenance Fee, 8th Year, Large Entity. |
Apr 10 2023 | M1553: Payment of Maintenance Fee, 12th Year, Large Entity. |
Date | Maintenance Schedule |
Dec 19 2020 | 4 years fee payment window open |
Jun 19 2021 | 6 months grace period start (w surcharge) |
Dec 19 2021 | patent expiry (for year 4) |
Dec 19 2023 | 2 years to revive unintentionally abandoned end. (for year 4) |
Dec 19 2024 | 8 years fee payment window open |
Jun 19 2025 | 6 months grace period start (w surcharge) |
Dec 19 2025 | patent expiry (for year 8) |
Dec 19 2027 | 2 years to revive unintentionally abandoned end. (for year 8) |
Dec 19 2028 | 12 years fee payment window open |
Jun 19 2029 | 6 months grace period start (w surcharge) |
Dec 19 2029 | patent expiry (for year 12) |
Dec 19 2031 | 2 years to revive unintentionally abandoned end. (for year 12) |