P. Reviriego, Shanshan Liu, A. Sánchez-Macián, Liyi Xiao, J. A. Maestro
{"title":"正交拉丁方码子集中奇偶开销的降低","authors":"P. Reviriego, Shanshan Liu, A. Sánchez-Macián, Liyi Xiao, J. A. Maestro","doi":"10.1109/DCIS51330.2020.9268637","DOIUrl":null,"url":null,"abstract":"Radiation may cause unexpected effects in electronics, in particular in harsh environments such as Space. Error correcting codes can be used to mitigate radiation effects in these scenarios. Orthogonal Latin Square (OLS) codes are a type of error-correction codes (ECC) capable of correcting multiple bit errors. They can be decoded with low delay and complexity. Therefore, they are of interest in communications and memory applications. Their main drawback is the overhead required in terms of parity bits needed to protect the information. Thus, a relevant goal is to reduce the number of parity bits while keeping the simplicity and delay properties. This paper presents a method to limit this overhead with similar delay and complexity characteristics with respect to the original code.","PeriodicalId":186963,"journal":{"name":"2020 XXXV Conference on Design of Circuits and Integrated Systems (DCIS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Reduction of Parity Overhead in a Subset of Orthogonal Latin Square Codes\",\"authors\":\"P. Reviriego, Shanshan Liu, A. Sánchez-Macián, Liyi Xiao, J. A. Maestro\",\"doi\":\"10.1109/DCIS51330.2020.9268637\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Radiation may cause unexpected effects in electronics, in particular in harsh environments such as Space. Error correcting codes can be used to mitigate radiation effects in these scenarios. Orthogonal Latin Square (OLS) codes are a type of error-correction codes (ECC) capable of correcting multiple bit errors. They can be decoded with low delay and complexity. Therefore, they are of interest in communications and memory applications. Their main drawback is the overhead required in terms of parity bits needed to protect the information. Thus, a relevant goal is to reduce the number of parity bits while keeping the simplicity and delay properties. This paper presents a method to limit this overhead with similar delay and complexity characteristics with respect to the original code.\",\"PeriodicalId\":186963,\"journal\":{\"name\":\"2020 XXXV Conference on Design of Circuits and Integrated Systems (DCIS)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 XXXV Conference on Design of Circuits and Integrated Systems (DCIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCIS51330.2020.9268637\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 XXXV Conference on Design of Circuits and Integrated Systems (DCIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCIS51330.2020.9268637","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Reduction of Parity Overhead in a Subset of Orthogonal Latin Square Codes
Radiation may cause unexpected effects in electronics, in particular in harsh environments such as Space. Error correcting codes can be used to mitigate radiation effects in these scenarios. Orthogonal Latin Square (OLS) codes are a type of error-correction codes (ECC) capable of correcting multiple bit errors. They can be decoded with low delay and complexity. Therefore, they are of interest in communications and memory applications. Their main drawback is the overhead required in terms of parity bits needed to protect the information. Thus, a relevant goal is to reduce the number of parity bits while keeping the simplicity and delay properties. This paper presents a method to limit this overhead with similar delay and complexity characteristics with respect to the original code.