Abstract: Embodiments of systems and methods for user enrollment in speaker authentication and speaker identification systems are disclosed. In some embodiments, the enrollment process includes collecting speech samples that are examples of multiple speech types spoken by a user, computing a speech representation for each speech sample, and aggregating the example speech representations to form a robust overall representation or user voiceprint of the user's speech.

Abstract: A multi-factor identification system is provided in which enrolled user authentication information is updated in the course of an authorization request based upon at least one of a confidence level of a match between a request first factor identifier, produced based upon first unique user identifying information received with the authentication request, and a respective matching enrolled first factor identifier and a confidence level of a match between a request second factor identifier, produced based upon second unique user identifying information received with the authentication request, and a respective matching enrolled second factor identifier.

Abstract: A method comprises partitioning a data object into a sequence of nested data objects each including fragments having K symbols per fragment. The method further comprises processing the nested data objects to produce sequences of coded payloads corresponding to the nested data objects. The processing includes, for each nested data object: using (n, K) coding for which n>K, individually coding the fragments of the nested data object into codewords with n codeword symbols per codeword; and generating, from the codewords, a sequence of coded payloads that are unique for the nested data object. The method further comprises transmitting coded payloads of the sequences of coded payloads.

Abstract: A multi-factor identification system is provided in which enrolled user authentication information is updated in the course of an authorization request based upon at least one of a confidence level of a match between a request first factor identifier, produced based upon first unique user identifying information received with the authentication request, and a respective matching enrolled first factor identifier and a confidence level of a match between a request second factor identifier, produced based upon second unique user identifying information received with the authentication request, and a respective matching enrolled second factor identifier.

Abstract: Embodiments of systems and methods for user enrollment in speaker authentication and speaker identification systems are disclosed. In some embodiments, the enrollment process includes collecting speech samples that are examples of multiple speech types spoken by a user, computing a speech representation for each speech sample, and aggregating the example speech representations to form a robust overall representation or user voiceprint of the user's speech.

Abstract: An audio encoder can parse a digital audio signal into a plurality of frames, each frame including a specified number of audio samples, perform a transform of the audio samples of each frame to produce a plurality of frequency-domain coefficients for each frame, partition the plurality of frequency-domain coefficients for each frame into a plurality of bands for each frame, each band having a reshaping parameter that represents a time resolution and a frequency resolution, and encode the digital audio signal to a bit stream that includes the reshaping parameters. For a first band, the reshaping parameter can be encoded using a first alphabet size. For a second band, the reshaping parameter can be encoded using a second alphabet size different from the first alphabet size. Using different alphabet sizes can allow for more compact compression in the bit stream.

Abstract: An audio encoder can parse a digital audio signal into a plurality of frames, each frame including a specified number of audio samples, perform a transform of the audio samples of each frame to produce a plurality of frequency-domain coefficients for each frame, partition the plurality of frequency-domain coefficients for each frame into a plurality of bands for each frame, each band having bit data that represents a number of bits allocated for the band, and encode the digital audio signal and difference data to a bit stream (e.g., an encoded digital audio signal). The difference data can produce the full bit data when combined with estimate data that can be computed from data present in the bit stream. The difference data can be compressed to a smaller size than the full bit data, which can reduce the space required in the bit stream.

Abstract: Certain embodiments enable improved encoding and decoding of a vector of coefficients by associating a vector element of a signed pyramid with an encoded value that includes a first portion and a second portion, where the first portion identifies a corresponding vector element of an unsigned pyramid and a second portion characterizes sign values for nonzero components of the vector element of the signed pyramid. As a result, computational constraints such as word size apply to the unsigned pyramid instead of the signed pyramid. The smaller size of the unsigned pyramid enables extending the range of signed pyramid parameters that are operable within the computational constraints.

Abstract: An audio encoder can parse a digital audio signal into a plurality of frames, each frame including a specified number of audio samples, perform a transform of the audio samples of each frame to produce a plurality of frequency-domain coefficients for each frame, partition the plurality of frequency-domain coefficients for each frame into a plurality of bands for each frame, each band having bit data that represents a number of bits allocated for the band, and encode the digital audio signal and difference data to a bit stream (e.g., an encoded digital audio signal). The difference data can produce the full bit data when combined with estimate data that can be computed from data present in the bit stream. The difference data can be compressed to a smaller size than the full bit data, which can reduce the space required in the bit stream.

Abstract: An audio encoder can parse a digital audio signal into a plurality of frames, each frame including a specified number of audio samples, perform a transform of the audio samples of each frame to produce a plurality of frequency-domain coefficients for each frame, partition the plurality of frequency-domain coefficients for each frame into a plurality of bands for each frame, each band having a reshaping parameter that represents a time resolution and a frequency resolution, and encode the digital audio signal to a bit stream that includes the reshaping parameters. For a first band, the reshaping parameter can be encoded using a first alphabet size. For a second band, the reshaping parameter can be encoded using a second alphabet size different from the first alphabet size. Using different alphabet sizes can allow for more compact compression in the bit stream.

