Abstract: The burden of designing multiple training sequences for systems having multiple transmit antennas, is drastically reduced by employing a single sequence from which the necessary multiple sequences are developed. The single sequence is selected to create sequences that have an impulse-like autocorrelation function and zero cross correlations. A sequence of any desired length Nt can be realized for an arbitrary number of channel taps, L. The created sequences can be restricted to a standard constellation (that is used in transmitting information symbols) so that a common constellation mapper is used for both the information signals and the training sequence. In some applications a training sequence may be selected so that it is encoded with the same encoder that is used for encoding information symbols. Both block and trellis coding is possible in embodiments that employ this approach.

Abstract: The burden of designing multiple training sequences for systems having multiple transmit antennas, is drastically reduced by employing a single sequence from which the necessary multiple sequences are developed. The single sequence is selected to create sequences that have an impulse-like autocorrelation function and zero cross correlations. A sequence of any desired length Nt can be realized for an arbitrary number of channel taps, L. The created sequences can be restricted to a standard constellation (that is used in transmitting information symbols) so that a common constellation mapper is used for both the information signals and the training sequence. In some applications a training sequence may be selected so that it is encoded with the same encoder that is used for encoding information symbols. Both block and trellis coding is possible in embodiments that employ this approach.

Abstract: The burden of designing multiple training sequences for systems having multiple transmit antennas, is drastically reduced by employing a single sequence from which the necessary multiple sequences are developed. The single sequence is selected to create sequences that have an impulse-like autocorrelation function and zero cross correlations. A sequence of any desired length Nt can be realized for an arbitrary number of channel taps, L. The created sequences can be restricted to a standard constellation (that is used in transmitting information symbols) so that a common constellation mapper is used for both the information signals and the training sequence. In some applications a training sequence may be selected so that it is encoded with the same encoder that is used for encoding information symbols. Both block and trellis coding is possible in embodiments that employ this approach.

Abstract: A system and method of generating a watermarked signal are disclosed. The system segments the signal into overlapping blocks using a window function and processes the overlapping blocks according to whether each block is odd- or even-numbered. The system windows the odd-numbered blocks, modulates the phase of each block in the frequency domain, transforms each modulated block in the time domain, windows each block transformed into the time domain and overlap-adds each odd-numbered block with each even-numbered block to generate the watermarked signal.

Abstract: This invention provides an iterative process to maximum a posteriori (MAP) decoding. The iterative process uses an auxiliary function which is defined in terms of a complete data probability distribution. The auxiliary function is derived based on an expectation maximization (EM) algorithm. For a special case of trellis coded modulators, the auxiliary function may be iteratively evaluated by a combination of forward-backward and Viterbi algorithms. The iterative process converges monotonically and thus improves the performance of any decoding algorithm. The MAP decoding minimizes a probability of error. A direct approach to achieve this minimization results in complexity which grows exponentially with T, where T is the size of the input. The iterative process avoids this complexity by converging on the MAP solution through repeated maximization of the auxiliary function.

Abstract: A system, method and computer readable medium that processing a watermarked signal using the phase Sk(f) of an original signal. The watermarked signal includes odd and even overlapped blocks where the watermark is contained in the even blocks. The method comprises test-decoding the watermarked signal and, if the watermarked signal contains errors, recoding the watermarked signal with a higher redundancy code. The steps of test-decoding and recording may be performed until all errors are corrected.

Abstract: A training sequence is created for space-time diversity arrangement, having any training sequence length, while limiting the training sequence to a standard constellation. Given a number of channel unknowns that need to be estimated, L, a training sequence can be creates that yields minimum means squared estimation error for lengths Nt=kNPRUS+L?1, for any positive integer k?1, where NPRUS is a selected perfect roots-of-unity sequence (PRUS) of length N. The training sequence is created by concatenating k of the length N perfect roots-of-unity sequences, followed by L?1 initial symbols of that same PRUS. Good training sequences can be created for lengths Nt that cannot be obtained through the above method by concatenating a requisite number of symbols found through an exhaustive search.

