System and method for descrambling data
View Patent ↗A method and system for negating a series of packed data bytes simultaneously based on conditional flags is used to descramble the data, as opposed to negating each byte with respect to each conditional flag bit. Sets of scrambled binary values are received. A descrambling code that corresponds to a flag bit sequence used to scramble the sets of binary values is generated. Then the sets of scrambled binary values are descrambled using the descrambling code. The method is particularly suitable for use in a wireless base band receiver.
1. A method for descrambling data, wherein the data includes one or more sets of scrambled binary values, the method comprising:
receiving a first predetermined number of sets of scrambled binary values that were scrambled using a predefined flag bit sequence;
generating at least one descrambling code by repeating each bit of the predefined flag bit sequence for a second predetermined number that is equal to a bit length of a selected one of the sets of the first predetermined number of sets of scrambled binary values; and
calculating a third predetermined number of sets of descrambled binary values corresponding to the first predetermined number of sets of scrambled binary values using the at least one descrambling code and a predefined value, wherein the predefined value is calculated using the first predetermined number and the bit length of the selected one of the sets of the first predetermined number of sets of scrambled binary values.
2. The descrambling method of claim 1 , wherein each bit of the predefined flag bit sequence corresponds to at least one set of the first predetermined number of sets of scrambled binary values.
3. The descrambling method of claim 2 , wherein descrambling comprises negating a set of scrambled binary values based on the value of a corresponding bit in the predefined flag bit sequence.
4. The descrambling method of claim 1 , wherein each set of scrambled binary values is at least one of a log likelihood ratio (LLR), a soft value, and an equalized demodulated probabilistic estimate.
5. The descrambling method of claim 1 , wherein calculating the third predetermined number of sets of descrambled binary values comprises calculating a first intermediate value by performing a bitwise logical AND operation on the at least one descrambling code and the predefined value.
6. The descrambling method of claim 5 , wherein calculating the third predetermined number of sets of descrambled binary values further comprises calculating a second intermediate value by performing a bitwise logical XOR operation on a set of scrambled binary values and the at least one descrambling code.
7. The descrambling method of claim 6 , wherein calculating the third predetermined number of sets of descrambled binary values further comprises adding the first intermediate value to the second intermediate value.
8. A method for descrambling one or more sets of scrambled binary values using a lookup table, the lookup table comprising a plurality of descrambling codes and a plurality of binary combinations, the method comprising:
receiving a first predetermined number of sets of scrambled binary values to be descrambled simultaneously, wherein the first predetermined number of sets of scrambled binary values are scrambled using a predefined flag bit sequence;
accessing at least one descrambling code from the lookup table corresponding to a binary combination, wherein the binary combination is identical to the predefined flag bit sequence; and
calculating a corresponding second predetermined number of sets of descrambled binary values corresponding to the first predetermined number of sets of scrambled binary values using the at least one accessed descrambling code and a predefined value, wherein the predefined value is calculated using the first predetermined number and a bit length of a selected one of the first predetermined number of sets of scrambled binary values.
9. The descrambling method of claim 8 , wherein each bit of the predefined flag bit sequence corresponds to at least one set of the first predetermined number of sets of scrambled binary values.
10. The descrambling method of claim 9 , wherein descrambling comprises negating a set of scrambled binary values based on the value of a corresponding bit in the predefined flag bit sequence.
11. The descrambling method of claim 8 , wherein each set of scrambled binary values is a log likelihood ratio (LLR), a soft value, and an equalized demodulated probabilistic estimate.
12. The descrambling method of claim 8 , wherein calculating the second predetermined number of sets of descrambled binary values comprises calculating a first intermediate value by performing a bitwise logical AND operation on the at least one descrambling code and the predefined value.
13. The descrambling method of claim 12 , wherein calculating the second predetermined number of sets of descrambled binary values further comprises performing a bitwise logical XOR operation on a set of scrambled binary values and the at least one descrambling code to obtain a second intermediate value.
14. The descrambling method of claim 13 , wherein calculating the second predetermined number of sets of descrambled binary values further comprises adding the first intermediate value to the second intermediate value.
15. A method for descrambling one or more sets of scrambled binary values using a lookup table, the lookup table comprising a plurality of descrambling codes and a plurality of binary combinations, the method comprising:
receiving a first predetermined number of sets of scrambled binary values to be descrambled simultaneously, wherein the first predetermined number of sets of scrambled binary values are scrambled using a predefined flag bit sequence;
accessing at least one descrambling code from the lookup table corresponding to a binary combination, wherein the binary combination is identical to the predefined flag bit sequence;
calculating a first intermediate value by performing a bitwise logical AND operation on the at least one descrambling code and a predefined value, wherein the predefined value is calculated using the first predetermined number and a bit length of one of the sets of the first predetermined number of sets of scrambled binary values;
calculating a second intermediate value by performing a bitwise logical XOR operation on the first predetermined number of sets of scrambled binary values and the at least one descrambling code; and
adding the first intermediate value to the second intermediate value to a first predetermined number of sets of descrambled binary values corresponding to the first predetermined number of sets of scrambled binary values.
16. The descrambling method of claim 15 , wherein scrambling comprises encoding a bit stream into the first predetermined number of sets of scrambled binary values using the predefined flag bit sequence, wherein each bit of the predefined flag bit sequence corresponds to a bit of the bit stream.
17. The descrambling method of claim 16 , wherein each bit of the predefined flag bit sequence corresponds to at least one set of scrambled binary values.
18. The descrambling method of claim 17 , wherein descrambling comprises negating a set of scrambled binary values based on the value of a corresponding bit in the predefined flag bit sequence.
19. The descrambling method of claim 15 , wherein each set of scrambled binary values is a log likelihood ratio (LLR).