Communication methods and systems having permutation schemes

• US 8,239,710 B2
• Filed: 07/15/2009
• Issued: 08/07/2012
• Est. Priority Date: 10/31/2008
• Status: Active Grant

• Current Assignee: Industrial Technology Research Institute
• Original Assignee: Industrial Technology Research Institute
• Inventors: Tsai, Chia-Lung, Hsieh, Yu-Tao, Hsu, Jen-Yuan, Ting, Pang-An
• Primary Examiner(s): CHAUDRY, MUJTABA M
• Application Number:
  US12/503,584
• Publication Number:
  US 20100111208A1
• Time in Patent Office: 1,119 Days
• Field of Search: 714/701, 375/260
• US Class Current: 714/701
• CPC Class Codes: H04K 1/06 by transmitting the information or elements thereof at unnatural speeds or in jumbled order or backwards
• CPC Class Codes: H04L 1/0071 Use of interleaving interleaving per se H03M13/27
• CPC Class Codes: H04L 5/0007 the frequencies being orthogonal, e.g. OFDM(A), DMT
• CPC Class Codes: H04L 5/0044 allocation of payload

Abstract

A wireless communication method implemented in a communication system may include receiving a data sequence to be permuted, and obtaining information associated with the data sequence to be permuted, the information containing at least a length of the data sequence and a sampling spacing for permuting the data sequence. The method may also include identifying a first portion of the data sequence having a first number of adjacent data items, and a second portion of the data sequence having a second number of adjacent data items. The method may also include accessing the first number of data items from the first portion at the sampling spacing, and placing the accessed first number of data items into a predetermined number of sub-blocks included within a permuted data sequence to be generated based on the received data sequence. The method may further include inserting each of the second number of data items into an end position of one of the sub-blocks within the permuted data sequence, and outputting the permuted data sequence.

Claims

1. A wireless communication method implemented in a communication system, comprising:

receiving a data sequence to be permuted;

obtaining information associated with the data sequence to be permuted, the information containing at least a length of the data sequence and a sampling spacing for permuting the data sequence;

identifying a first portion of the data sequence having a first number of adjacent data items, and a second portion of the data sequence having a second number of adjacent data items;

accessing the first number of data items from the first portion at the sampling spacing;

placing the accessed first number of data items into a predetermined number of sub-blocks included within a permuted data sequence to be generated based on the received data sequence;

inserting each of the second number of data items into an end position of one of the sub-blocks within the permuted data sequence; and

outputting the permuted data sequence.

2. The wireless communication method of claim 1, wherein the first portion includes a first length and the second portion includes a second length, the sum of the first and second lengths equals the length of the data sequence.

3. The wireless communication method of claim 1, wherein the predetermined number of sub-blocks is determined based on the length of the data sequence and the sampling spacing.

4. The wireless communication method of claim 1, wherein the each of the sub-blocks has a uniform number of positions for placing data items from the first portion.

5. The wireless communication method of claim 4, wherein at least one of the second number of data items is inserted into a sub-block that is not adjacent to any sub-block inserted with one of the second number of data items.

6. The wireless communication method of claim 1, further comprising determining the end position for each of the second data items based on at least one of a position number of each of the second number of data items, and a position number of one of the first number of data items within the first portion.

7. The wireless communication method of claim 1, wherein a permutation operation comprising at least one of the identifying, accessing, placing, and inserting operations is conducted based on at least one of following equations:

PPRU_MB[j]=PRU_MB[i], j=0, 1, . . . , K_MB−

1;

i=(q(j)mod D)*P+floor(q(j)/D);

P=min(K_MB, N₁/N₂);

r(j)=max(j−

(K_MB mod P)*D, 0);

q(j)=j+floor(r(j)/(D−

1));

D=floor(K_MB/P+1);

wherein K_MB is an integer number associated with the received data sequence, N₁ is an integer number associated with the received data sequence, N₂ is an integer number associated with the received data sequence, and j is an index, and

