DSpace Repository

A class of optimized encoder for block codes [articol]

Show simple item record

dc.contributor.author Ramasethu, L.
dc.contributor.author Poongodi, P.
dc.date.accessioned 2024-10-22T10:03:14Z
dc.date.available 2024-10-22T10:03:14Z
dc.date.issued 2019
dc.identifier.citation Ramasethu, L.; Poongodi, P.: A class of optimized encoder for block codes. Timişoara: Editura Politehnica, 2019. en_US
dc.identifier.issn 1582-4594
dc.identifier.uri https://dspace.upt.ro/xmlui/handle/123456789/6796
dc.description.abstract Error correcting codes are used broadly,in particularapplications such asin deep satellite communication and fault tolerant memory. In this papera new block code of (32, 19) optimised encoder is proposed. Compared with extended Golay code (24,12)the existing codesare capable of correcting three adjacent errors and detecting six errors. Optimization is achieved by an algorithm which finds the “Majority Message” bits (M). The proposed work is only on the encoder section of block and cyclic codes.As of now most of the work for error correcting codes are carried only on decoder section because of its complexity. A speed encoder is proposed which is not complex through the optimised algorithm. The delay in encoder is reduced thereby it contributes to the efficient error correcting code when considered with decoder section. The codes are programmed in HDL and synthesised using cadence tool of 180 nm library. The result on encoder with optimised new block code for delay, area and power which is at par to the cyclic code. For an increased number of message bits the proposed code is much efficient in correcting triple adjacent error. en_US
dc.language.iso en en_US
dc.publisher Timișoara : Editura Politehnica en_US
dc.relation.ispartofseries Journal of Electrical Engineering;Vol 19 No 4
dc.subject Optimised encoder en_US
dc.subject Golaycode en_US
dc.subject Encoder formation en_US
dc.title A class of optimized encoder for block codes [articol] en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account