The Experts below are selected from a list of 3450 Experts worldwide ranked by ideXlab platform
Yong Yuan - One of the best experts on this subject based on the ideXlab platform.
-
segmented cyclic redundancy check a data protection scheme for fast reading rfid tag s memory
Wireless Communications and Networking Conference, 2008Co-Authors: Xiaodong Deng, Mengtian Rong, Tao Liu, Yong YuanAbstract:In the RFID system, a reader recognizes tags through communications over a shared wireless channel. Using the singulation scheme, the reader detects a single tag from a tag population. Further, the reader sometimes requests the memory contents from the tag. The tag responds by backscattering the requested memory words and a CRC-16 is calculated over and attached to the memory words to verify the message. Since CRC is a technique for detecting errors, but not for making corrections when errors are detected, a simple and feasible solution is to retransmit the whole packet if error occurs. Unfortunately, it makes the RFID system very inefficient due to time delay, especially in dense interrogator environment. This paper presents a Segmented cyclic redundancy check (SCRC) algorithm, a simple, efficient and reliable algorithm for fast reading tag's memory. To reduce retransmission times and read tag's memory efficiently, SCRC corrects single-bit errors at first and the whole packet is divided into multiple segments based on the optimal segment length. Our performance evaluation shows that SCRC causes fewer retransmissions and takes shorter delay for reading RFID tag's memory than existing CRC algorithm.
-
WCNC - Segmented cyclic redundancy check: A Data Protection Scheme for Fast Reading RFID Tag's Memory
2008 IEEE Wireless Communications and Networking Conference, 2008Co-Authors: Xiaodong Deng, Mengtian Rong, Tao Liu, Yong YuanAbstract:In the RFID system, a reader recognizes tags through communications over a shared wireless channel. Using the singulation scheme, the reader detects a single tag from a tag population. Further, the reader sometimes requests the memory contents from the tag. The tag responds by backscattering the requested memory words and a CRC-16 is calculated over and attached to the memory words to verify the message. Since CRC is a technique for detecting errors, but not for making corrections when errors are detected, a simple and feasible solution is to retransmit the whole packet if error occurs. Unfortunately, it makes the RFID system very inefficient due to time delay, especially in dense interrogator environment. This paper presents a Segmented cyclic redundancy check (SCRC) algorithm, a simple, efficient and reliable algorithm for fast reading tag's memory. To reduce retransmission times and read tag's memory efficiently, SCRC corrects single-bit errors at first and the whole packet is divided into multiple segments based on the optimal segment length. Our performance evaluation shows that SCRC causes fewer retransmissions and takes shorter delay for reading RFID tag's memory than existing CRC algorithm.
Xiaodong Deng - One of the best experts on this subject based on the ideXlab platform.
-
segmented cyclic redundancy check a data protection scheme for fast reading rfid tag s memory
Wireless Communications and Networking Conference, 2008Co-Authors: Xiaodong Deng, Mengtian Rong, Tao Liu, Yong YuanAbstract:In the RFID system, a reader recognizes tags through communications over a shared wireless channel. Using the singulation scheme, the reader detects a single tag from a tag population. Further, the reader sometimes requests the memory contents from the tag. The tag responds by backscattering the requested memory words and a CRC-16 is calculated over and attached to the memory words to verify the message. Since CRC is a technique for detecting errors, but not for making corrections when errors are detected, a simple and feasible solution is to retransmit the whole packet if error occurs. Unfortunately, it makes the RFID system very inefficient due to time delay, especially in dense interrogator environment. This paper presents a Segmented cyclic redundancy check (SCRC) algorithm, a simple, efficient and reliable algorithm for fast reading tag's memory. To reduce retransmission times and read tag's memory efficiently, SCRC corrects single-bit errors at first and the whole packet is divided into multiple segments based on the optimal segment length. Our performance evaluation shows that SCRC causes fewer retransmissions and takes shorter delay for reading RFID tag's memory than existing CRC algorithm.
-
WCNC - Segmented cyclic redundancy check: A Data Protection Scheme for Fast Reading RFID Tag's Memory
2008 IEEE Wireless Communications and Networking Conference, 2008Co-Authors: Xiaodong Deng, Mengtian Rong, Tao Liu, Yong YuanAbstract:In the RFID system, a reader recognizes tags through communications over a shared wireless channel. Using the singulation scheme, the reader detects a single tag from a tag population. Further, the reader sometimes requests the memory contents from the tag. The tag responds by backscattering the requested memory words and a CRC-16 is calculated over and attached to the memory words to verify the message. Since CRC is a technique for detecting errors, but not for making corrections when errors are detected, a simple and feasible solution is to retransmit the whole packet if error occurs. Unfortunately, it makes the RFID system very inefficient due to time delay, especially in dense interrogator environment. This paper presents a Segmented cyclic redundancy check (SCRC) algorithm, a simple, efficient and reliable algorithm for fast reading tag's memory. To reduce retransmission times and read tag's memory efficiently, SCRC corrects single-bit errors at first and the whole packet is divided into multiple segments based on the optimal segment length. Our performance evaluation shows that SCRC causes fewer retransmissions and takes shorter delay for reading RFID tag's memory than existing CRC algorithm.
Tao Liu - One of the best experts on this subject based on the ideXlab platform.
-
segmented cyclic redundancy check a data protection scheme for fast reading rfid tag s memory
Wireless Communications and Networking Conference, 2008Co-Authors: Xiaodong Deng, Mengtian Rong, Tao Liu, Yong YuanAbstract:In the RFID system, a reader recognizes tags through communications over a shared wireless channel. Using the singulation scheme, the reader detects a single tag from a tag population. Further, the reader sometimes requests the memory contents from the tag. The tag responds by backscattering the requested memory words and a CRC-16 is calculated over and attached to the memory words to verify the message. Since CRC is a technique for detecting errors, but not for making corrections when errors are detected, a simple and feasible solution is to retransmit the whole packet if error occurs. Unfortunately, it makes the RFID system very inefficient due to time delay, especially in dense interrogator environment. This paper presents a Segmented cyclic redundancy check (SCRC) algorithm, a simple, efficient and reliable algorithm for fast reading tag's memory. To reduce retransmission times and read tag's memory efficiently, SCRC corrects single-bit errors at first and the whole packet is divided into multiple segments based on the optimal segment length. Our performance evaluation shows that SCRC causes fewer retransmissions and takes shorter delay for reading RFID tag's memory than existing CRC algorithm.
-
WCNC - Segmented cyclic redundancy check: A Data Protection Scheme for Fast Reading RFID Tag's Memory
2008 IEEE Wireless Communications and Networking Conference, 2008Co-Authors: Xiaodong Deng, Mengtian Rong, Tao Liu, Yong YuanAbstract:In the RFID system, a reader recognizes tags through communications over a shared wireless channel. Using the singulation scheme, the reader detects a single tag from a tag population. Further, the reader sometimes requests the memory contents from the tag. The tag responds by backscattering the requested memory words and a CRC-16 is calculated over and attached to the memory words to verify the message. Since CRC is a technique for detecting errors, but not for making corrections when errors are detected, a simple and feasible solution is to retransmit the whole packet if error occurs. Unfortunately, it makes the RFID system very inefficient due to time delay, especially in dense interrogator environment. This paper presents a Segmented cyclic redundancy check (SCRC) algorithm, a simple, efficient and reliable algorithm for fast reading tag's memory. To reduce retransmission times and read tag's memory efficiently, SCRC corrects single-bit errors at first and the whole packet is divided into multiple segments based on the optimal segment length. Our performance evaluation shows that SCRC causes fewer retransmissions and takes shorter delay for reading RFID tag's memory than existing CRC algorithm.
Mengtian Rong - One of the best experts on this subject based on the ideXlab platform.
-
segmented cyclic redundancy check a data protection scheme for fast reading rfid tag s memory
Wireless Communications and Networking Conference, 2008Co-Authors: Xiaodong Deng, Mengtian Rong, Tao Liu, Yong YuanAbstract:In the RFID system, a reader recognizes tags through communications over a shared wireless channel. Using the singulation scheme, the reader detects a single tag from a tag population. Further, the reader sometimes requests the memory contents from the tag. The tag responds by backscattering the requested memory words and a CRC-16 is calculated over and attached to the memory words to verify the message. Since CRC is a technique for detecting errors, but not for making corrections when errors are detected, a simple and feasible solution is to retransmit the whole packet if error occurs. Unfortunately, it makes the RFID system very inefficient due to time delay, especially in dense interrogator environment. This paper presents a Segmented cyclic redundancy check (SCRC) algorithm, a simple, efficient and reliable algorithm for fast reading tag's memory. To reduce retransmission times and read tag's memory efficiently, SCRC corrects single-bit errors at first and the whole packet is divided into multiple segments based on the optimal segment length. Our performance evaluation shows that SCRC causes fewer retransmissions and takes shorter delay for reading RFID tag's memory than existing CRC algorithm.
-
WCNC - Segmented cyclic redundancy check: A Data Protection Scheme for Fast Reading RFID Tag's Memory
2008 IEEE Wireless Communications and Networking Conference, 2008Co-Authors: Xiaodong Deng, Mengtian Rong, Tao Liu, Yong YuanAbstract:In the RFID system, a reader recognizes tags through communications over a shared wireless channel. Using the singulation scheme, the reader detects a single tag from a tag population. Further, the reader sometimes requests the memory contents from the tag. The tag responds by backscattering the requested memory words and a CRC-16 is calculated over and attached to the memory words to verify the message. Since CRC is a technique for detecting errors, but not for making corrections when errors are detected, a simple and feasible solution is to retransmit the whole packet if error occurs. Unfortunately, it makes the RFID system very inefficient due to time delay, especially in dense interrogator environment. This paper presents a Segmented cyclic redundancy check (SCRC) algorithm, a simple, efficient and reliable algorithm for fast reading tag's memory. To reduce retransmission times and read tag's memory efficiently, SCRC corrects single-bit errors at first and the whole packet is divided into multiple segments based on the optimal segment length. Our performance evaluation shows that SCRC causes fewer retransmissions and takes shorter delay for reading RFID tag's memory than existing CRC algorithm.
Hui Shen - One of the best experts on this subject based on the ideXlab platform.
-
an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check
IEEE Communications Letters, 2012Co-Authors: Bin Li, Hui ShenAbstract:In this letter, we propose an adaptive SC (Successive Cancellation)-List decoder for polar codes with CRC. This adaptive SC-List decoder iteratively increases the list size until at least one survival path can pass CRC. Simulation shows that the adaptive SC-List decoder provides significant complexity reduction. We also demonstrate that polar code (2048, 1024) with 24-bit CRC decoded by our proposed adaptive SC-List decoder with very large maximum list size can achieve a frame error rate FER ≤ 10-3{-3} at Eb/No = 1.1dB, which is about 0.25dB from the information theoretic limit at this block length.
-
an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check
arXiv: Information Theory, 2012Co-Authors: Bin Li, Hui ShenAbstract:In this letter, we propose an adaptive SC (Successive Cancellation)-List decoder for polar codes with CRC. This adaptive SC-List decoder iteratively increases the list size until the decoder outputs contain at least one survival path which can pass CRC. Simulation shows that the adaptive SC-List decoder provides significant complexity reduction. We also demonstrate that polar code (2048, 1024) with 24-bit CRC decoded by our proposed adaptive SC-List decoder with very large list size can achieve a frame error rate FER=0.001 at Eb/No=1.1dB, which is about 0.2dB from the information theoretic limit at this block length.
