Jan Sloot's principle looks like that of Klaus Holtz with the different that Sloot made a fixed static reference memory with all the unique data already in, while Holtz made it dynamic as a self learning system, also was Sloot final output key only 1Kb in size. As written in the book "De broncode" Sloot used 5 algorithms where he needed 12Mb for each algorithm what included storage for temporary calculation. He was working on a new application what needed 74Mb for each algorithm to store the temporary calculations for longer movie/TV programs, probably to store the bigger amount of frame keys after the 1Kb input key was decoded. The advantage of Sloot system was that it was possible; to add in every electronic device the processors with the algorithm included the reference memory and memory for the temporary calculations storage. After that only a one 1Kb key code for every movie or TV program was needed to generate the frames for displaying it at a display device.
Let's say one movie/program frame is 1024x640=655,360pixels
According to Jan Sloot second patent:
One block is 16x16=256 pixels
And 64 blocks are one row
Then there are 655,360/256=2,560 blocks in a frame
And 655,360/(256*64)=40 rows in a frame
If there are 25 frames a second and a movie is 90 minutes then:
There are 655,360x25x60x90=88,473,600,000 pixels in a movie/program
88,473,600,000/256=345,600,000 blocks in a movie/program
88,473,600,000/64=5,400,000 rows in a movie/program
88,473,600,000/38.125=135,000 frames in a movie/program
Figure 3 explanation:
30 reference memory contains all possible pixel values (colour values 256 or 2560 or 102400)
31 1st (de)coding part(*) compares every decoded pixel value with the reference memory (30)
32 pixel memory store pixel codes, 256 pixel values stored
33 2nd (de)coding part generate a block code from 256 pixels
34 block memory store block codes, 64 block values stored
35 3rd (de)coding part generate a row code from 64 blocks
36 row memory store row codes, 40(**) row values stored
37 4th (de)coding part generate a frame code from 40(**) rows
38 frame memory store frame codes, 135.000(***) frame values stored
39 5th (de)coding part generate a movie/program code from 135.000(***) frames
40 movie/program memory store movie/program codes, 1Kb each
* Also digital video signal input.
** Frame pixel size depended.
*** Frames a second and movie/program length depended.
41 key processor decoding part check if all blocks, rows and frames are only stored once and that in case of double ones only coordinates are stored
42 storage (chip card) keep a copy of the movie/program memory (40) and calculations from the key processor (41)
43 input-output equipment (chip card reader)
44 key processor coding part(*) stores the movie/program code in the movie/program memory (40)
* Also digital video signal output.
In the above example pixels are used but it's also possible with audio or text.
Details about the reference memory storage and the key code algorithms are not explained in this patent description.
If for example a video input pixel is 1byte then for example every coding part (5 in total) must generate an output key 40 times smaller then the input data to end with a 1Kb key.
88,473,600,000bytes/(40x40x40x40x40)=864bytes (without audio).
