专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07668255B1 Creating training sequences for space-time diversity arrangements 有权
标题翻译：创建时空多样性安排的训练序列
公开(公告)号：US07668255B1
公开(公告)日：2010-02-23
申请号：US11488342
申请日：2006-07-18
申请人： Naofal Al-Dhahir , Christine Fragouli , William Turin
发明人： Naofal Al-Dhahir , Christine Fragouli , William Turin
IPC分类号： H04L27/00 , H04L27/28 , H04L27/06 , H04L7/10
CPC分类号： H04L1/0618 , H04L25/0204 , H04L25/0212 , H04L25/0224
摘要： 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的良好训练序列。

2. 发明授权

US08942335B2 Training-based channel estimation for multiple-antennas 有权
标题翻译：基于训练的多天线信道估计
公开(公告)号：US08942335B2
公开(公告)日：2015-01-27
申请号：US12777421
申请日：2010-05-11
申请人： Naofal Al-Dhahir , Christine Fragouli , William Turin
发明人： Naofal Al-Dhahir , Christine Fragouli , William Turin
IPC分类号： H04B7/02 , H04L1/02 , H04B7/08 , H04B7/06 , H04L1/06 , H04L25/02 , H04L25/03
CPC分类号： H04B7/0684 , H04B7/0669 , H04B7/0848 , H04B7/0851 , H04B7/0854 , H04B7/0882 , H04L1/0618 , H04L25/0204 , H04L25/03006
摘要： 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的序列。所创建的序列可以被限制为标准星座（用于发送信息符号），使得公共星座映射器被用于信息信号和训练序列。在一些应用中，可以选择训练序列，使得它用与编码信息符号相同的编码器进行编码。在采用这种方法的实施例中，块和网格编码都是可能的。

3. 发明申请

US20100220803A1 Training-Based Channel Estimation for Multiple-Antennas 有权
标题翻译：基于训练的多天线信道估计
公开(公告)号：US20100220803A1
公开(公告)日：2010-09-02
申请号：US12777421
申请日：2010-05-11
申请人： Naofal Al-Dhahir , Christine Fragouli , William Turin
发明人： Naofal Al-Dhahir , Christine Fragouli , William Turin
IPC分类号： H04B7/02
CPC分类号： H04B7/0684 , H04B7/0669 , H04B7/0848 , H04B7/0851 , H04B7/0854 , H04B7/0882 , H04L1/0618 , H04L25/0204 , H04L25/03006
摘要： 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的序列。所创建的序列可以被限制为标准星座（用于发送信息符号），使得公共星座映射器被用于信息信号和训练序列。在一些应用中，可以选择训练序列，使得它用与编码信息符号相同的编码器进行编码。在采用这种方法的实施例中，块和网格编码都是可能的。

4. 发明授权

US07746945B2 Training-based channel estimation for multiple-antennas 有权
标题翻译：基于训练的多天线信道估计
公开(公告)号：US07746945B2
公开(公告)日：2010-06-29
申请号：US11190403
申请日：2005-07-27
申请人： Naofal Al-Dhahir , Christine Fragouli , William Turin
发明人： Naofal Al-Dhahir , Christine Fragouli , William Turin
IPC分类号： H04B7/02 , H04L1/02
CPC分类号： H04B7/0684 , H04B7/0669 , H04B7/0848 , H04B7/0851 , H04B7/0854 , H04B7/0882 , H04L1/0618 , H04L25/0204 , H04L25/03006
摘要： 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的序列。所创建的序列可以被限制为标准星座（用于发送信息符号），使得公共星座映射器被用于信息信号和训练序列。在一些应用中，可以选择训练序列，使得它用与用于对信息符号进行编码的相同编码器进行编码。在采用这种方法的实施例中，块和网格编码都是可能的。

5. 发明申请

US20100091890A1 Creating Training Sequences for Space-Time Diversity Arrangements 有权
标题翻译：为时空多样性安排创建训练序列
公开(公告)号：US20100091890A1
公开(公告)日：2010-04-15
申请号：US12638032
申请日：2009-12-15
申请人： Naofal Al-Dhahir , Christine Fragouli , William Turin
发明人： Naofal Al-Dhahir , Christine Fragouli , William Turin
IPC分类号： H04L27/00
CPC分类号： H04L1/0618 , H04L25/0204 , H04L25/0212 , H04L25/0224
摘要： 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的良好训练序列。

