We consider optical camera communication (OCC) between a camera receiver with optical lenses and distributed transmitters. This paper investigates the features of an OCC system when the periods of reception and transmission are slightly different from each other. We describe a received light signal model for the OCC system with on-off keying and regard the received signals generated from a probability distribution of a Gaussian mixture model. We obtain the parameters of the probability distributions by applying a variational Bayesian inference method and utilize them for channel estimation. In addition, we define cost functions and minimize them to demodulate the transmitted bit sequences. The demodulation procedure uses a maximum-likelihood sequence detection method, which can be implemented by the Viterbi algorithm and estimates a synchronization parameter by minimizing the cost functions. Our new demodulation method requires neither synchronization devices nor training sequences for estimating the parameters. Moreover, the receiver does not need the precise transmission period, which is difficult to know in advance in practical situations because of the frequency tolerance of the clock generator in the transmitter. To validate our developed method, we conducted numerical simulations and compared the results with those from an oracle estimator that knows the parameters other than the bit sequence in advance. We also experimented in a real setup situation, and the results show the efficiency of our developed method.
Two extension tools for enhancing the compression performance of prediction-based lossless audio coding are proposed. One is progressive-order prediction of the starting samples at the random access points, where the information of previous samples is not available. The first sample is coded as is, the second is predicted by first-order prediction, the third is predicted by second-order prediction, and so on. This can be efficiently carried out with PAR-COR (PARtial autoCORrelation) coefficients. The second tool is interchannel joint coding. Both predictive coefficients and prediction error signals are efficiently coded by interchannel differential or three-tap adaptive prediction. These new prediction tools lead to a steady reduction in bit rate when random access is activated and the interchannel correlation is strong.
13 September 2023 in IEEE Transactions on Information Theory
A general class of the almost instantaneous fixed-to-variable-length (AIFV) codes is proposed, which contains every possible binary code we can make when allowing finite bits of decoding delay. The contribution of the paper lies in the following. (i) Introducing N -bit-delay AIFV codes, constructed by multiple code trees with higher flexibility than the conventional AIFV codes. (ii) Proving that the proposed codes can represent any uniquely-encodable and uniquely-decodable variable-to-variable length codes. (iii) Showing how to express codes as multiple code trees with minimum decoding delay. (iv) Formulating the constraints of decodability as the comparison of intervals in the real number line. The theoretical results in this paper are expected to be useful for further study on AIFV codes.
9 June 2025 in IEEE Transactions on Instrumentation and Measurement
Acousto-optic sensing provides an alternative approach to traditional microphone arrays by shedding light on the interaction of light with an acoustic field. Sound field reconstruction is a fascinating and advanced technique used in acousto-optics sensing. Current challenges in sound-field reconstruction methods pertain to scenarios in which the sound source is located within the reconstruction area, known as the exterior problem. Existing reconstruction algorithms, primarily designed for interior scenarios, often exhibit suboptimal performance when applied to exterior cases. This paper introduces a novel technique for exterior sound-field reconstruction. The proposed method leverages concentric circle sampling and a two-dimensional exterior sound-field reconstruction approach based on circular harmonic extensions. To evaluate the efficacy of this approach, both numerical simulations and practical experiments are conducted. The results highlight the superior accuracy of the proposed method when compared to conventional reconstruction methods, all while utilizing a minimal amount of measured projection data.
This paper presents an optimal construction of N-bit-delay almost instantaneous fixed-to-variable-length (AIFV) codes, the general form of binary codes we can make when finite bits of decoding delay are allowed. The presented method enables us to optimize lossless codes among a broader class of codes compared to the conventional FV and AIFV codes. The paper first discusses the problem of code construction, which contains some essential partial problems, and defines three classes of optimality to clarify how far we can solve the problems. The properties of the optimal codes are analyzed theoretically, showing the sufficient conditions for achieving the optimum. Then, we propose an algorithm for constructing N-bit-delay AIFV codes for given stationary memory-less sources. The optimality of the constructed codes is discussed both theoretically and empirically. They showed shorter expected code lengths when N ≥ 3 than the conventional AIFV-m and extended Huffman codes. Moreover, in the random numbers simulation, they performed higher compression efficiency than the 32-bit-precision range codes under reasonable conditions.