随机图和复合系综中自旋系统的典型情况行为
Typical case behaviour of spin systems in random graph and composite ensembles
摘要:
本论文包括对对应于精确覆盖的无序自旋系综的分析,多通道问题,以及结合稀疏和密集相互作用的复合模型。使用一个简单的分支定界算法的统计分析解决精确覆盖的可满足性问题。该算法可以制定在大系统极限作为一个分支过程,可以分析的关键属性。远离临界点的一组微分方程可用于模拟该过程,这些微分方程可通过数值积分和精确定界法求解。多址信道问题制定为一个平衡的统计物理问题的情况下,在信道上的比特传输与功率控制和同步。稀疏码分多址方法被认为是和最佳的检测性能检查在典型情况下,通过使用的副本方法,并通过迭代解码方法实现的检测性能进行比较。这些代码被发现有非常相似的现象,以及理解密集的代码。复合模型作为正则稀疏和稠密无序自旋模型的抽象而引入。该模型包括耦合,由于密集和稀疏的拓扑结构同时。通过精确的副本分析在高温下,和变分方法在低温下,几个现象的稀疏或密集模型的特征被证明。提出了一种将复合交互结构扩展到码分多址方法的方法。新类型的代码表现出优于稀疏和密集的代码在某些制度,无论是在最佳性能,并在有限系统中的迭代检测方法实现的性能。
英文摘要:
This thesis includes analysis of disordered spin ensembles corresponding to Exact Cover, a multi-access channel problem, and composite models combining sparse and dense interactions. The satisfiability problem in Exact Cover is addressed using a statistical analysis of a simple branch and bound algorithm. The algorithm can be formulated in the large system limit as a branching process, for which critical properties can be analysed. Far from the critical point a set of differential equations may be used to model the process, and these are solved by numerical integration and exact bounding methods. The multi-access channel problem is formulated as an equilibrium statistical physics problem for the case of bit transmission on a channel with power control and synchronisation. A sparse code division multiple access method is considered and the optimal detection properties are examined in typical case by use of the replica method, and compared to detection performance achieved by iterative decoding methods. These codes are found to have phenomena closely resembling the well-understood dense codes. The composite model is introduced as an abstraction of canonical sparse and dense disordered spin models. The model includes couplings due to both dense and sparse topologies simultaneously. Through an exact replica analysis at high temperature, and variational approaches at low temperature, several phenomena uncharacteristic of either sparse or dense models are demonstrated. An extension of the composite interaction structure to a code division multiple access method is presented. The new type of codes are shown to outperform sparse and dense codes in some regimes both in optimal performance, and in performance achieved by iterative detection methods in finite systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。