An Efficient VLSI Execution of Data Transmission Error Detection and Correction Based Bloom Filter

S. Karthik Raja, PSNACET; Dr. A. Kaleel Rahuman ,

Golay Code, Extended Goaly Code, Bloom Filter

Channel coding is commonly incorporated to obtain sufficient reception quality in wireless mobile communications transceiver to counter channel degradation due to inter-symbol interference, multipath dispersion, and thermal noise induced by electronic circuit devices. High speed and high throughput hardware for encoder and decoder could be useful in communication field. Due to the channel achieving property, the GOLAY code has become one of the most favorable error-correcting codes. In this paper, a new algorithm has been proposed for CRC based encoding scheme, which devoid of any linear feedback shift registers (LFSR). In this architecture, our work is to design a GOLAY code based encoder and decoder architecture using CRC processing technique. The other approach is to design a Bloom filter with hamming distance based fast error detection and correction methodology and this work is to improve the secure data transmission. The bloom filter system is to identify the error bit location using the redundant bits add process and to correct the error for XOR based distance calculation process. The Bloom filter architecture is used to set the hash value for allocated transmitted data sequence and to improve the fault identification methodology. This method is to optimize the decoder structure and effectively identify the error location, then to correct to error using bit reverser logic process.
    [1] M. J. E. Golay, “Notes on digital coding,” Proc. IRE, vol. 37, p. 657, Jun. 1949. [2] X.-H. Peng and P. G. Farrell, “On construction of the (24, 12, 8)Golay codes,”IEEE Trans. Inf. Theory, vol. 52, no. 8, pp. 3669–3675,Aug. 2006. [3] B. Honary and G. Markarian, “New simple encoder and trellis decoderfor Golay codes,” Electron. Lett., vol. 29, no. 25, pp. 2170–2171,Dec. 1993. [4] B. K. Classon, “Method, system, apparatus, and phone for error controlof Golay encoded data signals,”U.S. Patent 6 199 189, Mar. 6, 2001. [5] M.-I. Weng and L.-N. Lee, “Weighted erasure codec for the (24, 12) extended Golay code,” U.S.Patent 4 397 022, Aug. 2, 1983 [6] S.-Y. Su and P.-C. Li, “Photoacoustic signal generation with Golaycoded excitation,” in Proc. IEEE Ultrason. Symp. (IUS), Oct. 2010, pp. 2151–2154. [7] M. Spachmann, “Automatic generation of parallel CRC circuits,” IEEEDes. Test. Comput., vol. 18, no. 3, pp. 108–114, May/Jun. 2001. [8] G. Campobello, G. Patane, and M. Russo, “Parallel CRC realization,”Trans. Comput., vol. 52, no. 10, pp. 1312–1319, Oct. 2003. [9] R. Nair, G. Ryan, and F. Farzaneh, “A symbol based algorithm forhardware implementation of cyclic redundancy check (CRC),” inProc.VHDL Int. Users’ Forum, Oct. 1997, pp. 82–87. [10] P. adde and R. le Bidan, “A low-complexity soft-decision decoding architecture for the binay extended Golay code,” in proc. 19th IEEE Int. Conf. Electron, Circuits, Syst. (ICECS), Dec. 2012, pp.705-708. [11] F Chang, J dean, S, Ghemawat, “Bigtable: A distributed storage system for structured data”, WC Hsieh, 2014. [12] Michael Mitzenmacher, “Compressed Bloom Filters”, 2002. [13] Taskin Kocak and Ilhan Kaya, 2006. “Low-Power Bloom Filter Architecture for Deep Packet Inspection”, [14] Michael Paynter and Taskin Kocak, “Fully Pipelined Bloom Filter Architecture”, 2008 [15] Haoyu Song, Sarang Dharmapurikar, “Fast Hash Table Lookup Using Extended Bloom Filter: An Aid to Network Processing”, 2005.
Paper ID: GRDCF002098
Published in: Conference : International Conference on Innovations in Engineering and Technology (ICIET - 2016)
Page(s): 519 - 526