公开(公告)号：US20080266014A1

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

申请号：US12048451

申请日：2008-03-14

Applicant: CHUANHUI MA ,  TING WANG

Inventor： CHUANHUI MA ,  TING WANG

IPC: H03C3/00

CPC classification number: H03C3/40 ,  H04L27/2627 ,  H04L27/2649 ,  H04L27/34 ,  H04L27/38

Abstract: A modulation system includes a modulator configured to employ a modulation mechanism on data. The mechanism includes a signal constellation configured to map sub-carriers which include a signal to be modulated. The signal constellation has a plurality of points asymmetrically disposed on a circle about an origin and a point at the origin wherein a number of sub-carriers becomes variable over different symbol intervals. Corresponding demodulators and corresponding methods are also disclosed.

Abstract translation: 调制系统包括调制机构，用于对数据采用调制机制。 该机构包括被配置为映射包括要调制的信号的子载波的信号星座。 信号星座具有不对称地设置在围绕原点的圆上的多个点和在原点处的点，其中多个子载波在不同的符号间隔上变得可变。 还公开了相应的解调器和相应的方法。

公开(公告)号：US20080232501A1

公开(公告)日：2008-09-25

申请号：US11950702

申请日：2007-12-05

Applicant: Mohammad Ali Khojastepour ,  Xiaodong Wang ,  Mohammad Madihian

Inventor： Mohammad Ali Khojastepour ,  Xiaodong Wang ,  Mohammad Madihian

IPC: H04L1/02

CPC classification number: H04B7/0417 ,  H04B7/0478 ,  H04B7/0639 ,  H04B7/0641

Abstract: Systems and methods are disclosed to generate a codebook for channel state information by generating a random codebook; partitioning channel state information into a set of nearest neighbors for each codebook entry based on a distance metric; and updating the codebook by finding a centroid for each partition.

Abstract translation: 公开了通过生成随机码本来生成用于信道状态信息的码本的系统和方法; 基于距离度量将信道状态信息划分成用于每个码本条目的一组最近邻居; 并通过为每个分区找到一个质心来更新码本。

公开(公告)号：US20080225979A1

公开(公告)日：2008-09-18

申请号：US12047544

申请日：2008-03-13

Applicant: Narayan Prasad ,  Xiaodong Wang ,  Mohammad Madihian

Inventor： Narayan Prasad ,  Xiaodong Wang ,  Mohammad Madihian

IPC: H04B15/00

CPC classification number: H04W72/082 ,  H04B7/0854 ,  H04B17/24 ,  H04B17/336 ,  H04L1/0026 ,  H04L1/0631 ,  H04L1/0668 ,  H04L25/03057 ,  H04L2025/03414 ,  H04L2025/0349 ,  H04W4/06 ,  H04W24/00 ,  H04W84/042

Abstract: A method for decoding and rate assignment in a wireless channel, where all dominant transmitter sources use inner codes from a particular set, comprising the steps of: i) estimating channel matrices seen from all dominant transmitter sources in response to a pilot or preamble signal transmitted by each such source; ii) converting each estimated channel matrix into an effective channel matrix responsive to the inner code of the corresponding transmitter source; iii) obtaining the received observations in a linear equivalent form (linear model) whose output is an equivalent of the received observations and in which the effective channel matrix corresponding to each dominant transmitter source inherits the structure of its inner code; iv) processing the transmitter sources according to the specified (or pre-determined) order of decoding; v) for each transmitter source, assuming perfect cancellation of signals of preceding transmitter sources; vi) computing a signal-to-interference-noise-ratio SINR responsive to the effective channel matrix of the transmitter source and the covariance matrix of the noise plus signals from remaining transmitter sources; and vii) feeding back all computed SINRs to respective transmitter sources.