Abstract: A system and method of retrieving a watermark in a watermarked signal are disclosed. The watermarked signal comprises odd and even overlapped blocks where the watermark is contained in the even blocks. The method comprises, for each k-th even block, subtracting the two adjacent odd numbered blocks from the k-th even block of the watermarked signal to retrieve s *k(n), transforming s *k(n) into the frequency domain to generate S k(f), calculating a phase of S k(f) as ? (f) and a phase of Sk(f) as ?(f), calculating the difference ? (f) between ? (f) and ?(f), unwrapping ? (f) to obtain the phase modulation {tilde over (?)} k(f), and using a Viterbi search to retrieve the watermark embedded in {tilde over (?)} k(f).

Abstract: The burden of designing multiple training sequences for systems having multiple transmit antennas, is drastically reduced by employing a single sequence from which the necessary multiple sequences are developed. The single sequence is selected to create sequences that have an impulse-like autocorrelation function and zero cross correlations. A sequence of any desired length Nt can be realized for an arbitrary number of channel taps, L. The created sequences can be restricted to a standard constellation (that is used in transmitting information symbols) so that a common constellation mapper is used for both the information signals and the training sequence. In some applications a training sequence may be selected so that it is encoded with the same encoder that is used for encoding information symbols. Both block and trellis coding is possible in embodiments that employ this approach.

Abstract: The burden of designing multiple training sequences for systems having multiple transmit antennas, is drastically reduced by employing a single sequence from which the necessary multiple sequences are developed. The single sequence is selected to create sequences that have an impulse-like autocorrelation function and zero cross correlations. A sequence of any desired length Nt can be realized for an arbitrary number of channel taps, L. The created sequences can be restricted to a standard constellation (that is used in transmitting information symbols) so that a common constellation mapper is used for both the information signals and the training sequence. In some applications a a training sequence may be selected so that it is encoded with the same encoder that is used for encoding information symbols. Both block and trellis coding is possible in embodiments that employ this approach.

Abstract: This invention provides an iterative process to maximum a posteriori (MAP) decoding. The iterative process uses an auxiliary function which is defined in terms of a complete data probability distribution. The auxiliary function is derived based on an expectation maximization (EM) algorithm. For a special case of trellis coded modulators, the auxiliary function may be iteratively evaluated by a combination of forward-backward and Viterbi algorithms. The iterative process converges monotonically and thus improves the performance of any decoding algorithm. The MAP decoding minimizes a probability of error. A direct approach to achieve this minimization results in complexity which grows exponentially with T, where T is the size of the input. The iterative process avoids this complexity by converging on the MAP solution through repeated maximization of the auxiliary function.

Abstract: A training sequence is created for space-time diversity arrangement, having any training sequence length, while limiting the training sequence to a standard constellation. Given a number of channel unknowns that need to be estimated, L, a training sequence can be creates that yields minimum means squared estimation error for lengths Nt=kNPRUS+L?1, for any positive integer k?1, where NPRUS is a selected perfect roots-of-unity sequence (PRUS) of length N. The training sequence is created by concatenating k of the length N perfect roots-of-unity sequences, followed by L?1 initial symbols of that same PRUS. Good training sequences can be created for lengths Nt that cannot be obtained through the above method by concatenating a requisite number of symbols found through an exhaustive search.

Abstract: A training sequence is created for space-time diversity arrangement, having any training sequence length, while limiting the training sequence to a standard constellation. Given a number of channel unknowns that need to be estimated, L, a training sequence can be creates that yields minimum means squared estimation error for lengths Nt=kNPRUS+L?1, for any positive integer k?1, where NPRUS a selected perfect roots-of-unity sequence (PRUS) of length N. The training sequence is created by concatenating k of the length N perfect roots-of-unity sequences, followed by L?1 initial symbols of that same PRUS. Good training sequences can be created for lengths Nt that cannot be obtained through the above method by concatenating a requisite number of symbols found through an exhaustive search.

Abstract: This invention provides an iterative process to maximum a posteriori (MAP) decoding. The iterative process uses an auxiliary function which is defined in terms of a complete data probability distribution. The auxiliary function is derived based on an expectation maximization (EM) algorithm. For a special case of trellis coded modulators, the auxiliary function may be iteratively evaluated by a combination of forward-backward and Viterbi algorithms. The iterative process converges monotonically and thus improves the performance of any decoding algorithm. The MAP decoding minimizes a probability of error. A direct approach to achieve this minimization results in complexity which grows exponentially with T, where T is the size of the input. The iterative process avoids this complexity by converging on the MAP solution through repeated maximization of the auxiliary function.

