Data scrambler in extreme high throughput

• US 11,206,667 B2
• Filed: 12/26/2019
• Issued: 12/21/2021
• Est. Priority Date: 06/07/2019
• Status: Active Grant

• Current Assignee: Intel Corporation
• Original Assignee: Intel Corporation
• Inventors: Li, Qinghua, Chen, Xiaogang, Gurevitz, Assaf, Kenney, Thomas J., Vituri, Shlomi, Jiang, Feng
• Primary Examiner(s): Oh, Andrew C
• Application Number:
  US16/727,611
• Publication Number:
  US 20200137759A1
• Time in Patent Office: 726 Days
• Field of Search: None
• CPC Class Codes: H04L 1/0007 by modifying the frame length
• CPC Class Codes: H04L 1/0016 involving special memory structures, e.g. look-up tables
• CPC Class Codes: H04L 2025/03656 Initialisation
• CPC Class Codes: H04L 25/03159 operating in the frequency domain H04L25/03165, H04L25/03178 take precedence
• CPC Class Codes: H04L 25/03866 using scrambling
• CPC Class Codes: H04L 27/2602 Signal structure
• CPC Class Codes: H04L 27/2615 Reduction thereof using coding
• CPC Class Codes: H04W 72/0466 the resource being a scrambling code

Abstract

This disclosure describes systems, methods, and devices related to extreme high throughput (EHT) data scrambler. A device may determine an extreme high throughput (EHT) data field of a frame to be scrambled using an EHT data scrambler. The device may determine to initialize the EHT data scrambler using an initialization seed, wherein the initialization seed has a size greater than seven bits. The device may generate scrambled data using the initialization seed. The device may cause to send the frame comprising the scrambled data to a first station device.

Claims

1. A device, the device comprising processing circuitry coupled to storage, the processing circuitry configured to:

determine an extreme high throughput (EHT) data field of a frame to be scrambled using an EHT data scrambler;

determine to initialize the EHT data scrambler using an initialization seed, wherein the initialization seed has a size greater than seven bits;

determine one or more blocks associated with a symbol of the frame;

repeatedly multiply a rotation vector for each repeated block, wherein a first block is multiplied by 1, a second block multiplied by −

1, and a third block multiplied by j, wherein j is an imaginary number;

generate scrambled data using the initialization seed; and

cause to send the frame comprising the scrambled data to a first station device.

2. The device of claim 1, wherein the processing circuitry is further configured to determine an output of the EHT data scrambler, wherein the output is greater than 127 bits.

3. The device of claim 1, wherein the initialization seed is associated with a polynomial of x{circumflex over ( 

)}9+x{circumflex over ( 

)}5+1 or x{circumflex over ( 

)}15+x{circumflex over ( 

)}14+1.

4. The device of claim 1, wherein the initialization seed is 9 bits or 15 bits.

5. The device of claim 1, wherein increasing the length of the initialization seed is done together with a size of a polynomial.

6. The device of claim 1, wherein the polynomial of x{circumflex over ( 

)}15+x{circumflex over ( 

)}14+1 comprises an output of a 15^th register being exclusive OR (XOR) with a 14^th register.

7. The device of claim 1, further comprising a transceiver configured to transmit and receive wireless signals.

8. The device of claim 7, further comprising an antenna coupled to the transceiver to cause to send the frame.

9. A non-transitory computer-readable medium storing computer-executable instructions which when executed by one or more processors result in performing operations comprising:

determining an extreme high throughput (EHT) data field of a frame to be scrambled using an EHT data scrambler;

determining to initialize the EHT data scrambler using an initialization seed, wherein the initialization seed has a size greater than seven bits;

determining one or more blocks associated with a symbol of the frame;

repeatedly multiplying a rotation vector for each block, wherein a first block is multiplied by 1, a second block multiplied by −

1, and a third block multiplied by j, wherein j is an imaginary number;

generating scrambled data using the initialization seed; and

causing to send the frame comprising the scrambled data to a first station device.

10. The non-transitory computer-readable medium of claim 9, wherein the operations further comprise determining an output of the EHT data scrambler, wherein the output is greater than 127 bits.

11. The non-transitory computer-readable medium of claim 9, wherein the initialization seed is associated with a polynomial of x{circumflex over ( 

)}9+x{circumflex over ( 

)}5+1 or x{circumflex over ( 

)}15+x{circumflex over ( 

)}14+1.

12. The non-transitory computer-readable medium of claim 9, wherein the initialization seed is 9 bits or 15 bits.

13. The non-transitory computer-readable medium of claim 9, wherein increasing the length of the initialization seed is done together with a size of a polynomial.

14. The non-transitory computer-readable medium of claim 9, wherein the polynomial of x{circumflex over ( 

)}15+x{circumflex over ( 

)}14+1 comprises an output of a 15^th register being exclusive OR (XOR) with a 14^th register.

15. A method comprising:

determining, by one or more processors, an extreme high throughput (EHT) data field of a frame to be scrambled using an EHT data scrambler;

determining to initialize the EHT data scrambler using an initialization seed, wherein the initialization seed has a size greater than seven bits;

determining one or more blocks associated with a symbol of the frame;

repeatedly multiplying a rotation vector for each block, wherein a first block is multiplied by 1, a second block multiplied by −

1, and a third block multiplied by j, wherein j is an imaginary number;

generating scrambled data using the initialization seed; and

causing to send the frame comprising the scrambled data to a first station device.

16. The method of claim 15, further comprising determining an output of the EHT data scrambler, wherein the output is greater than 127 bits.

17. The method of claim 15, wherein the initialization seed is associated with a polynomial of x{circumflex over ( 

)}9+x{circumflex over ( 

)}5+1 or x{circumflex over ( 

)}15+x{circumflex over ( 

)}14+1.

18. The method of claim 15, wherein the initialization seed is 9 bits or 15 bits.