Abstract: Systems and methods are described herein for validating an Internet Protocol (IP) version 6 (IPv6) address from an IP version 4 (IPv4) network. A method, according to one implementation, includes a step of receiving an IPv4-based request from a validation server that is configured to support an IPv4 address space. The method further includes a step of sending an IPv6-based request to a domain supporting an IPv6 address space. Also, the method includes receiving a response status code and domain validation information from the domain. Then, the method includes a step of passing the response status code and domain validation information to the validation server.

Abstract: Systems and methods are described herein for validating an Internet Protocol (IP) version 6 (IPv6) address from an IP version 4 (IPv4) network. A method, according to one implementation, includes a step of receiving an IPv4-based request from a validation server that is configured to support an IPv4 address space. The method further includes a step of sending an IPv6-based request to a domain supporting an IPv6 address space. Also, the method includes receiving a response status code and domain validation information from the domain. Then, the method includes a step of passing the response status code and domain validation information to the validation server.

Abstract: A radio-frequency identification (RFID) tag, or tag, is affixed to a particular item and stores unique identifying information about that item. It can be queried with a reader that transmits wireless signals to the tag and receive the tag's responses, which can be correlated with information in inventory records. Conventionally, when a reader stops receiving a tag's responses to these queries, the inventory records are updated to show that the tag and associated item have been removed from the inventory. But a tag can stop producing detectable response for other reasons, including being too close to other tags, so simply removing the tag and item can lead to inaccurate inventory records. Stateful inventory technology address this problem by maintaining and transitioning tags among different states, including a stale state for tags that have not been read recently, depending on when and where the tags were last read.

Abstract: A method and apparatus for interleaving bits in a first sequence is disclosed. An exemplary method comprises storing a set of offset values in at least one table, applying in order each of the set of offset values to identify an adjacent bit pair in the first sequence of the bits for a new interleaved sequence of the bits and incrementing each of the set of offset values until an upper limit is reached to further identify additional adjacent bit pairs in the first sequence of the bits for the new interleaved sequence of the bits. The table is significantly shorter, requiring less memory than that used in a conventional interleaver, particularly a GSM interleaver for half rate speech.

Abstract: Techniques for efficiently performing erasure-and-single-error correction block decoding on a received block of symbols previously coded column-wise with an (N, K) linear block code and row-wise with an error detection code (e.g., a CRC code). Initially, each row of the received block is marked as either an erased row or an un-erased row. To perform erasure-and-single-error correction block decoding on the received block, a codeword corresponding to a column of the received block containing an undetected symbol error is initially identified. The location of the symbol error in the codeword is then determined based on a particular block decoding scheme and corresponding to the selected (N, K) block code. The row of the received block containing the symbol error is then marked as an erased row. Block decoding may then be performed for the received block with the newly marked erased row containing the symbol error.

Abstract: A method and apparatus for interleaving bits in a first sequence is disclosed. An exemplary method comprises storing a set of offset values in at least one table, applying in order each of the set of offset values to identify an adjacent bit pair in the first sequence of the bits for a new interleaved sequence of the bits and incrementing each of the set of offset values until an upper limit is reached to further identify additional adjacent bit pairs in the first sequence of the bits for the new interleaved sequence of the bits. The table is significantly shorter, requiring less memory than that used in a conventional interleaver, particularly a GSM interleaver for half rate speech.