Results 1  10
of
47
JThB40.pdf Generation of 16Gb/s MSK signal using a single 10GHz SSB modulator and simplified encoder/decoder
"... Abstract: We propose a new scheme for generating optical MSK by using a commercial SSB modulator. The demodulation of the signal is based on a 2bit delay MZI to simplify precoding/decoding circuits. This scheme is successfully demonstrated in a 16Gb/s system. ©2006 Optical Society ofAmerica OCIS ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: We propose a new scheme for generating optical MSK by using a commercial SSB modulator. The demodulation of the signal is based on a 2bit delay MZI to simplify precoding/decoding circuits. This scheme is successfully demonstrated in a 16Gb/s system. ©2006 Optical Society ofAmerica OCIS
Suboptimum Algorithm for Estimating Transmitted Code Bits For . . .
"... We consider a class of data transmission systems where one has to construct estimates of the transmitted code bits and the quality is characterized by n error probabilities : the j{th bit error is de ned as the event that the j{th bit at the output of the decoder diers from the j{th transmitted ..."
Abstract
 Add to MetaCart
We consider a class of data transmission systems where one has to construct estimates of the transmitted code bits and the quality is characterized by n error probabilities : the j{th bit error is de ned as the event that the j{th bit at the output of the decoder diers from the j{th transmitted
JTh2A.19.pdf OFC/NFOEC Technical Digest © 2013 OSA 100GHz GridAligned Reconfigurable Polarization Insensitive BlackBox Wavelength Converter
"... Abstract: A new scheme for a flexible modulation, bit rate independent, reconfigurable and polarization insensitive wavelength converter based on FWM in a highly nonlinear fiber is demonstrated and characterized with 10Gbaud 16 QAM signals. OCIS codes: (060.4370) Nonlinear optics, fibers; (130.740 ..."
Abstract
 Add to MetaCart
Abstract: A new scheme for a flexible modulation, bit rate independent, reconfigurable and polarization insensitive wavelength converter based on FWM in a highly nonlinear fiber is demonstrated and characterized with 10Gbaud 16 QAM signals. OCIS codes: (060.4370) Nonlinear optics, fibers; (130
Lexoptimal online multiclass scheduling with hard deadlines
, 2000
"... Online scheduling of unitlength packets with hard deadlines by a single server in slotted time is considered. First, the set of all throughput optimal scheduling policies is characterized. Then multiclass packets are considered in which each packet has an Mbit class identifier. A new optimality p ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
property called lexoptimality (short for lexicographic optimality) is defined for online scheduling policies. Lexoptimality is a hierarchical sequence of M throughput optimality properties, the jth property keying on the jth bit of the class identifiers. The set of all lexoptimal policies that do
Approximate listdecoding of direct product . . .
"... Given a message msg ∈ {0, 1} N, its kwise direct product encoding is the sequence of ktuples (msg(i1),..., msg(ik)) over all possible ktuples of indices (i1,..., ik) ∈ {1,..., N} k. We give an efficient randomized algorithm for approximate local listdecoding of direct product codes. That is, gi ..."
Abstract

Cited by 33 (8 self)
 Add to MetaCart
) fraction of positions. The decoding is local in that our algorithm outputs a list of Boolean circuits so that the jth bit of the ith output string can be computed by running the ith circuit on input j. The running time of the algorithm is polynomial in log N and 1/ɛ. In general, when ɛ> e−kα for a
A Partial Retrieval of Music Data with Different Bit Rate using MPEG4 TwinVQ Audio Compression
"... The present paper describes a method for partial retrieval of a piece of music using the autocorrelation coefficients computed in the encoding step of TwinVQ (Transformdomain Weighted Interleave Vector Quantization) audio compression (MPEG4 audio standard). Our key contribution is to realize parti ..."
Abstract
 Add to MetaCart
approximate the jth autocorrelation ⌊coefficient with bit rate B2 of the piece
RICE UNIVERSITY Regime Change: Sampling Rate vs. BitDepth in Compressive Sensing
, 2011
"... The compressive sensing (CS) framework aims to ease the burden on analogtodigital converters (ADCs) by exploiting inherent structure in natural and manmade signals. It has been demonstrated that structured signals can be acquired with just a small number of linear measurements, on the order of t ..."
Abstract
 Add to MetaCart
of the signal complexity. In practice, this enables lower sampling rates that can be more easily achieved by current hardware designs. The primary bottleneck that limits ADC sampling rates is quantization, i.e., higher bitdepths impose lower sampling rates. Thus, the decreased sampling rates of CS ADCs
Some Bounds on Multiparty Communication Complexity of Pointer Jumping
, 1996
"... We introduce the model of conservative oneway multiparty complexity and prove lower and upper bounds on the complexity of pointer jumping. The pointer jumping function takes as its input a directed layered graph with a starting node and k layers of n nodes, and a single edge from each node to one ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
node from the next layer. The output is the node reached by following k edges from the starting node. In a conservative protocol Player i can see only the node reached by following the first i \Gamma 1 edges and the edges on the jth layer for each j ? i (compared to the general model where he sees
Description of Binary Sequences Based on the Interval Linear Complexity Profile
"... We consider the problem of partial approximation of binary sequences by the outputs of linear feedback shift registers. A generalization of the linear complexity profiles of binary sequences leads to a sequence that is regarded as the profile of interval linear complexity. This concept is useful if ..."
Abstract
 Add to MetaCart
if we want to identify all fragments of the given binary sequence having length at least 2m which can be described by m+ n bits, where n < m: We show that a fixed jth component belongs to such a fragment with probability 1=3 in the ensemble of fair cointossing sequences. We also apply the interval
Notes on generating Sobol ′ sequences
, 2008
"... The algorithm for generating Sobol ′ sequences is clearly explained in [2]. Here we give a brief outline of the details. To generate the jth component of the points in a Sobol ′ sequence, we need to choose a primitive polynomial of some degree sj in the field Z2, xsj + a1,j x sj−1 + a2,j xsj−2 + · ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The algorithm for generating Sobol ′ sequences is clearly explained in [2]. Here we give a brief outline of the details. To generate the jth component of the points in a Sobol ′ sequence, we need to choose a primitive polynomial of some degree sj in the field Z2, xsj + a1,j x sj−1 + a2,j xsj−2
Results 1  10
of
47