IP Library Granted Patent US 12,032,725
Granted Patent B2
US 12,032,725 · App. 16/885,726 · Granted Jul 9, 2024

Data scrambler for persistent memory

Inventors: Ravi H. Motwani (Fremont, CA); Santhosh Kumar Vanaparthy (Santa Clara, CA)
Assignee: Intel Corporation
G06F21/79G06F3/0623G06F3/0661G06F3/0679H04L9/0631H04L9/0656H04L2209/04
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,032,725
App. No.
16/885,726
Granted
Jul 9, 2024
Kind
B2
Abstract

Techniques and mechanisms to provide one or more substrates, and logic coupled to the one or more substrates. In an embodiment, the logic is to generate a pseudo-random sequence of bits, and to permute one or more bits of binary unscrambled data. In another embodiment, the logic is further to generate scrambled data based on an exclusive-or operation between the pseudo-random sequence of bits and the permuted data.

Claims (60)

1. An electronic apparatus, comprising:

one or more substrates; and

logic coupled to the one or more substrates, the logic to:

determine a first seed value,

determine a mask pattern based on the first seed value,

generate a pseudo-random first sequence of bits based on the first seed value,

generate a second sequence of bits based on an exclusive-or operation between the pseudo-random first sequence of bits and the mask pattern,

generate scrambled data based on an exclusive-or operation between the second sequence of bits and unscrambled data,

complement the first seed value to provide a complemented seed value, and

join the complemented seed value and the first seed value to provide a binary mask pattern for the mask pattern with a balanced number of binary zero-value bits and binary one-value bits.

2. The apparatus of claim 1 , wherein the logic is further to:

permute one or more bits of the binary mask pattern.

3. The apparatus of claim 1 , wherein the logic comprises a linear feedback shift register to generate the pseudo-random first sequence of bits based on the first seed value.

4. The apparatus of claim 1 , wherein the logic is further to:

determine the first seed value based on one or more of metadata and address information associated with the unscrambled data.

5. The apparatus of claim 1 , wherein the logic is further to:

permute one or more bits of the unscrambled data; and

generate the scrambled data based on an exclusive-or operation between the second sequence of bits and the permuted one or more bits of the unscrambled data; and

write the scrambled data to a persistent memory.

6. The apparatus of claim 5 , wherein the persistent memory comprises three dimensional crosspoint media.

7. An electronic system, comprising:

persistent memory; and

a controller communicatively coupled to the persistent memory, the controller including logic to:

determine a first seed value,

determine a mask pattern based on the first seed value,

generate a pseudo-random first sequence of bits based on the first seed value,

generate a second sequence of bits based on an exclusive-or operation between the pseudo-random first sequence of bits and the mask pattern,

generate scrambled data to store in the persistent memory based on an exclusive-or operation between the second sequence of bits and unscrambled data,

complement the first seed value to provide a complemented seed value, and

join the complemented seed value and the first seed value to provide a binary mask pattern for the mask pattern with a balanced number of binary zero-value bits and binary one-value bits.

8. The electronic system of claim 7 , wherein the logic is further to:

permute one or more bits of the binary mask pattern.

9. The electronic system of claim 7 , wherein the logic comprises a linear feedback shift register to generate the pseudo-random first sequence of bits based on the first seed value.

10. The electronic system of claim 7 , wherein the logic is further to:

determine the first seed value based on one or more of metadata and address information associated with the unscrambled data.

11. The electronic system of claim 7 , wherein the logic is further to:

determine a second seed value based on a non-linear transformation of the first seed value; and

generate the pseudo-random first sequence of bits based on the second seed value.

12. The electronic system of claim 11 , wherein the logic is further to:

permute one or more bits of the unscrambled data; and

generate the scrambled data to store in the persistent memory based on an exclusive-or operation between the second sequence of bits and the permuted one or more bits of the unscrambled data.

13. The electronic system of claim 7 , wherein the persistent memory comprises three-dimensional crosspoint media.

14. A method of scrambling data, comprising:

determining a first seed value;

determining a mask pattern based on the first seed value;

generating a pseudo-random first sequence of bits based on the first seed value;

generating a second sequence of bits based on an exclusive-or operation between the pseudo-random first sequence of bits and the mask pattern;

generating scrambled data based on an exclusive-or operation between the second sequence of bits and unscrambled data;

complementing the first seed value to provide a complemented seed value; and

joining the complemented seed value and the first seed value to provide a binary mask pattern for the mask pattern with a balanced number of binary zero-value bits and binary one-value bits.

15. The method of claim 14 , further comprising:

permuting one or more bits of the binary mask pattern.

16. The method of claim 14 , further comprising:

determining the first seed value based on one or more of metadata and address information associated with the unscrambled data.

17. The method of claim 14 , further comprising:

determining a second seed value based on a non-linear transformation of the first seed value; and

generating the pseudo-random first sequence of bits based on the second seed value.

18. The method of claim 14 , further comprising:

permuting one or more bits of the unscrambled data; and

generate the scrambled data to store in a persistent memory based on an exclusive-or operation between the second sequence of bits and the permuted one or more bits of the unscrambled data.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 17, 2025
From: INTEL CORPORATION
To: SK HYNIX NAND PRODUCT SOLUTIONS CORP. (DBA SOLIDIGM)
Reel/Frame 072851/0056 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 28, 2020
From: MOTWANI, RAVI H.; VANAPARTHY, SANTHOSH KUMAR
To: INTEL CORPORATION
Reel/Frame 052777/0203 →
Continuity (1)
Related Publication 20200293696A1 · Sep 17, 2020