Method of assigning a spreading sequence to a user of a telecommunications network

• US 6,987,747 B1
• Filed: 07/24/2000
• Issued: 01/17/2006
• Est. Priority Date: 09/13/1999
• Status: Expired due to Fees

• Current Assignee: Mitsubishi Denki Kabushiki Kaisha (Mitsubishi Electric Corporation)
• Original Assignee: Mitsubishi Denki Kabushiki Kaisha (Mitsubishi Electric Corporation)
• Inventors: Mottier, David, Castelain, Damien
• Primary Examiner(s): Patel, Ajit
• Assistant Examiner(s): SHAH, CHIRAG G
• Application Number:
  US09/624,857
• Time in Patent Office: 2,003 Days
• Field of Search: 370/329, 370/331, 370/335, 370/341, 370/342, 370/441, 375/130, 375/134, 455/450
• US Class Current: 370/335
• CPC Class Codes: H04J 13/16 Code allocation
• CPC Class Codes: H04L 5/026 using code division

Abstract

An apparatus and method for a Multi-Carrier Code Division Multiple Access (“MC-CDMA”) transmission network is disclosed. In the MC-CDMA transmission network a plurality of spreading sequences are assigned to individual users from a plurality of predetermined spreading sequences. The spreading sequences are assigned to users in order to minimize the interference created by the assignment of spreading sequences.

Claims

1. Method of assigning one or more spreading sequences among a family of spreading sequences to a user of a Multi-Carrier Code Division Multiple Access transmission network, each element of said sequence being, at the level of a transmitter of said network, multiplied by a data item to be transmitted and then transmitted on a corresponding sub-carrier, comprising:

assigning, to said user, said one or more spreading sequences; and

minimizing a function representing the interference between said one or more sequences, on the one hand, and spreading sequences of a predetermined set, on the other hand, said predetermined set being included in said family of spreading sequences;

wherein the minimizing function dynamically selects the best sequences from the predetermined set of spreading sequences in the family of spreading sequences as the number of needed sequences changes, and the number of selected sequences is less than or equal to the total number of spreading sequences.

2. A method according to claim 1 wherein the predetermined set of spreading sequences includes the set of sequences which are used by the network at the instant of assigning.

3. A method according to claim 1 wherein the predetermined set of spreading sequences includes the set of sequences which are potentially usable after the instant of assigning.

4. A method according to claim 1 wherein said set of spreading sequences includes a favored set of spreading sequences.

5. A method according to claim 1 which further includes allocating, from among all the spreading sequences available at the instant of the assigning, the spreading sequence c⁽ⁱ⁾ which minimizes a function J^(i,Ω

^k) representing the interference between the spreading sequence c⁽ⁱ⁾ and the spreading sequences of the predetermined or given set, the sequence of rank i thus being assigned if this rank i verifies the following relationship;

$i=\underset{j}{\arg }<br><br><br><br>\underset{j\in <br><br>{\mathrm{\Omega <br><br>}}_j,j\notin <br><br>{\mathrm{\Omega <br><br>}}_k}{\min }<br><br>\left[J^{\left(j,{\mathrm{\Omega <br><br>}}_k\right)}\right]$

where Ω

_k is the set of the indices of the sequences of the predetermined or given set and Ω

_j is the set of the indices of the available sequences.

6. A method according to claim 1 wherein each user is assigned a spreading sequence so as to take into account the transmission quality envisaged for the spreading sequence.

7. A method according to claim 6, wherein the user is assigned a spreading sequence c⁽ⁱ⁾ which minimizes the cost function J^(i,Ω

^k) with the spreading sequences c^(k) of a predetermined or given set of sequences of index k belonging to a set Ω

_k, to a user desiring an average transmission quality, the spreading sequence c⁽ⁱ⁾ which gives an average value to the cost function J<sup>(i,Ω

k)</sup> with the spreading sequences c^(k) of a predetermined or given set of sequences of index k belonging to a set Ω

_k, and to a user whose transmission quality can be a minimum, a spreading sequence c⁽ⁱ⁾.

8. A method according to claim 5, characterized in that the cost function J^(i,Ω

^k) representing the interference between the spreading sequence c⁽ⁱ⁾ and sequences c^(k) of indices k belonging to a set Ω

_k, is defined as being equal to the maximum value taken by a function D^(j,k) representing the degradation of the transmission which is induced as a result of the interference between the spreading sequence c^(j) and the spreading sequence c^(k);

$J^{\left(j,{\mathrm{\Omega <br><br>}}_k\right)}=\underset{k\in <br><br>{\mathrm{\Omega <br><br>}}_k}{\max }<br><br>D^{\left(j,k\right)}.$

9. A method according to claim 5 wherein the cost function J^(j,Ω

^k) representing the interference between the spreading sequence c^(j) and K sequences c^(k) of indices k belonging to a set Ω

_k, is defined as being equal to the average of the values taken by a function D^(j,k) representing the degradation of the transmission which is induced as a result of the interference between the spreading sequence c^(j) and the sequence c^(k);

$J^{\left(j,{\mathrm{\Omega <br><br>}}_k\right)}=\frac{1}{K}<br><br>\underset{k\in <br><br>{\mathrm{\Omega <br><br>}}_k}{\sum <br><br>}<br><br>D^{\left(j,k\right)}.$