Abstract translation: 一种用于在无线信道中解码和速率分配的方法，其中所有主要发射机源使用来自特定集合的内部码，包括以下步骤：i）响应于传输的导频或前导信号估计从所有主要发射机源看到的信道矩阵 由每个这样的来源; ii）响应于对应的发射机源的内部码，将每个估计的信道矩阵转换成有效信道矩阵; iii）以线性等效形式（线性模型）获得接收到的观测值，其输出等于所接收的观测值，并且其中对应于每个主要发射机源的有效信道矩阵继承其内部码的结构; iv）根据指定（或预定）解码顺序处理发射机源; v）对于每个发射机源，假设完全取消先前发射机的信号; vi）响应于发射机源的有效信道矩阵和来自剩余发射机源的噪声加信号的协方差矩阵来计算信噪比SINR; 和vii）将所有计算的SINR反馈到相应的发射机源。

公开(公告)号：US20080219145A1

公开(公告)日：2008-09-11

申请号：US12037227

申请日：2008-02-26

Applicant: Karthikeyan Sundaresan ,  Xiaodong Wang ,  Mohammad Madihian

Inventor： Karthikeyan Sundaresan ,  Xiaodong Wang ,  Mohammad Madihian

IPC: H04J11/00

CPC classification number: H04L47/10 ,  H04L5/0007 ,  H04L5/0037 ,  H04L5/0042 ,  H04L5/0053 ,  H04L5/0066 ,  H04L47/14 ,  H04L47/263 ,  H04L47/283

Abstract: A method includes tracking average user throughput, packet delay and jitter for every user that is serviced in an OFDM cellular system; using feedback to determine a potential schedule set responsive to user requirements for data and voice traffic responsive to minimum rate guarantee for data flows, and maximum tolerable delay and jitter guarantees for voice flows; with multiple flows for each user, first determining contending flow for each user responsive to aggregate rate feedback; obtaining search space for the user requirements of rate, delay and jitter responsive to corresponding optimizing strategies; determining individual rate, delay and jitter related schedules providing maximum incremental or marginal utility; and calculating final schedule of users on channels providing maximum incremental or marginal utility among parameter specific schedules form the determining step.

Abstract translation: 一种方法包括跟踪在OFDM蜂窝系统中服务的每个用户的平均用户吞吐量，分组延迟和抖动; 使用反馈来响应于数据流的最小速率保证响应用户对数据和语音流量的需求而确定潜在的调度集，以及用于语音流的最大容许延迟和抖动保证; 每个用户具有多个流，首先响应于总体速率反馈确定每个用户的竞争流; 响应于相应的优化策略，获得用户对速率，延迟和抖动的要求的搜索空间; 确定提供最大增量或边际效用的个人速率，延迟和抖动相关时间表; 并且在确定步骤之后计算在参数特定时间表中提供最大增量或边际效用的频道上的用户的最终时间表。

公开(公告)号：US20080201428A1

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

申请号：US12023141

申请日：2008-01-31

Applicant: Cezary Dubnicki ,  Leszek Gryz ,  Krzysztof Lichota ,  Cristian Ungureanu

Inventor： Cezary Dubnicki ,  Leszek Gryz ,  Krzysztof Lichota ,  Cristian Ungureanu

IPC: G06F15/16

CPC classification number: G06F17/30067

Abstract: A fixed prefix peer to peer network has a number of physical nodes. The nodes are logically divided into a number of storage slots. Blocks of data are erasure coded into original and redundant data fragments and the resultant fragments of data are stored in slots on separate physical nodes such that no physical node has more than one original and/or redundant fragment. The storage locations of all of the fragments are organized into a logical virtual node (e.g., a supernode). Thus, the supernode and the original block of data can be recovered even if some of the physical nodes are lost.

Abstract translation: 固定前缀对等网络具有多个物理节点。 节点在逻辑上划分为多个存储槽。 数据块被擦除编码为原始和冗余数据片段，并且所得到的数据片段存储在分开的物理节点上的时隙中，使得没有物理节点具有多于一个原始和/或冗余片段。 所有片段的存储位置被组织成逻辑虚拟节点（例如，超级节点）。 因此，即使某些物理节点丢失，超节点和原始数据块也可以被恢复。

