Programmable and high-performance data scrambler for non-volatile memory controllers
Systems, apparatuses and methods may provide for technology that generates a first set of scrambler bits based on a destination page number associated with data, generates a second set of scrambler bits based on a programmable nonlinear function, and combines the first set of scrambler bits and the second set of scrambler bits into a scrambler seed. In one example, the technology also randomizes the data based on the scrambler seed to obtain outgoing randomized data and writes the outgoing randomized data to a non-volatile memory.
1. A semiconductor apparatus comprising:
one or more substrates; and
logic coupled to the one or more substrates, wherein the logic is implemented at least partly in one or more of configurable or fixed-functionality hardware, the logic to:
generate a first set of scrambler bits based on a destination page number associated with data;
generate a second set of scrambler bits based on a programmable nonlinear function; and
combine the first set of scrambler bits and the second set of scrambler bits into a scrambler seed, wherein the scrambler seed is a single scrambler seed.
2. The semiconductor apparatus of claim 1 , wherein the logic is further to:
randomize the data based on the scrambler seed to obtain outgoing randomized data; and
write the outgoing randomized data to a non-volatile memory.
3. The semiconductor apparatus of claim 2 , wherein the logic is further to:
generate outgoing parity information based on the outgoing randomized data and the second set of scrambler bits;
write the first set of scrambler bits and the outgoing parity information to the non-volatile memory with the outgoing randomized data; and
withhold the second set of scrambler bits from the non-volatile memory.
4. The semiconductor apparatus of claim 2 , wherein the logic is further to:
read incoming randomized data, a first set of descrambler bits, and incoming parity information from the non-volatile memory;
generate a second set of descrambler bits based on the incoming parity information; and
combine the first set of descrambler bits and the second set of descrambler bits into a descrambler seed.
5. The semiconductor apparatus of claim 4 , wherein the logic is further to:
compare the descrambler seed to the scrambler seed;
generate an error notification if the descrambler seed does not match the scrambler seed; and
de-randomize the incoming randomized data based on the descrambler seed if the descrambler seed matches the scrambler seed.
6. A computing system comprising:
a non-volatile memory; and
a controller coupled to the non-volatile memory, wherein the controller includes logic implemented at least partly in one or more of configurable or fixed-functionality hardware, the logic to:
generate a first set of scrambler bits based on a destination page number associated with data,
generate a second set of scrambler bits based on a programmable nonlinear function, and
combine the first set of scrambler bits and the second set of scrambler bits into a scrambler seed, wherein the scrambler seed is a single scrambler seed.
7. The computing system of claim 6 , wherein the logic is further to:
randomize the data based on the scrambler seed to obtain outgoing randomized data, and
write the outgoing randomized data to the non-volatile memory.
8. The computing system of claim 7 , wherein the logic is further to:
generate outgoing parity information based on the outgoing randomized data and the second set of scrambler bits,
write the first set of scrambler bits and the outgoing parity information to the non-volatile memory with the outgoing randomized data, and
withhold the second set of scrambler bits from the non-volatile memory.
9. The computing system of claim 7 , wherein the logic is further to:
read incoming randomized data, a first set of descrambler bits, and incoming parity information from the non-volatile memory,
generate a second set of descrambler bits based on the incoming parity information, and
combine the first set of descrambler bits and the second set of descrambler bits into a descrambler seed.
10. The computing system of claim 9 , wherein the logic is further to:
compare the descrambler seed to the scrambler seed,
generate an error notification if the descrambler seed does not match the scrambler seed, and
de-randomize the incoming randomized data based on the descrambler seed if the descrambler seed matches the scrambler seed.
11. At least one non-transitory computer readable storage medium comprising a set of instructions, which when executed by a computing system, cause the computing system to:
generate a first set of scrambler bits based on a destination page number associated with data;
generate a second set of scrambler bits based on a programmable nonlinear function; and
combine the first set of scrambler bits and the second set of scrambler bits into a scrambler seed, wherein the scrambler seed is a single scrambler seed.
12. The at least one non-transitory computer readable storage medium of claim 11 , wherein the instructions, when executed, further cause the computing system to:
randomize the data based on the scrambler seed to obtain outgoing randomized data; and
write the outgoing randomized data to a non-volatile memory.
13. The at least one non-transitory computer readable storage medium of claim 12 , wherein the instructions, when executed, further cause the computing system to:
generate outgoing parity information based on the outgoing randomized data and the second set of scrambler bits;
write the first set of scrambler bits and the outgoing parity information to the non-volatile memory with the outgoing randomized data; and
withhold the second set of scrambler bits from the non-volatile memory.
14. The at least one non-transitory computer readable storage medium of claim 12 , wherein the instructions, when executed, further cause the computing system to:
read incoming randomized data, a first set of descrambler bits, and incoming parity information from the non-volatile memory;
generate a second set of descrambler bits based on the incoming parity information; and
combine the first set of descrambler bits and the second set of descrambler bits into a descrambler seed.
15. The at least one non-transitory computer readable storage medium of claim 14 , wherein the instructions, when executed, further cause the computing system to:
compare the descrambler seed to the scrambler seed;
generate an error notification if the descrambler seed does not match the scrambler seed; and
de-randomize the incoming randomized data based on the descrambler seed if the descrambler seed matches the scrambler seed.
16. A method comprising:
generating a first set of scrambler bits based on a destination page number associated with data;
generating a second set of scrambler bits based on a programmable nonlinear function; and
combining the first set of scrambler bits and the second set of scrambler bits into a scrambler seed, wherein the scrambler seed is a single scrambler seed.
17. The method of claim 16 , further including:
randomizing the data based on the scrambler seed to obtain outgoing randomized data; and
writing the outgoing randomized data to a non-volatile memory.
18. The method of claim 17 , further including:
generating outgoing parity information based on the outgoing randomized data and the second set of scrambler bits;
writing the first set of scrambler bits and the outgoing parity information to the non-volatile memory with the outgoing randomized data; and
withholding the second set of scrambler bits from the non-volatile memory.
19. The method of claim 17 , further including:
reading incoming randomized data, a first set of descrambler bits, and incoming parity information from the non-volatile memory;
generating a second set of descrambler bits based on the incoming parity information; and
combining the first set of descrambler bits and the second set of descrambler bits into a descrambler seed.
20. The method of claim 19 , further including:
comparing the descrambler seed to the scrambler seed;
generating an error notification if the descrambler seed does not match the scrambler seed; and
de-randomizing the incoming randomized data based on the descrambler seed if the descrambler seed matches the scrambler seed.