摘要(英) |
Cyclic redundancy check (CRC) scheme, which was particularly designed for medium access control (MAC) layer to detect erroneous frames, has been widely used in wired and wireless networks. Due to the limited information carried in the CRC field, receiver is not able to correct any erroneous frame and receiver drops all the erroneous frames automatically. To provide reliable communications on an error-prone communication link, retransmission scheme is often adopted to cooperate with the CRC scheme. From theoretical viewpoint, erroneous frame still possesses useful information which could be helpful for receiver to figure out the original data frame in case that retransmission is failed again. As a solution, we propose a new error recovery scheme at the MAC layer, namely CRC based error corrector (CEC), which simply amends legacy CRC error checker to become a CRC-based error corrector. The key concept of CEC is to compare all received erroneous frames and thereby derive the positions of differentiated bits among them. According to the positions of unmatched bits, all possible data frames are formed and rechecked by a fabric with a number of CRC encoders. As all error bits are detectable by the comparator, the original data frame is found. The error recoverable probability (ERP) of CEC is analyzed in this thesis. For evaluations, we also develop two types of hardware based CEC, namely CEC-I scheme and CEC-II scheme, as they equip different numbers of CRC encoders. As confirmed by performance evaluations, the proposed CEC with limited hardware cost can easily achieve excellent performance in term of the mean number of retransmissions per frame. |
參考文獻 |
[1] IEEE 802.16-2004, IEEE Standard for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed Broadband Wireless Access Systems, IEEE 802.16-2004, Oct. 2004
[2] IEEE Standard for Local and metropolitan area networks Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems Amendment 2: Physical and Medium Access Control Layers for Combined Fixed and Mobile Operation in Licensed Bands and Corrigendum, IEEE 802.16e-2005, Feb. 2006.
[3] G. Albertengo and Sisto, “Parallel CRC Generation,” IEEE Micro, Volume 10, No.5, pp. 63-71, Oct. 1990.
[4] S. Joshi, P. Dubey and M. Kaplan, “A New Parallel Algorithm for CRC Generation,” IEEE International Conference on Communications, Volume 3, June 2000.
[5] Ren-Der Lin and Wen-Shyen Chen, “Fast Calculation Algorithm of the Undetected Errors Probability of CRC Codes,” Advanced Information Networking and Applications (AINA), 2005.
[6] T. V. Ramabadran and S. S. Gaitonde, “A Tutorial on CRC Computations,” IEEE Micro, Aug. 1988.
[7] R. J. Glaise and X. Jacquart, “Fast CRC Calculation,” Proc. 1993 IEEE International Conference on Computer Design: VLSI in Computers and Processors, pp. 602-605, Oct. 1993.
[8] R. Lee, “Cyclic Code Redundancy,” Digital Design, pp. 77-85, Jul. 1981.
[9] A. Perez, “Byte-wise CRC Calculations,” IEEE Micro, Jun. 1983, pp. 40-50.
[10] W. W. Peterson and D. T. Brown, “Cyclic Codes for Error Detection,” Proc. IRE, pp. 228–236, Jan. 1961.
[11] E. O. Elliott “Estimates of Error Rates for Codes on Burst-noise Channels,” Bell Svst. Tech. J., vol. 42, pp.1977-1997, Sept. 1963. |