arXiv subjects

Moshe Schwartz

Publications and source records attributed to Moshe Schwartz.

At least 91 records · Page 5Linked to original sources

arXiv2014

Sensitivity of Yield Optimized Superoscillations

Super oscillating signals are band limited signals that oscillate in some region faster than their largest Fourier component. Such signals have many obvious scientific and technological applications, yet their practical use is strongly limited by the fact that an overwhelming proportion of the energy goes into that part of the signal, which is not superoscillating. In a recent article the problem of optimization of such signals has been studied. In that article the concept of superoscillation yield is defined as the ratio of the energy in the super oscillations to the total energy of the signal, given the range in time and frequency of the superoscillations, which is imposed by forcing the signal to interpolate among a set of predetermined points. The optimization of the superoscillation yield consists of obtaining the Fourier coefficients of the low frequency components of which the signal consists, that maximize the yield under the interpolation constraint. Since in practical applications it is impossible to determine the Fourier coefficients with infinite precision, it is necessary to answer two questions. The first is how is the superoscillating nature of the signal affected by random small deviations in those Fourier coefficients and the second is how is the yield affected? These are the questions addressed in the present article. Limits on the necessary precision are obtained. Those limits seem not to be impractical.

physics.data-an↗

arXiv2014

On a periodicity measure and superoscillations

The phenomenon of superoscillation, where band limited signals can oscillate over some time period with a frequency higher than the band limit, is not only very interesting but it also seems to offer many practical applications. The first reason is that the superoscillation frequency can be exploited to perform tasks beyond the limits imposed by the lower bandwidth of the signal. The second reason is that it is generic and applies to any wave form, be it optical, electrical, sonic, or quantum mechanical. For practical applications, it is important to overcome two problems. The first problem is that an overwhelming proportion of the energy goes into the non superoscillating part of the signal. The second problem is the control of the shape of the superoscillating part of the signal. The first problem has been recently addressed by optimization of the super oscillation yield, the ratio of the energy in the superoscillations to the total energy of the signal. The second problem may arise when the superoscillation, is to mimic a high frequency purely perodic signal. This may be required, for example, when a superoscillating force is to drive a harmonic oscillator at a high resonance frequency. In this paper the degree of periodicity of a signal is defined and applied to some yield optimized superoscillating signals.

physics.data-an↗

arXiv2014

The Capacity of String-Replication Systems

It is known that the majority of the human genome consists of repeated sequences. Furthermore, it is believed that a significant part of the rest of the genome also originated from repeated sequences and has mutated to its current form. In this paper, we investigate the possibility of constructing an exponentially large number of sequences from a short initial sequence and simple replication rules, including those resembling genomic replication processes. In other words, our goal is to find out the capacity, or the expressive power, of these string-replication systems. Our results include exact capacities, and bounds on the capacities, of four fundamental string-replication systems.

cs.IT↗

arXiv2014

Construction of Partial MDS (PMDS) and Sector-Disk (SD) Codes with Two Global Parity Symbols

Partial MDS (PMDS) codes are erasure codes combining local (row) correction with global additional correction of entries, while Sector-Disk (SD) codes are erasure codes that address the mixed failure mode of current RAID systems. It has been an open problem to construct general codes that have the PMDS and the SD properties, and previous work has relied on Monte-Carlo searches. In this paper, we present a general construction that addresses the case of any number of failed disks and in addition, two erased sectors. The construction requires a modest field size. This result generalizes previous constructions extending RAID~5 and RAID~6.

cs.IT↗

arXiv2014

Rate-Distortion for Ranking with Incomplete Information

We study the rate-distortion relationship in the set of permutations endowed with the Kendall Tau metric and the Chebyshev metric. Our study is motivated by the application of permutation rate-distortion to the average-case and worst-case analysis of algorithms for ranking with incomplete information and approximate sorting algorithms. For the Kendall Tau metric we provide bounds for small, medium, and large distortion regimes, while for the Chebyshev metric we present bounds that are valid for all distortions and are especially accurate for small distortions. In addition, for the Chebyshev metric, we provide a construction for covering codes.

cs.IT↗

arXiv2014

Flow equations for dense granular fluids: New insight from a first-principles derivation

We present a first-principles theory for plug-free dense granular flow. This is done by coarse-graining directly the microscopic dynamics and deriving an explicit relation between the macroscopic stress and strain rate tensors. The newly derived relation not only differs significantly from that of the existing empirical models for such flows but it also provides a novel understanding of the effect of rigid-like rotational regions in the flow.

cond-mat.soft↗

arXiv2013

Systematic Error-Correcting Codes for Rank Modulation

