01.08.2013 Views

Chapter 10 Memory Subsystem.pdf

Chapter 10 Memory Subsystem.pdf

Chapter 10 Memory Subsystem.pdf

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Row 0<br />

Row 1<br />

Row 2<br />

Row 3<br />

Row 252<br />

Row 253<br />

Row 254<br />

Row 255<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

P1o<br />

P1o P1o P1o<br />

P2o P2o<br />

256 Bytes input<br />

Row 0<br />

Row 1<br />

Row 2<br />

Row 3<br />

Row 252<br />

Row 253<br />

Row 254<br />

Row 255<br />

Public Version<br />

General-Purpose <strong>Memory</strong> Controller www.ti.com<br />

Figure <strong>10</strong>-27. Hamming Code Accumulation Algorithm (2/2)<br />

P8e<br />

P8e<br />

P8e<br />

P8e<br />

Row 0<br />

Row 1<br />

Row 2<br />

Row 3<br />

Row 252<br />

Row 253<br />

Row 254<br />

Row 255<br />

Unused parity bits in the result registers are set to 0.<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

P1o<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

bit7 bit6 bit5 bit4 bit3 bit2 bit1 bit0<br />

P1o P1e P1o P1e P1o P1e P1o P1e<br />

P2o P2e P2o P2e<br />

P4o P4e<br />

P1o P1o P1o<br />

P2o P2o<br />

P8e<br />

P8o<br />

P8e<br />

P8o<br />

P8e<br />

P8o<br />

P8e<br />

P8o<br />

P16e<br />

P16o<br />

P16e<br />

P16o<br />

P8e<br />

P8e<br />

P8e<br />

P8e<br />

P16e<br />

P16e<br />

gpmc-027<br />

Figure <strong>10</strong>-28 shows ECC computation for a 256-byte data stream (read or write). The result includes six<br />

column parity bits (P1o-P2o-P4o for odd parities, and P1e-P2e-P4e for even parities) and sixteen row<br />

parity bits (P8o-P16o-P32o--P<strong>10</strong>24o for odd parities, and P8e-P16e-P32e--P<strong>10</strong>24e for even parities).<br />

Figure <strong>10</strong>-28. ECC Computation for a 256-Byte Data Stream (Read or Write)<br />

P<strong>10</strong>24e<br />

P<strong>10</strong>24o<br />

gpmc-028<br />

Figure <strong>10</strong>-29 shows ECC computation for a 512-byte data stream (read or write). The result includes six<br />

column parity bits (P1o-P2o-P4o for odd parities, and P1e-P2e-P4e for even parities) and eighteen row<br />

parity bits (P8o-P16o-P32o--P<strong>10</strong>24o- - P2048o for odd parities, and P8e-P16e-P32e--P<strong>10</strong>24e- P2048e for<br />

even parities).<br />

2148 <strong>Memory</strong> <strong>Subsystem</strong> SPRUGN4L–May 20<strong>10</strong>–Revised June 2011<br />

Copyright © 20<strong>10</strong>–2011, Texas Instruments Incorporated

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!