6. 发明授权

US07154964B1 Creating training sequences for space-time diversity arrangements 有权
标题翻译：创建时空多样性安排的训练序列
公开(公告)号：US07154964B1
公开(公告)日：2006-12-26
申请号：US09957293
申请日：2001-09-20
申请人： Naofal Al-Dhahir , Christine Fragouli , William Turin
发明人： Naofal Al-Dhahir , Christine Fragouli , William Turin
IPC分类号： H04L27/04
CPC分类号： H04L1/0618 , H04L25/0204 , H04L25/0212 , H04L25/0224
摘要： 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 的良好训练序列。

7. 发明申请

US20050265478A1 Training-based channel estimation for multiple-antennas 有权
公开(公告)号：US20050265478A1
公开(公告)日：2005-12-01
申请号：US11190403
申请日：2005-07-27
申请人： Naofal Al-Dhahir , Christine Fragouli , William Turin
发明人： Naofal Al-Dhahir , Christine Fragouli , William Turin
IPC分类号： H04B7/02 , H04B7/08 , H04L1/00 , H04L1/02 , H04L1/06 , H04L25/02 , H04L25/03 , H04L25/08
CPC分类号： H04B7/0684 , H04B7/0669 , H04B7/0848 , H04B7/0851 , H04B7/0854 , H04B7/0882 , H04L1/0618 , H04L25/0204 , H04L25/03006
摘要： 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.

8. 发明授权

US07826559B2 Creating training sequences for space-time diversity arrangements 有权
标题翻译：创建时空多样性安排的训练序列
公开(公告)号：US07826559B2
公开(公告)日：2010-11-02
申请号：US12638032
申请日：2009-12-15
申请人： Naofal Al-Dhahir , Christine Fragouli , William Turin
发明人： Naofal Al-Dhahir , Christine Fragouli , William Turin
IPC分类号： H04L27/00 , H04L27/28 , H04L27/06 , H04L7/10
CPC分类号： H04L1/0618 , H04L25/0204 , H04L25/0212 , H04L25/0224
摘要： 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的良好训练序列。

9. 发明授权

US06959047B1 Training-based channel estimation for multiple-antennas 有权
标题翻译：基于训练的多天线信道估计
公开(公告)号：US06959047B1
公开(公告)日：2005-10-25
申请号：US09956648
申请日：2001-09-20
申请人： Naofal Al-Dhahir , Christine Fragouli , William Turin
发明人： Naofal Al-Dhahir , Christine Fragouli , William Turin
IPC分类号： H04B7/02 , H04B7/08 , H04L1/00 , H04L1/02 , H04L1/06 , H04L25/02 , H04L25/03 , H04L25/08
CPC分类号： H04B7/0684 , H04B7/0669 , H04B7/0848 , H04B7/0851 , H04B7/0854 , H04B7/0882 , H04L1/0618 , H04L25/0204 , H04L25/03006
摘要： 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的序列。所创建的序列可以被限制为标准星座（用于发送信息符号），使得公共星座映射器用于信息信号和训练序列。在一些应用中，可以选择训练序列，使得它用与用于对信息符号进行编码的相同编码器进行编码。在采用这种方法的实施例中，块和网格编码都是可能的。

10. 发明授权

US09008205B1 Method and apparatus for designing finite-length multi-input multi-output channel shortening pre-filters 有权
标题翻译：用于设计有限长度多输入多输出通道缩短预滤波器的方法和装置
公开(公告)号：US09008205B1
公开(公告)日：2015-04-14
申请号：US11227626
申请日：2005-09-15
申请人： Naofal Al-Dhahir
发明人： Naofal Al-Dhahir
IPC分类号： H04B7/08 , H04B1/58
CPC分类号： H04B1/58 , H04B7/0413
摘要： A multi-input, multi-output pre-filter improves operation of a multi-input receiver by shortening the effective memory of the channel with a set of FIR filters. The coefficients of these FIR filters can be fashioned to provide a variety of controls by the designer, for example, the value of the effective memory.
摘要翻译：多输入多输出预滤波器通过一组FIR滤波器缩短信道的有效存储器来改善多输入接收机的操作。这些FIR滤波器的系数可以被设计成为设计者提供各种控制，例如有效存储器的值。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式