The rank-modulation scheme has been recently proposed for efficiently storing data in nonvolatile memories. Error-correcting codes are essential for rank modulation, however, existing results have been limited. In this work we explore a new approach, \emph{systematic error-correcting codes for rank modulation}. Systematic codes have the benefits of enabling efficient information retrieval and potentially supporting more efficient encoding and decoding procedures. We study systematic codes for rank modulation under Kendall's $τ$-metric as well as under the $\ell_\infty$-metric. In Kendall's $τ$-metric we present $[k+2,k,3]$-systematic codes for correcting one error, which have optimal rates, unless systematic perfect codes exist. We also study the design of multi-error-correcting codes, and provide two explicit constructions, one resulting in $[n+1,k+1,2t+2]$ systematic codes with redundancy at most $2t+1$. We use non-constructive arguments to show the existence of $[n,k,n-k]$-systematic codes for general parameters. Furthermore, we prove that for rank modulation, systematic codes achieve the same capacity as general error-correcting codes. Finally, in the $\ell_\infty$-metric we construct two $[n,k,d]$ systematic multi-error-correcting codes, the first for the case of $d=O(1)$, and the second for $d=Θ(n)$. In the latter case, the codes have the same asymptotic rate as the best codes currently known in this metric.

cs.IT↗

arXiv2013

Yield--Optimized Superoscillations

Superoscillating signals are band--limited signals that oscillate in some region faster their largest Fourier component. While such signals have many scientific and technological applications, their actual use is hampered by the fact that an overwhelming proportion of the energy goes into that part of the signal, which is not superoscillating. In the present article we consider the problem of optimization of such signals. The optimization that we describe here is that of the superoscillation yield, the ratio of the energy in the superoscillations to the total energy of the signal, given the range and frequency of the superoscillations. The constrained optimization leads to a generalized eigenvalue problem, which is solved numerically. It is noteworthy that it is possible to increase further the superoscillation yield at the cost of slightly deforming the oscillatory part of the signal, while keeping the average frequency. We show, how this can be done gradually, which enables a trade-off between the distortion and the yield. We show how to apply this approach to non-trivial domains, and explain how to generalize this to higher dimensions.

quant-ph↗

arXiv2013

Gray codes and Enumerative Coding for vector spaces

Gray codes for vector spaces are considered in two graphs: the Grassmann graph, and the projective-space graph, both of which have recently found applications in network coding. For the Grassmann graph, constructions of cyclic optimal codes are given for all parameters. As for the projective-space graph, two constructions for specific parameters are provided, as well some non-existence results. Furthermore, encoding and decoding algorithms are given for the Grassmannian Gray code, which induce an enumerative-coding scheme. The computational complexity of the algorithms is at least as low as known schemes, and for certain parameter ranges, the new scheme outperforms previously-known ones.

cs.IT↗

arXiv2012

On the Non-existence of Lattice Tilings by Quasi-crosses

We study necessary conditions for the existence of lattice tilings of $\R^n$ by quasi-crosses. We prove non-existence results, and focus in particular on the two smallest unclassified shapes, the $(3,1,n)$-quasi-cross and the $(3,2,n)$-quasi-cross. We show that for dimensions $n\leq 250$, apart from the known constructions, there are no lattice tilings of $\R^n$ by $(3,1,n)$-quasi-crosses except for ten remaining cases, and no lattice tilings of $\R^n$ by $(3,2,n)$-quasi-crosses except for eleven remaining cases.

cs.IT↗

arXiv2011

On the Labeling Problem of Permutation Group Codes under the Infinity Metric

Codes over permutations under the infinity norm have been recently suggested as a coding scheme for correcting limited-magnitude errors in the rank modulation scheme. Given such a code, we show that a simple relabeling operation, which produces an isomorphic code, may drastically change the minimal distance of the code. Thus, we may choose a code structure for efficient encoding/decoding procedures, and then optimize the code's minimal distance via relabeling. We formally define the relabeling problem, and show that all codes may be relabeled to get a minimal distance at most 2. The decision problem of whether a code may be relabeled to distance 1 is shown to be NP-complete, and calculating the best achievable minimal distance after relabeling is proved hard to approximate. Finally, we consider general bounds on the relabeling problem. We specifically show the optimal relabeling distance of cyclic groups. A specific case of a general probabilistic argument is used to show $\agl(p)$ may be relabeled to a minimal distance of $p-O(\sqrt{p\ln p})$.

cs.IT↗

arXiv2011

Exponent Inequalities in Dynamical Systems

In this letter we derive exponent inequalities relating the dynamic exponent $z$ to the steady state exponent $Γ$ for a general class of stochastically driven dynamical systems. We begin by deriving a general exact inequality, relating the response function and the correlation function, from which the various exponent inequalities emanate. We then distinguish between two classes of dynamical systems and obtain different and complementary inequalities relating $z$ and $Γ$. The consequences of those inequalities for a wide set of dynamical problems, including critical dynamics and Kardar-Parisi-Zhang-like problems are discussed.

