Skip to content
/ nanors Public
forked from sleepybishop/nanors

fast reed solomon codes in GF2^8

License

Notifications You must be signed in to change notification settings

ns6089/nanors

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

38 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

nanors CI

nanors is a tiny, performant implementation of reed solomon codes capable of reaching multi-gigabit speeds on a single core.

It was designed to be compatible with the reed solomon scheme used in NVIDIA GameStream and as such the generator uses a cauchy matrix instead of the more common vandermonde matrix.

Performance

Good performance is dependent on CPU acceleration, to this end a stripped down and amalgamated version of https://github.com/sleepybishop/oblas is included.

Benchmark

Use Cases

  • Applications with small data volumes and low latency requirements.
  • Storage applications, particularly if using a large block size.

Other Implementations

Most implementations use a standard textbook inversion strategy during decoding, whereas nanors exploits the structure of the matrix to perform the minimum number of operations, as such performance should compare favorably to other implementations on a per core basis.

About

fast reed solomon codes in GF2^8

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C 75.9%
  • Perl 15.6%
  • Makefile 8.5%