公开(公告)号：US20130308700A1

公开(公告)日：2013-11-21

申请号：US13475350

申请日：2012-05-18

申请人： Toshiaki Koike-Akino ,  Jesper H. Soerensen ,  Philip Orlik

发明人： Toshiaki Koike-Akino ,  Jesper H. Soerensen ,  Philip Orlik

IPC分类号： H04N7/26

CPC分类号： H04N19/164 ,  H03M13/373 ,  H03M13/3761

摘要： A method and system use capacity-approaching rateless code to communicate multimedia data even with very short codewords, such as 64 bits or less, via erasure and noise channels. The method provides a way to design the edge degree distribution of rateless codes for any arbitrary channel. Based on an equivalent metric of decoding behavior in any channels, the degree distribution of a rateless code such as Luby-transform codes and raptor codes is optimized based on in-process status of decoding. A regularized least-squares optimization is used to avoid erroneous decoding. Multiple feedbacks can further improve the performance.

摘要翻译： 一种方法和系统使用容量接近的无码代码即使通过擦除和噪声信道的诸如64位或更少的非常短的码字来传送多媒体数据。 该方法提供了一种设计任意任意通道的无码代码边缘度分布的方法。 基于任何通道中的解码行为的等效度量，基于解码的进程内状态来优化诸如Luby变换代码和猛禽代码之类的无码代码的度分布。 使用正则化的最小二乘优化来避免错误的解码。 多个反馈可以进一步提高性能。

公开(公告)号：US09215457B2

公开(公告)日：2015-12-15

申请号：US13475350

申请日：2012-05-18

申请人： Toshiaki Koike-Akino ,  Jesper H Soerensen ,  Philip Orlik

发明人： Toshiaki Koike-Akino ,  Jesper H Soerensen ,  Philip Orlik

IPC分类号： H04N7/26 ,  H04N19/164 ,  H03M13/37

CPC分类号： H04N19/164 ,  H03M13/373 ,  H03M13/3761

摘要： A method and system use capacity-approaching rateless code to communicate multimedia data even with very short codewords, such as 64 bits or less, via erasure and noise channels. The method provides a way to design the edge degree distribution of rateless codes for any arbitrary channel. Based on an equivalent metric of decoding behavior in any channels, the degree distribution of a rateless code such as Luby-transform codes and raptor codes is optimized based on in-process status of decoding. A regularized least-squares optimization is used to avoid erroneous decoding. Multiple feedbacks can further improve the performance.

摘要翻译： 一种方法和系统使用容量接近的无码代码即使通过擦除和噪声信道的诸如64位或更少的非常短的码字来传送多媒体数据。 该方法提供了一种设计任意任意通道的无码代码边缘度分布的方法。 基于任何通道中的解码行为的等效度量，基于解码的进程内状态来优化诸如Luby变换代码和猛禽代码之类的无码代码的度分布。 使用正则化的最小二乘优化来避免错误的解码。 多个反馈可以进一步提高性能。

公开(公告)号：US08553792B2

公开(公告)日：2013-10-08

申请号：US13007523

申请日：2011-01-14

申请人： Toshiaki Koike-Akino ,  Philip V. Orlik

发明人： Toshiaki Koike-Akino ,  Philip V. Orlik

IPC分类号： H04L23/02

CPC分类号： H04L1/0034 ,  H04L1/0038 ,  H04L1/006 ,  H04L1/0077 ,  H04L1/0625 ,  H04L2001/0097

摘要： This invention provides a method for jointly optimizing network coding, channel coding, and signal constellations in non-coherent wireless multiple-input multiple-output (MIMO) wireless relay networks for the case when transceivers cannot obtain any knowledge of channel state information (CSI) due to high-speed mobility of the transceivers. In the relay networks, two terminal transceivers simultaneously transmit data to an intermediate relaying transceiver, which in turn broadcasts mixed data using physical-layer network coding to both terminals. The embodiments of this invention exploit different blind space-time trellis-coded modulations (ST-TCM) for each user, whose codebook is jointly generated over a Grassmannian manifold. The method is provided by exponential mapping with affine-lattice convolution for joint optimization of channel coding, modulations, and network coding. The method is designed for fast fading channels with and without interleaving. The method significantly improves performance in non-coherent bidirectional relaying MIMO networks.

