公开(公告)号：US08706423B2

公开(公告)日：2014-04-22

申请号：US12498085

申请日：2009-07-06

申请人： Victor On-Kwok Li ,  Albert Yun Sang Lam

发明人： Victor On-Kwok Li ,  Albert Yun Sang Lam

IPC分类号： G01N33/48 ,  G06F19/12 ,  G06F19/10

CPC分类号： G06F19/12 ,  B82Y10/00 ,  G06F19/10 ,  G06F19/702 ,  G06F19/707 ,  G06N3/006

摘要： Subject matter disclosed herein relates to various embodiments of a chemical reaction-type metaheuristic. According to an embodiment, solutions to an objective function can be determined by iteratively searching for a minimum energy state of one or more interactions of molecules in a chemical reaction. The molecules in the chemical reaction can be assigned to represent the possible outcomes of the objective function. In a specific embodiment, the interactions of the molecules can modeled as on-wall ineffective collisions, decompositions, inter-molecular ineffective collisions, and synthesis. The type of interaction can affect where the next molecular structure is searched.

摘要翻译： 本文公开的主题涉及化学反应型元启发式的各种实施方案。 根据实施例，可以通过迭代地搜索化学反应中分子的一个或多个相互作用的最小能量状态来确定目标函数的解决方案。 可以分配化学反应中的分子来表示目标函数的可能结果。 在一个具体实施方案中，分子的相互作用可以建模为壁上无效碰撞，分解，分子间无效碰撞和合成。 相互作用的类型可以影响下一个分子结构的搜索。

公开(公告)号：US08051199B2

公开(公告)日：2011-11-01

申请号：US09877744

申请日：2001-06-08

申请人： Victor On-Kwok Li ,  Chun-Yin Li ,  Ping-Kong Alex Wai ,  Xiaochun Yuan

发明人： Victor On-Kwok Li ,  Chun-Yin Li ,  Ping-Kong Alex Wai ,  Xiaochun Yuan

IPC分类号： G06F13/00

CPC分类号： H04L61/6004 ,  H04L29/12009 ,  H04L29/12801 ,  H04L29/12924 ,  H04L45/00 ,  H04L61/6063

摘要： A method and system for assigning self-routing addresses to nodes in a network with arbitrary, including irregular, topology is provided. The method and system are useful in packet-switched networks and in particular optical packet-switched networks for reducing processing associated with routing packets. Each self-routing address encodes a set of paths from all nodes in the network to the destination node. In an embodiment of the invention each output port of each node in a network sends a packet in response to the state of a bit in the self-routing address in a packet. Alternatively, each node address in the network is mapped to a bit in a self-routing address. Furthermore, a node can have multiple self-routing addresses encoding different sets of paths from all other nodes in the network to the node. In addition, hierarchical networks are included among the networks suitable for self-routing addresses.

摘要翻译： 提供了一种用于将自路由地址分配给具有任意（包括不规则）拓扑的网络中的节点的方法和系统。 该方法和系统在分组交换网络，特别是用于减少与路由分组相关联的处理的光分组交换网络中是有用的。 每个自路由地址对从网络中的所有节点到目标节点的一组路径进行编码。 在本发明的实施例中，网络中的每个节点的每个输出端口响应于分组中的自路由地址中的比特的状态来发送分组。 或者，网络中的每个节点地址被映射到自路由地址中的位。 此外，节点可以具有编码从网络中的所有其他节点到节点的不同路径集合的多个自路由地址。 另外，适合于自路由地址的网络中包括分层网络。

公开(公告)号：US08218575B2

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

申请号：US12277028

申请日：2008-11-24

申请人： Chun-Yin Li ,  Alexander Ping-Kong Wai ,  Victor On-Kwok Li

发明人： Chun-Yin Li ,  Alexander Ping-Kong Wai ,  Victor On-Kwok Li

IPC分类号： H04J3/24

CPC分类号： H04Q11/0005 ,  H04Q11/0066 ,  H04Q2011/0015 ,  H04Q2011/002 ,  H04Q2011/0024 ,  H04Q2011/0039 ,  H04Q2011/0045

摘要： A method for shortening the length of time gaps between data units in a data switching network; the method comprising: arranging a group of K data units received consecutively at an input of a first device in K time units, where K is a positive integer; sending the arranged K data units to the inputs of M devices, where M is a positive integer; transferring a group of Hj data units of the arranged K data units by a device j of the M devices from its inputs to its outputs within a time unit Tx in the K unit time period, where Hj is a positive integer and the sum of Hj for j=1, . . . M is equal to K, where HjK; arranging the data units sent to the devices of the M devices transferring at time unit Tx such that no two inputs of the devices of the M devices transferring at time unit Tx receive the same data unit at any moment; and repeatedly combining and arranging the K data units from the outputs of the M devices by a second device such that the K data units appear at the output of the second device consecutively.

