Home > Search Results: keywords:"BCH kódy"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Error protection of data transmission using BCH Codes
 Kašpar, Jaroslav ; Křivánek, Vítězslav (referee) ; Němec, Karel (advisor)
The thesis Data transmission error-protection with BCH codes deals with a large class of random-error correcting cyclic codes which are able to protect binary data and can be used for example in data storages, high speed modems. Bose, Chaudhuri and Hocquenghem (BCH) codes operate over algebraic structures called Galois fields. The BCH encoding is the same as cyclic encoding and can be done with linear feedback shift register but decoding is more complex and can be done with different algorithms - in this thesis there are two algorithms for decoding Peterson and Berlekam-Massey mentioned. The aim of this thesis is to find BCH code which is able to correct t = 6 independent errors in up to data sequence n = 150 bits, then peruse possible realizations of the codecs and set criteria for the best realization, then design and test this realization. This thesis is split into three main parts. In the first part there are encoding and decoding methods of the BCH code generally described. The second part deals with selecting of the right code and realization. There was chosen BCH (63,30) code and realization with FPGA chip. In the last part is described design of BCH encoder and decoder and compilation in the Altera design software.
Detailed record
Error protection of data transmission using BCH Codes
 Kašpar, Jaroslav ; Křivánek, Vítězslav (referee) ; Němec, Karel (advisor)
The thesis Data transmission error-protection with BCH codes deals with a large class of random-error correcting cyclic codes which are able to protect binary data and can be used for example in data storages, high speed modems. Bose, Chaudhuri and Hocquenghem (BCH) codes operate over algebraic structures called Galois fields. The BCH encoding is the same as cyclic encoding and can be done with linear feedback shift register but decoding is more complex and can be done with different algorithms - in this thesis there are two algorithms for decoding Peterson and Berlekam-Massey mentioned. The aim of this thesis is to find BCH code which is able to correct t = 6 independent errors in up to data sequence n = 150 bits, then peruse possible realizations of the codecs and set criteria for the best realization, then design and test this realization. This thesis is split into three main parts. In the first part there are encoding and decoding methods of the BCH code generally described. The second part deals with selecting of the right code and realization. There was chosen BCH (63,30) code and realization with FPGA chip. In the last part is described design of BCH encoder and decoder and compilation in the Altera design software.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English