Lucent Technologies Inc.

Alcatel Lucent

Alcatel-lucent USA Inc.

Emina Soljanin

Carl Jeremy Nuzman

Adriaan J De Lind Van Wijngaarden

Aleksandra Mojsilovic

Peter Johannes Winzer

Alexei Ashikhmin

Katherine Hua Guo

Thomas L Marzetta

Thomas Y Woo

Nandu Gopalakrishnan

Philip Alfred Whiting

Antonia Maria Tulino

Jaehyeong Kim

Necip Sayiner

Kyle Guan

Silvija Kokalj-Filipovic

Nedeljko Varnica

Amin Emad

A capability is provided for securely transferring a file within network-based storage. A capability is provided for securely transferring a user file of a user from a first server to a second server. The first server may be associated with a first service provider and the second server may be associated with a second service provider. The secure transfer of a user file from the first server to the second server may be performed based on a One-Click File Transfer capability in which only a single click by the user is needed in order for the user file to be transferred. The secure transfer of a user file from the first server to the second server may be performed based on a Zero-Click File Transfer capability in which the user file may be transferred without any interaction by the user.

Secure file transfers within network-based storage

At least one example embodiment discloses a method of determining crosstalk for at least one first line in a communication system having a plurality of second lines. The method includes obtaining at least one pilot matrix representing a sequence of pilot signals and transmitting pilot signals across the plurality of second lines in accordance with the at least one pilot matrix. The method further includes obtaining measurement vectors for the at least one first line on a plurality of subcarriers, in response to the transmitted pilot signals, determining a weighted vector, the weighted vector being a weighted combination of the measurement vectors and determining a crosstalk coupling vector based on the determined weighted vector.

Methods and systems for determining crosstalk for a line in a vectored system

In one aspect, a compressive sampling encoder comprises matrix determination circuitry configured to determine a particular sampling matrix selected from a codebook comprising a plurality of sampling matrices. The compressive sampling encoder further comprises sampling circuitry coupled to the matrix determination circuitry and configured to apply the particular sampling matrix to a first signal to generate a second signal, and encryption circuitry configured to receive an identifier of the particular sampling matrix and to encrypt the identifier of the particular sampling matrix. The compressive sampling encoder provides at one or more outputs thereof the second signal and the encrypted identifier of the particular sampling matrix. Other aspects include a compressive sampling decoder, compressive sampling encoding and decoding methods, and associated computer program products.

Secure compressive sampling using codebook of sampling matrices

At least one example embodiment discloses a method of determining crosstalk for a joining line in a communication system having a plurality of current active lines. The method includes obtaining a number of disturber lines among the plurality of current active lines, the number of disturber lines being less than a number of the plurality of current active lines, obtaining a pilot matrix, a first dimension of the pilot matrix being based on the number of disturber lines, the pilot matrix representing a sequence of pilots to be transmitted across the plurality of current active lines and the joining line, the first dimension being a number of time instances, the number of time instances being less than the number of the plurality of active lines and determining a crosstalk coupling vector for the joining line based on the pilot matrix.

Methods and systems for determining crosstalk for a joining line in a vectored system

A transmitter, receiver and method for mitigating the cliff effect for content delivery over a heterogeneous network. In one embodiment, the transmitter includes: (1) a joint encoder configured to receive a content unit and generate multiple quantized representations thereof and (2) an erasing quantizer associated with the joint encoder and configured to select, from uncoded symbols representing the content unit, multiple subsets of the uncoded symbols. The multiple quantized representations and the multiple subsets of the uncoded symbols are associated to form multiple, independently quantized, correlated descriptions of the content unit. Two design parameters may be employed to control the level of correlation. In one embodiment, the receiver includes: (1) a joint decoder configured to decode quantized representations extracted from received descriptions representing a content unit and (2) a summing junction associated with the joint decoder and configured to employ at least one uncoded symbol representing the content unit to compensate for at least one corresponding symbol that the joint decoder failed to decode.

System and method for mitigating the cliff effect for content delivery over a heterogeneous network

