SYSTEMS AND METHODS FOR GENERATING A CODEBOOK TO ENCODE EMBEDDED INFORMATION

• US 20090219895A1
• Filed: 02/29/2008
• Published: 09/03/2009
• Est. Priority Date: 02/29/2008
• Status: Active Grant

• Current Assignee: Sharp Kabushiki Kaisha (Hon Hai Precision Industry Co., Ltd.)
• Original Assignee: Sharp Laboratories of America Incorporated (Hon Hai Precision Industry Co., Ltd.)
• Inventors: Wu, Huaming
• Granted Patent: US 8,189,647 B2
• Time in Patent Office: Days
• US Class Current: 370/335
• CPC Class Codes: H04L 1/0026 Transmission of channel quality indication
• CPC Class Codes: H04L 1/0041 Arrangements at the transmitter end
• CPC Class Codes: H04L 1/1607 Details of the supervisory signal

Abstract

A method for generating a codebook to encode embedded information is described. A distribution pattern of symbols is determined. A first number of codewords associated with the distribution pattern of symbols is determined. A subset of codewords from the first number of codewords is selected. The subset of codewords is included in the codebook if the subset of codewords satisfies predetermined performance criteria.

Claims

1. A method for generating a codebook to encode embedded information, comprising:

determining a distribution pattern of symbols;

determining a first number of codewords associated with the distribution pattern of symbols;

selecting a subset of codewords from the first number of codewords; and

including the subset of codewords in the codebook if the subset of codewords satisfies predetermined performance criteria.

2. The method of claim 1, further comprising calculating a second number of codewords, and wherein the second number indicates the quantity of codewords to include in the codebook.

3. The method of claim 2, further comprising calculating possible combinations of codewords based on the first number of codewords and the second number of codewords.

4. The method of claim 3, further comprising calculating a performance metric for each of the possible combinations of codewords.

5. The method of claim 4, further comprising determining if a performance metric of a combination of codewords is better than the performance metric of other combinations of codewords.

6. The method of claim 5, further comprising including codewords associated with a combination if the combination'"'"'s performance metric is better than the performance metrics of other combinations.

7. The method of claim 1, wherein the performance criteria comprises a minimum average Euclidean distance among the codewords of the subset of codewords.

8. The method of claim 1, wherein the performance criteria comprises a minimum average Hamming distance among the codewords of the subset of codewords.

9. The method of claim 1, wherein the performance criteria comprises a maximum of the smallest Hamming distance among the codewords of the subset of codewords.

10. The method of claim 1, wherein the performance criteria comprises a maximum of the smallest Euclidean distance among the codewords of the subset of codewords.

11. The method of claim 1, further comprising selecting an initial value of a codebook B and selecting an initial value of a codebook B*, and wherein B* is selected based on the value B.

12. The method of claim 11, further comprising determining a set of codewords wherein the sum distance of the codewords to the codebook B* is smaller than the sum distance of other sets of codewords to the codebook B*.

13. The method of claim 11, further comprising generating a new independent value B_new.

14. The method of claim 13, further comprising calculating a first performance criteria P(B_new) and a second performance criteria P(B_i).

15. The method of claim 14, further comprising setting B_i+1=B_new if performance criteria are met.

16. The method of claim 11, further comprising setting a condition to terminate the generation of the codebook.

17. A communications device that is configured to generate a codebook to encode embedded information, the communications device comprising:

a processor;

memory in electronic communication with the processor;

instructions stored in the memory, the instructions being executable to;

determine a distribution pattern of symbols;

determine a first number of codewords associated with the distribution pattern of symbols;

select a subset of codewords from the first number of codewords; and

include the subset of codewords in the codebook if the subset of codewords satisfies predetermined performance criteria.

18. The communications device of claim 17, wherein the instructions are further executable to calculate a second number of codewords, and wherein the second number indicates the quantity of codewords to include in the codebook.

19. The communications device of claim 18, wherein the instructions are further executable to calculate possible combinations of codewords based on the first number of codewords and the second number of codewords.

20. The communications device of claim 19, wherein the instructions are further executable to calculate a performance metric for each of the possible combinations of codewords.

21. The communications device of claim 20, wherein the instructions are further executable to determine if a performance metric of a combination of codewords is better than the performance metric of other combinations of codewords.

22. The communications device of claim 21, wherein the instructions are further executable to include codewords associated with a combination if the combination'"'"'s performance metric is better than the performance metrics of other combinations.

23. The communications device of claim 17, wherein the performance criteria comprises a minimum average Euclidean distance among the codewords of the subset of codewords.

24. The communications device of claim 17, wherein the performance criteria comprises a minimum average Hamming distance among the codewords of the subset of codewords.

25. The communications device of claim 17, wherein the performance criteria comprises a maximum of the smallest Hamming distance among the codewords of the subset of codewords.

26. The communications device of claim 17, wherein the performance criteria comprises a maximum of the smallest Euclidean distance among the codewords of the subset of codewords.

27. The communications device of claim 17, wherein the instructions are further executable to select an initial value of a codebook B and select an initial value of a codebook B*, and wherein B* is selected based on the value B.

28. The communications device of claim 27, wherein the instructions are further executable to determine a set of codewords wherein the sum distance of the codewords to the codebook B* is smaller than the sum distance of other sets of codewords to the codebook B*.

29. The communications device of claim 27, wherein the instructions are further executable to generate a new independent value B_new.

30. The communications device of claim 29, wherein the instructions are further executable to calculate a first performance criteria P(B_new) and a second performance criteria P(B_i).

31. The communications device of claim 30, wherein the instructions are further executable to set B_i+1=B_new if performance criteria are met.

32. The communications device of claim 27, wherein the instructions are further executable to set a condition to terminate the generation of the codebook.

33. The communications device of claim 17, wherein the device is a mobile user device.

34. The communications device of claim 17, wherein the device is a base station.

35. A computer-readable medium comprising executable instructions for:

determining a distribution pattern of symbols;

determining a first number of codewords associated with the distribution pattern of symbols;

selecting a subset of codewords from the first number of codewords; and

including the subset of codewords in the codebook if the subset of codewords satisfies predetermined performance criteria.