NoC & Fabric

 NoC (network on a chip) & Fabric

https://www.arteris.com/blog/bid/99797/The-SoC-Interconnect-Fabric-A-Brief-History

https://www.design-reuse.com/articles/39023/noc-interconnect-fabric-ip-improves-soc-power-performance-and-area.html

https://www.arteris.com/noc-technology-benefits

Stitching Computing Systems into a Single Fabric

Banker's round

When you convert the floating-point value to a fixed-point value, you should change the value. It is rounding.

For example, there is a value "1.5".

fixed point (1.5) is 1 or 2, which one is the right value?

There are many rounding methods.

https://en.wikipedia.org/wiki/Rounding

1. normal round: Round_half_away_from_zero

2. bankers' round: Round half to even or http://www.xbeat.net/vbspeed/i_BankersRounding.htm (Gaussian rounding, round to even, bankers' rounding)

Polar Code

Polar Codes: https://simons.berkeley.edu/talks/polar-codes

From this site https://www.polarcodes.com/ you can watch the videos & download the documents.

https://www.ocf.berkeley.edu/~sasoglu/0100000041.pdf

15-859: Information Theory and its applications in theory of computation, Spring 2013, lecture 10, 11, 12

Best Readings in Polar Coding

----

A Practical Introduction to Polar Codes (A very simple tutorial for beginners)

- K (message) bits and N (code) bits (where K is a message and N is a code)

- BI-DMS: binary input discrete memoryless symmetric

- Attractive features:

  - Fixed, low, and deterministic encoding and decoding

  - Explicit construction

  - Easy to implement

- BSC: binary symmetric channel

- BEC: binary erasure channel

- AWGN: additive white Gaussian channel

- Bhattacharyya parameter

FFT/iFFT & DFT/iDFT

https://cnx.org/contents/0sbTkzWQ@2.2:4kChocHM@6/Efficient-FFT-Algorithm-and-Programming-Tricks


8 point FFT algorithm
https://studylib.net/doc/5721308/ece-734--project-presentation

Paper
https://ieeexplore.ieee.org/document/799577
https://www.researchgate.net/publication/4089256_Improved_radix-4_and_radix-8_FFT_algorithms

CRC

CRC

http://www.sunshine2k.de/articles/coding/crc/understanding_crc.html
https://en.wikipedia.org/wiki/Cyclic_redundancy_check
https://web.archive.org/web/20051125100414/http://www.ross.net/crc/download/crc_v3.txt

LFSR - linear feedback shift register

LFSR - linear feedback shift register

& fast algorithm ???

• shift register sequence
• Random number generation using LFSR (by maxim integrated)

Every primitive polynomial will have an odd number of terms, which means that every mask for a primitive polynomial will have an even number of 1 bit. Every primitive polynomial also defines a second primitive polynomial, its dual. The dual can be found by subtracting the exponent from the degree of the polynomial for each term. For example, given the 6th-degree polynomial, x6 + x + 1, its dual is x6-6 + x6-1 + x6-0, which is equal to x6 + x5 + 1. In Table 1, polynomials 1 and 2, 3 and 4, 5 and 6 are the duals of each other.

• LFSR jump ahead algorithm
• Scrambler

http://www.johnkerl.org/doc/ffcomp.pdf
LFSRs.pdf
LFSR-notes.PDF


* reference
http://www.cs.fsu.edu/~xyuan/cda5125/347603_347603.pdf

Syndrome decode

Syndrome decoding in Wikipedia
Syndrome decoding in UCSD pdf (An introduction to error correcting codes part 1)