EPFL

Algo+LMA

This shows you the differences between two versions of the page.

Both sides previous revision Previous revision Next revision | Previous revision | ||

en:private:erclog:ghid2010 [2011/02/07 17:08] maatouk |
en:private:erclog:ghid2010 [2016/06/23 11:26] (current) |
||
---|---|---|---|

Line 50: | Line 50: | ||

===== December 2010 ===== | ===== December 2010 ===== | ||

- | Speeding up RS codes in hardware (semester project in ALGO). Previous work by A. Shokrollahi achieves a speedup of RS encoding and some decoding stages, of a factor p when working in a field where there exist p-th roots of unity (at the small additional hardware cost of a DFT unit). We are interested in the case where there exist no roots of unity in the finite field. In this case, we try to build a similar approach by performing computation on additive cosets of a subspace of the field viewed as a vector space. | + | Speeding up RS codes in hardware (semester project in ALGO). Previous work by A. Shokrollahi achieves a speedup of RS encoding and some decoding stages, of a factor p when working in a field where there exist p-th roots of unity (at the small additional hardware cost of a DFT unit). We are interested in the case where there exist no roots of unity in the finite field. In this case, we try to build a similar approach by performing computation on additive cosets of a subspace of the field viewed as a vector space (see report filed under January 2011). |