公开(公告)号：US08498544B2

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

申请号：US13024769

申请日：2011-02-10

Applicant: Chunjie Duan ,  Kieran Parsons ,  Philip V. Orlik

Inventor： Chunjie Duan ,  Kieran Parsons ,  Philip V. Orlik

IPC: H04B10/00

CPC classification number: G06F7/5057 ,  G06F7/5443 ,  H03M13/1111 ,  H03M13/658 ,  H04B10/6165 ,  H04L9/3218 ,  H04L2209/46 ,  H04L2209/50

Abstract: A method and an optical receiver compensates for an error in a phase of an optical signal in a receiver. The signal includes blocks of symbols in a sequence. Each block is decoded based on a partially phase compensated symbols, and an average phase error for the block is estimated. Forward phase compensation and backward phase compensation is performed on the block based on the average phase error, and the decoding, estimating, performing is iterated until a termination condition is satisfied to produce a phase compensated block.

Abstract translation: 一种方法和光学接收机补偿接收机中光信号的相位中的误差。 信号包括序列中的符号块。 基于部分相位补偿的符号对每个块进行解码，并且估计块的平均相位误差。 基于平均相位误差对块进行正向相位补偿和反相补偿，迭代解码，估计执行直到满足终止条件以产生相位补偿块。

公开(公告)号：US20060078336A1

公开(公告)日：2006-04-13

申请号：US10531314

申请日：2003-07-11

Applicant: John McNicol ,  Kieran Parsons ,  Leo Strawczynski ,  Kim Roberts ,  Maurice O'Sullivan

Inventor： John McNicol ,  Kieran Parsons ,  Leo Strawczynski ,  Kim Roberts ,  Maurice O'Sullivan

IPC: H04B10/12

CPC classification number: H04B10/07951 ,  H04B10/07953 ,  H04B10/25137 ,  H04B10/505 ,  H04B10/50597 ,  H04B10/508 ,  H04B10/6161

Abstract: Optical dispersion imposed on a communications signal conveyed through an optical communications system is compensated by modulating the communications signal in the electrical domain. A compensation function is determined that substantially mitigates the chromatic dispersion. The communications signal is then modulated in the electrical domain using the compensation function. In preferred embodiments, compensation is implemented in the transmitter, using a look-up-table and digital-to-analog converter to generate an electrical predistorted signal. The electrical predistorted signal is then used to modulate an optical source to generate a corresponding predistorted optical signal for transmission through the optical communications system.

Abstract translation: 施加在通过光通信系统传送的通信信号上的光色散通过调制电域中的通信信号来补偿。 确定基本上减轻色散的补偿功能。 然后使用补偿功能在电域中调制通信信号。 在优选实施例中，使用查找表和数模转换器来在发射机中实现补偿以产生电预失真信号。 然后，电预失真信号用于调制光源以产生用于通过光通信系统传输的相应的预失真光信号。

公开(公告)号：US08891967B2

公开(公告)日：2014-11-18

申请号：US13218044

申请日：2011-08-25

Applicant: Kieran Parsons ,  Philip Orlik

Inventor： Kieran Parsons ,  Philip Orlik

IPC: H04J14/00 ,  H04Q11/00

CPC classification number: H04Q11/0062 ,  H04Q2011/0086

Abstract: In optical networks new links are added between nodes over time to satisfy the increasing traffic demands of the network. Existing links are normally not changed, resulting in a network that does not have the lowest energy consumption. A method provides a way to reduce the energy consumption of the overall network while supporting the required traffic demands at all times. The network includes a multiple source nodes, and multiple destination nodes. The network is represented by a graph of nodes connected by edges, wherein each node represents an optical network element and each edge represents a path connecting two optical network elements. Each edge is labeled with a demand. The non-bridge edge with a lowest demand is removed from the graph, and the lowest demand is added to the non-bridge edge with a highest demand. These steps are repeated until a termination condition is reached.