摘要翻译： 一种用于缩短数据交换网络中的数据单元之间的时间间隔长度的方法; 所述方法包括：以K个时间单位在第一设备的输入端连续接收的一组K个数据单元，其中K是正整数; 将布置的K个数据单元发送到M个设备的输入，其中M是正整数; 将K个数据单元的一组Hj数据单元由M个装置的装置j从K个单位时间段内的时间单位Tx内从其输入传送到其输出，其中Hj是正整数，Hj的和 对于j = 1，。 。 。 M等于K，其中HjK; 将发送到M个设备的设备的数据单元布置在时间单元Tx处传送，使得在时间单元Tx传输的M个设备的设备的任何两个输入在任何时刻都不会接收相同的数据单元; 并且通过第二装置从M个装置的输出重复地组合和布置K个数据单元，使得K个数据单元连续出现在第二个装置的输出端。

公开(公告)号：US08594130B2

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

申请号：US13541021

申请日：2012-07-03

申请人： Chun-Yin Li ,  Alexander Ping-Kong Wai ,  Victor On-Kwok Li

发明人： Chun-Yin Li ,  Alexander Ping-Kong Wai ,  Victor On-Kwok Li

IPC分类号： H04J3/24

CPC分类号： H04Q11/0005 ,  H04Q11/0066 ,  H04Q2011/0015 ,  H04Q2011/002 ,  H04Q2011/0024 ,  H04Q2011/0039 ,  H04Q2011/0045

摘要： A group of K data units received consecutively is arranged by a first device. The arranged K data units are sent to the inputs of M devices, and a group of Hj data units of the arranged K data units are transferred by a device j of the M devices. The data units sent to the devices of the M devices are arranged such that no two inputs of the devices of the M devices transferring receive the same data unit at any moment. A second device combines and arranges the K data units from the outputs of the M devices such that the K data units appear at the output of the second device consecutively, and a length of time gap between data units in a data switching network is shortened.

摘要翻译： 连续接收的一组K个数据单元由第一设备排列。 所排列的K个数据单元被发送到M个设备的输入端，并且通过M个设备的设备j传送所排列的K个数据单元的一组Hj个数据单元。 发送到M设备的设备的数据单元布置成使得M设备传输的设备的任何两个输入在任何时刻都接收相同的数据单元。 第二设备从M个设备的输出组合并排列K个数据单元，使得K个数据单元连续出现在第二设备的输出端，数据交换网络中数据单元之间的时间间隔长度缩短。

公开(公告)号：US20090135853A1

公开(公告)日：2009-05-28

申请号：US12277028

申请日：2008-11-24

申请人： Chun-Yin Li ,  Alexander Ping-Kong Wai ,  Victor On-Kwok Li

发明人： Chun-Yin Li ,  Alexander Ping-Kong Wai ,  Victor On-Kwok Li

IPC分类号： H04J3/24

CPC分类号： H04Q11/0005 ,  H04Q11/0066 ,  H04Q2011/0015 ,  H04Q2011/002 ,  H04Q2011/0024 ,  H04Q2011/0039 ,  H04Q2011/0045

摘要： A method for shortening the length of time gaps between data units in a data switching network; the method comprising: arranging a group of K data units received consecutively at an input of a first device in K time units, where K is a positive integer; sending the arranged K data units to the inputs of M devices, where M is a positive integer; transferring a group of Hj data units of the arranged K data units by a device j of the M devices from its inputs to its outputs within a time unit Tx in the K unit time period, where Hj is a positive integer and the sum of Hj for j=1, . . . M is equal to K, where Hj≦K; arranging the data emits sent to the devices of the M devices transferring at time unit Tx such that no two inputs of the devices of the M devices transferring at time unit Tx receive the same data unit at any moment; and repeatedly combining and arranging the K data units from the outputs of the M devices by a second device such that the K data units appear at the output of the second device consecutively

摘要翻译： 一种用于缩短数据交换网络中的数据单元之间的时间间隔长度的方法; 所述方法包括：以K个时间单位在第一设备的输入端连续接收的一组K个数据单元，其中K是正整数; 将布置的K个数据单元发送到M个设备的输入，其中M是正整数; 将K个数据单元的一组Hj数据单元由M个装置的装置j从K个单位时间段内的时间单位Tx内从其输入传送到其输出，其中Hj是正整数，Hj的和 对于j = 1，。 。 。 M等于K，其中Hj <= K; 将发送的数据发送到在时间单元Tx传送的M个设备的设备，使得在时间单元Tx处传送的M个设备的设备的任何两个输入在任何时间都接收相同的数据单元; 并且通过第二装置从M个装置的输出重复地组合和布置K个数据单元，使得K个数据单元连续地出现在第二个装置的输出端

