Team dz
Newbie
Karma: +0/-0
 Offline
Posts: 5
|
 |
« Reply #105 on: December 09, 2023, 03:26:49 PM »
|
|
|
|
|
|
|
|
Logged
|
|
|
|
doot47
Newbie
Karma: +0/-0
Offline
Posts: 6
|
|
« Reply #106 on: December 13, 2023, 01:25:40 PM »
|
|
|
|
|
|
|
|
Logged
|
|
|
|
beginner
Newbie
Karma: +0/-0
Offline
Posts: 3
|
|
« Reply #107 on: March 06, 2024, 07:48:29 PM »
|
|
|
does any one have a working c# for this algo ?
|
|
|
|
|
Logged
|
|
|
|
deutsch1988
Newbie
Karma: +0/-0
Offline
Posts: 7
|
|
« Reply #108 on: April 22, 2024, 12:03:16 PM »
|
|
|
Hello.
And i am interessing abouth here. Will up this theme!
|
|
|
|
|
Logged
|
|
|
|
deutsch1988
Newbie
Karma: +0/-0
Offline
Posts: 7
|
|
« Reply #109 on: April 23, 2024, 12:13:59 PM »
|
|
|
6 days i am trying to fix this , buth CR1 dont work. here pascal code, what its wrong?
[codefunction CRC32T(Initial: LongWord; Data: array of Byte; DataSize: LongWord): LongWord;
const
poly = $EDB88320;
var
j: Integer;
tmp1, tmp2, crc, i: LongWord;
begin
crc := Initial;
i := 0;
while i < DataSize do
begin
tmp1 := 0;
tmp2 := crc xor Data[i];
for j := 0 to 7 do
begin
if tmp2 and 1 = 1 then
tmp1 := tmp1 xor poly;
tmp2 := tmp2 shr 1;
end;
crc := (crc shr 8) xor tmp1;
Inc(i);
end;
Result := not crc;
end;
|
|
|
|
« Last Edit: April 23, 2024, 12:16:25 PM by deutsch1988 »
|
Logged
|
|
|
|
deutsch1988
Newbie
Karma: +0/-0
Offline
Posts: 7
|
|
« Reply #110 on: April 23, 2024, 02:54:25 PM »
|
|
|
Problem fixed CS1.
Special Thanks to Anton from group. he have writed code in Visual Studio, and i have converted this code to Pascal!
SPECIAL THANKS ANTON!!!
Great mann.helped very very goood!!!
after finish program i will share the direct basic exe file, just put datas and get CS1 and CS2 or automatic edit CS on file with cheking!
|
|
|
|
|
Logged
|
|
|
|
LI
Newbie
Karma: +0/-0
Offline
Posts: 1
|
|
« Reply #111 on: April 30, 2024, 09:32:26 AM »
|
|
|
Hello, I want to figure out the effective verification and calculation steps for my 17 years old. Can you help me?
|
|
|
|
|
Logged
|
|
|
|
Arthur1808
Newbie
Karma: +0/-0
Offline
Posts: 2
|
|
« Reply #112 on: July 11, 2024, 06:17:09 AM »
|
|
|
Hello everyone, any news for this calculation of cs1 and cs2?
|
|
|
|
|
Logged
|
|
|
|
duzi
Newbie
Karma: +0/-0
Offline
Posts: 1
|
|
« Reply #113 on: July 30, 2024, 02:00:36 AM »
|
|
|
DEL..
figured it out, thanks everyone for your help
|
|
|
|
« Last Edit: August 05, 2024, 09:59:54 AM by duzi »
|
Logged
|
|
|
|
stranger
Newbie
Karma: +0/-0
Offline
Posts: 9
|
|
« Reply #114 on: September 16, 2024, 04:33:23 AM »
|
|
|
What about TC1793 that doesn't seems to use CS2. Blocks still looks to be same size, but no block ID is used.
Emulated eeprom is 192Kb in size.
At place where normally CS2 is, only something similar to CS1.
Has anyone figured out how to calculate this checksum? |
|
|
|
|
Logged
|
|
|
|
stranger
Newbie
Karma: +0/-0
Offline
Posts: 9
|
|
« Reply #115 on: September 19, 2024, 02:55:02 PM »
|
|
|
What about TC1793 that doesn't seems to use CS2. Blocks still looks to be same size, but no block ID is used.
Emulated eeprom is 192Kb in size.
At place where normally CS2 is, only something similar to CS1.
From TC1793 datasheet: Flexible CRC Engine (FCE).
– IEEE 802.3 CRC32 ethernet polynomial: 0x82608EDB (CRC kernel 0).
– CRC32C Castagnoli: 0xD419CC15 (CRC kernel 1).So, probably polynomial is one of this two... |
|
|
|
|
Logged
|
|
|
|
deutsch1988
Newbie
Karma: +0/-0
Offline
Posts: 7
|
|
« Reply #116 on: September 25, 2024, 11:01:03 PM »
|
|
|
its very simple algo
i have fixed block by block checking or 64/128/192 kb, also writed soft very easy, and have do this with php file online....
Now interessing for flash, becasse not total flash, only blocks id
|
|
|
|
|
Logged
|
|
|
|
stranger
Newbie
Karma: +0/-0
Offline
Posts: 9
|
|
« Reply #117 on: September 26, 2024, 07:16:28 AM »
|
|
|
its very simple algo
i have fixed block by block checking or 64/128/192 kb, also writed soft very easy, and have do this with php file online....
Now interessing for flash, becasse not total flash, only blocks id
Of course, the algorithm is easy already after you have figured it out.  Can you give a hint? Is the algorithm the same as for 32, 64 and 128kb only with other input parameters? Or there is a completely different algorithm? |
|
|
|
« Last Edit: September 26, 2024, 07:25:14 AM by stranger »
|
Logged
|
|
|
|
deutsch1988
Newbie
Karma: +0/-0
Offline
Posts: 7
|
|
« Reply #118 on: September 26, 2024, 05:05:39 PM »
|
|
|
|
|
|
|
|
Logged
|
|
|
|
stranger
Newbie
Karma: +0/-0
Offline
Posts: 9
|
|
« Reply #119 on: September 26, 2024, 05:56:44 PM »
|
|
|
I probably didn't ask the question correctly. I am asking about the checksum in the TC1793 eeprom block (eeprom file size 192kb). I am not asking about CS1 and CS2 algo in 32kb, 64kb and 128kb eeproms, I already have figured this algo out. So, my question: is algo for TC1793 eeprom block CS the same as for CS1 and CS2 in other eeproms? If "yes" - please give me some push in right direction. What polynome used? Initial value? P.S. it seems to be that in 192kb eeproms it is only one CS (2 bytes in the very end of the block) |
|
|
|
« Last Edit: September 26, 2024, 06:00:44 PM by stranger »
|
Logged
|
|
|
|
|