Abstract translation: 在光网络中，随着时间的推移，节点间增加了新的链路，以满足网络流量的不断增长。 现有链接通常不会更改，导致网络的能耗最低。 一种方法提供了一种在始终支持所需的交通需求的同时降低总体网络的能量消耗的方法。 该网络包括多个源节点和多个目的节点。 网络由通过边缘连接的节点的图表示，其中每个节点表示光网络元件，并且每个边缘表示连接两个光网络元件的路径。 每个边缘都贴有需求。 具有最低需求的非桥接边缘从图中去除，最低需求被添加到具有最高需求的非桥接边缘。 重复这些步骤直到达到终止条件。

公开(公告)号：US20130258841A1

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

申请号：US13435335

申请日：2012-03-30

Applicant: Kieran Parsons ,  Ke Wen

Inventor： Kieran Parsons ,  Ke Wen

IPC: H04L12/24

CPC classification number: H04L41/0663 ,  H04L41/142 ,  H04L49/552

Abstract: A method protects data transmission from failures, wherein the data transmissions are from a source to a destination in a Multi-Protocol Label Switching (MPLS) network, and the data transmissions are via a labeled-switch path (LSP) with segment protection in protection domains. A maximum recovery time for each protection domain is constrained, and for each protection domain, one or more backup tunnels are determined. A graph of nodes of the LSP and the backup tunnels is constructed, wherein edges in the graph represent the links between the nodes. A weight is assigned to each edge to produce a weighted graph. Based on the weighted graph, a path from the source to the destination that satisfies a reliability constraint with a minimum cost is determined by using an optimal combination of segment protections and a reliability-guaranteed least-cost

Abstract translation: 一种保护数据传输免受故障的方法，其中数据传输在多协议标签交换（MPLS）网络中从源到目的地，并且数据传输通过具有保护的段保护的标记交换路径（LSP） 域名 限制每个保护域的最大恢复时间，并且对于每个保护域，确定一个或多个备份隧道。 构建LSP和备份隧道的节点图，其中图中的边表示节点之间的链路。 将权重分配给每个边缘以产生加权图。 基于加权图，通过使用段保护的最佳组合和可靠性保证的最低成本来确定从源到目的地满足最小成本的可靠性约束的路径

公开(公告)号：US20130051797A1

公开(公告)日：2013-02-28

申请号：US13218044

申请日：2011-08-25

Applicant: Kieran Parsons ,  Philip Orlik

Inventor： Kieran Parsons ,  Philip Orlik

IPC: H04J14/00

CPC classification number: H04Q11/0062 ,  H04Q2011/0086

Abstract: In optical networks new links are added between nodes over time to satisfy the increasing traffic demands of the network. Existing links are normally not changed, resulting in a network that does not have the lowest energy consumption. A method provides a way to reduce the energy consumption of the overall network while supporting the required traffic demands at all times. The network includes a multiple source nodes, and multiple destination nodes. The network is represented by a graph of nodes connected by edges, wherein each node represents an optical network element and each edge represents a path connecting two optical network elements. Each edge is labeled with a demand. The non-bridge edge with a lowest demand is removed from the graph, and the lowest demand is added to the non-bridge edge with a highest demand. These steps are repeated until a termination condition is reached.

Abstract translation: 在光网络中，随着时间的推移，节点间增加了新的链路，以满足网络流量的不断增长。 现有链接通常不会更改，导致网络的能耗最低。 一种方法提供了一种在始终支持所需的交通需求的同时降低总体网络的能量消耗的方法。 该网络包括多个源节点和多个目的节点。 网络由通过边缘连接的节点的图表示，其中每个节点表示光网络元件，并且每个边缘表示连接两个光网络元件的路径。 每个边缘都贴有需求。 具有最低需求的非桥接边缘从图中去除，最低需求被添加到具有最高需求的非桥接边缘。 重复这些步骤直到达到终止条件。

公开(公告)号：US20120263464A1

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

申请号：US13085715

申请日：2011-04-13

Applicant: Toshiaki Koike-Akino ,  Cheng Liu ,  Kieran Parsons

Inventor： Toshiaki Koike-Akino ,  Cheng Liu ,  Kieran Parsons

