Testing the Collective Properties of Small-World Networks through Roughness Scaling

Motivated by a fundamental synchronization problem in scalable parallel computing and by a recent criterion for ``mean-field'' synchronizability in interacting systems, we study the Edwards-Wilkinson model on two variations of a small-worldnetwork. In the first version each site has exactly one random link of strength $p$, while in the second one each site on average has $p$ links of unit strength. We construct a perturbative description for the width of the stationary-state surface (a measure of synchronization), in the weak- and sparse-coupling limits, respectively, and verify the results by performing exact numerical diagonalization. The width remains finite in both cases, but exhibits anomalous scaling with $p$ in the latter for $d\leq 2$.Comment: 4 pages, 3 figure

New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems

We propose two uniform solutions to an open question: the Firing Squad Synchronization Problem (FSSP), for hyperdag and symmetric neural P systems, with anonymous cells. Our solutions take e_c+5 and 6e_c+7 steps, respectively, where e_c is the eccentricity of the commander cell of the dag or digraph underlying these P systems. The first and fast solution is based on a novel proposal, which dynamically extends P systems with mobile channels. The second solution is substantially longer, but is solely based on classical rules and static channels. In contrast to the previous solutions, which work for tree-based P systems, our solutions synchronize to any subset of the underlying digraph; and do not require membrane polarizations or conditional rules, but require states, as typically used in hyperdag and neural P systems

Dynamic Transitions in Small World Networks: Approach to Equilibrium

We study the transition to phase synchronization in a model for the spread of infection defined on a small world network. It was shown (Phys. Rev. Lett. {\bf 86} (2001) 2909) that the transition occurs at a finite degree of disorder $p$, unlike equilibrium models where systems behave as random networks even at infinitesimal $p$ in the infinite size limit. We examine this system under variation of a parameter determining the driving rate, and show that the transition point decreases as we drive the system more slowly. Thus it appears that the transition moves to $p=0$ in the very slow driving limit, just as in the equilibrium case.Comment: 8 pages, 2 figure

Looking for Simple Common Schemes to Design Recognizer P Systems with Active Membranes That Solve Numerical Decision Problems

Earlier solutions to decision problems by means of P systems used many counter objects to control the synchronization of different stages in a computation (usually as many counters as the stage must last in the worst case). In this paper we propose a way to replace those counters with some spacial objects for each stage. Furthermore, following the ideas presented in [1], in order to have a common scheme to attack numerical problems, all instances of a problem with the same size are solved by the same P system (which depends on the size) given an input which describes the corresponding instance of the problem. We illustrate these ideas with a cellular solution to the Subset-Sum problem

Low Complexity Time Synchronization Algorithm for OFDM Systems with Repetitive Preambles