公开(公告)号：US20120275788A1

公开(公告)日：2012-11-01

申请号：US13541021

申请日：2012-07-03

申请人： Chun-Yin Li ,  Alexander Ping-Kong Wai ,  Victor On-Kwok Li

发明人： Chun-Yin Li ,  Alexander Ping-Kong Wai ,  Victor On-Kwok Li

IPC分类号： H04L29/02 ,  H04J14/00

CPC分类号： H04Q11/0005 ,  H04Q11/0066 ,  H04Q2011/0015 ,  H04Q2011/002 ,  H04Q2011/0024 ,  H04Q2011/0039 ,  H04Q2011/0045

摘要： A group of K data units received consecutively is arranged by a first device. The arranged K data units are sent to the inputs of M devices, and a group of Hj data units of the arranged K data units are transferred by a device j of the M devices. The data units sent to the devices of the M devices are arranged such that no two inputs of the devices of the M devices transferring receive the same data unit at any moment. A second device combines and arranges the K data units from the outputs of the M devices such that the K data units appear at the output of the second device consecutively, and a length of time gap between data units in a data switching network is shortened.

摘要翻译： 连续接收的一组K个数据单元由第一设备排列。 所排列的K个数据单元被发送到M个设备的输入端，并且通过M个设备的设备j传送所排列的K个数据单元的一组Hj个数据单元。 发送到M设备的设备的数据单元布置成使得M设备传输的设备的任何两个输入在任何时刻都接收相同的数据单元。 第二设备从M个设备的输出组合并排列K个数据单元，使得K个数据单元连续出现在第二设备的输出端，数据交换网络中数据单元之间的时间间隔长度缩短。

公开(公告)号：US07441174B2

公开(公告)日：2008-10-21

申请号：US11221311

申请日：2005-09-07

申请人： Victor On-Kwok Li ,  Jianhao Hu ,  Alfred K. K. Wong

发明人： Victor On-Kwok Li ,  Jianhao Hu ,  Alfred K. K. Wong

IPC分类号： H03M13/00

CPC分类号： H03M13/3911 ,  H03M13/2957 ,  H03M13/3905

摘要： A method, an embedded state metric storage, is used for MAP (Maximum A Posterior)-based decoder of turbo codes to reduce the memory requirement of state metric storage. For MAP decoder, this method comprises selecting any state metric from the updated state metrics for each recursion direction, forward and reverse, and dividing the state metrics by the selected state metric; the selected state metric value becomes a constant, namely, one. The constant one state metric is embedded into the resulted state metrics. For log-MAP decoder, this method comprises selecting any state metric from the updated state metrics in each direction, forward and reverse, and subtracting the state metrics from the selected state metric; the selected state metric value becomes a constant, zero. The constant zero state metric is embedded into the resulted state metrics. One advantage of the embedded state metric storage during state metric updating and likelihood ratio calculation is to embed the information of the selected state metric into the resulted state metrics. Thus, the selected state metric is not required to be kept in the state metric memory, and calculation of a constant state metric in the resulted state metric can be omitted. Therefore, the latency and the area of implementation in ASIC will be reduced with this method of embedded state metric storage.

摘要翻译： 一种方法，嵌入式状态量度存储，用于turbo码的基于MAP（Maximum A Posterior）的解码器，以减少状态度量存储的存储器需求。 对于MAP解码器，该方法包括从针对每个递归方向的前向和反向的更新状态度量中选择任何状态度量，并且将状态度量除以所选择的状态度量; 所选择的状态度量值变为常数，即一个。 恒定的一个状态度量被嵌入到所得到的状态度量中。 对于对数MAP解码器，该方法包括从每个方向，正向和反向的更新状态度量中选择任何状态度量，以及从所选状态度量中减去状态量度; 所选状态度量值变为常数，为零。 常数零状态度量被嵌入到所得到的状态度量中。 在状态度量更新和似然比计算期间嵌入状态量度存储的一个优点是将所选状态度量的信息嵌入到所得状态度量中。 因此，所选择的状态度量不需要保持在状态度量存储器中，并且可以省略所得状态度量中的常数状态量度的计算。 因此，嵌入式状态度量存储的方法将降低ASIC中的延迟和实现面积。