Optimization of a storage system containing ECC and scramble engines
Abstract
A method for selecting the scrambling and descrambling data transmitted in a storage system containing ECC and scramble engines with a seed table is disclosed and the steps comprises: encoding a data sent from a HOST interface by an ECC encoding engine and transmitting the data to a LFSR scramble engine; scrambling the data by the LFSR scramble engine and transmitting to a storage device; creating a seed value and transmitting the seed value to a seed table by the LFSR scramble engine; receiving the seed value from the seed table and the scrambled data from the storage device by a LFSR descramble engine, and descrambling the scrambled data based on the seed value and transmitting to an ECC decoding engine; and decoding the descrambled data received from the LFSR descramble engine and then acquiring the original data sent from the HOST interface.
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1. A method for selecting the scrambling and descrambling data transmitted in a storage system containing ECC and scramble engines with a seed table, comprising:
encoding a data sent from a HOST interface by an ECC encoding engine and transmitting the data to a LFSR scramble engine;
scrambling the data by the LFSR scramble engine and transmitting to a storage device;
creating a seed value and transmitting the seed value to a seed table by the LFSR scramble engine;
receiving the seed value from the seed table and the scrambled data from the storage device by a LFSR descramble engine, and descrambling the scrambled data based on the seed value and transmitting to an ECC decoding engine; and
decoding the descrambled data received from the LFSR descramble engine and then acquiring the original data sent from the HOST interface,
wherein the ECC decoding engine decodes the data every X2 bytes, saving the seed value of every beginning of X2 bytes or times of X2 bytes get the best performance, and the seed value is repeated every X3 bytes and then the size of the seed table is reduced.
2. The method according to claim 1 , wherein the ECC decoding engine decodes the data every 1,024 bytes, then the seed table only saves the seed value of every 1K bytes, or times of 1K bytes; and the density of the storage device is 8G bytes, then the seed table is reduced to 8 millions of entries or less depending on performance requirement.Cited by (0)
No later patents cite this yet.
References (0)
No backward citations on record.