Abstract: A system and method of retrieving a watermark in a watermarked signal are disclosed. The watermarked signal comprises odd and even overlapped blocks where the watermark is contained in the even blocks. The method comprises, for each k-th even block, subtracting the two adjacent odd numbered blocks from the k-th even block of the watermarked signal to retrieve s*k(n), transforming s*k(n) into the frequency domain to generate Sk(ƒ), calculating a phase of Sk(ƒ) as ?(ƒ) and a phase of Sk(ƒ) as ?(ƒ), calculating the difference ?(ƒ) between ?(ƒ) and ?(ƒ), unwrapping ?(ƒ) to obtain the phase modulation {tilde over (?)}k(ƒ), and using a Viterbi search to retrieve the watermark embedded in {tilde over (?)}k(ƒ).

Abstract: A system and method of generating a watermarked signal are disclosed. The system segments the signal into overlapping blocks using a window function and processes the overlapping blocks according to whether each block is odd- or even-numbered. The system windows the odd-numbered blocks, modulates the phase of each block in the frequency domain, transforms each modulated block in the time domain, windows each block transformed into the time domain and overlap-adds each odd-numbered block with each even-numbered block to generate the watermarked signal.

Abstract: A system and method of retrieving a watermark in a watermarked signal are disclosed. The watermarked signal comprises odd and even overlapped blocks where the watermark is contained in the even blocks. The method comprises, for each k-th even block, subtracting the two adjacent odd numbered blocks from the k-th even block of the watermarked signal to retrieve s*k(n), transforming s*k(n) into the frequency domain to generate Sk(f), calculating a phase of Sk(f) as ?(f) and a phase of Sk(f) as ?(f), calculating the difference ?(f) between ?(f) and ?(f), unwrapping ?(f) to obtain the phase modulation {tilde over (?)}k(f), and using a Viterbi search to retrieve the watermark embedded in {tilde over (?)}k(f).

Abstract: This invention provides an iterative process to maximum a posteriori (MAP) decoding. The iterative process uses an auxiliary function which is defined in terms of a complete data probability distribution. The auxiliary function is derived based on an expectation maximization (EM) algorithm. For a special case of trellis coded modulators, the auxiliary function may be iteratively evaluated by a combination of forward-backward and Viterbi algorithms. The iterative process converges monotonically and thus improves the performance of any decoding algorithm. The MAP decoding minimizes a probability of error. A direct approach to achieve this minimization results in complexity which grows exponentially with T, where T is the size of the input. The iterative process avoids this complexity by converging on the MAP solution through repeated maximization of the auxiliary function.

Abstract: A method of retrieving a watermark in a watermarked signal involves processing a signal having odd- and even-overlapped blocks and where the watermark is contained in the even blocks. For each k-th block, the method comprises subtracting the odd-numbered blocks from the k-th block of the watermarked signal to generate s*k(n), applying an FFT to s*k(n) to generate a phase Sk(ƒ), calculating a phase of Sk(ƒ) as ?(ƒ) and a phase of an original signal Sk(ƒ) as ?(ƒ), calculating the difference ?(ƒ) between ?(ƒ) and ?(ƒ); and retrieving the watermark embedded in ?(ƒ). A Viterbi search may be the algorithm used to retrieve the watermark.

Abstract: The burden of designing multiple training sequences for systems having multiple transmit antennas, is drastically reduced by employing a single sequence from which the necessary multiple sequences are developed. The single sequence is selected to create sequences that have an impulse-like autocorrelation function and zero cross correlations. A sequence of any desired length Nt can be realized for an arbitrary number of channel taps, L. The created sequences can be restricted to a standard constellation (that is used in transmitting information symbols) so that a common constellation mapper is used for both the information signals and the training sequence. In some applications a a training sequence may be selected so that it is encoded with the same encoder that is used for encoding information symbols. Both block and trellis coding is possible in embodiments that employ this approach.