摘要翻译： 本发明提供了一种用于在收发机不能获得信道状态信息（CSI）的任何知识的情况下联合优化非相干无线多输入多输出（MIMO）无线中继网络中的网络编码，信道编码和信号星座的方法， 由于收发器的高速移动性。 在中继网络中，两个终端收发器同时向中间中继收发器发送数据，中继中继收发机又将物理层网络编码的混合数据广播到两个终端。 本发明的实施例针对每个用户利用不同的盲时空网格编码调制（ST-TCM），其码本通过Grassmannian流形共同生成。 该方法通过用仿射网格卷积的指数映射提供，用于信道编码，调制和网络编码的联合优化。 该方法设计用于具有和不具有交织的快速衰落信道。 该方法显着提高了非相干双向中继MIMO网络中的性能。

公开(公告)号：US08483387B2

公开(公告)日：2013-07-09

申请号：US12962449

申请日：2010-12-07

申请人： Ramesh Annavajjala ,  Wei Liu ,  Chunjie Duan ,  Toshiaki Koike-Akino ,  Yige Wang

发明人： Ramesh Annavajjala ,  Wei Liu ,  Chunjie Duan ,  Toshiaki Koike-Akino ,  Yige Wang

IPC分类号： H04L29/06

CPC分类号： H04L9/0875 ,  H04L2209/80 ,  H04W12/02 ,  H04W12/04

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

摘要翻译： 无线网络中的第一和第二节点估计第一和第二信道响应。 第一节点量化第一信道响应以产生第一比特序列，以及作为前馈消息作为第二节点发送的前馈消息。 第二节点使用前馈消息量化第二信道响应，以产生第一比特序列，第二比特序列和反馈消息的估计，其被发送到第一节点。 然后，第一和第二节点使用反馈和前馈消息删除各个比特序列中的比特，以产生具有低比特失配率的第一和第二私钥。

公开(公告)号：US20130170842A1

公开(公告)日：2013-07-04

申请号：US13343133

申请日：2012-01-04

申请人： Toshiaki Koike-Akino ,  Chunjie Duan ,  Kieran Parsons ,  Keisuke Kojima

发明人： Toshiaki Koike-Akino ,  Chunjie Duan ,  Kieran Parsons ,  Keisuke Kojima

IPC分类号： H04B10/06

CPC分类号： H04L25/03184 ,  H04L25/03171 ,  H04L25/03286

摘要： A method equalizes and decodes a received signal including a sequence of symbols. Subsequences of the signal are selected, wherein the subsequences are overlapping and time shifted. For each subsequence, statistics of the channel corresponding to a pattern in the subsequence are selected, wherein the statistics include high-order statistics. A transmitted signal corresponding to the received signal is then estimated based on the statistics.

摘要翻译： 一种方法对包括符号序列的接收信号进行均衡和解码。 选择信号的子序列，其中子序列重叠并且时移。 对于每个子序列，选择与子序列中的模式对应的信道的统计，其中统计信息包括高阶统计。 然后，基于统计量来估计与接收信号对应的发送信号。

公开(公告)号：US08472809B2

公开(公告)日：2013-06-25

申请号：US13085715

申请日：2011-04-13

申请人： Toshiaki Koike-Akino ,  Cheng Liu ,  Kieran Parsons

发明人： Toshiaki Koike-Akino ,  Cheng Liu ,  Kieran Parsons

IPC分类号： H04B10/00

CPC分类号： H04L25/03292 ,  H04B10/6162 ,  H04B10/6163 ,  H04L25/024

