Abstract: A method estimates parameters of 3-phase voltage signals to synchronize a power grid in a presence of a voltage unbalance by transforming the 3-phase voltage signals to ??-reference signals using a Clarke transformation matrix, and estimating sinusoidal signals and corresponding quadrature signals of the ??-reference signals using an extended Kalman filter, and determining a phase angle of a positive sequence based on a relationship of the phase angle to the estimated the sinusoidal signals.

Abstract: A method and system manage a hierarchy of passwords for users accessing a hierarchy of access control devices. First, a codeword is acquired and a syndrome of the codeword is determined. Next, the codeword is randomly modified with a probability p to produce a modified codeword. The modified codeword is selected and assigned to a user as a password, if the modified codeword is recoverable.

Abstract: The first and second nodes in a wireless network estimate first and second channel response. The first node quantizes the first channel response to produce a first bit sequence, and a feed-forward message, which is transmit as a feed-forward message to the second node. The second node quantizes the second channel response using the feed-forward message to produce and an estimate of the first bit sequence, a second bit sequence and a feed-back message, which is transmitted to the first node. Then, the first and second nodes delete bits in the respective bit sequences using the feed-back and feed-forward message to generate first and second private keys with low bit mismatch rate.

Abstract: A method for authenticating biometric data. Comprising of a processor that measures the reliability of each bit in enrollment biometric data; by arranging the bits; encoding the enrollment biometric data in the decreasing order to produce an enrollment syndrome; arranging the bits in the authentication biometric; decoding the authentication enrollment syndrome to produce an estimate of the enrollment biometric data; generating an output signal indicating that the estimate of the authentication biometric data is substantially the same as the enrollment biometric data.

Abstract: A method for encoding a source image, wherein the source image includes a set of bitplanes of pixels, is disclosed. For each bitplane in a most to least significant order, the method include obtaining a list of significant pixels (LSP), a list of insignificant pixels (LIP), and a list of insignificant sets (LIS) according to a hierarchical ordering of the source image pixels; synchronizing the LSP, LIP and LIS of the source image with the LSP, LIP and LIS of a key image; constructing a temporary list of insignificant sets (TLIS) for the source image; and applying syndrome encoding to the LSP, LIP, and TLIS of the source image to obtain syndromes corresponding to magnitudes and signs of pixels in the source image, wherein the steps are performed in a processor.

Abstract: A system and a method determine a quasi-cyclic (QC) low-density parity-check (LDPC) code corresponding to a protograph and having a predetermined girth. At least several elements of the connectivity matrix representing the protograph are duplicated along at least one line of duplication to produce an inflated connectivity matrix, wherein values of at least several elements in the connectivity matrix form a pattern indicated by the predetermined girth. A hierarchical quasi-cyclic (HQC) LDPC code corresponding to the inflated connectivity matrix is determined and at least several elements of a matrix representing the HQC LDPC code are removed, such that the matrix is squashed along the line of duplication to produce the QC LDPC code.

Abstract: A system and a method for determining a quasi-cyclic (QC) low-density parity-check (LDPC) code, such that the QC LDPC code has no trapping sets are disclosed. A set of matrices representing a family of QC LDPC codes are acquired, wherein each QC LDPC code is a tail-biting spatially-coupled code of girth not less than eight, and wherein each column of each matrix in the set has a weight not less than four. Based on a trapping set pattern, a matrix from the set of matrices is selected such that the matrix represents the QC LDPC code with no trapping sets. The matrix can be stored into a memory.

Abstract: A code to be decoded by message-passing is represented by a factor graph. The factor graph includes variable nodes indexed by i and constraint nodes indexed by a connected by edges for transferring messages mi?a outgoing from the variable nodes to the constraint nodes and messages ma?i incoming from the constraint nodes to the variable nodes. The messages mi?a are initialized based on beliefs bi of a received codeword. The messages ma?i are generated by overshooting the messages mi?a at the constraint nodes. The beliefs bi are updated at the variable nodes using the messages ma?i. The codeword is outputted if found, otherwise, the messages mi?a are updated using a correction for the overshooting.

Abstract: A method for encoding a source image, wherein the source image includes a set of bitplanes of pixels, is disclosed. For each bitplane in a most to least significant order, the method include obtaining a list of significant pixels (LSP), a list of insignificant pixels (LIP), and a list of insignificant sets (LIS) according to a hierarchical ordering of the source image pixels; synchronizing the LSP, LIP and LIS of the source image with the LSP, LIP and LIS of a key image; constructing a temporary list of insignificant sets (TLIS) for the source image; and applying syndrome encoding to the LSP, LIP, and TLIS of the source image to obtain syndromes corresponding to magnitudes and signs of pixels in the source image, wherein the steps are performed in a processor.