IPC: H04B10/06 ,  H04J14/06

CPC classification number: H04L25/03292 ,  H04B10/6162 ,  H04B10/6163 ,  H04L25/024

Abstract: 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.

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

公开(公告)号：US08280337B2

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

申请号：US13017378

申请日：2011-01-31

Applicant: Marc Dubois ,  Stephen Rayment ,  Andrew Keir ,  Kieran Parsons

Inventor： Marc Dubois ,  Stephen Rayment ,  Andrew Keir ,  Kieran Parsons

IPC: H04B1/10

CPC classification number: H04B1/30

Abstract: A circuit for communicating information in a wireless network includes a filtering circuit in communication with a zero intermediate frequency (ZIF) transceiver circuit. The filtering circuit includes a first mixer in communication with an output of the ZIF transceiver circuit. The filtering circuit includes a first Surface Acoustic Wave (SAW) filter circuit in communication with an output of the first mixer. The filtering circuit includes a second mixer in communication with an output of the first SAW filter circuit. The filtering circuit includes a third mixer, and a second SAW filter circuit in communication with an output of the third mixer. The filtering circuit includes a fourth mixer in communication with an output of the second SAW filter circuit and an input of the ZIF transceiver circuit. The filtering circuit also includes a local oscillator circuit in communication with the first, second, third and fourth mixers.

Abstract translation: 用于在无线网络中传送信息的电路包括与零中频（ZIF）收发器电路通信的滤波电路。 滤波电路包括与ZIF收发器电路的输出通信的第一混频器。 滤波电路包括与第一混频器的输出通信的第一表面声波（SAW）滤波器电路。 滤波电路包括与第一SAW滤波器电路的输出通信的第二混频器。 滤波电路包括第三混频器和与第三混频器的输出通信的第二SAW滤波器电路。 滤波电路包括与第二SAW滤波器电路的输出和ZIF收发器电路的输入通信的第四混频器。 滤波电路还包括与第一，第二，第三和第四混频器通信的本地振荡器电路。

公开(公告)号：US20120185755A1

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

申请号：US13007435

申请日：2011-01-14

Applicant: Philip Orlik ,  Raymond Yim ,  Kieran Parsons ,  Vahid Tarokh ,  Jinyun Zhang

Inventor： Philip Orlik ,  Raymond Yim ,  Kieran Parsons ,  Vahid Tarokh ,  Jinyun Zhang

IPC: H03M13/07 ,  G06F11/10

CPC classification number: H03M13/136 ,  H03M13/3905 ,  H03M13/45 ,  H03M13/458 ,  H04L1/0054

Abstract: Soft decision decoding of a codeword of a Reed-Muller (RM) code byselecting an optimal decomposition variable i using a likelihood calculation. A code RM(r, m) is expressed as {(u, uv)|uεRM(r, m−1) and vεRM(r−1, m−1)) where uv denotes a component-wise multiplication of u and v, and (u, uv)=(r1, r2). A receive codeword is separated into r1=u and r2=uv based on the optimal decomposition variable, and r2 is decoded according to the optimal decomposition variable, using a RM(r−1, m−1) decoder to obtain a decoded v and a first set of decoded bits. The decoded v is combined with r1 using (r1+r2v)/2, and(r1+r2V)/2 is decoded using a RM(r, m−1) decoder to obtain a decoded u and a second set of decoded bits.