Various embodiments provide for detection of tapping of an optical signal. In one embodiment an optical fiber includes a cladding region and first and second core regions. The first core region has a first core medium having a first mode-dependent loss (MDL) figure of merit. The second core region has a second core medium having a second different MDL figure of merit. Tapping of the optical signal may be determined to occur when the MDL of the first and second optical signals differs by a predetermined threshold value.

Optical fibers with varied mode-dependent loss

Significant improvement in Raptor codes and punctured LDPC codes are obtainable by use of the invention. In both a transmission scheme for Raptor-encoded or LDPC-encoded information, a dynamic adjustment approach is employed. A fraction of a codeword or information frame is transmitted. A feedback signal is sent from the receiver to the transmitter indicating either 1) successful decoding, or 2) failure to decode and/or a feedback signal indicative of a statistical measure of transmission channel quality. If decoding fails, a further portion of the codeword or frame is sent. The intensity and/or size of the fraction is adjusted based on the feedback signal. In one embodiment, a specific range for probabilities employed in the encoding process for Raptor codes provides the ability to increase transmission throughput. Further it has been found that the advantageous Raptor codes are useful in noise conditions where even the improved punctured LDPC codes of the invention begin to degrade.

Encoded transmission

A method is provided to accurately predict the probability of successfully recovering frames of (coded) information received over a wireless link, without having to decode the frame. This method includes receiving a first encoded signal and predicting link errors based on characteristics of the first encoded signal and variations in these characteristics before decoding the first encoded signal.

Method and apparatus for link error prediction in a communication system

A method for assigning a color symbol to an image pixel comprises selecting a luminance value from a discrete set of quantized luminance values; selecting a chrominance value from an ordered discrete set of quantized chrominance values; and composing a color symbol from an index of the selected luminance value and an index of an ordinal position of the selected chrominance value. In particular embodiments of the invention, each discrete chrominance value is selected from a Fibonacci lattice on a constant-luminance plane in a perceptually uniform color space such as Lab or Luv.

Method of color quantization in color images

Data words are converted to codewords in accordance with a run-length limited (RLL) or maximum transition run (MTR) code in which the codewords are subject to one or more constraints on the number of consecutive like symbols. The data words and codewords are each partitioned into a number of disjoint subsets. Associated with each of the disjoint subsets of data words is a distinct mapping. A given data word is converted to a codeword by applying to the given data word the mapping associated with the subset containing that data word. The mappings are configured to utilize symmetry whenever possible. For example, if Y&equals;&psgr;(X) represents the mapping of a given data word X onto a corresponding codeword Y. then it is preferred that X&prime; and Y&prime; representing the words X and Y in reversed order, satisfy the relation Y&prime;&equals;&psgr;(X&prime;). An example of an efficient high-rate, multi-purpose code in accordance with the invention is a rate 16/17 code satisfying (0,15,9,9) RLL and (0,3,2,2) MTR constraints. This exemplary code can be further processed using interleaving techniques to generate other higher rate codes.

Methods and apparatus for implementing run-length limited and maximum transition run codes

Low disparity coding method for digital data

A method of decoding a sequence of samples received over a communications channel, such as a partial response channel, in which the sequence represents a length k binary bit stream encoded as a sequence of bipolar symbols comprised of q groups of L symbols, each length L group of said symbols corresponding to one of 2.sup.m subwords having a predetermined block digital sum. The decoding method makes use of the structure of the encoding method by finding, in one illustrative embodiment, for each group of L samples, the maximum likelihood path through a time varying trellis supporting the sets of subwords having predetermined block digital sums to identify said subwords; recording the state metrics and branch metrics for each path and identifying, from the metrics the maximum likelihood path, the order of concatenation of the subwords.

Method of detecting DC-free sequences

A method and apparatus generates a channel codeword based on codewords with arbitrary block digital sums. Respective portions of the channel codeword are generated based on respective sets of input symbols, and the channel codeword is generated from the portions in accordance with another set of input symbols. The potions are advantageously codewords, comprising symbols, generated by selecting, for each set of input symbols, a codeword from a codebook and by adapting, as for example by ordering or by inverting symbols in, the codewords to form the channel codeword.

Growing community of inventors

Green Village, NJ, United States of America

Emina Soljanin