SAS Interface
1.2.2 Hashed SAS address
SSP frames include a hashed version of the SAS address to provide an additional
level of verification of proper frame routing.
The code used for the hashing algorithm is a cyclic binary Bose, Chaudhuri, and
Hocquenghem (BCH) (63, 39, 9) codes. Table 1.2 lists the parameters for the
code.
Table 1.2 Hashed SAS address code parameter
Number of bits per codeword
Number of data bits
Number of redundant bits
Minimum distance of the code
The generator polynomial for this code is:
G(x) = (x
After multiplication of the factors, the generator polynomial is:
G(x) = x
+
4
x
+ x
30
Parameter
6
6
4
+ x + 1) (x
+ x
+ x
24
23
22
20
+ x
+ x
+ x
+ x
2
+ x + 1
Value
63
39
24
9
2
6
5
2
+ x + 1) (x
+ x
+ x
19
17
16
13
+ x
+ x
+ x
+ x
6
3
+ x + 1) (x
+ x
+ 1)
10
9
8
6
5
+ x
+ x
+ x
+ x
C141-C013