Filetype
Network re-optimization is a process that must be triggered periodically in order to improve the inefficient resource allocation of online routing heuristics due to the uncertainty of online lightpath demand arrivals and departures. Network re-optimization involves two tasks: a) finding new lightpaths for a (sub)set of current demands, i.e. rerouting, and b) migrating the current traffic to the ne
We use a 2-dimensional (2-D) Vernier gated-ring-oscillator (GRO) time-to-digital-converter (TDC) in a cascade structure (MASH), so that a larger raw quantization step can be allowed without sacrificing the final resolution performance. The 2-D approach effectively reduces the latency time under a large input, while the MASH structure provides a 2nd-order noise shaping that produces a lower in-band
Regional climate modeling is a dynamical downscaling technique applied to the results of global climate models (GCMs) in order to acquire more information on climate simulations and climate change projections. GCMs and regional climate models (RCMs) have undergone considerable development over the past few decades, and both have increased in resolution. The higher-resolution edge of RCMs compared
Abstract in Undetermined Given an undirected graph g(V, E), a set of traffic matrices H and one additional traffic matrix h, we say that H totally dominates h if, for each capacity reservation u supporting H, u also supports h using the same routing pattern. It has been shown that if vertical bar H vertical bar = 1 = (H = {(h) over cap}, say) and g, is a complete graph, H totally dominates h if, a
Atmospheric aerosol particles influence the climate system directly by scattering and absorbing solar radiation, and indirectly by acting as cloud condensation nuclei(1-4). Apart from black carbon aerosol, aerosols cause a negative radiative forcing at the top of the atmosphere and substantially mitigate the warming caused by greenhouse gases(1). In the future, tightening of controls on anthropoge
In this paper we present an improved algorithm for finding low-weight multiples of polynomials over the binary field using coding theoretic methods. The associated code defined by the given polynomial has a cyclic structure, allowing an algorithm to search for shifts of the sought minimum-weight codeword. Therefore, a code with higher dimension is constructed, having a larger number of low-weight
How hard are geometric vision problems with outliers? We show that for most fitting problems, a solution that minimizes the num- ber of outliers can be found with an algorithm that has polynomial time- complexity in the number of points (independent of the rate of outliers). Further, and perhaps more interestingly, other cost functions such as the truncated L2 -norm can also be handled within the
Abstract in UndeterminedA family of iterative receivers is evaluated in terms of complexity and performance for the case of an uplink multi-user (MU) multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) system. The transmission over block fading channels is considered. The analyzed class of receivers is performing channel estimation inside the iterative detection l
We present a study of tail-bias-current 1/f noise upconversion into 1/f(3) phase noise for both CMOS Colpitts and differential-pair LC oscillators. We focus on the incremental Groszkowski effect, i.e., the modulation of the shift in oscillation frequency induced by the higher current harmonics flowing into the LC tank of a harmonic oscillator induced by bias instabilities, as we show that there is
Primary and backup paths in MPLS fast reroute (FRR) may be established as shortest paths according to the administrative link costs of the IP control plane, or as explicitly calculated arbitrary paths. In both cases, the path layout can be optimized so that the maximum link utilization for a specific traffic matrix and for a set of considered failure scenarios is minimized. In this paper, we propo
BEAN is a newly proposed lightweight stream cipher adopting Fibonacci FCSRs. It is designed for very constrained environments and aims at providing a balance between security, efficiency and cost. A weakness in BEAN was first found by Ågren and Hell in 2011, resulting in a key recovery attack slightly better than brute force. In this paper, we present new correlations between state and keystream w
In this article we present a survey of routing methods in Optical Burst Switching (OBS) networks We begin with a description of routing approaches and follow the discussion with a detailed classification of routing algorithms in OBS. Afterwards, we discuss common OBS network loss models that are frequently used in routing optimization. As examples of such application, we present a linear and a non
The paper is devoted to modeling and optimization of reliable wireless mesh networks that employ directional antennas. We introduce two mixed-integer programming formulations that allow to simultaneously characterize routing patterns and transmission schedules. The first model allows for maximizing the minimal flow in a network. The second model involves reliability constraints and aims at minimiz
Vehicle-to-vehicle (V2V) communications have received increasingattention lately, but there is a lack of reported results regarding important quantities such as path loss. This paper presents parameterized path loss models for V2V communications based on extensive sets of measurement data collected mainly under line-of-sight conditions in four different propagation environments: highway, rural, ur
Analog decoders are constructed based on interconnecting CMOS Gilbert vector multipliers using transistors operating in the sub-VT region. They are seen as an interesting alternative to digital implementations with a low transistor count and a potential for a very low power consumption. Analog implementation makes the circuit sensitive to mismatch, requiring careful transistor sizing. A simulation
In this paper we prove threshold saturation for spatially coupled turbo codes (SC-TCs) and braided convolutional codes (BCCs) over the binary erasure channel. We introduce a compact graph representation for the ensembles of SC-TC and BCC codes which simplifies their description and the analysis of the message passing decoding. We demonstrate that by few assumptions in the ensembles of these codes,
Signal-to-noise ratio (SNR) estimation is commonly used in wireless receivers to enhance the performance in different ways. In this paper a novel low complexity SNR estimator for OFDM is proposed. The estimator might be implemented using floating point representation or by using only the sign-bit, and can if desired be effectively implemented by reconfiguring the standard correlator used for time-