In this paper, a new time synchronization algorithm for OFDM systems with repetitive preamble is proposed. This algorithm makes use of coarse and fine time estimation; the fine time estimation is performed using a cross-correlation similar to previous proposals in the literature, whereas the coarse time estimation is made using a new metric and an iterative search of the last sample of the repetitive preamble. A complete analysis of the new metric is included, as well as a wide performance comparison, for multipath channel and carrier frequency offset, with the main time synchronization algorithms found in the literature. Finally, the complexity of the VLSI implementation of this proposal is discussed. © 2011 Springer Science+Business Media, LLC.This work was supported by the Spanish Ministerio de Educacion y Ciencia under grants TEC2006-14204-C02-01 and TEC2008-06787.Canet Subiela, MJ.; Almenar Terre, V.; Flores Asenjo, SJ.; Valls Coquillat, J. (2012). Low Complexity Time Synchronization Algorithm for OFDM Systems with Repetitive Preambles. Journal of Signal Processing Systems. 68(3):287-301. doi:10.1007/s11265-011-0618-6S287301683IEEE 802.11a standard (1999). Wireless LAN medium access control (MAC) and physical layer (PHY) specifications: high-speed physical layer in the 5 GHz band.IEEE 802.11 g standard (2003). Wireless LAN specifications: Further higher data rate extension in the 2.4 GHz band.IEEE 802.16-2004 (2004). Standard for local and metropolitan area networks, part 16: Air interface for fixed broadband wireless access systems.Lee, D., & Cheun, K. (2002). Coarse symbol synchronization algorithms for OFDM systems in multipath channels. IEEE Communications Letters, 6(10), 446–448.Park, B., Cheon, H., Ko, E., Kang, C., & Hong, D. (2004). A blind OFDM synchronization algorithm based on cyclic correlation. IEEE Signal Processing Letters, 11(2), 83–85.Beek, J. J., Sandell, M., & Börjesson, P. O. (1997). ML estimation of time and frequency offset in OFDM system. IEEE Transactions on Signal Processing, 45(7), 1800–1805.Ma, S., Pan, X., Yang, G., & Ng, T. (2009). Blind symbol synchronization based on cyclic prefix for OFDM systems. IEEE Transactions on Vehicular Technology, 58(4), 1746–1751.Schmidl, T., & Cox, D. (1997). Robust frequency and timing synchronization for OFDM. IEEE Transactions on Communications, 45(12), 1613–1621.Coulson, A. J. (2001). Maximum likelihood synchronization for OFDM using a pilot symbol: Algorithms. IEEE Journal on Selected Areas in Communications, 19(12), 2495–2503.Tufvesson, F., Edfors, O., & Faulker, M. (1999). Time and frequency synchronization for OFDM using PN-sequence preambles. Proceedings of the Vehicular Technology Conference (VTC), 4, 2203–2207.Shi, K., & Serpedin, E. (2004). Coarse frame and carrier synchronization of OFDM systems: a new metric and comparison. IEEE Transactions on Wireless Communications, 3(4), 1271–1284.Minn, H., Zeng, M., & Bhargava, V. K. (2000). On timing offset estimation for OFDM Systems. IEEE Communications Letters, 4, 242–244.Minn, H., Bhargava, V. K., & Letaief, K. B. (2003). A robust timing and frequency synchronization for OFDM systems. IEEE Transactions on Wireless Communications, 2(4), 822–839.Minn, H., Bhargava, V. K., & Letaief, K. B. (2006). A combined timing and frequency synchronization and channel estimation for OFDM. IEEE Transactions on Communications, 54(3), 416–422.Park, B., Cheon, H., Ko, E., Kang, C., & Hong, D. (2003). A novel timing estimation method for OFDM systems. IEEE Communications Letters, 7(5), 239–241.Chang, S., & Kelley, B. (2003). Time synchronization for OFDM-based WLAN systems. Electronics Letters, 39(13), 1024–1026.Wu, Y., Yip, K., Ng, T., & Serpedin, E. (2005). Maximum-likelihood symbol synchronization for IEEE 802.11a WLANs in unknown frequency-selective fading channels. IEEE Transactions on Wireless Communications, 4(6), 2751–2763.Larsson, E. G., Liu, G., Li, J., & Giannakis, G. B. (2001). Joint symbol timing and channel estimation for OFDM based WLANs. IEEE Communications Letters, 5(8), 325–327.Troya, A., Maharatna, K., Krstic, M., Grass, E., Jagdhold, U., & Kraemer, R. (2007). Efficient inner receiver design for OFDM-based WLAN systems: algorithm and architecture. IEEE Transactions on Wireless Communications, 6(4), 1374–1385.Yang, J., & Cheun, K. (2006). Improved symbol timing synchronization in IEEE 802.11a/g wireless LAN systems in multipath channels. International Conference on Consumer Electronics. doi: 10.1109/ICCE.2006.1598425 .Manusani, S. K., Hshetrimayum, R. S., & Bhattacharjee, R. (2006). Robust time and frequency synchronization in OFDM based 802.11a WLAN systems. Annual India Conference. doi: 10.1109/INDCON.2006.302775 .Zhou, L., & Saito, M. (2004). A new symbol timing synchronization for OFDM based WLANs under multipath fading channels. 15th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. doi: 10.1109/PIMRC.2004.1373890 .Kim, T., & Park, S.-C. (2007). A new symbol timing and frequency synchronization design for OFDM-based WLAN systems. 9th Conference on Advanced Communication Technology. doi: 10.1109/ICACT.2007.358691 .Baek, J. H., Kim, S. D., & Sunwoo, M. H. (2008). SPOCS: Application specific signal processor for OFDM communication systems. Journal of Signal Processing Systems, 53(3), 383–397.Van Kempen, G., & van Vliet, L. (2000). Mean and variance of ratio estimators used in fluorescence ratio imaging. Cytometry, 39(4), 300–305.J. Melbo, J., & Schramm, P. (1998). Channel models for HIPERLAN/2 in different indoor scenarios. 3ERI085B, HIPERLAN/2 ETSI/BRAN contribution.Abramowitz, M., & Stegun, I. A. (1972). Handbook of mathematical functions. Dover.López-Martínez, F. J., del Castillo-Sánchez, E., Entrambasaguas, J. T., & Martos-Naya, E. (2010). Iterative-gradient based complex divider FPGA core with dynamic configurability of accuracy and throughput. Journal of Signal Processing Systems. doi: 10.1007/s11265-010-0464-y .Angarita, F., Canet, M. J., Sansaloni, T., Perez-Pascual, A., & Valls, J. (2008). Efficient mapping of CORDIC Algorithm for OFDM-based WLAN. Journal of Signal Processing Systems, 52(2), 181–191

