Abstract:
An improved aggregation scheme for wireless multi-hop mesh networks is disclosed. An aggregator at each node operates to merge VoIP packets at an ingress/source node with a forced delay, but at an intermediate node aggregated packets are either sent directly to their destination or to the next hop without deaggregation. A novel compression mechanism for compressing and decompressing the aggregated packets is also disclosed.
Abstract:
Disclosed is a data replication technique for providing erasure encoded replication of large data sets over a geographically distributed replica set. The technique utilizes a multicast tree to store, forward, and erasure encode the data set. The erasure encoding of data may be performed at various locations within the multicast tree, including the source, intermediate nodes, and destination nodes. In one embodiment, the system comprises a source node for storing the original data set, a plurality of intermediate nodes, and a plurality of leaf nodes for storing the unique replica fragments. The nodes are configured as a multicast tree to convert the original data into the unique replica fragments by performing distributed erasure encoding at a plurality of levels of the multicast tree.
Abstract:
A new machine learning technique is herein disclosed which generalizes the support vector machine framework. A separating hyperplane in a separating space is optimized in accordance with generalized constraints which are dependent upon the clustering of the input vectors in the dataset.
Abstract:
A method for human face detection that detects faces independently of their particular poses and simultaneously estimates those poses. Our method exhibits an immunity to variations in skin color, eyeglasses, facial hair, lighting, scale and facial expressions, and others. In operation, we train a convolutional neural network to map face images to points on a face manifold, and non-face images to points far away from that manifold, wherein that manifold is parameterized by facial pose. Conceptually, we view a pose parameter as a latent variable, which may be inferred through an energy-minimization process. To train systems based upon our inventive method, we derive a new type of discriminative loss function that is tailored to such detection tasks. Our method enables a multi-view detector that can detect faces in a variety of poses, for example, looking left or right (yaw axis), up or down (pitch axis), or tilting left or right (roll axis). Systems employing our method are highly-reliable, run at near real time (5 frames per second on conventional hardware), and is robust against variations in yaw (±90°), roll(±45°), and pitch(±60°).
Abstract:
A test output compaction architecture and method that takes advantage of a response shaper in order to minimize masking of faults during compaction. A response shaper is inserted between a plurality of scan chains and an output compactor. The response shaper receives output responses from scan chains and reshapes the output responses in a manner that minimizes masking of faults by the output compactor.
Abstract:
Disclosed is a density evolution algorithm based on a refined definition of node and edge densities for different parts of the code. In particular, density functions ƒV(1)(i) and ƒV(2)(i) of the output edges of the variable nodes with degree i within different codeword regions w1 and we, respectively, are defined and then calculated. Further, density functions ƒC(1)(j) and ƒC(2)(j) of the output edges for check nodes with degree j within codeword regions w1 and we, respectively, are defined and then calculated. Mixture density functions of output check edges connecting variable nodes in the first codeword region and the second codeword region are then calculated to determine an LDPC code design.
Abstract translation:公开了基于代码不同部分的节点和边缘密度的精确定义的密度演化算法。 特别地,(i)和(ii)(i)的浓度函数f(i) 分别在不同码字区域w 1和w e e中的等级i的可变节点的输出边缘被分别定义然后被计算。 此外,密度函数f(1)(j)和(C)的密度函数 分别定义并且然后计算在码字区域w 1和w e e中的具有度j的校验节点的输出边缘。 然后计算连接第一码字区域和第二码字区域中的可变节点的输出校验边缘的混合密度函数,以确定LDPC码设计。
Abstract:
Disclosed is a coded orthogonal frequency-division multiplexing (OFDM) system and method for reducing a peak-to-average power ratio (PAPR). The system and method include a modulator configured to modulate (e.g., using quadrature amplitude modulation (QAM)) coded bits into symbols. The system and method also include an inverse discrete fourier transform (IDFT) module to perform an IDFT on the symbols to produce an OFDM signal. The system and method measure the PAPR of the OFDM signal and transmit the signal to a receiver if the PAPR of the signal is less than a threshold PAPR.
Abstract:
A spatial compactor design and technique for the compaction of test response data is herein disclosed which advantageously provides a scan-out response with multiple opportunities to be observed on different output channels in one to several scan-shift cycles.
Abstract:
Disclosed is a method and apparatus for improved delay fault testing by optimizing the order of scan cells in a scan chain. The order of the scan cells is determined by using a cost value for an order of scan cells, the cost value being computed from costs assigned to orderings of individual pairs of scan cells. These costs can be based on the number of faults that are untestable when the pair of scan cells are placed consecutively in the scan chain. The disclosed techniques allow for enhanced delay fault coverage by rearranging scan flip-flops without increasing routing overhead.
Abstract:
A precoding technique is herein disclosed for a spread-spectrum transmission system which advantageously addresses intersymbol interference along with multiuser and interchip interference.