Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userStatistical mechanical analysis of a hierarchical random code ensemble in signal processing
458
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We study a random code ensemble with a hierarchical structure, which is closely related to the generalized random energy model with discrete energy values. Based on this correspondence, we analyze the hierarchical random code ensemble by using the replica method in two situations: lossy data compression and channel coding. For both the situations, the exponents of large deviation analysis characterizing the performance of the ensemble, the distortion rate of lossy data compression and the error exponent of channel coding in Gallagers formalism, are accessible by a generating function of the generalized random energy model. We discuss that the transitions of those exponents observed in the preceding work can be interpreted as phase transitions with respect to the replica number. We also show that the replica symmetry breaking plays an essential role in these transitions.
rate research
Read More
The maximum entropy principle from statistical mechanics states that a closed system attains an equilibrium distribution that maximizes its entropy. We first show that for graphs with fixed number of edges one can define a stochastic edge dynamic that can serve as an effective thermalization scheme, and hence, the underlying graphs are expected to attain their maximum-entropy states, which turn out to be Erdos-Renyi (ER) random graphs. We next show that (i) a rate-equation based analysis of node degree distribution does indeed confirm the maximum-entropy principle, and (ii) the edge dynamic can be effectively implemented using short random walks on the underlying graphs, leading to a local algorithm for the generation of ER random graphs. The resulting statistical mechanical system can be adapted to provide a distributed and local (i.e., without any centralized monitoring) mechanism for load balancing, which can have a significant impact in increasing the efficiency and utilization of both the Internet (e.g., efficient web mirroring), and large-scale computing infrastructure (e.g., cluster and grid computing).
We review the information geometry of linear systems and its application to Bayesian inference, and the simplification available in the Kahler manifold case. We find conditions for the information geometry of linear systems to be Kahler, and the relation of the Kahler potential to information geometric quantities such as $alpha $-divergence, information distance and the dual $alpha $-connection structure. The Kahler structure simplifies the calculation of the metric tensor, connection, Ricci tensor and scalar curvature, and the $alpha $-generalization of the geometric objects. The Laplace--Beltrami operator is also simplified in the Kahler geometry. One of the goals in information geometry is the construction of Bayesian priors outperforming the Jeffreys prior, which we use to demonstrate the utility of the Kahler structure.
Code Division Multiple Access (CDMA) in which the spreading code assignment to users contains a random element has recently become a cornerstone of CDMA research. The random element in the construction is particular attractive as it provides robustness and flexibility in utilising multi-access channels, whilst not making significant sacrifices in terms of transmission power. Random codes are generated from some ensemble, here we consider the possibility of combining two standard paradigms, sparsely and densely spread codes, in a single composite code ensemble. The composite code analysis includes a replica symmetric calculation of performance in the large system limit, and investigation of finite systems through a composite belief propagation algorithm. A variety of codes are examined with a focus on the high multi-access interference regime. In both the large size limit and finite systems we demonstrate scenarios in which the composite code has typical performance exceeding sparse and dense codes at equivalent signal to noise ratio.
Typical properties of computing circuits composed of noisy logical gates are studied using the statistical physics methodology. A growth model that gives rise to typical random Boolean functions is mapped onto a layered Ising spin system, which facilitates the study of their ability to represent arbitrary formulae with a given level of error, the tolerable level of gate-noise, and its dependence on the formulae depth and complexity, the gates used and properties of the function inputs. Bounds on their performance, derived in the information theory literature via specific gates, are straightforwardly retrieved, generalized and identified as the corresponding typical-case phase transitions. The framework is employed for deriving results on error-rates, function-depth and sensitivity, and their dependence on the gate-type and noise model used that are difficult to obtain via the traditional methods used in this field.
We study analytically and numerically the dynamics of the generalized Rosenzweig-Porter model, which is known to possess three distinct phases: ergodic, multifractal and localized phases. Our focus is on the survival probability $R(t)$, the probability of finding the initial state after time $t$. In particular, if the system is initially prepared in a highly-excited non-stationary state (wave packet) confined in space and containing a fixed fraction of all eigenstates, we show that $R(t)$ can be used as a dynamical indicator to distinguish these three phases. Three main aspects are identified in different phases. The ergodic phase is characterized by the standard power-law decay of $R(t)$ with periodic oscillations in time, surviving in the thermodynamic limit, with frequency equals to the energy bandwidth of the wave packet. In multifractal extended phase the survival probability shows an exponential decay but the decay rate vanishes in the thermodynamic limit in a non-trivial manner determined by the fractal dimension of wave functions. Localized phase is characterized by the saturation value of $R(ttoinfty)=k$, finite in the thermodynamic limit $Nrightarrowinfty$, which approaches $k=R(tto 0)$ in this limit.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