An adaptive fuzzy observer-based approach for chaotic synchronization

AbstractThis paper presents an adaptive fuzzy observer design to synchronize chaotic systems. The chaotic system is expressed in the form of Takagi–Sugeno fuzzy model (T–S fuzzy system), which considers the effect of model mismatches. Based on this model, an adaptive fuzzy observer is developed to deal with the synchronization of nonidentical chaotic systems. In contrast to the framework of parallel distributed compensation for T–S fuzzy system, the proposed method does not rely on the existence of common matrix P which is imposed in stability conditions. The computer simulation examines the performance of two well-known chaotic systems, Lorenz system and Chua circuit. The results show that the proposed approach cannot only attain synchronization but also is robust to parameter perturbations in the drive system

Synchronization in Scale Free networks: The role of finite size effects

Synchronization problems in complex networks are very often studied by researchers due to its many applications to various fields such as neurobiology, e-commerce and completion of tasks. In particular, Scale Free networks with degree distribution $P(k)\sim k^{-\lambda}$, are widely used in research since they are ubiquitous in nature and other real systems. In this paper we focus on the surface relaxation growth model in Scale Free networks with $2.5< \lambda <3$, and study the scaling behavior of the fluctuations, in the steady state, with the system size $N$. We find a novel behavior of the fluctuations characterized by a crossover between two regimes at a value of $N=N^*$ that depends on $\lambda$: a logarithmic regime, found in previous research, and a constant regime. We propose a function that describes this crossover, which is in very good agreement with the simulations. We also find that, for a system size above $N^{*}$, the fluctuations decrease with $\lambda$, which means that the synchronization of the system improves as $\lambda$ increases. We explain this crossover analyzing the role of the network's heterogeneity produced by the system size $N$ and the exponent of the degree distribution.Comment: 9 pages and 5 figures. Accepted in Europhysics Letter

Generalized synchronization of chaos in autonomous systems

We extend the concept of generalized synchronization of chaos, a phenomenon that occurs in driven dynamical systems, to the context of autonomous spatiotemporal systems. It means a situation where the chaotic state variables in an autonomous system can be synchronized to each other but not to a coupling function defined from them. The form of the coupling function is not crucial; it may not depend on all the state variables nor it needs to be active for all times for achieving generalized synchronization. The procedure is based on the analogy between a response map subject to an external drive acting with a probability p and an autonomous system of coupled maps where a global interaction between the maps takes place with this same probability. It is shown that, under some circumstances, the conditions for stability of generalized synchronized states are equivalent in both types of systems. Our results reveal the existence of similar minimal conditions for the emergence of generalized synchronization of chaos in driven and in autonomous spatiotemporal systems.Comment: 5 pages, 7 figures, accepted in PR

Multiple timing offsets compensation in cooperative communication systems

Cooperative communication systems have attracted much attention recently due to their desirable performance gain while using single antenna terminals. However, most of the existin works on cooperative communications require perfect timing synchronization among users, which is usually not true in practical systems. In this paper, a general framework of the re-synchronization filter design is developed in order to com pensate the multiple timing offsets at the destination. The proposed method is applied to different scenarios with varying degrees of timing misalignment and is numerically shown to provide excellent performances that approach the perfectly synchronized case. © 2009 IEEE.published_or_final_versionThe 16th International Conference on Digital Signal Processing (DSP 2009), Santorini-Hellas, Greece, 5-7 July 2009. In Proceedings of 16th DSP, 2009, p. 1-