公开(公告)号：US20080201281A1

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

申请号：US12110519

申请日：2008-04-28

Applicant: Hans Peter Graf ,  Eric Cosatto ,  Leon Bottou ,  Vladimir N. Vapnik

Inventor： Hans Peter Graf ,  Eric Cosatto ,  Leon Bottou ,  Vladimir N. Vapnik

IPC: G06F15/18

CPC classification number: G06K9/6292 ,  G06K9/6269 ,  G06N99/005

Abstract: Disclosed is an improved technique for training a support vector machine using a distributed architecture. A training data set is divided into subsets, and the subsets are optimized in a first level of optimizations, with each optimization generating a support vector set. The support vector sets output from the first level optimizations are then combined and used as input to a second level of optimizations. This hierarchical processing continues for multiple levels, with the output of each prior level being fed into the next level of optimizations. In order to guarantee a global optimal solution, a final set of support vectors from a final level of optimization processing may be fed back into the first level of the optimization cascade so that the results may be processed along with each of the training data subsets. This feedback may continue in multiple iterations until the same final support vector set is generated during two sequential iterations through the cascade, thereby guaranteeing that the solution has converged to the global optimal solution. In various embodiments, various combinations of inputs may be used by the various optimizations. The individual optimizations may be processed in parallel.

Abstract translation: 公开了一种用于使用分布式架构来训练支持向量机的改进技术。 将训练数据集分为子集，并且子集在优化的第一级优化，每个优化生成支持向量集。 然后将来自第一级优化的支持向量集合输出组合并用作第二级优化的输入。 该分级处理持续多级，每个先前级别的输出被馈送到下一级优化。 为了保证全局最优解，可以将最终优化处理级别的最后一组支持向量反馈到优化级联的第一级，以便结果可以与每个训练数据子集一起被处理。 这种反馈可以在多次迭代中继续，直到在通过级联的两次连续迭代期间产生相同的最终支持向量集，从而保证解已经收敛到全局最优解。 在各种实施例中，各种优化可以使用输入的各种组合。 个别优化可以并行处理。

公开(公告)号：US20080195904A1

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

申请号：US12015129

申请日：2008-01-16

Applicant: Seongmoon Wang

Inventor： Seongmoon Wang

IPC: G01R31/3181 ,  G06F11/26

CPC classification number: G01R31/318547

Abstract: A method for increasing fault coverage and compression with a broadcast scan-based test data compression circuit includes inserting test points for breaking correlations existing between scan inputs that belong to same scan slices making some faults un-testable with a broadcast scan-based test data compression circuit; and reordering scan inputs for further reducing correlations between scan inputs that belong to the same scan slices.

Abstract translation: 使用基于广播扫描的测试数据压缩电路来增加故障覆盖和压缩的方法包括：插入测试点，用于破坏属于相同扫描片的扫描输入之间存在的相关性，从而使一些故障与基于广播扫描的测试数据压缩无法测试 电路 并重新排序扫描输入，以进一步减少属于相同扫描片的扫描输入之间的相关性。

公开(公告)号：US20080163025A1

公开(公告)日：2008-07-03

申请号：US11950757

申请日：2007-12-05

Applicant: Ivan B. Djordjevic ,  Milorad Cvjetic ,  Lei Xu ,  Ting Wang

Inventor： Ivan B. Djordjevic ,  Milorad Cvjetic ,  Lei Xu ,  Ting Wang

IPC: H03M13/05 ,  G06F11/10

CPC classification number: H03M13/255 ,  H03M13/11 ,  H04L25/03171 ,  H04L25/067 ,  H04L27/183 ,  H04L27/186 ,  H04L2025/03611