摘要： For coherent fiber optic communications, the nonlinear XPolM impairment is the most important issue to realize over-100 Gbps high-speed transmissions. A method provides a way to cancel time-varying XPolM crosstalk by introducing multi-stage adaptive mechanism. In the method, a low-complexity adaptive filtering based on recursive least-squares (RLS) first tracks the time-varying crosstalk along with the per-survivor trellis-state decoding. The estimated channel and the decoded data are then used to calculate the empirical covariance, which is in turn exploited to obtain more accurate channel estimates by means of optimal-weighted least-squares. This is performed with a low-complexity processing over frequency domain with fast Fourier transform. The performance is significantly improved with turbo principle decoding, more specifically, iterative decoding and iterative estimation over a block.

摘要翻译： 对于相干光纤通信，非线性XPolM损伤是实现超过100 Gbps高速传输的最重要问题。 一种方法提供了一种通过引入多级自适应机制来消除时变XPolM串扰的方法。 在该方法中，基于递归最小二乘法（RLS）的低复杂度自适应滤波首先跟踪随时间变化的串扰以及每个幸存者网格状态解码。 然后将估计的信道和解码的数据用于计算经验协方差，其经过利用最佳加权最小二乘法获得更准确的信道估计。 这是通过具有快速傅立叶变换的频域上的低复杂度处理来执行的。 通过turbo原理解码，更具体地说，在块上迭代解码和迭代估计，性能得到显着提高。

公开(公告)号：US08433205B2

公开(公告)日：2013-04-30

申请号：US13086020

申请日：2011-04-13

申请人： Toshiaki Koike-Akino ,  Philip V. Orlik ,  Kieran Parsons

发明人： Toshiaki Koike-Akino ,  Philip V. Orlik ,  Kieran Parsons

IPC分类号： H04B10/04 ,  H04B10/08 ,  H04B10/00 ,  H04B10/12 ,  H04J14/00

CPC分类号： H04J14/06 ,  H04B10/5055 ,  H04B10/532 ,  H04J14/02

摘要： A method reduces time-varying polarization crosstalk due to XPolM by transmitting multi-dimensional orthogonal constellations. Three variants of crosstalk-free constellations are provided: Grassmann constellations, unitary constellations, and rotation codes. The method uses the Grassmann constellations and the unitary constellations to deal with fiber nonlinearity by applying as a polarization-time coding. The rotation codes exploit a fiber channel characteristic to improve performance and to reduce computational complexity. The underlying orthogonality behind those constellations enables the receiver to decode it as if there is no polarization crosstalk. Moreover, the required computational complexity at the receiver is significantly reduced because neither crosstalk cancellers nor channel estimators are needed.

摘要翻译： 一种方法通过传输多维正交星座来减少XPolM引起的时变极化串扰。 提供了无串扰星座的三种变体：Grassmann星座，酉星座和旋转码。 该方法使用Grassmann星座和单一星座通过应用极化时间编码来处理光纤非线性。 旋转码利用光纤通道特性来提高性能并降低计算复杂度。 这些星座背后的基础正交性使得接收机能够将其解码为好像没有偏振串扰。 此外，接收机所需的计算复杂度显着降低，因为不需要串扰消除器和信道估计器。

公开(公告)号：US20120263454A1

公开(公告)日：2012-10-18

申请号：US13086020

申请日：2011-04-13

申请人： Toshiaki Koike-Akino ,  Philip V. Orlik ,  Kieran Parsons

发明人： Toshiaki Koike-Akino ,  Philip V. Orlik ,  Kieran Parsons

IPC分类号： H04B10/00 ,  H04B10/12 ,  H04B10/08 ,  H04J14/02

CPC分类号： H04J14/06 ,  H04B10/5055 ,  H04B10/532 ,  H04J14/02

摘要： A method reduces time-varying polarization crosstalk due to XPolM by transmitting multi-dimensional orthogonal constellations. Three variants of crosstalk-free constellations are provided: Grassmann constellations, unitary constellations, and rotation codes. The method uses the Grassmann constellations and the unitary constellations to deal with fiber nonlinearity by applying as a polarization-time coding. The rotation codes exploit a fiber channel characteristic to improve performance and to reduce computational complexity. The underlying orthogonality behind those constellations enables the receiver to decode it as if there is no polarization crosstalk. Moreover, the required computational complexity at the receiver is significantly reduced because neither crosstalk cancellers nor channel estimators are needed.