Abstract translation: 通过使用似然率计算选择最优分解变量i，对Reed-Muller（RM）码的码字进行软判决解码。 代码RM（r，m）表示为{（u，uv）| u＆egr; RM（r，m-1）和v＆egr; RM（r-1，m-1）），其中uv表示分量乘法 的u和v，（u，uv）=（r1，r2）。 基于最优分解变量将接收码字分为r1 = u和r2 = uv，并使用RM（r-1，m-1）解码器根据最优分解变量对r2进行解码，以获得解码的v和 第一组解码位。 使用（r1 + r2v）/ 2将解码的v与r1组合，并且使用RM（r，m-1）解码器对（r1 + r2V）/ 2进行解码，以获得解码的u和第二组解码比特。

公开(公告)号：US20070238419A1

公开(公告)日：2007-10-11

申请号：US11399536

申请日：2006-04-07

Applicant: Marc Dubois ,  Stephen Rayment ,  Andrew Keir ,  Kieran Parsons

Inventor： Marc Dubois ,  Stephen Rayment ,  Andrew Keir ,  Kieran Parsons

IPC: H04B1/44

CPC classification number: H04B1/30

Abstract: A circuit for communicating information in a wireless network includes a filtering circuit in communication with a zero intermediate frequency (ZIF) transceiver circuit. The filtering circuit includes a first mixer in communication with an output of the ZIF transceiver circuit. The filtering circuit includes a first Surface Acoustic Wave (SAW) filter circuit in communication with an output of the first mixer. The filtering circuit includes a second mixer in communication with an output of the first SAW filter circuit. The filtering circuit includes a third mixer, and a second SAW filter circuit in communication with an output of the third mixer. The filtering circuit includes a fourth mixer in communication with an output of the second SAW filter circuit and an input of the ZIF transceiver circuit. The filtering circuit also includes a local oscillator circuit in communication with the first, second, third and fourth mixers.

Abstract translation: 用于在无线网络中传送信息的电路包括与零中频（ZIF）收发器电路通信的滤波电路。 滤波电路包括与ZIF收发器电路的输出通信的第一混频器。 滤波电路包括与第一混频器的输出通信的第一表面声波（SAW）滤波器电路。 滤波电路包括与第一SAW滤波器电路的输出通信的第二混频器。 滤波电路包括第三混频器和与第三混频器的输出通信的第二SAW滤波器电路。 滤波电路包括与第二SAW滤波器电路的输出和ZIF收发器电路的输入通信的第四混频器。 滤波电路还包括与第一，第二，第三和第四混频器通信的本地振荡器电路。

公开(公告)号：US08245116B2

公开(公告)日：2012-08-14

申请号：US13007435

申请日：2011-01-14

Applicant: Philip Orlik ,  Raymond Yim ,  Kieran Parsons ,  Vahid Tarokh ,  Jinyun Zhang

Inventor： Philip Orlik ,  Raymond Yim ,  Kieran Parsons ,  Vahid Tarokh ,  Jinyun Zhang

IPC: H03M13/00

CPC classification number: H03M13/136 ,  H03M13/3905 ,  H03M13/45 ,  H03M13/458 ,  H04L1/0054

Abstract: Soft decision decoding of a codeword of a Reed-Muller (RM) code by selecting an optimal decomposition variable i using a likelihood calculation. A code RM(r, m) is expressed as {(u, uv)|uεRM(r, m−1) and vεRM(r−1, m−1)}, where uv denotes a component-wise multiplication of u and v, and (u, uv)=(r1, r2). A receive codeword is separated into r1=u and r2=uv based on the optimal decomposition variable, and r2 is decoded according to the optimal decomposition variable, using a RM(r−1, m−1) decoder to obtain a decoded v and a first set of decoded bits. The decoded v is combined with r1 using (r1+r2v)/2, and (r1+r2v)/2 is decoded using a RM(r, m−1) decoder to obtain a decoded u and a second set of decoded bits.

Abstract translation: 通过使用似然率计算选择最优分解变量i，对Reed-Muller（RM）码的码字进行软判决解码。 代码RM（r，m）表示为{（u，uv）| u＆egr; RM（r，m-1）和v＆egr; RM（r-1，m-1）}，其中uv表示分量 u和v的乘法，（u，uv）=（r1，r2）。 基于最优分解变量将接收码字分为r1 = u和r2 = uv，并使用RM（r-1，m-1）解码器根据最优分解变量对r2进行解码，以获得解码的v和 第一组解码位。 使用（r1 + r2v）/ 2将解码的v与r1组合，并且使用RM（r，m-1）解码器对（r1 + r2v）/ 2进行解码，以获得解码的u和第二组解码比特。