10. A method according to claim 8 wherein the degradation function D^(j,k) is defined as follows:

$D^{\left(j,k\right)}=E<br><br>\left[{\left(\underset{m=1}{\overset{M}{\sum <br><br>}}<br><br>h_m^{\mathrm{\prime <br><br>}<br><br>\left(j\right)}<br><br>c_m^{\left(j\right)}<br><br>c_m^{\left(k\right)}\right)}^2\right]<br><br><br><br>\mathrm{or}<br><br><br><br>D^{\left(j,k\right)}=E<br><br>\left[{\left(\underset{m=1}{\overset{M}{\sum <br><br>}}<br><br>h_m^{\mathrm{\prime <br><br>}<br><br>\left(k\right)}<br><br>c_m^{\left(j\right)}<br><br>c_m^{\left(k\right)}\right)}^2\right]$

where E is the mathematical expectation, M the number of sub-carriers used in the MC-CDMA transmission system and h′

_m^(j) is the apparent response of the transmission channel in view of an equalization process implemented in the receiver, the response for the frequency of the sub-carrier of rank m and for the receiver of the user of the sequence of rank j.

11. A method according to claim 8 wherein the degradation function D^(j,k) represents the small size of the high-frequency components of a sequence X^(j,k) of N elements resulting from the element-by-element product of the sequence c^(j) and the sequence c^(k).

12. A method according to claim to claim 11 wherein the value of the degradation function D^(j,k) is given by the application of a Fourier transform to the sequence X^(j,k) of N elements resulting from the element-by-element product of the sequence c^(j) and the sequence c^(k).

13. A method according to claim 11 wherein the value of the degradation function D^(j,k) is given by the number of {+1,−

1} and {+1,−

1} transitions appearing in the sequence X^(j,k) of N elements resulting from the element-by-element product of the sequence c^(j) and the sequence c^(k).

14. A method according to claim to claim 1 wherein the method is implemented dynamically and includes re-assigning during transmission, at predetermined instants, the K-Q sequences still necessary for the different transmissions, K being the number of spreading sequences used previously before Q sequences from among K(Q<

K) were made available.

15. A method according to claim 14 which further includes;

calculating the cost functions J<sup>(j,Ω

k)</sup> for any spreading sequence c^(j) where j belongs to the set Ω

_Q of the indices of the sequences made available,

calculating the cost functions J<sup>(j,Ω

k)</sup> for any spreading sequence c^(k) where k belongs to the set Ω

_K-Q of the indices of the sequences still used,

as long as there exists one or more spreading sequences of index j₀ε

Ω

_Q and one or more spreading sequences of index k₀ε

Ω

_K-Q such that J<sup>(j0,Ω

k)</sup><

J<sup>(k0,Ω

k)</sup> de-allocating the sequence c^(kM) defined by;

$k_M=\underset{k}{\arg }<br><br><br><br>\underset{k\in <br><br>{\mathrm{\Omega <br><br>}}_{K-Q}}{\max }<br><br>\left[J^{\left(k,{\mathrm{\Omega <br><br>}}_k\right)}\right],$

and allocating instead the sequence c^(kM) defined by;

$k_m=\underset{k}{\arg }<br><br><br><br>\underset{k\in <br><br>{\mathrm{\Omega <br><br>}}_Q}{\max }<br><br>\left[J^{\left(k,{\mathrm{\Omega <br><br>}}_k\right)}\right].$

16. Assigning method according to claim 14, which further includes;

calculating the cost functions J^(j,i0) for any spreading sequence c^(j) where j belongs to the set Ω

_Q of the indices of the sequences made available,

calculating the cost functions J^(k,i0) for any spreading sequence c^(k) where k belongs to the set Ω

_K-Q of the indices of the sequences still used,

as long as there exists one or more spreading sequences of index j₀ε

Ω

_Q and one or more spreading sequences of index k₀ε

Ω

_K-Q such that J^(j0,i0)<

J^(k0,i0), de-allocating the sequence c^(kM) defined by;

$k_M=\underset{k}{\arg }<br><br><br><br>\underset{k\in <br><br>{\mathrm{\Omega <br><br>}}_{K-Q}}{\max }<br><br>\left[J^{\left(k,i_o\right)}\right],$

and allocating instead the sequence c^(km) defined by;

$k_m=\underset{k}{\arg }<br><br><br><br>\underset{k\in <br><br>{\mathrm{\Omega <br><br>}}_Q}{\min }<br><br>\left[J^{\left(k,i_o\right)}\right].$

17. A transmitter for a Multi-Carrier Code Division Multiple Access transmission system, that assigns one or more spreading sequences among a family of spreading sequences to a user of a Multi-Carrier Code Division Multiple Access transmission network, each element of said sequence being, at the level of a transmitter of said network, multiplied by a data item to be transmitted and then transmitted on a corresponding sub-carrier, the transmitter comprising:

means for assigning, to said user, said one or more spreading sequences; and

means for minimizing a function representing the interference between said one or more sequences, on the one hand, and spreading sequences of a predetermined set, on the other hand, said predetermined set being included in said family of spreading sequences

wherein the means for minimizing a function dynamically selects the best sequences from the predetermined set of spreading sequences in the family of spreading sequences as the number of needed sequences changes, and the number of selected sequences is less than or equal to the total number of spreading sequences.