Please use this identifier to cite or link to this item: http://nopr.niscpr.res.in/handle/123456789/2921
Full metadata record
DC FieldValueLanguage
dc.contributor.authorArun, C-
dc.contributor.authorRajamani, V-
dc.date.accessioned2009-01-30T04:23:03Z-
dc.date.available2009-01-30T04:23:03Z-
dc.date.issued2009-02-
dc.identifier.issn0019-5189-
dc.identifier.urihttp://hdl.handle.net/123456789/2921-
dc.description97-106en_US
dc.description.abstractThis paper presents implementation of a new non-polynomial approach to design a high throughput with reduced bit error probability Viterbi decoder. Increase in dfree has been achieved by proposed non-polynomial convolutional coding method. A decoder system (code rate k/n=1/6, constrain length K=4) has been implemented on Xilinx VERTEX-E. Performance of Viterbi decoder with proposed method has been improved from 27% to 75%. High speed (60.299 Mbps) and low bit error rate (BER) are achieved for Viterbi decoder. Proposed Viterbi decoder provides satisfactory probability of error (Ph) performance and high operating speed under conditions including AWGN, co-channel interference and adjacent channel interference environments.en_US
dc.language.isoen_USen_US
dc.publisherCSIRen_US
dc.sourceJSIR Vol.68(1) [February 2009]en_US
dc.subjectAdd compare select (ACS)en_US
dc.subjectBranch metric unit (BMU)en_US
dc.subjectFree distanceen_US
dc.subjectLow bit error rateen_US
dc.subjectNon-polynomial approachen_US
dc.subjectTrace back unit (TBU)en_US
dc.subjectViterbi algorithmen_US
dc.titleDesign and VLSI architecture of non-polynomial based low probability of error (Pb) Viterbi decoderen_US
dc.typeArticleen_US
Appears in Collections:JSIR Vol.68(02) [February 2009]

Files in This Item:
File Description SizeFormat 
JSIR 68(2) 97-106.pdf1.11 MBAdobe PDFView/Open


Items in NOPR are protected by copyright, with all rights reserved, unless otherwise indicated.