cond-mat.stat-mech↗

arXiv2011

Dynamical Inequality in Growth Models

A recent exponent inequality is applied to a number of dynamical growth models. Many of the known exponents for models such as the Kardar-Parisi-Zhang (KPZ) equation are shown to be consistent with the inequality. In some cases, such as the Molecular Beam Equation, the situation is more interesting, where the exponents saturate the inequality. As the acid test for the relative strength of four popular approximation schemes we apply the inequality to the exponents obtained for two Non Local KPZ systems. We find that all methods but one, the Self Consistent Expansion, violate the inequality in some regions of parameter space. To further demonstrate the usefulness of the inequality, we apply it to a specific model, which belongs to a family of models in which the inequality becomes an equality. We thus show that the inequality can easily yield results, which otherwise have to rely either on approximations or general beliefs.

cond-mat.stat-mech↗

arXiv2011

Upper critical dimension of the KPZ equation

Numerical results for the Directed Polymer model in 1+4 dimensions in various types of disorder are presented. The results are obtained for system size considerably larger than that considered previously. For the extreme strong disorder case (Min-Max system), associated with the Directed Percolation model, the expected value of the meandering exponent, zeta = 0.5 is clearly revealed, with very week finite size effects. For the week disorder case, associated with the KPZ equation, finite size effects are stronger, but the value of seta is clearly seen in the vicinity of 0.57. In systems with "strong disorder" it is expected that the system will cross over sharply from Min-Max behavior at short chains to weak disorder behavior at long chains. This is indeed what we find. These results indicate that 1+4 is not the Upper Critical Dimension (UCD) in the week disorder case, and thus 4+1 does not seem to be the upper critical dimension for the KPZ equation.

cond-mat.stat-mech↗

arXiv2011

Snake-in-the-Box Codes for Rank Modulation

Motivated by the rank-modulation scheme with applications to flash memory, we consider Gray codes capable of detecting a single error, also known as snake-in-the-box codes. We study two error metrics: Kendall's $τ$-metric, which applies to charge-constrained errors, and the $\ell_\infty$-metric, which is useful in the case of limited magnitude errors. In both cases we construct snake-in-the-box codes with rate asymptotically tending to 1. We also provide efficient successor-calculation functions, as well as ranking and unranking functions. Finally, we also study bounds on the parameters of such codes.

cs.IT↗

arXiv2011

Generalized Gray Codes for Local Rank Modulation

We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. Local rank-modulation is a generalization of the rank-modulation scheme, which has been recently suggested as a way of storing information in flash memory. We study Gray codes for the local rank-modulation scheme in order to simulate conventional multi-level flash cells while retaining the benefits of rank modulation. Unlike the limited scope of previous works, we consider code constructions for the entire range of parameters including the code length, sliding window size, and overlap between adjacent windows. We show our constructed codes have asymptotically-optimal rate. We also provide efficient encoding, decoding, and next-state algorithms.

cs.IT↗

arXiv2011

Quasi-Cross Lattice Tilings with Applications to Flash Memory

We consider lattice tilings of $\R^n$ by a shape we call a $(\kp,\km,n)$-quasi-cross. Such lattices form perfect error-correcting codes which correct a single limited-magnitude error with prescribed maximal-magnitudes of positive error and negative error (the ratio of which is called the balance ratio). These codes can be used to correct both disturb and retention errors in flash memories, which are characterized by having limited magnitudes and different signs. We construct infinite families of perfect codes for any rational balance ratio, and provide a specific construction for $(2,1,n)$-quasi-cross lattice tiling. The constructions are related to group splitting and modular $B_1$ sequences. We also study bounds on the parameters of lattice-tilings by quasi-crosses, connecting the arm lengths of the quasi-crosses and the dimension. We also prove constraints on group splitting, a specific case of which shows that the parameters of the lattice tiling of $(2,1,n)$-quasi-crosses is the only ones possible.

cs.IT↗

arXiv2010

Trajectory Codes for Flash Memory

Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the stored data changes its value with certain patterns. The patterns of data updates are determined by the data structure and the application, and are independent of the constraints imposed by the storage medium. Thus, an appropriate coding scheme is needed so that the data changes can be updated and stored efficiently under the storage-medium's constraints. In this paper, we define the general rewriting problem using a graph model. It extends many known rewriting models such as floating codes, WOM codes, buffer codes, etc. We present a new rewriting scheme for flash memories, called the trajectory code, for rewriting the stored data as many times as possible without block erasures. We prove that the trajectory code is asymptotically optimal in a wide range of scenarios. We also present randomized rewriting codes optimized for expected performance (given arbitrary rewriting sequences). Our rewriting codes are shown to be asymptotically optimal.

cs.IT↗