摘要翻译： 一种方法通过传输多维正交星座来减少XPolM引起的时变极化串扰。 提供了无串扰星座的三种变体：Grassmann星座，酉星座和旋转码。 该方法使用Grassmann星座和单一星座通过应用极化时间编码来处理光纤非线性。 旋转码利用光纤通道特性来提高性能并降低计算复杂度。 这些星座背后的基础正交性使得接收机能够将其解码为好像没有偏振串扰。 此外，接收机所需的计算复杂度显着降低，因为不需要串扰消除器和信道估计器。

公开(公告)号：US20120183020A1

公开(公告)日：2012-07-19

申请号：US13007523

申请日：2011-01-14

申请人： Toshiaki Koike-Akino ,  Philip V. Orlik

发明人： Toshiaki Koike-Akino ,  Philip V. Orlik

IPC分类号： H04W40/00

CPC分类号： H04L1/0034 ,  H04L1/0038 ,  H04L1/006 ,  H04L1/0077 ,  H04L1/0625 ,  H04L2001/0097

摘要： This invention provides a method for jointly optimizing network coding, channel coding, and signal constellations in non-coherent wireless multiple-input multiple-output (MIMO) wireless relay networks for the case when transceivers cannot obtain any knowledge of channel state information (CSI) due to high-speed mobility of the transceivers. In the relay networks, two terminal transceivers simultaneously transmit data to an intermediate relaying transceiver, which in turn broadcasts mixed data using physical-layer network coding to both terminals. The embodiments of this invention exploit different blind space-time trellis-coded modulations (ST-TCM) for each user, whose codebook is jointly generated over a Grassmannian manifold. The method is provided by exponential mapping with affine-lattice convolution for joint optimization of channel coding, modulations, and network coding. The method is designed for fast fading channels with and without interleaving. The method significantly improves performance in non-coherent bidirectional relaying MIMO networks.

摘要翻译： 本发明提供了一种用于在收发机不能获得信道状态信息（CSI）的任何知识的情况下联合优化非相干无线多输入多输出（MIMO）无线中继网络中的网络编码，信道编码和信号星座的方法， 由于收发器的高速移动性。 在中继网络中，两个终端收发器同时向中间中继收发器发送数据，中继中继收发机又将物理层网络编码的混合数据广播到两个终端。 本发明的实施例针对每个用户利用不同的盲时空网格编码调制（ST-TCM），其码本通过Grassmannian流形共同生成。 该方法通过用仿射网格卷积的指数映射提供，用于信道编码，调制和网络编码的联合优化。 该方法设计用于具有和不具有交织的快速衰落信道。 该方法显着提高了非相干双向中继MIMO网络中的性能。

公开(公告)号：US20120140922A1

公开(公告)日：2012-06-07

申请号：US12962449

申请日：2010-12-07

申请人： Ramesh Annavajjala ,  Wei Liu ,  Chunjie Duan ,  Toshiaki Koike-Akino ,  Yige Wang

发明人： Ramesh Annavajjala ,  Wei Liu ,  Chunjie Duan ,  Toshiaki Koike-Akino ,  Yige Wang

IPC分类号： H04W12/04

CPC分类号： H04L9/0875 ,  H04L2209/80 ,  H04W12/02 ,  H04W12/04

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

摘要翻译： 无线网络中的第一和第二节点估计第一和第二信道响应。 第一节点量化第一信道响应以产生第一比特序列，以及作为前馈消息作为第二节点发送的前馈消息。 第二节点使用前馈消息量化第二信道响应，以产生第一比特序列，第二比特序列和反馈消息的估计，其被发送到第一节点。 然后，第一和第二节点使用反馈和前馈消息删除各个比特序列中的比特，以产生具有低比特失配率的第一和第二私钥。