wherein PPRU_MB denotes the permuted data sequence, and PRU_MB denotes the received data sequence.

8. The wireless communication method of claim 7, wherein the permutation operation comprising at least one of the identifying, accessing, placing, and inserting operations is a miniband permutation performed based on a miniband permutation sequence determined from at least one of the equations.

9. The wireless communication method of claim 1, wherein a permutation operation comprising at least one of the identifying, accessing, placing, and inserting operations is conducted based on at least one of following equations:

PPRU_MB[j]=PRU_MB[i], j=0, 1, . . . , L_MB−

1;

i=((q(j)mod D)*P+floor(q(j)/D)*N₂)+(j mod N₂);

P=min(L_MB, N₁);

r(j)=max(floor (j/N₂)−

(L_MB mod P)*D/N₂,

     0);

q(j)=floor(j/N₂)+floor(r(j)/(D−

1));

D=floor(L_MB/P+1);

wherein L_MB is an integer number associated with the received data sequence, N₁ is an integer number associated with the received data sequence, N₂ is an integer number associated with the received data sequence, and j is an index, and

wherein PPRU_MB denotes the permuted data sequence, and PRU_MB denotes the received data sequence.

10. The wireless communication method of claim 9, wherein the permutation operation comprising at least one of the identifying, accessing, placing, and inserting operations is a miniband permutation performed based on a miniband permutation sequence determined from at least one of the equations.

11. A wireless communication method implemented in a communication system, comprising:

receiving a data sequence to be permuted;

identifying at least a length of the data sequence and a sampling spacing for permutation;

identifying a first portion and a second portion of the data sequence, the first portion having a first length and containing a first number of adjacent data items, the second portion having a second length and containing a second number of adjacent data items;

providing a first number of positions within a permuted data sequence for the first number of data items from the first portion based on the sampling spacing;

providing a second number of positions within the permuted data sequence for the second number of data items based on the first number of determined positions; and

processing the permuted data sequence for wireless communication.

12. The wireless communication method of claim 11, further comprising placing the first number of data items into the first number of positions within the permuted data sequence, and placing the second number of data items into the second number of positions within the permuted data sequence.

13. The wireless communication method of claim 11, wherein the first number of positions are evenly distributed in a number of sub-blocks, each sub-block having a left end position and a right end position, the method further comprising inserting each of the second number of data items into one of the left or right end position of one of the sub-blocks within the permuted data sequence.

14. The wireless communication method of claim 11, wherein the first number of positions are evenly distributed in a number of sub-blocks, and wherein at least one of the second number of data items is inserted into a sub-block that is not adjacent to any sub-block inserted with one of the second number of data items.

15. The wireless communication method of claim 11, wherein determining the second number of positions for the second number of data items comprising determining the second number of positions based on at least one of a position number of each of the second number of data items and a position number of one of the first number of data items within the first portion.

16. The wireless communication method of claim 11, wherein a permutation comprising at least one of the identifying and providing operations is conducted based on at least one of following equations:

PPRU_MB[j]=PRU_MB[i], j=0, 1, . . . , K_MB−

1;

i(q(j)mod D)*P+floor(q(j)/D);

P=min(K_MB, N₁/N₂);

r(j)=max(j−

(K_MB mod P)*D, 0);

q(j)=j+floor(r(j)/(D−

1));

D=floor(K_MB/P+1);

wherein K_MB is an integer number associated with the received data sequence, N₁ is an integer number associated with the received data sequence, N₂ is an integer number associated with the received data sequence, and j is an index, and

wherein PPRU_MB denotes the permuted data sequence, and PRU_MB denotes the received data sequence.

17. The wireless communication method of claim 16, wherein a permutation comprising at least one of the identifying and providing operations is a miniband permutation performed based on a miniband permutation sequence determined from at least one of the equations.