Abstract: A transmitter includes a plurality of encoders configured to receive source bit streams from m information sources, each of the plurality encoders including identical (n,k) low-density parity check (LDPC) codes of code rate r=k/n, where k is a number of information bits and n is codeword length. An interleaver is configured to collect m row-wise codewords from the plurality of encoders, and a mapper is configured to receive m bits at a time column-wise from the interleaver and to determine an M-ary signal constellation point. A modulator is configured to modulate a light source in accordance with the output of the mapper at a transmission rate Rs/r (Rs—the symbol rate, r—the code rate). A receiver and transmission and receiving methods are also disclosed.

Abstract translation: 发射机包括被配置为从m个信息源接收源比特流的多个编码器，多个编码器中的每一个包括码率为r = k / n的相同（n，k）个低密度奇偶校验码（LDPC）码，其中k 是多个信息位，n是码字长度。 交织器被配置为从多个编码器收集m个逐行码字，并且映射器被配置为从交织器逐列地接收m个比特，并且确定M元信号星座点。 调制器被配置为根据映射器的输出以传输速率R / R（R s） - 符号率r-调制光源 码率）。 还公开了接收机和发送和接收方法。

公开(公告)号：US07395457B2

公开(公告)日：2008-07-01

申请号：US11149655

申请日：2005-06-10

Applicant: Guofei Jiang ,  Haifeng Chen ,  Cristian Ungureanu ,  Kenji Yoshihira

Inventor： Guofei Jiang ,  Haifeng Chen ,  Cristian Ungureanu ,  Kenji Yoshihira

IPC: G06F11/00

CPC classification number: G06F11/0751 ,  G06F11/0709

Abstract: To determine the cause of a problem, evaluating and tracing how an individual request traverses through various components in the system makes possible new detection techniques. The present invention relates to detecting faults in a computer system. In accordance with an embodiment of the invention, a method and apparatus detects a fault in a system by receiving a request and generating a trace based on the request. The trace is a sequence of components used to service the request. The method and apparatus also compares the trace with a stored automaton to determine whether the trace is an anomaly. The stored automaton describes traces.

Abstract translation: 为了确定问题的原因，评估和跟踪单个请求如何遍历系统中的各种组件，使得新的检测技术成为可能。 本发明涉及检测计算机系统的故障。 根据本发明的实施例，一种方法和装置通过接收请求并基于该请求生成跟踪来检测系统中的故障。 跟踪是用于服务请求的一系列组件。 方法和装置还将跟踪与存储的自动机进行比较，以确定跟踪是否是异常。 存储的自动机描述痕迹。

公开(公告)号：US20080154860A1

公开(公告)日：2008-06-26

申请号：US11691470

申请日：2007-03-26

Applicant: Songting Chen ,  Hua-Gang Li ,  Junichi Tatemura ,  Wang-Pin Hsiung ,  Divyakant Agrawal ,  Kasim Selcuk Candan

Inventor： Songting Chen ,  Hua-Gang Li ,  Junichi Tatemura ,  Wang-Pin Hsiung ,  Divyakant Agrawal ,  Kasim Selcuk Candan

IPC: G06F17/30

CPC classification number: G06F16/8373

Abstract: Systems and methods process generalized-tree-pattern queries by processing a twig query with a bottom-up computation to generate a generalized tree pattern result; encoding the generalized tree pattern results using hierarchical stacks; enumerating the generalized tree pattern result with a top-down computation; a hybrid of top-down and bottom-up computation for early result enumeration before reaching the end of document; and a more succinct encoding scheme that replaces the hierarchical stacks to further improve the performance.

Abstract translation: 系统和方法通过使用自下而上的计算处理树枝查询来生成广义树模式结果来处理广义树模式查询; 使用分层堆栈编码广义树模式结果; 使用自上而下的计算来枚举广义树模式结果; 在达到文档结束之前的早期结果枚举的自上而下和自下而上的计算的混合; 以及更简洁的编码方案，可以替代分层堆栈以进一步提高性能。