Abstract: Certain embodiments enable improved encoding and decoding of a vector of coefficients by associating a vector element of a signed pyramid with an encoded value that includes a first portion and a second portion, where the first portion identifies a corresponding vector element of an unsigned pyramid and a second portion characterizes sign values for nonzero components of the vector element of the signed pyramid. As a result, computational constraints such as word size apply to the unsigned pyramid instead of the signed pyramid. The smaller size of the unsigned pyramid enables extending the range of signed pyramid parameters that are operable within the computational constraints.

Abstract: Lossy compression and transmission of a downmixed composite signal having multiple tracks and objects, including a downmixed signal, is accomplished in a manner that reduces the bit-rate requirement as compared to redundant transmission or lossless compression, while reducing upmix artifacts. A compressed residual signal is generated and transmitted along with a compressed total mix and at least one compressed audio objects. In the reception and upmix aspect the invention decompresses a downmixed signal and other compressed objects, calculates an approximate upmix signal, and corrects specific base signals derived from the upmix, by subtracting a decompressed residual signal. The invention thus allows lossy compression to be used in combination with downmixed audio signals for transmission through a communication channel (or for storage).

Abstract: A distinguished node is dynamically selected from a subset of nodes in a wireless network. Data samples from the subset of nodes are received in view of the distinguished node status. At least one estimate is generated from the data samples and the data samples are compressed conditioned on the estimate.

Abstract: One example disclosed in the application is an electronic data-storage device comprising one or more arrays of memory elements. The data-storage device also includes an error-control-coding encoder that encodes received data and a READ/WRITE controller that writes encoded data received from the error-control-coding encoder to a number of memory elements by applying the switching-inducing force or gradient to the one or more arrays of memory elements until more than a maximum-allowed number of WRITE requests have been queued to the WRITE-request buffer, until feedback signals indicate that the WRITE operation has completed, or until the switching-inducing force or gradient has been applied for a maximum application time.

Abstract: Lossy compression and transmission of a downmixed composite signal having multiple tracks and objects, including a downmixed signal, is accomplished in a manner that reduces the bit-rate requirement as compared to redundant transmission or lossless compression, while reducing upmix artifacts. A compressed residual signal is generated and transmitted along with a compressed total mix and at least one compressed audio objects. In the reception and upmix aspect the invention decompresses a downmixed signal and other compressed objects, calculates an approximate upmix signal, and corrects specific base signals derived from the upmix, by subtracting a decompressed residual signal. The invention thus allows lossy compression to be used in combination with downmixed audio signals for transmission through a communication channel (or for storage).

Abstract: According to an example, in a method to manage access to a memory array, a bit string may be encoded with a rank metric code encoder to generate a rank metric codeword having an encoded binary array. The encoded binary array may be modifies so each row of the encoded binary array has at most half of the row with a first bit value and each column of the encoded binary array has at most half of the column with the first bit value. The modified binary array may be stored into corresponding memory devices of the memory array. In addition, the memory array may be read to retrieve a corrupted binary array having a corrupted rank metric codeword and the corrupted rank metric codeword may be decoded with a rank metric code decoder to recover the bit string.

Abstract: A method is provided to manage access to a memory array. The method includes encoding a bit string with a rank metric encoder to generate an encoded binary array, modifying the encoded binary array so each row has at most half of the row with a bit value and each column has at most half of the column with the bit value, and storing the modified binary array into corresponding memory devices of the memory array.

Abstract: A method of storing data into a memory array converts an input string into a first binary array with (m?1) rows and (n?1) columns. A second binary array with m rows and n columns in an encoded bit pattern is then generated from the first binary array. The second binary array in the encoded bit pattern has at most n/2 1's in each row and at most m/2 1's in each column, and the m-th row and an n-th column contain information for decoding other entries of the second binary array. The encoded bit pattern of the second binary array is then stored into corresponding memory devices of the memory array.

Abstract: A multi-state memory system with encoding that minimizes half-select currents. The system includes an array of row and column conductors with a plurality of storage cells each capable of being placed into any of three or more physical states. An encoder is connected to receive data bits for storage and to apply activation signals to the row and column conductors to write information to the storage cells. The encoder is programmed to encode the data bits into entries in an array having one row corresponding with each row conductor and one column corresponding with each column conductor; select entries in the array according to half-select currents of the storage cells; apply a predetermined one-dimensional mapping that increases the value of at most one entry in the array to obtain a mapped array; and write entries of the mapped array into the storage cells.

Abstract: A programmable crossbar array with inline fuses includes a layer of row lines and a layer of column lines with the row lines crossing over the column lines to form junctions and resistive memory elements sandwiched between row lines and a column lines at the junctions. Inline fuses are located in either the row lines, column lines or both. The inline fuses are interposed between the support circuitry and the resistive memory elements. A method for mitigating shorts in a crossbar array is also provided.