Creating training sequences for space-time diversity arrangements
    1.
    发明授权
    Creating training sequences for space-time diversity arrangements 有权
    创建时空多样性安排的训练序列

    公开(公告)号:US07668255B1

    公开(公告)日:2010-02-23

    申请号:US11488342

    申请日:2006-07-18

    摘要: 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.

    摘要翻译: 为具有任何训练序列长度的时空分集排列创建训练序列,同时将训练序列限制为标准星座。 给定需要估计的多个信道未知数L,可以创建训练序列,对于任何正整数k&nlE,其长度Nt = kNPRUS + L-1产生最小均方估计误差;其中NPRUS选择完美 长度为N的根序列(PRUS)。通过连接长度为N的完美根序列序列的k,随后是相同PRUS的L-1个初始符号来创建训练序列。 可以通过连接通过穷举搜索找到的必需数量的符号,通过上述方法无法获得长度Nt的良好训练序列。

    Training-based channel estimation for multiple-antennas
    2.
    发明授权
    Training-based channel estimation for multiple-antennas 有权
    基于训练的多天线信道估计

    公开(公告)号:US08942335B2

    公开(公告)日:2015-01-27

    申请号:US12777421

    申请日:2010-05-11

    摘要: 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.

    摘要翻译: 为具有多个发射天线的系统设计多个训练序列的负担通过采用从其开发必需的多个序列的单个序列而大大降低。 选择单个序列以创建具有脉冲状自相关函数和零交叉相关的序列。 可以对任意数量的信道抽头L实现任何期望长度Nt的序列。所创建的序列可以被限制为标准星座(用于发送信息符号),使得公共星座映射器被用于 信息信号和训练序列。 在一些应用中,可以选择训练序列,使得它用与编码信息符号相同的编码器进行编码。 在采用这种方法的实施例中,块和网格编码都是可能的。

    Training-Based Channel Estimation for Multiple-Antennas
    3.
    发明申请
    Training-Based Channel Estimation for Multiple-Antennas 有权
    基于训练的多天线信道估计

    公开(公告)号:US20100220803A1

    公开(公告)日:2010-09-02

    申请号:US12777421

    申请日:2010-05-11

    IPC分类号: H04B7/02

    摘要: 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.

    摘要翻译: 为具有多个发射天线的系统设计多个训练序列的负担通过采用从其开发必需的多个序列的单个序列而大大降低。 选择单个序列以创建具有脉冲状自相关函数和零交叉相关的序列。 可以对任意数量的信道抽头L实现任何期望长度Nt的序列。所创建的序列可以被限制为标准星座(用于发送信息符号),使得公共星座映射器被用于 信息信号和训练序列。 在一些应用中,可以选择训练序列,使得它用与编码信息符号相同的编码器进行编码。 在采用这种方法的实施例中,块和网格编码都是可能的。

    Training-based channel estimation for multiple-antennas
    4.
    发明授权
    Training-based channel estimation for multiple-antennas 有权
    基于训练的多天线信道估计

    公开(公告)号:US07746945B2

    公开(公告)日:2010-06-29

    申请号:US11190403

    申请日:2005-07-27

    IPC分类号: H04B7/02 H04L1/02

    摘要: 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.

    摘要翻译: 为具有多个发射天线的系统设计多个训练序列的负担通过采用从其开发必需的多个序列的单个序列而大大降低。 选择单个序列以创建具有脉冲状自相关函数和零交叉相关的序列。 可以对任意数量的信道抽头L实现任何期望长度Nt的序列。所创建的序列可以被限制为标准星座(用于发送信息符号),使得公共星座映射器被用于 信息信号和训练序列。 在一些应用中,可以选择训练序列,使得它用与用于对信息符号进行编码的相同编码器进行编码。 在采用这种方法的实施例中,块和网格编码都是可能的。

    Creating training sequences for space-time diversity arrangements
    5.
    发明授权
    Creating training sequences for space-time diversity arrangements 有权
    创建时空多样性安排的训练序列

    公开(公告)号:US07826559B2

    公开(公告)日:2010-11-02

    申请号:US12638032

    申请日:2009-12-15

    摘要: 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.

    摘要翻译: 为具有任何训练序列长度的时空分集排列创建训练序列,同时将训练序列限制为标准星座。 给定需要估计的多个信道未知数L,可以创建训练序列,对于任何正整数k≥1,对于长度Nt = kNPRUS + L-1,产生最小均方估计误差,其中NPRUS是被选择的 完整的长度为N的根系序列(PRUS)。训练序列通过连接长度为N的完美根序列序列的k,随后是相同PRUS的L-1个初始符号来创建。 可以通过连接通过穷举搜索找到的必需数量的符号,通过上述方法无法获得长度Nt的良好训练序列。

    Training-based channel estimation for multiple-antennas
    6.
    发明授权
    Training-based channel estimation for multiple-antennas 有权
    基于训练的多天线信道估计

    公开(公告)号:US06959047B1

    公开(公告)日:2005-10-25

    申请号:US09956648

    申请日:2001-09-20

    摘要: 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.

    摘要翻译: 为具有多个发射天线的系统设计多个训练序列的负担通过采用从其开发必需的多个序列的单个序列而大大降低。 选择单个序列以创建具有脉冲状自相关函数和零交叉相关的序列。 可以为任意数量的信道抽头L实现任何期望长度N t的序列。所创建的序列可以被限制为标准星座(用于发送信息符号),使得 公共星座映射器用于信息信号和训练序列。 在一些应用中,可以选择训练序列,使得它用与用于对信息符号进行编码的相同编码器进行编码。 在采用这种方法的实施例中,块和网格编码都是可能的。

    Creating Training Sequences for Space-Time Diversity Arrangements
    7.
    发明申请
    Creating Training Sequences for Space-Time Diversity Arrangements 有权
    为时空多样性安排创建训练序列

    公开(公告)号:US20100091890A1

    公开(公告)日:2010-04-15

    申请号:US12638032

    申请日:2009-12-15

    IPC分类号: H04L27/00

    摘要: 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.

    摘要翻译: 为具有任何训练序列长度的时空分集排列创建训练序列,同时将训练序列限制为标准星座。 给定需要估计的多个信道未知数L,可以创建训练序列,对于任何正整数k≥1,对于长度Nt = kNPRUS + L-1,产生最小均方估计误差,其中NPRUS是被选择的 完整的长度为N的根系序列(PRUS)。训练序列通过连接长度为N的完美根序列序列的k,随后是相同PRUS的L-1个初始符号来创建。 可以通过连接通过穷举搜索找到的必需数量的符号,通过上述方法无法获得长度Nt的良好训练序列。

    Creating training sequences for space-time diversity arrangements
    8.
    发明授权
    Creating training sequences for space-time diversity arrangements 有权
    创建时空多样性安排的训练序列

    公开(公告)号:US07154964B1

    公开(公告)日:2006-12-26

    申请号:US09957293

    申请日:2001-09-20

    IPC分类号: H04L27/04

    摘要: 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.

    摘要翻译: 为具有任何训练序列长度的时空分集排列创建训练序列,同时将训练序列限制为标准星座。 给定需要估计的多个信道未知数,L,可以创建训练序列,其产生长度为N N的最小均方估计误差 -1,对于任何正整数k> = 1,其中N PRUS 是长度为N的精确完全根系序列(PRUS)。训练序列是通过连接长度为k的k来创建的 N个完美的单一序列序列,其次是同一PRUS的L-1个初始符号。 可以通过连接通过穷举搜索找到的必需数量的符号,通过上述方法不能获得长度为N 的良好训练序列。

    System and method of retrieving a watermark within a signal
    10.
    发明授权
    System and method of retrieving a watermark within a signal 失效
    在信号中检索水印的系统和方法

    公开(公告)号:US07802101B2

    公开(公告)日:2010-09-21

    申请号:US12414602

    申请日:2009-03-30

    CPC分类号: G10L19/018

    摘要: 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).

    摘要翻译: 公开了一种在水印信号中检索水印的系统和方法。 水印信号包括奇偶重叠块,其中水印包含在偶数块中。 该方法包括对于每个第k个偶数块,从水印信号的第k个偶数块中减去两个相邻的奇数块,以检索s * k(n),将s * k(n)变换为频域 以产生S k(f),计算S k(f)的相位为&phgr; (f)和Sk(f)的阶段,(f),计算&phgr;(f)之间的差Ψ(f) (f)和(f),展开Ψ(f)以获得相位调制(())(k)(f)的波形,并使用维特比搜索来检索嵌入在{ k(f)。