Abstract: A multi-stage decoder decodes a block of symbols, received via a noisy channel, to a codeword. The decoder includes multiple sub-decoders connected sequentially, and wherein a next sub-decoder has a slower processing time and better word error rate than a previous sub-decoder, and wherein the next sub-decoder is only executed if the previous decoder fails to decode the block sequence of symbols, and a last sub-decoder is executed until a termination condition is reached.

Abstract: Undetectable errors in packets are minimized by verifying the CRC in each packet, setting a CRC flag to 0 to indicate success, and setting the CRC flag to 1 to indicate failure. If at least one packet in the set of packets fails then generate an error pattern E for each packet by comparing the packet that fails with one packet that passed the CRC verification, and comparing the error pattern to a set of known error patterns. Then, setting a CRC flag to 0 to indicate success and passing the payload of each packet and the CRC flag to the application if the difference is less than a predetermined threshold, and otherwise, setting the CRC flag to 1 to indicate failure.

Abstract: Data are communicated in a wireless network between a transmitter to a receiver. The transmitter estimates a first channel response between the receiver and the transmitter at the transmitter, and generating a first key based on the first channel response. The data are encoded at the transmitter using a rate-adaptive code to produce encoded data, which is scrambling using the first key before broadcasting. Subsequently, the receiver can estimate a second channel response to generate a second key to be used to descramble the broadcast data.

Abstract: An encoded signal is decoded based on statistical dependencies between the encoded signal and the side information. A statistical reliability of each transform block of the side information is determined as a function of absolute values of transform coefficients of a transform block. The transform blocks of the side information are grouped into a set of groups based on the statistical reliability of each transform block. The decoding is performed using a statistical dependency between a transform block of the encoded signal and a group including a corresponding transform block of the side information.

Abstract: The first and second nodes in a wireless network estimate first and second channel response. The first node quantizes the first channel response to produce a first bit sequence, and a feed-forward message, which is transmit as a feed-forward message to the second node. The second node quantizes the second channel response using the feed-forward message to produce and an estimate of the first bit sequence, a second bit sequence and a feed-back message, which is transmitted to the first node. Then, the first and second nodes delete bits in the respective bit sequences using the feed-back and feed-forward message to generate first and second private keys with low bit mismatch rate.

Abstract: Packet in a multimedia stream has and associated standard priority level specified by standard protocols. The standard priority level in input packets received by a home gateway is converted to a harmonized priority level. Then, the input packets are processed in the home gateway according to the harmonized priority level, and converted from the harmonized priority level to the standard priority level in corresponding output packets after the processing.

Abstract: Embodiments of the invention relate to a computer-implemented method and system for providing personalized recommendations for a target user based at least on stored data about the target user. The method comprises obtaining a plurality of feedback data from a plurality of users, wherein the feedback data comprises an indication of a media object, a response obtained from target user related to the feedback data, and at least one demographic data element associated with the target user. A set of personalized recommendations for the target user are identified based at least on stored data about the target user and the feedback data related to the user. The personalized recommendations system identifies media objects to potentially provide to the target user, and selects or filters the identified media objects to form a set of personalized media objects associated with the set of personalized recommendations.

Abstract: A method constructs a code, wherein the code is a large-girth quasi-cyclic low-density parity-check code. A base matrix is selected for the code. A cost matrix corresponding to the base matrix is determined. A single element in the base is changed repeatedly maximize a reduction in cost. A parity check matrix is constructing for the code from the base matrix when the cost is zero, and an information block is encoded as a code word using the parity check matrix in an encoder.

Abstract: Packet in a multimedia stream has and associated standard priority level specified by standard protocols. The standard priority level in input packets received by a home gateway is converted to a harmonized priority level. Then, the input packets are processed in the home gateway according to the harmonized priority level, and converted from the harmonized priority level to the standard priority level in corresponding output packets after the processing.

Abstract: A code to be decoded by message-passing is represented by a factor graph. The factor graph includes variable nodes indexed by i and constraint nodes indexed by a connected by edges for transferring messages mi?a outgoing from the variable nodes to the constraint nodes and messages ma?i incoming from the constraint nodes to the variable nodes. The messages mi?a are initialized based on beliefs bi of a received codeword. The messages ma?i are generated by overshooting the messages mi?a at the constraint nodes. The beliefs bi are updated at the variable nodes using the messages ma?i. The codeword is outputted if found, otherwise, the messages mi?a are updated using a correction for the overshooting.

Abstract: A code to be decoded by message-passing is represented by a factor graph. The factor graph includes variable nodes indexed by i and constraint nodes indexed by a connected by edges for transferring messages mi?a outgoing from the variable nodes to the constraint nodes and messages ma?i incoming from the constraint nodes to the variable nodes. The messages mi?a are initialized based on beliefs bi of a received codeword. The messages ma?i are generated by overshooting the messages mi?a at the constraint nodes. The beliefs bi are updated at the variable nodes using the messages ma?i. The codeword is outputted if found, otherwise, the messages mi?a are updated using a correction for the overshooting.