18. The wireless communication method of claim 11, wherein a permutation comprising at least one of the identifying and providing operations is conducted based on at least one of following equations:

PPRU_MB[j]=PRU_MB[i], j=0, 1, . . . , L_MB−

1;

i=((q(j)mod D)*P+floor(q(j)/D)*N₂)+(j mod N₂);

P=min(L_MB, N₁);

r(j)=max(floor (j/N₂)−

(L_MB mod P)*D/N₂,

     0);

q(j)=floor(j/N₂)+floor(r(j)/(D−

1));

D=floor(L_MB/P+1);

wherein L_MB is an integer number associated with the received data sequence, N₁ is an integer number associated with the received data sequence, N₂ is an integer number associated with the received data sequence, and j is an index, and

wherein PPRU_MB denotes the permuted data sequence, and PRU_MB denotes the received data sequence.

19. The wireless communication method of claim 18, wherein a permutation comprising at least one of the identifying and providing operations is a miniband permutation performed based on at least one of the equations.

20. A system for wireless communication, comprising:

an input interface configured to receive a data sequence to be permuted, the data sequence having a plurality of data items;

a coding device configured to apply a permutation to the data sequence and generate a permuted data sequence, the coding device comprising;

a permutation device configured to;

obtain information associated with the data sequence to be permuted, the information containing at least a length of the data sequence and a sampling spacing for permuting the data sequence;

identify a first portion of the data sequence having a first number of adjacent data items, and a second portion of the data sequence having a second number of adjacent data items;

access the first number of data items from the first portion at the sampling spacing;

place the accessed first number of data items into a predetermined number of sub-blocks included within the permuted data sequence; and

insert each of the second number of data items into an end position of one of the sub-blocks within the permuted data sequence; and

an output interface configured to output the permuted data sequence for wireless communication.

21. The system of claim 20, further comprising a computational circuit configured to compute a permutation sequence based on the length of the data sequence.

22. The system of claim 21, further comprising a shift logic circuit configured to receive the computed permutation sequence from the computational circuit and shift data contents of the permutation sequence.

23. The system of claim 21, wherein the computational circuit is configured to compute the permutation sequence based on at least one of following equations:

PPRU_MB[j]=PRU_MB[i], j=0, 1, . . . , K_MB−

1;

i(q(j)mod D)*P+floor(q(j)/D);

P=min(K_MB, N₁/N₂);

r(j)=max(j−

(K_MB mod P)*D, 0);

q(j)=j+floor(r(j)/(D−

1));

D=floor(K_MB/P+1);

wherein K_MB is an integer number associated with the received data sequence, N₁ is an integer number associated with the received data sequence, N₂ is an integer number associated with the received data sequence, and j is an index, and

wherein PPRU_MB denotes the permuted data sequence, and PRU_MB denotes the received data sequence.

24. The system of claim 23, wherein the permutation device is configured to perform a miniband permutation based on the permutation sequence computed based on at least one of the equations.

25. The system of claim 21, wherein the computational circuit is configured to compute the permutation sequence based on at least one of following equations:

PPRU_MB[j]=PRU_MB[i], j=0, 1, . . . , L_MB−

1;

i=((q(j)mod D)*P+floor(q(j)/D)*N₂)+(j mod N₂);

P=min(L_MB, N₁);

r(j)=max(floor (j/N₂)−

(L_MB mod P)*D/N₂,

     0);

q(j)=floor(j/N₂)+floor(r(j)/(D−

1));

D=floor(L_MB/P+1);

wherein L_MB is an integer number associated with the received data sequence, N₁ is an integer number associated with the received data sequence, N₂ is an integer number associated with the received data sequence, and j is an index, and

wherein PPRU_MB denotes the permuted data sequence, and PRU_MB denotes the received data sequence.

26. The system of claim 25, wherein the permutation device is configured to perform a miniband permutation based on the permutation sequence computed based on at least one of the equations.