Performance Analysis of Reconstruction Techniques for Frequency-Domain Optical-Coherence Tomography

We address the issue of noise robustness of reconstruction techniques for frequency-domain optical-coherence tomography (FDOCT). We consider three reconstruction techniques: Fourier, iterative phase recovery, and cepstral techniques. We characterize the reconstructions in terms of their statistical bias and variance and obtain approximate analytical expressions under the assumption of small noise. We also perform Monte Carlo analyses and show that the experimental results are in agreement with the theoretical predictions. It turns out that the iterative and cepstral techniques yield reconstructions with a smaller bias than the Fourier method. The three techniques, however, have identical variance profiles, and their consistency increases linearly as a function of the signal-to-noise ratio.

Pyroelectric properties of Bi2VO5.5 ceramic

The dielectric, pyroelectric and thermal properties of ferroelectric Bi2VO5.5(Bi4V2O11) ceramic have been studied over a temperature range of 300-780 K. The sign of the pyroelectric coefficient is positive at room temperature. The dielectric constant, pyroelectric coefficient and specific heat exhibit anomalies around the Curie temperature, 725 K. The frequency response of the dielectric constant and tan delta has been studied over a frequency range of 1-100 kHz. It is found that both the dielectric constant and the loss tangent decrease with increasing frequency. The pyroelectric figures of merit from the point of view of different applications have been calculated at 320 K by combining pyroelectric, dielectric and thermal properties.

A Flexible Class of Regenerating Codes for Distributed Storage

In the distributed storage setting introduced by Dimakis et al., B units of data are stored across n nodes in the network in such a way that the data can be recovered by connecting to any k nodes. Additionally one can repair a failed node by connecting to any d nodes while downloading at most beta units of data from each node. In this paper, we introduce a flexible framework in which the data can be recovered by connecting to any number of nodes as long as the total amount of data downloaded is at least B. Similarly, regeneration of a failed node is possible if the new node connects to the network using links whose individual capacity is bounded above by beta(max) and whose sum capacity equals or exceeds a predetermined parameter gamma. In this flexible setting, we obtain the cut-set lower bound on the repair bandwidth along with a constructive proof for the existence of codes meeting this bound for all values of the parameters. An explicit code construction is provided which is optimal in certain parameter regimes.