{"title":"Multiple error detection and correction over GF(2m) using novel cross parity code","authors":"M. S. Sundary, V. Logisvary","doi":"10.1109/ISCO.2016.7726963","DOIUrl":null,"url":null,"abstract":"Communication becomes most important in today's life. The world is dreaded to think beyond any communication gadgets. Data communication basically involves transfers of data from one place to another or from one point of time to another. Error may be introduced by the channel which makes data unreliable for user. Hence we need different error detection and error correction schemes. Our need is to achieve High speed and low complexity. The proposed work is to detect and correct a multiple error using low complexity novel cross parity code at lower overhead over GF(2m). It is able to correct m<;= Dw<;= 3m/2-1 multiple error combination out of all the possible 2m-1 error. Our proposed work is to test on 128 bit parallel and 163 bit (FIPT/NIST) standard word level GF multiplier and improve the efficiency of the circuit when compare to the existing work. Then we implement the design using VHDL, then simulated and synthesized using Modelsim SE 6 simulator and Xilinx ISE 6.3i respectively.","PeriodicalId":320699,"journal":{"name":"2016 10th International Conference on Intelligent Systems and Control (ISCO)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 10th International Conference on Intelligent Systems and Control (ISCO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCO.2016.7726963","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Communication becomes most important in today's life. The world is dreaded to think beyond any communication gadgets. Data communication basically involves transfers of data from one place to another or from one point of time to another. Error may be introduced by the channel which makes data unreliable for user. Hence we need different error detection and error correction schemes. Our need is to achieve High speed and low complexity. The proposed work is to detect and correct a multiple error using low complexity novel cross parity code at lower overhead over GF(2m). It is able to correct m<;= Dw<;= 3m/2-1 multiple error combination out of all the possible 2m-1 error. Our proposed work is to test on 128 bit parallel and 163 bit (FIPT/NIST) standard word level GF multiplier and improve the efficiency of the circuit when compare to the existing work. Then we implement the design using VHDL, then simulated and synthesized using Modelsim SE 6 simulator and Xilinx ISE 6.3i respectively.
沟通在今天的生活中变得最重要。这个世界害怕超越任何通讯工具。数据通信基本上包括将数据从一个地方传输到另一个地方或从一个时间点传输到另一个时间点。信道可能引入错误,使用户的数据不可靠。因此,我们需要不同的错误检测和纠错方案。我们需要的是实现高速度和低复杂性。提出的工作是使用低复杂度的新型交叉奇偶校验码在GF(2m)上以较低的开销检测和纠正多重错误。能够在所有可能的2m-1误差中,对m<;= Dw<;= 3m/2-1多重误差组合进行校正。我们提出的工作是在128位并行和163位(FIPT/NIST)标准字电平GF乘法器上进行测试,与现有工作相比,提高电路的效率。然后使用VHDL实现设计,然后分别使用Modelsim SE 6模拟器和Xilinx ISE 6.3i进行仿真和合成。