Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 5; Issue 5. Fixed Points - From Russia with Love - A Primer of Fixed Point Theory. A K Vijaykumar. Book Review Volume 5 Issue 5 May 2000 pp 101-102. Fulltext. Click here to view fulltext PDF. Permanent link:
Directory of Open Access Journals (Sweden)
Sanjo Zlobec
2017-04-01
Full Text Available A set of sufficient conditions which guarantee the existence of a point x⋆ such that f(x⋆ = x⋆ is called a "fixed point theorem". Many such theorems are named after well-known mathematicians and economists. Fixed point theorems are among most useful ones in applied mathematics, especially in economics and game theory. Particularly important theorem in these areas is Kakutani's fixed point theorem which ensures existence of fixed point for point-to-set mappings, e.g., [2, 3, 4]. John Nash developed and applied Kakutani's ideas to prove the existence of (what became known as "Nash equilibrium" for finite games with mixed strategies for any number of players. This work earned him a Nobel Prize in Economics that he shared with two mathematicians. Nash's life was dramatized in the movie "Beautiful Mind" in 2001. In this paper, we approach the system f(x = x differently. Instead of studying existence of its solutions our objective is to determine conditions which are both necessary and sufficient that an arbitrary point x⋆ is a fixed point, i.e., that it satisfies f(x⋆ = x⋆. The existence of solutions for continuous function f of the single variable is easy to establish using the Intermediate Value Theorem of Calculus. However, characterizing fixed points x⋆, i.e., providing answers to the question of finding both necessary and sufficient conditions for an arbitrary given x⋆ to satisfy f(x⋆ = x⋆, is not simple even for functions of the single variable. It is possible that constructive answers do not exist. Our objective is to find them. Our work may require some less familiar tools. One of these might be the "quadratic envelope characterization of zero-derivative point" recalled in the next section. The results are taken from the author's current research project "Studying the Essence of Fixed Points". They are believed to be original. The author has received several feedbacks on the preliminary report and on parts of the project
J.W. de Bakker (Jaco)
1975-01-01
textabstractParameter mechanisms for recursive procedures are investigated. Contrary to the view of Manna et al., it is argued that both call-by-value and call-by-name mechanisms yield the least fixed points of the functionals determined by the bodies of the procedures concerned. These functionals
Fixed points of quantum gravity
Litim, D F
2003-01-01
Euclidean quantum gravity is studied with renormalisation group methods. Analytical results for a non-trivial ultraviolet fixed point are found for arbitrary dimensions and gauge fixing parameter in the Einstein-Hilbert truncation. Implications for quantum gravity in four dimensions are discussed.
Fixed points of quantum operations
International Nuclear Information System (INIS)
Arias, A.; Gheondea, A.; Gudder, S.
2002-01-01
Quantum operations frequently occur in quantum measurement theory, quantum probability, quantum computation, and quantum information theory. If an operator A is invariant under a quantum operation φ, we call A a φ-fixed point. Physically, the φ-fixed points are the operators that are not disturbed by the action of φ. Our main purpose is to answer the following question. If A is a φ-fixed point, is A compatible with the operation elements of φ? We shall show in general that the answer is no and we shall give some sufficient conditions under which the answer is yes. Our results will follow from some general theorems concerning completely positive maps and injectivity of operator systems and von Neumann algebras
Padgett, Wayne T
2009-01-01
This book is intended to fill the gap between the ""ideal precision"" digital signal processing (DSP) that is widely taught, and the limited precision implementation skills that are commonly required in fixed-point processors and field programmable gate arrays (FPGAs). These skills are often neglected at the university level, particularly for undergraduates. We have attempted to create a resource both for a DSP elective course and for the practicing engineer with a need to understand fixed-point implementation. Although we assume a background in DSP, Chapter 2 contains a review of basic theory
Flat Coalgebraic Fixed Point Logics
Schröder, Lutz; Venema, Yde
Fixed point logics are widely used in computer science, in particular in artificial intelligence and concurrency. The most expressive logics of this type are the μ-calculus and its relatives. However, popular fixed point logics tend to trade expressivity for simplicity and readability, and in fact often live within the single variable fragment of the μ-calculus. The family of such flat fixed point logics includes, e.g., CTL, the *-nesting-free fragment of PDL, and the logic of common knowledge. Here, we extend this notion to the generic semantic framework of coalgebraic logic, thus covering a wide range of logics beyond the standard μ-calculus including, e.g., flat fragments of the graded μ-calculus and the alternating-time μ-calculus (such as ATL), as well as probabilistic and monotone fixed point logics. Our main results are completeness of the Kozen-Park axiomatization and a timed-out tableaux method that matches ExpTime upper bounds inherited from the coalgebraic μ-calculus but avoids using automata.
Shapiro, Joel H
2016-01-01
This text provides an introduction to some of the best-known fixed-point theorems, with an emphasis on their interactions with topics in analysis. The level of exposition increases gradually throughout the book, building from a basic requirement of undergraduate proficiency to graduate-level sophistication. Appendices provide an introduction to (or refresher on) some of the prerequisite material and exercises are integrated into the text, contributing to the volume’s ability to be used as a self-contained text. Readers will find the presentation especially useful for independent study or as a supplement to a graduate course in fixed-point theory. The material is split into four parts: the first introduces the Banach Contraction-Mapping Principle and the Brouwer Fixed-Point Theorem, along with a selection of interesting applications; the second focuses on Brouwer’s theorem and its application to John Nash’s work; the third applies Brouwer’s theorem to spaces of infinite dimension; and the fourth rests ...
LDPC decoder with a limited-precision FPGA-based floating-point multiplication coprocessor
Moberly, Raymond; O'Sullivan, Michael; Waheed, Khurram
2007-09-01
Implementing the sum-product algorithm, in an FPGA with an embedded processor, invites us to consider a tradeoff between computational precision and computational speed. The algorithm, known outside of the signal processing community as Pearl's belief propagation, is used for iterative soft-decision decoding of LDPC codes. We determined the feasibility of a coprocessor that will perform product computations. Our FPGA-based coprocessor (design) performs computer algebra with significantly less precision than the standard (e.g. integer, floating-point) operations of general purpose processors. Using synthesis, targeting a 3,168 LUT Xilinx FPGA, we show that key components of a decoder are feasible and that the full single-precision decoder could be constructed using a larger part. Soft-decision decoding by the iterative belief propagation algorithm is impacted both positively and negatively by a reduction in the precision of the computation. Reducing precision reduces the coding gain, but the limited-precision computation can operate faster. A proposed solution offers custom logic to perform computations with less precision, yet uses the floating-point format to interface with the software. Simulation results show the achievable coding gain. Synthesis results help theorize the the full capacity and performance of an FPGA-based coprocessor.
Common fixed points for weakly compatible maps
Indian Academy of Sciences (India)
Springer Verlag Heidelberg #4 2048 1996 Dec 15 10:16:45
In 1976, Jungck [4] proved a common fixed point theorem for commuting maps generalizing the Banach's fixed point theorem, which states that, 'let (X, d) be a complete metric space. If T satisfies d(Tx,Ty) ≤ kd(x,y) for each x,y ∈ X where 0 ≤ k < 1, then T has a unique fixed point in X'. This theorem has many applications, ...
Infra-red fixed points in supersymmetry
Indian Academy of Sciences (India)
¾c /font>, and c stands for the color quadratic Casimir of the field. Fixed points arise when R* ¼ or when R*. /nobr>. ´S-½. µ ´r ·b¿µ. The stability of the solutions may be tested by linearizing the system about the fixed points. For the non-trivial fixed points we need to consider the eigenvalues of the stability matrix whose ...
Algorithms for solving common fixed point problems
Zaslavski, Alexander J
2018-01-01
This book details approximate solutions to common fixed point problems and convex feasibility problems in the presence of perturbations. Convex feasibility problems search for a common point of a finite collection of subsets in a Hilbert space; common fixed point problems pursue a common fixed point of a finite collection of self-mappings in a Hilbert space. A variety of algorithms are considered in this book for solving both types of problems, the study of which has fueled a rapidly growing area of research. This monograph is timely and highlights the numerous applications to engineering, computed tomography, and radiation therapy planning. Totaling eight chapters, this book begins with an introduction to foundational material and moves on to examine iterative methods in metric spaces. The dynamic string-averaging methods for common fixed point problems in normed space are analyzed in Chapter 3. Dynamic string methods, for common fixed point problems in a metric space are introduced and discussed in Chapter ...
A Scalable Architecture of a Structured LDPC Decoder
Lee, Jason Kwok-San; Lee, Benjamin; Thorpe, Jeremy; Andrews, Kenneth; Dolinar, Sam; Hamkins, Jon
2004-01-01
We present a scalable decoding architecture for a certain class of structured LDPC codes. The codes are designed using a small (n,r) protograph that is replicated Z times to produce a decoding graph for a (Z x n, Z x r) code. Using this architecture, we have implemented a decoder for a (4096,2048) LDPC code on a Xilinx Virtex-II 2000 FPGA, and achieved decoding speeds of 31 Mbps with 10 fixed iterations. The implemented message-passing algorithm uses an optimized 3-bit non-uniform quantizer that operates with 0.2dB implementation loss relative to a floating point decoder.
Fixed point theorems in spaces and -trees
Directory of Open Access Journals (Sweden)
Kirk WA
2004-01-01
Full Text Available We show that if is a bounded open set in a complete space , and if is nonexpansive, then always has a fixed point if there exists such that for all . It is also shown that if is a geodesically bounded closed convex subset of a complete -tree with , and if is a continuous mapping for which for some and all , then has a fixed point. It is also noted that a geodesically bounded complete -tree has the fixed point property for continuous mappings. These latter results are used to obtain variants of the classical fixed edge theorem in graph theory.
Magnetic Fixed Points and Emergent Supersymmetry
DEFF Research Database (Denmark)
Antipin, Oleg; Mojaza, Matin; Pica, Claudio
2013-01-01
We establish in perturbation theory the existence of fixed points along the renormalization group flow for QCD with an adjoint Weyl fermion and scalar matter reminiscent of magnetic duals of QCD [1-3]. We classify the fixed points by analyzing their basin of attraction. We discover that among...
Metallic and antiferromagnetic fixed points from gravity
Paul, Chandrima
2018-06-01
We consider SU(2) × U(1) gauge theory coupled to matter field in adjoints and study RG group flow. We constructed Callan-Symanzik equation and subsequent β functions and study the fixed points. We find there are two fixed points, showing metallic and antiferromagnetic behavior. We have shown that metallic phase develops an instability if certain parametric conditions are satisfied.
Fixed points of occasionally weakly biased mappings
Y. Mahendra Singh, M. R. Singh
2012-01-01
Common fixed point results due to Pant et al. [Pant et al., Weak reciprocal continuity and fixed point theorems, Ann Univ Ferrara, 57(1), 181-190 (2011)] are extended to a class of non commuting operators called occasionally weakly biased pair[ N. Hussain, M. A. Khamsi A. Latif, Commonfixed points for JH-operators and occasionally weakly biased pairs under relaxed conditions, Nonlinear Analysis, 74, 2133-2140 (2011)]. We also provideillustrative examples to justify the improvements. Abstract....
About Applications of the Fixed Point Theory
Directory of Open Access Journals (Sweden)
Bucur Amelia
2017-06-01
Full Text Available The fixed point theory is essential to various theoretical and applied fields, such as variational and linear inequalities, the approximation theory, nonlinear analysis, integral and differential equations and inclusions, the dynamic systems theory, mathematics of fractals, mathematical economics (game theory, equilibrium problems, and optimisation problems and mathematical modelling. This paper presents a few benchmarks regarding the applications of the fixed point theory. This paper also debates if the results of the fixed point theory can be applied to the mathematical modelling of quality.
Hybrid fixed point in CAT(0 spaces
Directory of Open Access Journals (Sweden)
Hemant Kumar Pathak
2018-02-01
Full Text Available In this paper, we introduce an ultrapower approach to prove fixed point theorems for $H^{+}$-nonexpansive multi-valued mappings in the setting of CAT(0 spaces and prove several hybrid fixed point results in CAT(0 spaces for families of single-valued nonexpansive or quasinonexpansive mappings and multi-valued upper semicontinuous, almost lower semicontinuous or $H^{+}$-nonexpansive mappings which are weakly commuting. We also establish a result about structure of the set of fixed points of $H^{+}$-quasinonexpansive mapping on a CAT(0 space.
Fixed-Point Configurable Hardware Components
Directory of Open Access Journals (Sweden)
Rocher Romuald
2006-01-01
Full Text Available To reduce the gap between the VLSI technology capability and the designer productivity, design reuse based on IP (intellectual properties is commonly used. In terms of arithmetic accuracy, the generated architecture can generally only be configured through the input and output word lengths. In this paper, a new kind of method to optimize fixed-point arithmetic IP has been proposed. The architecture cost is minimized under accuracy constraints defined by the user. Our approach allows exploring the fixed-point search space and the algorithm-level search space to select the optimized structure and fixed-point specification. To significantly reduce the optimization and design times, analytical models are used for the fixed-point optimization process.
Anderson Acceleration for Fixed-Point Iterations
Energy Technology Data Exchange (ETDEWEB)
Walker, Homer F. [Worcester Polytechnic Institute, MA (United States)
2015-08-31
The purpose of this grant was to support research on acceleration methods for fixed-point iterations, with applications to computational frameworks and simulation problems that are of interest to DOE.
Topological fixed point theory of multivalued mappings
Górniewicz, Lech
1999-01-01
This volume presents a broad introduction to the topological fixed point theory of multivalued (set-valued) mappings, treating both classical concepts as well as modern techniques. A variety of up-to-date results is described within a unified framework. Topics covered include the basic theory of set-valued mappings with both convex and nonconvex values, approximation and homological methods in the fixed point theory together with a thorough discussion of various index theories for mappings with a topologically complex structure of values, applications to many fields of mathematics, mathematical economics and related subjects, and the fixed point approach to the theory of ordinary differential inclusions. The work emphasises the topological aspect of the theory, and gives special attention to the Lefschetz and Nielsen fixed point theory for acyclic valued mappings with diverse compactness assumptions via graph approximation and the homological approach. Audience: This work will be of interest to researchers an...
Characterizations of fixed points of quantum operations
International Nuclear Information System (INIS)
Li Yuan
2011-01-01
Let φ A be a general quantum operation. An operator B is said to be a fixed point of φ A , if φ A (B)=B. In this note, we shall show conditions under which B, a fixed point φ A , implies that B is compatible with the operation element of φ A . In particular, we offer an extension of the generalized Lueders theorem.
Quantum entanglement and fixed-point bifurcations
International Nuclear Information System (INIS)
Hines, Andrew P.; McKenzie, Ross H.; Milburn, G.J.
2005-01-01
How does the classical phase-space structure for a composite system relate to the entanglement characteristics of the corresponding quantum system? We demonstrate how the entanglement in nonlinear bipartite systems can be associated with a fixed-point bifurcation in the classical dynamics. Using the example of coupled giant spins we show that when a fixed point undergoes a supercritical pitchfork bifurcation, the corresponding quantum state--the ground state--achieves its maximum amount of entanglement near the critical point. We conjecture that this will be a generic feature of systems whose classical limit exhibits such a bifurcation
The computation of fixed points and applications
Todd, Michael J
1976-01-01
Fixed-point algorithms have diverse applications in economics, optimization, game theory and the numerical solution of boundary-value problems. Since Scarf's pioneering work [56,57] on obtaining approximate fixed points of continuous mappings, a great deal of research has been done in extending the applicability and improving the efficiency of fixed-point methods. Much of this work is available only in research papers, although Scarf's book [58] gives a remarkably clear exposition of the power of fixed-point methods. However, the algorithms described by Scarf have been super~eded by the more sophisticated restart and homotopy techniques of Merrill [~8,~9] and Eaves and Saigal [1~,16]. To understand the more efficient algorithms one must become familiar with the notions of triangulation and simplicial approxi- tion, whereas Scarf stresses the concept of primitive set. These notes are intended to introduce to a wider audience the most recent fixed-point methods and their applications. Our approach is therefore ...
Fixed point theory in metric type spaces
Agarwal, Ravi P; O’Regan, Donal; Roldán-López-de-Hierro, Antonio Francisco
2015-01-01
Written by a team of leading experts in the field, this volume presents a self-contained account of the theory, techniques and results in metric type spaces (in particular in G-metric spaces); that is, the text approaches this important area of fixed point analysis beginning from the basic ideas of metric space topology. The text is structured so that it leads the reader from preliminaries and historical notes on metric spaces (in particular G-metric spaces) and on mappings, to Banach type contraction theorems in metric type spaces, fixed point theory in partially ordered G-metric spaces, fixed point theory for expansive mappings in metric type spaces, generalizations, present results and techniques in a very general abstract setting and framework. Fixed point theory is one of the major research areas in nonlinear analysis. This is partly due to the fact that in many real world problems fixed point theory is the basic mathematical tool used to establish the existence of solutions to problems which arise natur...
Fixed point algebras for easy quantum groups
DEFF Research Database (Denmark)
Gabriel, Olivier; Weber, Moritz
2016-01-01
Compact matrix quantum groups act naturally on Cuntz algebras. The first author isolated certain conditions under which the fixed point algebras under this action are Kirchberg algebras. Hence they are completely determined by their K-groups. Building on prior work by the second author,we prove...... that free easy quantum groups satisfy these conditions and we compute the K-groups of their fixed point algebras in a general form. We then turn to examples such as the quantum permutation group S+ n,the free orthogonal quantum group O+ n and the quantum reflection groups Hs+ n. Our fixed point......-algebra construction provides concrete examples of free actions of free orthogonal easy quantum groups,which are related to Hopf-Galois extensions....
Duan's fixed point theorem: Proof and generalization
Directory of Open Access Journals (Sweden)
Arkowitz Martin
2006-01-01
Full Text Available Let be an H-space of the homotopy type of a connected, finite CW-complex, any map and the th power map. Duan proved that has a fixed point if . We give a new, short and elementary proof of this. We then use rational homotopy to generalize to spaces whose rational cohomology is the tensor product of an exterior algebra on odd dimensional generators with the tensor product of truncated polynomial algebras on even dimensional generators. The role of the power map is played by a -structure as defined by Hemmi-Morisugi-Ooshima. The conclusion is that and each has a fixed point.
ASIC For Complex Fixed-Point Arithmetic
Petilli, Stephen G.; Grimm, Michael J.; Olson, Erlend M.
1995-01-01
Application-specific integrated circuit (ASIC) performs 24-bit, fixed-point arithmetic operations on arrays of complex-valued input data. High-performance, wide-band arithmetic logic unit (ALU) designed for use in computing fast Fourier transforms (FFTs) and for performing ditigal filtering functions. Other applications include general computations involved in analysis of spectra and digital signal processing.
Common Fixed Points for Weakly Compatible Maps
Indian Academy of Sciences (India)
The purpose of this paper is to prove a common fixed point theorem, from the class of compatible continuous maps to a larger class of maps having weakly compatible maps without appeal to continuity, which generalized the results of Jungck [3], Fisher [1], Kang and Kim [8], Jachymski [2], and Rhoades [9].
Some Generalizations of Jungck's Fixed Point Theorem
Directory of Open Access Journals (Sweden)
J. R. Morales
2012-01-01
Full Text Available We are going to generalize the Jungck's fixed point theorem for commuting mappings by mean of the concepts of altering distance functions and compatible pair of mappings, as well as, by using contractive inequalities of integral type and contractive inequalities depending on another function.
Fixed points and self-reference
Directory of Open Access Journals (Sweden)
Raymond M. Smullyan
1984-01-01
Full Text Available It is shown how Gödel's famous diagonal argument and a generalization of the recursion theorem are derivable from a common construation. The abstract fixed point theorem of this article is independent of both metamathematics and recursion theory and is perfectly comprehensible to the non-specialist.
Fixed Point Approach to Bagley Torvik Problem
Directory of Open Access Journals (Sweden)
Lale CONA
2017-10-01
Full Text Available In the present paper, a sufficient condition for existence and uniqueness of Bagley Torvik problem is obtained. The theorem on existence and uniqueness is established. This approach permits us to use fixed point iteration method to solve problem for differential equation involving derivatives of nonlinear order.
Precise Point Positioning with Partial Ambiguity Fixing.
Li, Pan; Zhang, Xiaohong
2015-06-10
Reliable and rapid ambiguity resolution (AR) is the key to fast precise point positioning (PPP). We propose a modified partial ambiguity resolution (PAR) method, in which an elevation and standard deviation criterion are first used to remove the low-precision ambiguity estimates for AR. Subsequently the success rate and ratio-test are simultaneously used in an iterative process to increase the possibility of finding a subset of decorrelated ambiguities which can be fixed with high confidence. One can apply the proposed PAR method to try to achieve an ambiguity-fixed solution when full ambiguity resolution (FAR) fails. We validate this method using data from 450 stations during DOY 021 to 027, 2012. Results demonstrate the proposed PAR method can significantly shorten the time to first fix (TTFF) and increase the fixing rate. Compared with FAR, the average TTFF for PAR is reduced by 14.9% for static PPP and 15.1% for kinematic PPP. Besides, using the PAR method, the average fixing rate can be increased from 83.5% to 98.2% for static PPP, from 80.1% to 95.2% for kinematic PPP respectively. Kinematic PPP accuracy with PAR can also be significantly improved, compared to that with FAR, due to a higher fixing rate.
The universal cardinal ordering of fixed points
International Nuclear Information System (INIS)
San Martin, Jesus; Moscoso, Ma Jose; Gonzalez Gomez, A.
2009-01-01
We present the theorem which determines, by a permutation, the cardinal ordering of fixed points for any orbit of a period doubling cascade. The inverse permutation generates the orbit and the symbolic sequence of the orbit is obtained as a corollary. Interestingly enough, it is important to point that this theorem needs no previous information about any other orbit; also the cardinal ordering is achieved automatically with no need to compare numerical values associated with every point of the orbit (as would be the case if kneading theory were used).
Duan's fixed point theorem: proof and generalization
Directory of Open Access Journals (Sweden)
2006-01-01
Full Text Available Let X be an H-space of the homotopy type of a connected, finite CW-complex, f:X→X any map and p k :X→X the k th power map. Duan proved that p k f :X→X has a fixed point if k≥2 . We give a new, short and elementary proof of this. We then use rational homotopy to generalize to spaces X whose rational cohomology is the tensor product of an exterior algebra on odd dimensional generators with the tensor product of truncated polynomial algebras on even dimensional generators. The role of the power map is played by a θ -structure μ θ :X→X as defined by Hemmi-Morisugi-Ooshima. The conclusion is that μ θ f and f μ θ each has a fixed point.
Fixed point of the parabolic renormalization operator
Lanford III, Oscar E
2014-01-01
This monograph grew out of the authors' efforts to provide a natural geometric description for the class of maps invariant under parabolic renormalization and for the Inou-Shishikura fixed point itself as well as to carry out a computer-assisted study of the parabolic renormalization operator. It introduces a renormalization-invariant class of analytic maps with a maximal domain of analyticity and rigid covering properties and presents a numerical scheme for computing parabolic renormalization of a germ, which is used to compute the Inou-Shishikura renormalization fixed point. Inside, readers will find a detailed introduction into the theory of parabolic bifurcation, Fatou coordinates, Écalle-Voronin conjugacy invariants of parabolic germs, and the definition and basic properties of parabolic renormalization. The systematic view of parabolic renormalization developed in the book and the numerical approach to its study will be interesting to both experts in the field as well as graduate students wishi...
Branes, superpotentials and superconformal fixed points
International Nuclear Information System (INIS)
Aharony, O.
1997-01-01
We analyze various brane configurations corresponding to field theories in three, four and five dimensions. We find brane configurations which correspond to three-dimensional N=2 and four-dimensional N=1 supersymmetric QCD theories with quartic superpotentials, in which what appear to be ''hidden parameters'' play an important role. We discuss the construction of five-dimensional N=1 supersymmetric gauge theories and superconformal fixed points using branes, which leads to new five-dimensional N=1 superconformal field theories. The same five-dimensional theories are also used, in a surprising way, to describe new superconformal fixed points of three-dimensional N=2 supersymmetric theories, which have both ''electric'' and ''magnetic'' Coulomb branches. (orig.)
Duan's fixed point theorem: Proof and generalization
Directory of Open Access Journals (Sweden)
Martin Arkowitz
2006-02-01
Full Text Available Let X be an H-space of the homotopy type of a connected, finite CW-complex, f:XÃ¢Â†Â’X any map and pk:XÃ¢Â†Â’X the kth power map. Duan proved that pkf:XÃ¢Â†Â’X has a fixed point if kÃ¢Â‰Â¥2. We give a new, short and elementary proof of this. We then use rational homotopy to generalize to spaces X whose rational cohomology is the tensor product of an exterior algebra on odd dimensional generators with the tensor product of truncated polynomial algebras on even dimensional generators. The role of the power map is played by a ÃŽÂ¸-structure ÃŽÂ¼ÃŽÂ¸:XÃ¢Â†Â’X as defined by Hemmi-Morisugi-Ooshima. The conclusion is that ÃŽÂ¼ÃŽÂ¸f and fÃŽÂ¼ÃŽÂ¸ each has a fixed point.
On Krasnoselskii's Cone Fixed Point Theorem
Directory of Open Access Journals (Sweden)
Man Kam Kwong
2008-04-01
Full Text Available In recent years, the Krasnoselskii fixed point theorem for cone maps and its many generalizations have been successfully applied to establish the existence of multiple solutions in the study of boundary value problems of various types. In the first part of this paper, we revisit the Krasnoselskii theorem, in a more topological perspective, and show that it can be deduced in an elementary way from the classical Brouwer-Schauder theorem. This viewpoint also leads to a topology-theoretic generalization of the theorem. In the second part of the paper, we extend the cone theorem in a different direction using the notion of retraction and show that a stronger form of the often cited Leggett-Williams theorem is a special case of this extension.
Fixed point theorems for generalized Lipschitzian semigroups
Directory of Open Access Journals (Sweden)
Jong Soo Jung
2001-01-01
semigroup of K into itself, that is, for s∈G, ‖Tsx−Tsy‖≤as‖x−y‖+bs(‖x−Tsx‖+‖y−Tsy‖+cs(‖x−Tsy‖+‖y−Tsx‖, for x,y∈K where as,bs,cs>0 such that there exists a t1∈G such that bs+cs<1 for all s≽t1. It is proved that if there exists a closed subset C of K such that ⋂sco¯{Ttx:t≽s}⊂C for all x∈K, then with [(α+βp(αp⋅2p−1−1/(cp−2p−1βp⋅Np]1/p<1 has a common fixed point, where α=lim sups(as+bs+cs/(1-bs-cs and β=lim sups(2bs+2cs/(1-bs-cs.
Interleaved Product LDPC Codes
Baldi, Marco; Cancellieri, Giovanni; Chiaraluce, Franco
2011-01-01
Product LDPC codes take advantage of LDPC decoding algorithms and the high minimum distance of product codes. We propose to add suitable interleavers to improve the waterfall performance of LDPC decoding. Interleaving also reduces the number of low weight codewords, that gives a further advantage in the error floor region.
DISCRETE FIXED POINT THEOREMS AND THEIR APPLICATION TO NASH EQUILIBRIUM
Sato, Junichi; Kawasaki, Hidefumi
2007-01-01
Fixed point theorems are powerful tools in not only mathematics but also economic. In some economic problems, we need not real-valued but integer-valued equilibriums. However, classical fixed point theorems guarantee only real-valued equilibria. So we need discrete fixed point theorems in order to get discrete equilibria. In this paper, we first provide discrete fixed point theorems, next apply them to a non-cooperative game and prove the existence of a Nash equilibrium of pure strategies.
Brouwer's ε-fixed point from Sperner's lemma
Dalen, D. van
It is by now common knowledge that Brouwer gave mathematics in 1911 a miraculous tool, the fixed point theorem, and that later in life, he disavowed it. It usually came as a shock when he replied to the question “is the fixed point theorem correct ?” with a point blank “no”. This rhetoric exchange
Nonthermal fixed points and the functional renormalization group
International Nuclear Information System (INIS)
Berges, Juergen; Hoffmeister, Gabriele
2009-01-01
Nonthermal fixed points represent basic properties of quantum field theories, in addition to vacuum or thermal equilibrium fixed points. The functional renormalization group on a closed real-time path provides a common framework for their description. For the example of an O(N) symmetric scalar theory it reveals a hierarchy of fixed point solutions, with increasing complexity from vacuum and thermal equilibrium to nonequilibrium
Fixed points of quantum gravity in extra dimensions
International Nuclear Information System (INIS)
Fischer, Peter; Litim, Daniel F.
2006-01-01
We study quantum gravity in more than four dimensions with renormalisation group methods. We find a non-trivial ultraviolet fixed point in the Einstein-Hilbert action. The fixed point connects with the perturbative infrared domain through finite renormalisation group trajectories. We show that our results for fixed points and related scaling exponents are stable. If this picture persists at higher order, quantum gravity in the metric field is asymptotically safe. We discuss signatures of the gravitational fixed point in models with low scale quantum gravity and compact extra dimensions
Impulsive differential inclusions a fixed point approach
Ouahab, Abdelghani; Henderson, Johnny
2013-01-01
Impulsive differential equations have been developed in modeling impulsive problems in physics, population dynamics, ecology, biotechnology, industrial robotics, pharmacokinetics, optimal control, etc. The questions of existence and stability of solutions for different classes of initial values problems for impulsive differential equations and inclusions with fixed and variable moments are considered in detail. Attention is also given to boundary value problems and relative questions concerning differential equations. This monograph addresses a variety of side issues that arise from its simple
Floating-to-Fixed-Point Conversion for Digital Signal Processors
Directory of Open Access Journals (Sweden)
Menard Daniel
2006-01-01
Full Text Available Digital signal processing applications are specified with floating-point data types but they are usually implemented in embedded systems with fixed-point arithmetic to minimise cost and power consumption. Thus, methodologies which establish automatically the fixed-point specification are required to reduce the application time-to-market. In this paper, a new methodology for the floating-to-fixed point conversion is proposed for software implementations. The aim of our approach is to determine the fixed-point specification which minimises the code execution time for a given accuracy constraint. Compared to previous methodologies, our approach takes into account the DSP architecture to optimise the fixed-point formats and the floating-to-fixed-point conversion process is coupled with the code generation process. The fixed-point data types and the position of the scaling operations are optimised to reduce the code execution time. To evaluate the fixed-point computation accuracy, an analytical approach is used to reduce the optimisation time compared to the existing methods based on simulation. The methodology stages are described and several experiment results are presented to underline the efficiency of this approach.
Floating-to-Fixed-Point Conversion for Digital Signal Processors
Menard, Daniel; Chillet, Daniel; Sentieys, Olivier
2006-12-01
Digital signal processing applications are specified with floating-point data types but they are usually implemented in embedded systems with fixed-point arithmetic to minimise cost and power consumption. Thus, methodologies which establish automatically the fixed-point specification are required to reduce the application time-to-market. In this paper, a new methodology for the floating-to-fixed point conversion is proposed for software implementations. The aim of our approach is to determine the fixed-point specification which minimises the code execution time for a given accuracy constraint. Compared to previous methodologies, our approach takes into account the DSP architecture to optimise the fixed-point formats and the floating-to-fixed-point conversion process is coupled with the code generation process. The fixed-point data types and the position of the scaling operations are optimised to reduce the code execution time. To evaluate the fixed-point computation accuracy, an analytical approach is used to reduce the optimisation time compared to the existing methods based on simulation. The methodology stages are described and several experiment results are presented to underline the efficiency of this approach.
Fixed points in a group of isometries
Voorneveld, M.
2000-01-01
The Bruhat-Tits xed point theorem states that a group of isometries on a complete metric space with negative curvature possesses a xed point if it has a bounded orbit. This theorem is extended by a relaxation of the negative curvature condition in terms of the w-distance functions introduced by Kada
Fixed-point data-collection method of video signal
International Nuclear Information System (INIS)
Tang Yu; Yin Zejie; Qian Weiming; Wu Xiaoyi
1997-01-01
The author describes a Fixed-point data-collection method of video signal. The method provides an idea of fixed-point data-collection, and has been successfully applied in the research of real-time radiography on dose field, a project supported by National Science Fund
Fixed points for weak contractions in metric type spaces
Gaba, Yaé Ulrich
2014-01-01
In this article, we prove some fixed point theorems in metric type spaces. This article is just a generalization some results previously proved in \\cite{niyi-gaba}. In particular, we give some coupled common fixed points theorems under weak contractions. These results extend well known similar results existing in the literature.
ORIGINAL Some Generalized Fixed Point Results on Compact ...
African Journals Online (AJOL)
Abstract. The goal of this research is to study some generalized fixed point results in compact metric space. It mainly focuses on the existence and unique fixed point of a selfmap on a compact metric space and its generalizations. In this study iterative techniques due to. Edelstein, Bhardwaj et al. and Sastry et al. are used to ...
A hierarchical model exhibiting the Kosterlitz-Thouless fixed point
International Nuclear Information System (INIS)
Marchetti, D.H.U.; Perez, J.F.
1985-01-01
A hierarchical model for 2-d Coulomb gases displaying a line stable of fixed points describing the Kosterlitz-Thouless phase transition is constructed. For Coulomb gases corresponding to Z sub(N)- models these fixed points are stable for an intermediate temperature interval. (Author) [pt
Fixed Points on Abstract Structures without the Equality Test
DEFF Research Database (Denmark)
Korovina, Margarita
2002-01-01
The aim of this talk is to present a study of definability properties of fixed points of effective operators on abstract structures without the equality test. The question of definability of fixed points of -operators on abstract structures with equality was first studied by Gandy, Barwise, Mosch...
Some fixed point theorems in fuzzy reflexive Banach spaces
International Nuclear Information System (INIS)
Sadeqi, I.; Solaty kia, F.
2009-01-01
In this paper, we first show that there are some gaps in the fixed point theorems for fuzzy non-expansive mappings which are proved by Bag and Samanta, in [Bag T, Samanta SK. Fixed point theorems on fuzzy normed linear spaces. Inf Sci 2006;176:2910-31; Bag T, Samanta SK. Some fixed point theorems in fuzzy normed linear spaces. Inform Sci 2007;177(3):3271-89]. By introducing the notion of fuzzy and α- fuzzy reflexive Banach spaces, we obtain some results which help us to establish the correct version of fuzzy fixed point theorems. Second, by applying Theorem 3.3 of Sadeqi and Solati kia [Sadeqi I, Solati kia F. Fuzzy normed linear space and it's topological structure. Chaos, Solitons and Fractals, in press] which says that any fuzzy normed linear space is also a topological vector space, we show that all topological version of fixed point theorems do hold in fuzzy normed linear spaces.
Wall shear stress fixed points in blood flow
Arzani, Amirhossein; Shadden, Shawn
2017-11-01
Patient-specific computational fluid dynamics produces large datasets, and wall shear stress (WSS) is one of the most important parameters due to its close connection with the biological processes at the wall. While some studies have investigated WSS vectorial features, the WSS fixed points have not received much attention. In this talk, we will discuss the importance of WSS fixed points from three viewpoints. First, we will review how WSS fixed points relate to the flow physics away from the wall. Second, we will discuss how certain types of WSS fixed points lead to high biochemical surface concentration in cardiovascular mass transport problems. Finally, we will introduce a new measure to track the exposure of endothelial cells to WSS fixed points.
A new compact fixed-point blackbody furnace
International Nuclear Information System (INIS)
Hiraka, K.; Oikawa, H.; Shimizu, T.; Kadoya, S.; Kobayashi, T.; Yamada, Y.; Ishii, J.
2013-01-01
More and more NMIs are realizing their primary scale themselves with fixed-point blackbodies as their reference standard. However, commercially available fixed-point blackbody furnaces of sufficient quality are not always easy to obtain. CHINO Corp. and NMIJ, AIST jointly developed a new compact fixed-point blackbody furnace. The new furnace has such features as 1) improved temperature uniformity when compared to previous products, enabling better plateau quality, 2) adoption of the hybrid fixed-point cell structure with internal insulation to improve robustness and thereby to extend lifetime, 3) easily ejectable and replaceable heater unit and fixed-point cell design, leading to reduced maintenance cost, 4) interchangeability among multiple fixed points from In to Cu points. The replaceable cell feature facilitates long term maintenance of the scale through management of a group of fixed-point cells of the same type. The compact furnace is easily transportable and therefore can also function as a traveling standard for disseminating the radiation temperature scale, and for maintaining the scale at the secondary level and industrial calibration laboratories. It is expected that the furnace will play a key role of the traveling standard in the anticipated APMP supplementary comparison of the radiation thermometry scale
Accuracy Constraint Determination in Fixed-Point System Design
Directory of Open Access Journals (Sweden)
Serizel R
2008-01-01
Full Text Available Most of digital signal processing applications are specified and designed with floatingpoint arithmetic but are finally implemented using fixed-point architectures. Thus, the design flow requires a floating-point to fixed-point conversion stage which optimizes the implementation cost under execution time and accuracy constraints. This accuracy constraint is linked to the application performances and the determination of this constraint is one of the key issues of the conversion process. In this paper, a method is proposed to determine the accuracy constraint from the application performance. The fixed-point system is modeled with an infinite precision version of the system and a single noise source located at the system output. Then, an iterative approach for optimizing the fixed-point specification under the application performance constraint is defined and detailed. Finally the efficiency of our approach is demonstrated by experiments on an MP3 encoder.
Wall shear stress fixed points in cardiovascular fluid mechanics.
Arzani, Amirhossein; Shadden, Shawn C
2018-05-17
Complex blood flow in large arteries creates rich wall shear stress (WSS) vectorial features. WSS acts as a link between blood flow dynamics and the biology of various cardiovascular diseases. WSS has been of great interest in a wide range of studies and has been the most popular measure to correlate blood flow to cardiovascular disease. Recent studies have emphasized different vectorial features of WSS. However, fixed points in the WSS vector field have not received much attention. A WSS fixed point is a point on the vessel wall where the WSS vector vanishes. In this article, WSS fixed points are classified and the aspects by which they could influence cardiovascular disease are reviewed. First, the connection between WSS fixed points and the flow topology away from the vessel wall is discussed. Second, the potential role of time-averaged WSS fixed points in biochemical mass transport is demonstrated using the recent concept of Lagrangian WSS structures. Finally, simple measures are proposed to quantify the exposure of the endothelial cells to WSS fixed points. Examples from various arterial flow applications are demonstrated. Copyright © 2018 Elsevier Ltd. All rights reserved.
Fixed Points of Expansive Type Mappings in 2-Banach Spaces
Directory of Open Access Journals (Sweden)
Prabha Chouhan
2013-08-01
Full Text Available In present paper, we define expansive mappings in 2-Banach space and prove some common unique fixed point theorems which are the extension of results of Wang et al. [12] and Rhoades [9] in 2-Banach space.
Tripled Fixed Point in Ordered Multiplicative Metric Spaces
Directory of Open Access Journals (Sweden)
Laishram Shanjit
2017-06-01
Full Text Available In this paper, we present some triple fixed point theorems in partially ordered multiplicative metric spaces depended on another function. Our results generalise the results of [6] and [5].
Measures of Noncircularity and Fixed Points of Contractive Multifunctions
Directory of Open Access Journals (Sweden)
Marrero Isabel
2010-01-01
Full Text Available In analogy to the Eisenfeld-Lakshmikantham measure of nonconvexity and the Hausdorff measure of noncompactness, we introduce two mutually equivalent measures of noncircularity for Banach spaces satisfying a Cantor type property, and apply them to establish a fixed point theorem of Darbo type for multifunctions. Namely, we prove that every multifunction with closed values, defined on a closed set and contractive with respect to any one of these measures, has the origin as a fixed point.
A fixed-point theorem for holomorphic maps
TIMONEY, RICHARD
1994-01-01
PUBLISHED We consider the action on the maximal ideal space M of the algebra H of bounded analytic functions, induced by an analytic self?map of a complex manifold, X. After some general preliminaries, we focus on the question of the existence of fixed points for this action, in the case when X is the open unit disk, D. We classify the fixed?point?free M?obius transformations, and we show that for an arbitrary analytic map from D into itself, the induced map has a fixed poin...
Fixed Points in Discrete Models for Regulatory Genetic Networks
Directory of Open Access Journals (Sweden)
Orozco Edusmildo
2007-01-01
Full Text Available It is desirable to have efficient mathematical methods to extract information about regulatory iterations between genes from repeated measurements of gene transcript concentrations. One piece of information is of interest when the dynamics reaches a steady state. In this paper we develop tools that enable the detection of steady states that are modeled by fixed points in discrete finite dynamical systems. We discuss two algebraic models, a univariate model and a multivariate model. We show that these two models are equivalent and that one can be converted to the other by means of a discrete Fourier transform. We give a new, more general definition of a linear finite dynamical system and we give a necessary and sufficient condition for such a system to be a fixed point system, that is, all cycles are of length one. We show how this result for generalized linear systems can be used to determine when certain nonlinear systems (monomial dynamical systems over finite fields are fixed point systems. We also show how it is possible to determine in polynomial time when an ordinary linear system (defined over a finite field is a fixed point system. We conclude with a necessary condition for a univariate finite dynamical system to be a fixed point system.
Matrix product density operators: Renormalization fixed points and boundary theories
Energy Technology Data Exchange (ETDEWEB)
Cirac, J.I. [Max-Planck-Institut für Quantenoptik, Hans-Kopfermann-Str. 1, D-85748 Garching (Germany); Pérez-García, D., E-mail: dperezga@ucm.es [Departamento de Análisis Matemático, Universidad Complutense de Madrid, Plaza de Ciencias 3, 28040 Madrid (Spain); ICMAT, Nicolas Cabrera, Campus de Cantoblanco, 28049 Madrid (Spain); Schuch, N. [Max-Planck-Institut für Quantenoptik, Hans-Kopfermann-Str. 1, D-85748 Garching (Germany); Verstraete, F. [Department of Physics and Astronomy, Ghent University (Belgium); Vienna Center for Quantum Technology, University of Vienna (Austria)
2017-03-15
We consider the tensors generating matrix product states and density operators in a spin chain. For pure states, we revise the renormalization procedure introduced in (Verstraete et al., 2005) and characterize the tensors corresponding to the fixed points. We relate them to the states possessing zero correlation length, saturation of the area law, as well as to those which generate ground states of local and commuting Hamiltonians. For mixed states, we introduce the concept of renormalization fixed points and characterize the corresponding tensors. We also relate them to concepts like finite correlation length, saturation of the area law, as well as to those which generate Gibbs states of local and commuting Hamiltonians. One of the main result of this work is that the resulting fixed points can be associated to the boundary theories of two-dimensional topological states, through the bulk-boundary correspondence introduced in (Cirac et al., 2011).
IR fixed points in SU(3 gauge theories
Directory of Open Access Journals (Sweden)
K.-I. Ishikawa
2015-09-01
Full Text Available We propose a novel RG method to specify the location of the IR fixed point in lattice gauge theories and apply it to the SU(3 gauge theories with Nf fundamental fermions. It is based on the scaling behavior of the propagator through the RG analysis with a finite IR cutoff, which we cannot remove in the conformal field theories in sharp contrast to the confining theories. The method also enables us to estimate the anomalous mass dimension in the continuum limit at the IR fixed point. We perform the program for Nf=16,12,8 and Nf=7 and indeed identify the location of the IR fixed points in all cases.
Fixed Point Learning Based Intelligent Traffic Control System
Zongyao, Wang; Cong, Sui; Cheng, Shao
2017-10-01
Fixed point learning has become an important tool to analyse large scale distributed system such as urban traffic network. This paper presents a fixed point learning based intelligence traffic network control system. The system applies convergence property of fixed point theorem to optimize the traffic flow density. The intelligence traffic control system achieves maximum road resources usage by averaging traffic flow density among the traffic network. The intelligence traffic network control system is built based on decentralized structure and intelligence cooperation. No central control is needed to manage the system. The proposed system is simple, effective and feasible for practical use. The performance of the system is tested via theoretical proof and simulations. The results demonstrate that the system can effectively solve the traffic congestion problem and increase the vehicles average speed. It also proves that the system is flexible, reliable and feasible for practical use.
Fixed-Rate Compressed Floating-Point Arrays.
Lindstrom, Peter
2014-12-01
Current compression schemes for floating-point data commonly take fixed-precision values and compress them to a variable-length bit stream, complicating memory management and random access. We present a fixed-rate, near-lossless compression scheme that maps small blocks of 4(d) values in d dimensions to a fixed, user-specified number of bits per block, thereby allowing read and write random access to compressed floating-point data at block granularity. Our approach is inspired by fixed-rate texture compression methods widely adopted in graphics hardware, but has been tailored to the high dynamic range and precision demands of scientific applications. Our compressor is based on a new, lifted, orthogonal block transform and embedded coding, allowing each per-block bit stream to be truncated at any point if desired, thus facilitating bit rate selection using a single compression scheme. To avoid compression or decompression upon every data access, we employ a software write-back cache of uncompressed blocks. Our compressor has been designed with computational simplicity and speed in mind to allow for the possibility of a hardware implementation, and uses only a small number of fixed-point arithmetic operations per compressed value. We demonstrate the viability and benefits of lossy compression in several applications, including visualization, quantitative data analysis, and numerical simulation.
Fixed Points in Grassmannians with Applications to Economic Equilibrium
DEFF Research Database (Denmark)
Keiding, Hans
2017-01-01
In some applications of equilibrium theory, the fixed point involves not only a state and a value of a parameter in the dual of the state space, but also a particular subspace of the state space. Since the set of all subspaces of a finite-dimensional Euclidean space has a structure which does...... not allow immediate application of fixed point theorems, the problem must be reformulated using a suitable parametrization of subspaces. One such parametrization, the Plücker coordinates, is used here to prove a general equilibrium existence theorem. Applications to economic problems involving hierarchies...... of consumers or incomplete markets with real assets are outlined....
Common fixed points of single-valued and multivalued maps
Directory of Open Access Journals (Sweden)
Yicheng Liu
2005-01-01
Full Text Available We define a new property which contains the property (EA for a hybrid pair of single- and multivalued maps and give some new common fixed point theorems under hybrid contractive conditions. Our results extend previous ones. As an application, we give a partial answer to the problem raised by Singh and Mishra.
Modified intuitionistic fuzzy metric spaces and some fixed point theorems
International Nuclear Information System (INIS)
Saadati, R.; Sedghi, S.; Shobe, N.
2008-01-01
Since the intuitionistic fuzzy metric space has extra conditions (see [Gregori V, Romaguera S, Veereamani P. A note on intuitionistic fuzzy metric spaces. Chaos, Solitons and Fractals 2006;28:902-5]). In this paper, we consider modified intuitionistic fuzzy metric spaces and prove some fixed point theorems in these spaces. All the results presented in this paper are new
Stability of common fixed points in uniform spaces
Directory of Open Access Journals (Sweden)
Singh Shyam
2011-01-01
Full Text Available Abstract Stability results for a pair of sequences of mappings and their common fixed points in a Hausdorff uniform space using certain new notions of convergence are proved. The results obtained herein extend and unify several known results. AMS(MOS Subject classification 2010: 47H10; 54H25.
STABILITY OF NONLINEAR NEUTRAL DIFFERENTIAL EQUATION VIA FIXED POINT
Institute of Scientific and Technical Information of China (English)
无
2012-01-01
In this paper,a nonlinear neutral differential equation is considered.By a fixed point theory,we give some conditions to ensure that the zero solution to the equation is asymptotically stable.Some existing results are improved and generalized.
Probabilistic G-Metric space and some fixed point results
Directory of Open Access Journals (Sweden)
A. R. Janfada
2013-01-01
Full Text Available In this note we introduce the notions of generalized probabilistic metric spaces and generalized Menger probabilistic metric spaces. After making our elementary observations and proving some basic properties of these spaces, we are going to prove some fixed point result in these spaces.
On stability of fixed points and chaos in fractional systems
Edelman, Mark
2018-02-01
In this paper, we propose a method to calculate asymptotically period two sinks and define the range of stability of fixed points for a variety of discrete fractional systems of the order 0 logistic maps. Based on our analysis, we make a conjecture that chaos is impossible in the corresponding continuous fractional systems.
Radiative symmetry breaking from interacting UV fixed points
DEFF Research Database (Denmark)
Abel, Steven; Sannino, Francesco
2017-01-01
It is shown that the addition of positive mass-squared terms to asymptotically safe gauge-Yukawa theories with perturbative UV fixed points leads to calculable radiative symmetry breaking in the IR. This phenomenon, and the multiplicative running of the operators that lies behind it, is akin...
Partial rectangular metric spaces and fixed point theorems.
Shukla, Satish
2014-01-01
The purpose of this paper is to introduce the concept of partial rectangular metric spaces as a generalization of rectangular metric and partial metric spaces. Some properties of partial rectangular metric spaces and some fixed point results for quasitype contraction in partial rectangular metric spaces are proved. Some examples are given to illustrate the observed results.
Renormalization group fixed points of foliated gravity-matter systems
Energy Technology Data Exchange (ETDEWEB)
Biemans, Jorn [Institute for Mathematics, Astrophysics and Particle Physics (IMAPP),Radboud University Nijmegen,Heyendaalseweg 135, 6525 AJ Nijmegen (Netherlands); Platania, Alessia [Institute for Mathematics, Astrophysics and Particle Physics (IMAPP),Radboud University Nijmegen,Heyendaalseweg 135, 6525 AJ Nijmegen (Netherlands); Department of Physics and Astronomy, University of Catania,Via S. Sofia 63, 95123 Catania (Italy); INFN, Catania section,Via S. Sofia 64, 95123, Catania (Italy); INAF, Catania Astrophysical Observatory,Via S. Sofia 78, 95123, Catania (Italy); Saueressig, Frank [Institute for Mathematics, Astrophysics and Particle Physics (IMAPP),Radboud University Nijmegen,Heyendaalseweg 135, 6525 AJ Nijmegen (Netherlands)
2017-05-17
We employ the Arnowitt-Deser-Misner formalism to study the renormalization group flow of gravity minimally coupled to an arbitrary number of scalar, vector, and Dirac fields. The decomposition of the gravitational degrees of freedom into a lapse function, shift vector, and spatial metric equips spacetime with a preferred (Euclidean) “time”-direction. In this work, we provide a detailed derivation of the renormalization group flow of Newton’s constant and the cosmological constant on a flat Friedmann-Robertson-Walker background. Adding matter fields, it is shown that their contribution to the flow is the same as in the covariant formulation and can be captured by two parameters d{sub g}, d{sub λ}. We classify the resulting fixed point structure as a function of these parameters finding that the existence of non-Gaussian renormalization group fixed points is rather generic. In particular the matter content of the standard model and its most common extensions gives rise to one non-Gaussian fixed point with real critical exponents suitable for Asymptotic Safety. Moreover, we find non-Gaussian fixed points for any number of scalar matter fields, making the scenario attractive for cosmological model building.
Fixed Points on the Real numbers without the Equality Test
DEFF Research Database (Denmark)
Korovina, Margarita
2002-01-01
In this paper we present a study of definability properties of fixed points of effective operators on the real numbers without the equality test. In particular we prove that Gandy theorem holds for the reals without the equality test. This provides a useful tool for dealing with recursive...
On stability of fixed points and chaos in fractional systems.
Edelman, Mark
2018-02-01
In this paper, we propose a method to calculate asymptotically period two sinks and define the range of stability of fixed points for a variety of discrete fractional systems of the order 0chaos is impossible in the corresponding continuous fractional systems.
1989-06-09
could be used to establish a conjectured minimax for a search game of Baston and Bostock [2]. An application of Theorem 1 is to the problem of getting...Alpern S., Search for point in interval, with high-low feedback, Math. Proc., Cambridge Phil. Soc. 98, (1985), 569-578. [2] Baston V. J. and Bostock F. A
Directory of Open Access Journals (Sweden)
Ishak Altun
2016-01-01
Full Text Available We provide sufficient conditions for the existence of a unique common fixed point for a pair of mappings T,S:X→X, where X is a nonempty set endowed with a certain metric. Moreover, a numerical algorithm is presented in order to approximate such solution. Our approach is different to the usual used methods in the literature.
A new 6d fixed point from holography
Energy Technology Data Exchange (ETDEWEB)
Apruzzi, Fabio [Department of Physics, University of North Carolina,Chapel Hill, NC 27599 (United States); CUNY Graduate Center, Initiative for the Theoretical Sciences,New York, NY 10016 (United States); Department of Physics, Columbia University,New York, NY 10027 (United States); Dibitetto, Giuseppe; Tizzano, Luigi [Department of Physics and Astronomy, Uppsala university,Box 516, SE-75120 Uppsala (Sweden)
2016-11-22
We propose a stringy construction giving rise to a class of interacting and non-supersymmetric CFT’s in six dimensions. Such theories may be obtained as an IR conformal fixed point of an RG flow ending up in a (1,0) theory in the UV. We provide the due holographic evidence in the context of massive type IIA on AdS{sub 7}×M{sub 3}, where M{sub 3} is topologically an S{sup 3}. In particular, in this paper we present a 10d flow solution which may be interpreted as a non-BPS bound state of NS5, D6 and (D6)-bar branes. Moreover, by adopting its 7d effective description, we are able to holographically compute the free energy and the operator spectrum in the novel IR conformal fixed point.
Fixed Points of Multivalued Contractive Mappings in Partial Metric Spaces
Directory of Open Access Journals (Sweden)
Abdul Rahim Khan
2014-01-01
Full Text Available The aim of this paper is to present fixed point results of multivalued mappings in the framework of partial metric spaces. Some examples are presented to support the results proved herein. Our results generalize and extend various results in the existing literature. As an application of our main result, the existence and uniqueness of bounded solution of functional equations arising in dynamic programming are established.
Fixed point structure of quenched, planar quantum electrodynamics
International Nuclear Information System (INIS)
Love, S.T.
1986-07-01
Gauge theories exhibiting a hierarchy of fermion mass scales may contain a pseudo-Nambu-Boldstone boson of spontaneously broken scale invariance. The relation between scale and chiral symmetry breaking is studied analytically in quenched, planar quantum electrodynamics in four dimensions. The model possesses a novel nonperturbative ultraviolet fixed point governing its strong coupling phase which requires the mixing of four fermion operators. 12 refs
Almost Fixed-Point-Free Automorphisms of Prime Power Order
Directory of Open Access Journals (Sweden)
B.A.F. Wehrfritz
2016-06-01
Full Text Available We study the effect under various rank restrictions of a group having an automorphism of prime power order whose fixed-point set is also finite of prime power order for the same prime. Generally our conclusions are that the group has a soluble normal subgroup of bounded derived length. Not surprisingly the bound gets larger as the rank restrictions get weaker.
New results for the Liebau phenomenon via fixed point index
Czech Academy of Sciences Publication Activity Database
Cid, J.A.; Infante, G.; Tvrdý, Milan; Zima, M.
2017-01-01
Roč. 35, June (2017), s. 457-469 ISSN 1468-1218 R&D Projects: GA ČR(CZ) GA14-06958S Institutional support: RVO:67985840 Keywords : cone * fixed point index * Green's function Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 1.659, year: 2016 http://www.sciencedirect.com/science/article/pii/S1468121816301511
Some fixed point theorems on non-convex sets
Directory of Open Access Journals (Sweden)
Mohanasundaram Radhakrishnan
2017-10-01
Full Text Available In this paper, we prove that if $K$ is a nonempty weakly compact set in a Banach space $X$, $T:K\\to K$ is a nonexpansive map satisfying $\\frac{x+Tx}{2}\\in K$ for all $x\\in K$ and if $X$ is $3-$uniformly convex or $X$ has the Opial property, then $T$ has a fixed point in $K.$
A common fixed point for operators in probabilistic normed spaces
International Nuclear Information System (INIS)
Ghaemi, M.B.; Lafuerza-Guillen, Bernardo; Razani, A.
2009-01-01
Probabilistic Metric spaces was introduced by Karl Menger. Alsina, Schweizer and Sklar gave a general definition of probabilistic normed space based on the definition of Menger [Alsina C, Schweizer B, Sklar A. On the definition of a probabilistic normed spaces. Aequationes Math 1993;46:91-8]. Here, we consider the equicontinuity of a class of linear operators in probabilistic normed spaces and finally, a common fixed point theorem is proved. Application to quantum Mechanic is considered.
Approximate solutions of common fixed-point problems
Zaslavski, Alexander J
2016-01-01
This book presents results on the convergence behavior of algorithms which are known as vital tools for solving convex feasibility problems and common fixed point problems. The main goal for us in dealing with a known computational error is to find what approximate solution can be obtained and how many iterates one needs to find it. According to know results, these algorithms should converge to a solution. In this exposition, these algorithms are studied, taking into account computational errors which remain consistent in practice. In this case the convergence to a solution does not take place. We show that our algorithms generate a good approximate solution if computational errors are bounded from above by a small positive constant. Beginning with an introduction, this monograph moves on to study: · dynamic string-averaging methods for common fixed point problems in a Hilbert space · dynamic string methods for common fixed point problems in a metric space · dynamic string-averaging version of the proximal...
Fixed point theorems in complex valued metric spaces
Directory of Open Access Journals (Sweden)
Naval Singh
2016-07-01
Full Text Available The aim of this paper is to establish and prove several results on common fixed point for a pair of mappings satisfying more general contraction conditions portrayed by rational expressions having point-dependent control functions as coefficients in complex valued metric spaces. Our results generalize and extend the results of Azam et al. (2011 [1], Sintunavarat and Kumam (2012 [2], Rouzkard and Imdad (2012 [3], Sitthikul and Saejung (2012 [4] and Dass and Gupta (1975 [5]. To substantiate the authenticity of our results and to distinguish them from existing ones, some illustrative examples are also furnished.
Iterative approximation of fixed points of nonexpansive mappings
International Nuclear Information System (INIS)
Chidume, C.E.; Chidume, C.O.
2007-07-01
Let K be a nonempty closed convex subset of a real Banach space E which has a uniformly Gateaux differentiable norm and T : K → K be a nonexpansive mapping with F(T) := { x element of K : Tx = x} ≠ 0 . For a fixed δ element of (0, 1), define S : K → K by Sx := (1- δ)x+ δ Tx , for all x element of K. Assume that { z t } converges strongly to a fixed point z of T as t → 0, where z t is the unique element of K which satisfies z t = tu + (1 - t)Tz t for arbitrary u element of K. Let {α n } be a real sequence in (0, 1) which satisfies the following conditions: C1 : lim α n = 0; C2 : Σαn = ∞. For arbitrary x 0 element of K, let the sequence { x n } be defined iteratively by x n+1 = α n u + (1 - α n )Sx n . Then, {x n } converges strongly to a fixed point of T. (author)
Stability by fixed point theory for functional differential equations
Burton, T A
2006-01-01
This book is the first general introduction to stability of ordinary and functional differential equations by means of fixed point techniques. It contains an extensive collection of new and classical examples worked in detail and presented in an elementary manner. Most of this text relies on three principles: a complete metric space, the contraction mapping principle, and an elementary variation of parameters formula. The material is highly accessible to upper-level undergraduate students in the mathematical sciences, as well as working biologists, chemists, economists, engineers, mathematicia
Border collisions inside the stability domain of a fixed point
DEFF Research Database (Denmark)
Avrutin, Viktor; Zhusubaliyev, Zhanybai T.; Mosekilde, Erik
2016-01-01
a complicated interior structure formed by boundaries defined by persistence border collisions. We describe a simple approach that is based on symbolic dynamics and makes it possible to detect such boundaries numerically. Using this approach we describe several regions in the parameter space leading......Recent studies on a power electronic DC/AC converter (inverter) have demonstrated that such systems may undergo a transition from regular dynamics (associated with a globally attracting fixed point of a suitable stroboscopic map) to chaos through an irregular sequence of border-collision events...
Improved fixed point iterative method for blade element momentum computations
DEFF Research Database (Denmark)
Sun, Zhenye; Shen, Wen Zhong; Chen, Jin
2017-01-01
The blade element momentum (BEM) theory is widely used in aerodynamic performance calculations and optimization applications for wind turbines. The fixed point iterative method is the most commonly utilized technique to solve the BEM equations. However, this method sometimes does not converge...... are addressed through both theoretical analysis and numerical tests. A term from the BEM equations equals to zero at a critical inflow angle is the source of the convergence problems. When the initial inflow angle is set larger than the critical inflow angle and the relaxation methodology is adopted...
Third generation masses from a two Higgs model fixed point
International Nuclear Information System (INIS)
Froggatt, C.D.; Knowles, I.G.; Moorhouse, R.G.
1990-01-01
The large mass ratio between the top and bottom quarks may be attributed to a hierarchy in the vacuum expectation values of scalar doublets. We consider an effective renormalisation group fixed point determination of the quartic scalar and third generation Yukawa couplings in such a two doublet model. This predicts a mass m t =220 GeV and a mass ratio m b /m τ =2.6. In its simplest form the model also predicts the scalar masses, including a light scalar with a mass of order the b quark mass. Experimental implications are discussed. (orig.)
International Nuclear Information System (INIS)
Schrempp, B.
1994-10-01
The two loop 'top-down' renormalization group flow for the top, bottom and tau Yukawa couplings, from μ=M GUT ≅O(10 16 GeV) to μ≅m t , is explored in the framework of supersymmetric grand unification; reproduction of the physical bottom and tau masses is required. Instead of following the recent trend of implementing exact Yukawa coupling unification i) a search for infrared (IR) fixed lines and fixed points in the m t pole -tan β plane is performed and ii) the extent to which these imply approximate Yukawa unification is determined. In the m t pole -tan β plane two IR fixed lines, intersecting in an IR fixed point, are located. The more attractive fixed line has a branch of almost constant top mass, m t pole ≅168≅180 GeV (close to the experimental value), for the large interval 2.5 GUT approximately. The less attractive fixed line as well as the fixed point at m t pole ≅170 GeV, tan β≅55 implement approximate top-bottom Yukawa unification at all scales μ. The renormalization group flow is attracted towards the IR fixed point by way of the more attractive IR fixed line. The fixed point and lines are distinct from the much quoted effective IR fixed point m t pole ≅O(200 GeV) sin β. (orig.)
Non-monotonic Pre-fixed Points and Learning
Directory of Open Access Journals (Sweden)
Stefano Berardi
2013-08-01
Full Text Available We consider the problem of finding pre-fixed points of interactive realizers over arbitrary knowledge spaces, obtaining a relative recursive procedure. Knowledge spaces and interactive realizers are an abstract setting to represent learning processes, that can interpret non-constructive proofs. Atomic pieces of information of a knowledge space are stratified into levels, and evaluated into truth values depending on knowledge states. Realizers are then used to define operators that extend a given state by adding and possibly removing atoms: in a learning process states of knowledge change nonmonotonically. Existence of a pre-fixed point of a realizer is equivalent to the termination of the learning process with some state of knowledge which is free of patent contradictions and such that there is nothing to add. In this paper we generalize our previous results in the case of level 2 knowledge spaces and deterministic operators to the case of omega-level knowledge spaces and of non-deterministic operators.
Fixed-point image orthorectification algorithms for reduced computational cost
French, Joseph Clinton
Imaging systems have been applied to many new applications in recent years. With the advent of low-cost, low-power focal planes and more powerful, lower cost computers, remote sensing applications have become more wide spread. Many of these applications require some form of geolocation, especially when relative distances are desired. However, when greater global positional accuracy is needed, orthorectification becomes necessary. Orthorectification is the process of projecting an image onto a Digital Elevation Map (DEM), which removes terrain distortions and corrects the perspective distortion by changing the viewing angle to be perpendicular to the projection plane. Orthorectification is used in disaster tracking, landscape management, wildlife monitoring and many other applications. However, orthorectification is a computationally expensive process due to floating point operations and divisions in the algorithm. To reduce the computational cost of on-board processing, two novel algorithm modifications are proposed. One modification is projection utilizing fixed-point arithmetic. Fixed point arithmetic removes the floating point operations and reduces the processing time by operating only on integers. The second modification is replacement of the division inherent in projection with a multiplication of the inverse. The inverse must operate iteratively. Therefore, the inverse is replaced with a linear approximation. As a result of these modifications, the processing time of projection is reduced by a factor of 1.3x with an average pixel position error of 0.2% of a pixel size for 128-bit integer processing and over 4x with an average pixel position error of less than 13% of a pixel size for a 64-bit integer processing. A secondary inverse function approximation is also developed that replaces the linear approximation with a quadratic. The quadratic approximation produces a more accurate approximation of the inverse, allowing for an integer multiplication calculation
Directory of Open Access Journals (Sweden)
Adrian Petruşel
2015-01-01
Full Text Available We will discuss discrete dynamics generated by single-valued and multivalued operators in spaces endowed with a generalized metric structure. More precisely, the behavior of the sequence (fn(xn∈N of successive approximations in complete generalized gauge spaces is discussed. In the same setting, the case of multivalued operators is also considered. The coupled fixed points for mappings t1:X1×X2→X1 and t2:X1×X2→X2 are discussed and an application to a system of nonlinear integral equations is given.
An introduction to nonlinear analysis and fixed point theory
Pathak, Hemant Kumar
2018-01-01
This book systematically introduces the theory of nonlinear analysis, providing an overview of topics such as geometry of Banach spaces, differential calculus in Banach spaces, monotone operators, and fixed point theorems. It also discusses degree theory, nonlinear matrix equations, control theory, differential and integral equations, and inclusions. The book presents surjectivity theorems, variational inequalities, stochastic game theory and mathematical biology, along with a large number of applications of these theories in various other disciplines. Nonlinear analysis is characterised by its applications in numerous interdisciplinary fields, ranging from engineering to space science, hydromechanics to astrophysics, chemistry to biology, theoretical mechanics to biomechanics and economics to stochastic game theory. Organised into ten chapters, the book shows the elegance of the subject and its deep-rooted concepts and techniques, which provide the tools for developing more realistic and accurate models for ...
Approximation of fixed points of strongly pseudo-contractive mappings
International Nuclear Information System (INIS)
Chidume, C.E.
1991-10-01
Let E be a real Banach space with a uniformly convex dual, and let K be a nonempty closed convex and bounded subset of E. Let T:K→K be a continuous strongly pseudocontractive mapping of K into itself. Let {c n } n=1 ∞ be a real sequence satisfying: (i) 0 n n=1 ∞ c n =∞; and (iii) Σ n=1 ∞ c n b(c n ) n } n=1 ∞ generated by x 1 is an element of K. x n+1 =(1-c n )x n +c n Tx n , n≥1, converges strongly to the unique fixed point of T. A related result deals with the Ishikawa iteration scheme when T is Lipschitzian and strongly pseudocontractive. (author). 28 refs
Multi-Valued Modal Fixed Point Logics for Model Checking
Nishizawa, Koki
In this paper, I will show how multi-valued logics are used for model checking. Model checking is an automatic technique to analyze correctness of hardware and software systems. A model checker is based on a temporal logic or a modal fixed point logic. That is to say, a system to be checked is formalized as a Kripke model, a property to be satisfied by the system is formalized as a temporal formula or a modal formula, and the model checker checks that the Kripke model satisfies the formula. Although most existing model checkers are based on 2-valued logics, recently new attempts have been made to extend the underlying logics of model checkers to multi-valued logics. I will summarize these new results.
Fundamental flavours, fields and fixed points: a brief account
Energy Technology Data Exchange (ETDEWEB)
Kundu, Arnab [Theory Division, Saha Institute of Nuclear Physics,1/AF Bidhannagar, Kolkata 700064 (India); Homi Bhaba National Institute, Training School Complex,Anushakti Nagar, Mumbai 400085 (India); Kundu, Nilay [Center for Gravitational Physics, Yukawa Institute for Theoretical Physics (YITP),Kyoto University,Kyoto 606-8502 (Japan)
2017-03-13
In this article we report on a preliminary study, via Holography, of infrared fixed points in a putative strongly coupled SU(N{sub c}) gauge theory, with N{sub f} fundamental matter, in the presence of additional fields in the fundamental sector, e.g. density or a magnetic field. In an inherently effective or a bottom up approach, we work with a simple system: Einstein-gravity with a negative cosmological constant, coupled to a Dirac-Born-Infeld (DBI) matter. We obtain a class of exact solutions, dual to candidate grounds states in the infrared (IR), with a scaling ansatz for various fields. These solutions are of two kinds: AdS{sub m}×ℝ{sup n}-type, which has appeared in the literature before; and AdS{sub m}×EAdS{sub n}-type, where m and n are suitable integers. Both these classes of solutions are non-perturbative in back-reaction. The AdS{sub m}×EAdS{sub n}-type contains examples of Bianchi type-V solutions. We also construct explicit numerical flows from an AdS{sub 5} ultraviolet to both an AdS{sub 2} and an AdS{sub 3} IR.
Fixed points of IA-endomorphisms of a free metabelian Lie algebra
Indian Academy of Sciences (India)
Let be a free metabelian Lie algebra of finite rank at least 2. We show the existence of non-trivial fixed points of an -endomorphism of and give an algorithm detecting them. In particular, we prove that the fixed point subalgebra Fix of an -endomorphism of is not finitely generated.
Memory-efficient decoding of LDPC codes
Kwok-San Lee, Jason; Thorpe, Jeremy; Hawkins, Jon
2005-01-01
We present a low-complexity quantization scheme for the implementation of regular (3,6) LDPC codes. The quantization parameters are optimized to maximize the mutual information between the source and the quantized messages. Using this non-uniform quantized belief propagation algorithm, we have simulated that an optimized 3-bit quantizer operates with 0.2dB implementation loss relative to a floating point decoder, and an optimized 4-bit quantizer operates less than 0.1dB quantization loss.
Topological Vector Space-Valued Cone Metric Spaces and Fixed Point Theorems
Directory of Open Access Journals (Sweden)
Radenović Stojan
2010-01-01
Full Text Available We develop the theory of topological vector space valued cone metric spaces with nonnormal cones. We prove three general fixed point results in these spaces and deduce as corollaries several extensions of theorems about fixed points and common fixed points, known from the theory of (normed-valued cone metric spaces. Examples are given to distinguish our results from the known ones.
Common fixed points for generalized contractive mappings in cone metric spaces
Directory of Open Access Journals (Sweden)
Hassen Aydi
2012-06-01
Full Text Available The purpose of this paper is to establish coincidence point and common fixed point results for four maps satisfying generalized weak contractions in cone metric spaces. Also, an example is given to illustrate our results.
Gaussian point count statistics for families of curves over a fixed finite field
Kurlberg, Par; Wigman, Igor
2010-01-01
We produce a collection of families of curves, whose point count statistics over F_p becomes Gaussian for p fixed. In particular, the average number of F_p points on curves in these families tends to infinity.
The D4-D8 Brane System and Five Dimensional Fixed Points
Brandhuber, A; Oz, Y
1999-01-01
We construct dual Type I' string descriptions to five dimensional supersymmetric fixed points with $E_{N_f+1}$ global symmetry. The background is obtained as the near horizon geometry of the D4-D8 brane system in massive Type IIA supergravity. We use the dual description to deduce some properties of the fixed points.
Fixed point iterations for quasi-contractive maps in uniformly smooth Banach spaces
International Nuclear Information System (INIS)
Chidume, C.E.; Osilike, M.O.
1992-05-01
Two well-known fixed point iteration methods are applied to approximate fixed points of quasi-contractive maps in real uniformly smooth Banach spaces. While our theorems generalize important known results, our method is of independent interest. (author). 25 refs
Area law for fixed points of rapidly mixing dissipative quantum systems
Energy Technology Data Exchange (ETDEWEB)
Brandão, Fernando G. S. L. [Quantum Architectures and Computation Group, Microsoft Research, Redmond, Washington 98052 (United States); Department of Computer Science, University College London, Gower Street, London WC1E 6BT (United Kingdom); Cubitt, Toby S. [Department of Computer Science, University College London, Gower Street, London WC1E 6BT (United Kingdom); DAMTP, University of Cambridge, Cambridge (United Kingdom); Lucia, Angelo, E-mail: anlucia@ucm.es [Departamento de Análisis Matemático, Universidad Complutense de Madrid, Madrid (Spain); Michalakis, Spyridon [Institute for Quantum Information and Matter, Caltech, California 91125 (United States); Perez-Garcia, David [Departamento de Análisis Matemático, Universidad Complutense de Madrid, Madrid (Spain); IMI, Universidad Complutense de Madrid, Madrid (Spain); ICMAT, C/Nicolás Cabrera, Campus de Cantoblanco, 28049 Madrid (Spain)
2015-10-15
We prove an area law with a logarithmic correction for the mutual information for fixed points of local dissipative quantum system satisfying a rapid mixing condition, under either of the following assumptions: the fixed point is pure or the system is frustration free.
Mangum, B W
1983-07-01
In an investigation of the melting and freezing behavior of succinonitrile, the triple-point temperature was determined to be 58.0805 degrees C, with an estimated uncertainty of +/- 0.0015 degrees C relative to the International Practical Temperature Scale of 1968 (IPTS-68). The triple-point temperature of this material is evaluated as a temperature-fixed point, and some clinical laboratory applications of this fixed point are proposed. In conjunction with the gallium and ice points, the availability of succinonitrile permits thermistor thermometers to be calibrated accurately and easily on the IPTS-68.
New fixed and periodic point results on cone metric spaces
Directory of Open Access Journals (Sweden)
Ghasem Soleimani Rad
2014-05-01
Full Text Available In this paper, several xed point theorems for T-contraction of two maps on cone metric spaces under normality condition are proved. Obtained results extend and generalize well-known comparable results in the literature.
Directory of Open Access Journals (Sweden)
Badridatt Pant
2014-02-01
Full Text Available In this paper, we prove a common fixed point theorem for finite number of self mappings in Menger probabilistic quasi metric space. Our result improves and extends the results of Rezaiyan et al. [A common fixed point theorem in Menger probabilistic quasi-metric spaces, Chaos, Solitons and Fractals 37 (2008 1153-1157.], Miheţ [A note on a fixed point theorem in Menger probabilistic quasi-metric spaces, Chaos, Solitons and Fractals 40 (2009 2349-2352], Pant and Chauhan [Fixed points theorems in Menger probabilistic quasi metric spaces using weak compatibility, Internat. Math. Forum 5 (6 (2010 283-290] and Sastry et al. [A fixed point theorem in Menger PQM-spaces using weak compatibility, Internat. Math. Forum 5 (52 (2010 2563-2568
Eigenvectors and fixed point of non-linear operators
Directory of Open Access Journals (Sweden)
Giulio Trombetta
2007-12-01
Full Text Available Let X be a real inﬁnite-dimensional Banach space and ψ a measure of noncompactness on X. Let Ω be a bounded open subset of X and A : Ω → X a ψ-condensing operator, which has no ﬁxed points on ∂Ω.Then the ﬁxed point index, ind(A,Ω, of A on Ω is deﬁned (see, for example, ([1] and [18]. In particular, if A is a compact operator ind(A,Ω agrees with the classical Leray-Schauder degree of I −A on Ω relative to the point 0, deg(I −A,Ω,0. The main aim of this note is to investigate boundary conditions, under which the ﬁxed point index of strict- ψ-contractive or ψ-condensing operators A : Ω → X is equal to zero. Correspondingly, results on eigenvectors and nonzero ﬁxed points of k-ψ-contractive and ψ-condensing operators are obtained. In particular we generalize the Birkhoff-Kellog theorem [4] and Guo’s domain compression and expansion theorem [17]. The note is based mainly on the results contained in [7] and [8].
The fixed point structure of lattice field theories
International Nuclear Information System (INIS)
Baier, R.; Reusch, H.J.; Lang, C.B.
1989-01-01
Monte-Carlo renormalization group methods allow to analyze lattice regularized quantum field theories. The properties of the quantized field theory in the continuum may be recovered at a critical point of the lattice model. This requires a study of the phase diagram and the renormalization flow structure of the coupling constants. As an example the authors discuss the results of a recent MCRG investigation of the SU(2) adjoint Higgs model, where they find evidence for the existence of a tricritical point at finite values of the inverse gauge coupling β
Design and Implementation of Numerical Linear Algebra Algorithms on Fixed Point DSPs
Directory of Open Access Journals (Sweden)
Gene Frantz
2007-01-01
Full Text Available Numerical linear algebra algorithms use the inherent elegance of matrix formulations and are usually implemented using C/C++ floating point representation. The system implementation is faced with practical constraints because these algorithms usually need to run in real time on fixed point digital signal processors (DSPs to reduce total hardware costs. Converting the simulation model to fixed point arithmetic and then porting it to a target DSP device is a difficult and time-consuming process. In this paper, we analyze the conversion process. We transformed selected linear algebra algorithms from floating point to fixed point arithmetic, and compared real-time requirements and performance between the fixed point DSP and floating point DSP algorithm implementations. We also introduce an advanced code optimization and an implementation by DSP-specific, fixed point C code generation. By using the techniques described in the paper, speed can be increased by a factor of up to 10 compared to floating point emulation on fixed point hardware.
Approximating fixed points for nonself mappings in CAT(0) spaces
Razani Abdolrahman; Shabani Saeed
2011-01-01
Abstract Suppose K is a nonempty closed convex subset of a complete CAT(0) space X with the nearest point projection P from X onto K. Let T : K → X be a nonself mapping, satisfying Condition (E) with F(T): = {x ∈ K : Tx = x} ≠ ∅. Suppose {xn} is generated iteratively by x1 ∈ K, xn+1 = P ((1 - αn)xn ⊕ αnTP [(1 - βn)xn ⊕ βnTxn]),n ≥ 1, where {αn} and {βn} are real sequences in [ε, 1 - ε] for some ε W...
Common fixed points in best approximation for Banach operator pairs with Ciric type I-contractions
Hussain, N.
2008-02-01
The common fixed point theorems, similar to those of Ciric [Lj.B. Ciric, On a common fixed point theorem of a Gregus type, Publ. Inst. Math. (Beograd) (N.S.) 49 (1991) 174-178; Lj.B. Ciric, On Diviccaro, Fisher and Sessa open questions, Arch. Math. (Brno) 29 (1993) 145-152; Lj.B. Ciric, On a generalization of Gregus fixed point theorem, Czechoslovak Math. J. 50 (2000) 449-458], Fisher and Sessa [B. Fisher, S. Sessa, On a fixed point theorem of Gregus, Internat. J. Math. Math. Sci. 9 (1986) 23-28], Jungck [G. Jungck, On a fixed point theorem of Fisher and Sessa, Internat. J. Math. Math. Sci. 13 (1990) 497-500] and Mukherjee and Verma [R.N. Mukherjee, V. Verma, A note on fixed point theorem of Gregus, Math. Japon. 33 (1988) 745-749], are proved for a Banach operator pair. As applications, common fixed point and approximation results for Banach operator pair satisfying Ciric type contractive conditions are obtained without the assumption of linearity or affinity of either T or I. Our results unify and generalize various known results to a more general class of noncommuting mappings.
Lyapunov functions for the fixed points of the Lorenz model
International Nuclear Information System (INIS)
Bakasov, A.A.; Govorkov, B.B. Jr.
1992-11-01
We have shown how the explicit Lyapunov functions can be constructed in the framework of a regular procedure suggested and completed by Lyapunov a century ago (''method of critical cases''). The method completely covers all practically encountering subtle cases of stability study for ordinary differential equations when the linear stability analysis fails. These subtle cases, ''the critical cases'', according to Lyapunov, include both bifurcations of solutions and solutions of systems with symmetry. Being properly specialized and actually powerful in case of ODE's, this Lyapunov's method is formulated in simple language and should attract a wide interest of the physical audience. The method leads to inevitable construction of the explicit Lyapunov function, takes automatically into account the Fredholm alternative and avoids infinite step calculations. Easy and apparent physical interpretation of the Lyapunov function as a potential or as a time-dependent entropy provides one with more details about the local dynamics of the system at non-equilibrium phase transition points. Another advantage is that this Lyapunov's method consists of a set of very detailed explicit prescriptions which allow one to easy programmize the method for a symbolic processor. The application of the Lyapunov theory for critical cases has been done in this work to the real Lorenz equations and it is shown, in particular, that increasing σ at the Hopf bifurcation point suppresses the contribution of one of the variables to the destabilization of the system. The relation of the method to contemporary methods and its place among them have been clearly and extensively discussed. Due to Appendices, the paper is self-contained and does not require from a reader to approach results published only in Russian. (author). 38 refs
Boundary Fixed Points, Enhanced Gauge Symmetry and Singular Bundles on K3
Fuchs, J; Lerche, Wolfgang; Lütken, C A; Schweigert, C; Walcher, J
2001-01-01
We investigate certain fixed points in the boundary conformal field theory representation of type IIA D-branes on Gepner points of K3. They correspond geometrically to degenerate brane configurations, and physically lead to enhanced gauge symmetries on the world-volume. Non-abelian gauge groups arise if the stabilizer group of the fixed points is realized projectively, which is similar to D-branes on orbifolds with discrete torsion. Moreover, the fixed point boundary states can be resolved into several irreducible components. These correspond to bound states at threshold and can be viewed as (non-locally free) sub-sheaves of semi-stable sheaves. Thus, the BCFT fixed points appear to carry two-fold geometrical information: on the one hand they probe the boundary of the instanton moduli space on K3, on the other hand they probe discrete torsion in D-geometry.
Common fixed point theorems for weakly compatible mappings in fuzzy metric spaces
Directory of Open Access Journals (Sweden)
Sunny Chauhan
2013-05-01
Full Text Available The aim of this paper is to prove a common fixed point theorem for a pair of weakly compatible mappings in fuzzy metric space by using the (CLRg property. An example is also furnished which demonstrates the validity of our main result. As an application to our main result, we present a fixed point theorem for two finite families of self mappings in fuzzy metric space by using the notion of pairwise commuting. Our results improve the results of Sedghi, Shobe and Aliouche [A common fixed point theorem for weakly compatible mappings in fuzzy metric spaces, Gen. Math. 18(3 (2010, 3-12 MR2735558].
Common Fixed Points of Generalized Cocyclic Mappings in Complex Valued Metric Spaces
Directory of Open Access Journals (Sweden)
Mujahid Abbas
2015-01-01
Full Text Available We present fixed point results of mappings satisfying generalized contractive conditions in complex valued metric spaces. As an application, we obtain a common fixed point of a pair of weakly compatible mappings. Some common fixed point results of generalized contractive-type mappings involved in cocyclic representation of a nonempty subset of a complex valued metric space are also obtained. Some examples are also presented to support the results proved herein. These results extend and generalize many results in the existing literature.
Common Fixed Points of Generalized Rational Type Cocyclic Mappings in Multiplicative Metric Spaces
Directory of Open Access Journals (Sweden)
Mujahid Abbas
2015-01-01
Full Text Available The aim of this paper is to present fixed point result of mappings satisfying a generalized rational contractive condition in the setup of multiplicative metric spaces. As an application, we obtain a common fixed point of a pair of weakly compatible mappings. Some common fixed point results of pair of rational contractive types mappings involved in cocyclic representation of a nonempty subset of a multiplicative metric space are also obtained. Some examples are presented to support the results proved herein. Our results generalize and extend various results in the existing literature.
Directory of Open Access Journals (Sweden)
Klin-eam Chakkrid
2009-01-01
Full Text Available Abstract A new approximation method for solving variational inequalities and fixed points of nonexpansive mappings is introduced and studied. We prove strong convergence theorem of the new iterative scheme to a common element of the set of fixed points of nonexpansive mapping and the set of solutions of the variational inequality for the inverse-strongly monotone mapping which solves some variational inequalities. Moreover, we apply our main result to obtain strong convergence to a common fixed point of nonexpansive mapping and strictly pseudocontractive mapping in a Hilbert space.
Revisiting the dilatation operator of the Wilson-Fisher fixed point
Energy Technology Data Exchange (ETDEWEB)
Liendo, Pedro [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany). Theory Group
2017-01-15
We revisit the order ε dilatation operator of the Wilson-Fisher fixed point obtained by Kehrein, Pismak, and Wegner in light of recent results in conformal field theory. Our approach is algebraic and based only on symmetry principles. The starting point of our analysis is that the first correction to the dilatation operator is a conformal invariant, which implies that its form is fixed up to an infinite set of coefficients associated with the scaling dimensions of higher-spin currents. These coefficients can be fixed using well-known perturbative results, however, they were recently re-obtained using CFT arguments without relying on perturbation theory. Our analysis then implies that all order-ε scaling dimensions of the Wilson-Fisher fixed point can be fixed by symmetry.
Swinford, Echo
2006-01-01
If you're vexed and perplexed by PowerPoint, pick up a copy of Fixing PowerPoint Annoyances. This funny, and often opinionated, guide is chock full of tools and techniques for eliminating all the problems that drive audiences and presenters crazy. There's nothing more discouraging than an unresponsive audience--or worse, one that snickers at your slides. And there's nothing more maddening than technical glitches that turn your carefully planned slide show into a car wreck. Envious when you see other presenters effectively use nifty features that you've never been able to get to work right?
Directory of Open Access Journals (Sweden)
Sunny Chauhan
2013-01-01
Full Text Available The objective of this paper is to emphasize the role of “common limit range property” to ascertain the existence of common fixed point in fuzzy metric spaces. Some illustrative examples are furnished which demonstrate the validity of the hypotheses and degree of utility of our results. We derive a fixed point theorem for four finite families of self-mappings which can be utilized to derive common fixed point theorems involving any finite number of mappings. As an application to our main result, we prove an integral-type fixed point theorem in fuzzy metric space. Our results improve and extend a host of previously known results including the ones contained in Imdad et al. (2012.
Fixed points for alpha-psi contractive mappings with an application to quadratic integral equations
Directory of Open Access Journals (Sweden)
Bessem Samet
2014-06-01
Full Text Available Recently, Samet et al [24] introduced the concept of alpha-psi contractive mappings and studied the existence of fixed points for such mappings. In this article, we prove three fixed point theorems for this class of operators in complete metric spaces. Our results extend the results in [24] and well known fixed point theorems due to Banach, Kannan, Chatterjea, Zamfirescu, Berinde, Suzuki, Ciric, Nieto, Lopez, and many others. We prove that alpha-psi contractions unify large classes of contractive type operators, whose fixed points can be obtained by means of the Picard iteration. Finally, we utilize our results to discuss the existence and uniqueness of solutions to a class of quadratic integral equations.
Some common random fixed point theorems for contractive type conditions in cone random metric spaces
Directory of Open Access Journals (Sweden)
Saluja Gurucharan S.
2016-08-01
Full Text Available In this paper, we establish some common random fixed point theorems for contractive type conditions in the setting of cone random metric spaces. Our results unify, extend and generalize many known results from the current existing literature.
Fixed Point Methods in the Stability of the Cauchy Functional Equations
Directory of Open Access Journals (Sweden)
Z. Dehvari
2013-03-01
Full Text Available By using the fixed point methods, we prove some generalized Hyers-Ulam stability of homomorphisms for Cauchy and CauchyJensen functional equations on the product algebras and on the triple systems.
Fixed Point in Topological Vector Space-Valued Cone Metric Spaces
Directory of Open Access Journals (Sweden)
Muhammad Arshad
2010-01-01
Full Text Available We obtain common fixed points of a pair of mappings satisfying a generalized contractive type condition in TVS-valued cone metric spaces. Our results generalize some well-known recent results in the literature.
Latif, Abdul; Mongkolkeha, Chirasak; Sintunavarat, Wutiphol
2014-01-01
We extend the notion of generalized weakly contraction mappings due to Choudhury et al. (2011) to generalized α-β-weakly contraction mappings. We show with examples that our new class of mappings is a real generalization of several known classes of mappings. We also establish fixed point results for such mappings in metric spaces. Applying our new results, we obtain fixed point results on ordinary metric spaces, metric spaces endowed with an arbitrary binary relation, and metric spaces endowed with graph.
Three Boundary Conditions for Computing the Fixed-Point Property in Binary Mixture Data.
Directory of Open Access Journals (Sweden)
Leendert van Maanen
Full Text Available The notion of "mixtures" has become pervasive in behavioral and cognitive sciences, due to the success of dual-process theories of cognition. However, providing support for such dual-process theories is not trivial, as it crucially requires properties in the data that are specific to mixture of cognitive processes. In theory, one such property could be the fixed-point property of binary mixture data, applied-for instance- to response times. In that case, the fixed-point property entails that response time distributions obtained in an experiment in which the mixture proportion is manipulated would have a common density point. In the current article, we discuss the application of the fixed-point property and identify three boundary conditions under which the fixed-point property will not be interpretable. In Boundary condition 1, a finding in support of the fixed-point will be mute because of a lack of difference between conditions. Boundary condition 2 refers to the case in which the extreme conditions are so different that a mixture may display bimodality. In this case, a mixture hypothesis is clearly supported, yet the fixed-point may not be found. In Boundary condition 3 the fixed-point may also not be present, yet a mixture might still exist but is occluded due to additional changes in behavior. Finding the fixed-property provides strong support for a dual-process account, yet the boundary conditions that we identify should be considered before making inferences about underlying psychological processes.
Finding Non-Zero Stable Fixed Points of the Weighted Kuramoto model is NP-hard
Taylor, Richard
2015-01-01
The Kuramoto model when considered over the full space of phase angles [$0,2\\pi$) can have multiple stable fixed points which form basins of attraction in the solution space. In this paper we illustrate the fundamentally complex relationship between the network topology and the solution space by showing that determining the possibility of multiple stable fixed points from the network topology is NP-hard for the weighted Kuramoto Model. In the case of the unweighted model this problem is shown...
Error tolerance in an NMR implementation of Grover's fixed-point quantum search algorithm
International Nuclear Information System (INIS)
Xiao Li; Jones, Jonathan A.
2005-01-01
We describe an implementation of Grover's fixed-point quantum search algorithm on a nuclear magnetic resonance quantum computer, searching for either one or two matching items in an unsorted database of four items. In this algorithm the target state (an equally weighted superposition of the matching states) is a fixed point of the recursive search operator, so that the algorithm always moves towards the desired state. The effects of systematic errors in the implementation are briefly explored
Infrared fixed point of SU(2) gauge theory with six flavors
Leino, Viljami; Rummukainen, Kari; Suorsa, Joni; Tuominen, Kimmo; Tähtinen, Sara
2018-06-01
We compute the running of the coupling in SU(2) gauge theory with six fermions in the fundamental representation of the gauge group. We find strong evidence that this theory has an infrared stable fixed point at strong coupling and measure also the anomalous dimension of the fermion mass operator at the fixed point. This theory therefore likely lies close to the boundary of the conformal window and will display novel infrared dynamics if coupled with the electroweak sector of the Standard Model.
Fixed point iterations for strictly hemi-contractive maps in uniformly smooth Banach spaces
International Nuclear Information System (INIS)
Chidume, C.E.; Osilike, M.O.
1993-05-01
It is proved that the Mann iteration process converges strongly to the fixed point of a strictly hemi-contractive map in real uniformly smooth Banach spaces. The class of strictly hemi-contractive maps includes all strictly pseudo-contractive maps with nonempty fixed point sets. A related result deals with the Ishikawa iteration scheme when the mapping is Lipschitzian and strictly hemi-contractive. Our theorems generalize important known results. (author). 29 refs
Some Nonunique Fixed Point Theorems of Ćirić Type on Cone Metric Spaces
Directory of Open Access Journals (Sweden)
Erdal Karapınar
2010-01-01
Full Text Available Some results of (Ćirić, 1974 on a nonunique fixed point theorem on the class of metric spaces are extended to the class of cone metric spaces. Namely, nonunique fixed point theorem is proved in orbitally complete cone metric spaces under the assumption that the cone is strongly minihedral. Regarding the scalar weight of cone metric, we are able to remove the assumption of strongly minihedral.
Directory of Open Access Journals (Sweden)
Shenghua Wang
2013-01-01
Full Text Available We first introduce the concept of Bregman asymptotically quasinonexpansive mappings and prove that the fixed point set of this kind of mappings is closed and convex. Then we construct an iterative scheme to find a common element of the set of solutions of an equilibrium problem and the set of common fixed points of a countable family of Bregman asymptotically quasinonexpansive mappings in reflexive Banach spaces and prove strong convergence theorems. Our results extend the recent ones of some others.
Analysis of Non-binary Hybrid LDPC Codes
Sassatelli, Lucile; Declercq, David
2008-01-01
In this paper, we analyse asymptotically a new class of LDPC codes called Non-binary Hybrid LDPC codes, which has been recently introduced. We use density evolution techniques to derive a stability condition for hybrid LDPC codes, and prove their threshold behavior. We study this stability condition to conclude on asymptotic advantages of hybrid LDPC codes compared to their non-hybrid counterparts.
Common fixed point theorems for fuzzy mappings in metric space under φ-contraction condition
International Nuclear Information System (INIS)
Abu-Donia, H.M.
2007-01-01
Some common fixed point theorems for multi-valued mappings under φ-contraction condition have been studied by Rashwan [Rashwan RA, Ahmed MA. Fixed points for φ-contraction type multivalued mappings. J Indian Acad Math 1995;17(2):194-204]. Butnariu [Butnariu D. Fixed point for fuzzy mapping. Fuzzy Sets Syst 1982;7:191-207] and Helipern [Hilpern S. Fuzzy mapping and fixed point theorem. J Math Anal Appl 1981;83:566-9] also, discussed some fixed point theorems for fuzzy mappings in the category of metric spaces. In this paper, we discussed some common fixed point theorems for fuzzy mappings in metric space under φ-contraction condition. Our investigation are related to the fuzzy form of Hausdorff metric which is a basic tool for computing Hausdorff dimensions. These dimensions help in understanding ε ∞ -space [El-Naschie MS. On the unification of the fundamental forces and complex time in the ε ∞ -space. Chaos, Solitons and Fractals 2000;11:1149-62] and are used in high energy physics [El-Naschie MS. Wild topology hyperbolic geometry and fusion algebra of high energy particle physics. Chaos, Solitons and Fractals 2002;13:1935-45
Common fixed point theorems for fuzzy mappings in metric space under {phi}-contraction condition
Energy Technology Data Exchange (ETDEWEB)
Abu-Donia, H.M. [Department of Mathematics, Faculty of Science, Zagazig University, Zagazig (Egypt)
2007-10-15
Some common fixed point theorems for multi-valued mappings under {phi}-contraction condition have been studied by Rashwan [Rashwan RA, Ahmed MA. Fixed points for {phi}-contraction type multivalued mappings. J Indian Acad Math 1995;17(2):194-204]. Butnariu [Butnariu D. Fixed point for fuzzy mapping. Fuzzy Sets Syst 1982;7:191-207] and Helipern [Hilpern S. Fuzzy mapping and fixed point theorem. J Math Anal Appl 1981;83:566-9] also, discussed some fixed point theorems for fuzzy mappings in the category of metric spaces. In this paper, we discussed some common fixed point theorems for fuzzy mappings in metric space under {phi}-contraction condition. Our investigation are related to the fuzzy form of Hausdorff metric which is a basic tool for computing Hausdorff dimensions. These dimensions help in understanding {epsilon} {sup {infinity}}-space [El-Naschie MS. On the unification of the fundamental forces and complex time in the {epsilon} {sup {infinity}}-space. Chaos, Solitons and Fractals 2000;11:1149-62] and are used in high energy physics [El-Naschie MS. Wild topology hyperbolic geometry and fusion algebra of high energy particle physics. Chaos, Solitons and Fractals 2002;13:1935-45].
International Nuclear Information System (INIS)
Neves, A.G.M.
1988-01-01
The renormalization transformation e sup(-S 1) sup((B)) const. ζ e sup(-S o (A) - V(A)) δ (B-C sub(1) A) δ sub(Ax) (A)DA for the U(1) lattice gauge theory, where S sub(o) (A) is the gaussian fixed point of the transformation, V(A) is a gauge invariant perturbation, C sub(1) is the averaging operator and δ sub(Ax) (A) fixes the local axial gauge is studied via an equivalent renormalization transformation on the 2-forms F = dA. The transformation is linearized in the neighborhood of the fixed point and then diagonalized. (author)
Ensemble Weight Enumerators for Protograph LDPC Codes
Divsalar, Dariush
2006-01-01
Recently LDPC codes with projected graph, or protograph structures have been proposed. In this paper, finite length ensemble weight enumerators for LDPC codes with protograph structures are obtained. Asymptotic results are derived as the block size goes to infinity. In particular we are interested in obtaining ensemble average weight enumerators for protograph LDPC codes which have minimum distance that grows linearly with block size. As with irregular ensembles, linear minimum distance property is sensitive to the proportion of degree-2 variable nodes. In this paper the derived results on ensemble weight enumerators show that linear minimum distance condition on degree distribution of unstructured irregular LDPC codes is a sufficient but not a necessary condition for protograph LDPC codes.
Gauge-fixing parameter dependence of two-point gauge-variant correlation functions
International Nuclear Information System (INIS)
Zhai, C.
1996-01-01
The gauge-fixing parameter ξ dependence of two-point gauge-variant correlation functions is studied for QED and QCD. We show that, in three Euclidean dimensions, or for four-dimensional thermal gauge theories, the usual procedure of getting a general covariant gauge-fixing term by averaging over a class of covariant gauge-fixing conditions leads to a nontrivial gauge-fixing parameter dependence in gauge-variant two-point correlation functions (e.g., fermion propagators). This nontrivial gauge-fixing parameter dependence modifies the large-distance behavior of the two-point correlation functions by introducing additional exponentially decaying factors. These factors are the origin of the gauge dependence encountered in some perturbative evaluations of the damping rates and the static chromoelectric screening length in a general covariant gauge. To avoid this modification of the long-distance behavior introduced by performing the average over a class of covariant gauge-fixing conditions, one can either choose a vanishing gauge-fixing parameter or apply an unphysical infrared cutoff. copyright 1996 The American Physical Society
Directory of Open Access Journals (Sweden)
Samet Bessem
2011-01-01
Full Text Available Abstract In this article, we establish coincidence point and common fixed point theorems for mappings satisfying a contractive inequality which involves two generalized altering distance functions in ordered complete metric spaces. As application, we study the existence of a common solution to a system of integral equations. 2000 Mathematics subject classification. Primary 47H10, Secondary 54H25
Application of fixed point theory to chaotic attractors of forced oscillators
International Nuclear Information System (INIS)
Stewart, H.B.
1990-11-01
A review of the structure of chaotic attractors of periodically forced second order nonlinear oscillators suggests that the theory of fixed points of transformations gives information about the fundamental topological structure of attractors. First a simple extension of the Levinson index formula is proved. Then numerical evidence is used to formulate plausible conjectures about absorbing regions containing chaotic attractors in forced oscillators. Applying the Levinson formula suggests a fundamental relation between the number of fixed points or periodic points in a section of the chaotic attractor on the one hand, and a topological invariant of an absorbing region on the other hand. (author)
Directory of Open Access Journals (Sweden)
Kang Shin
2011-01-01
Full Text Available Abstract In this paper, the existence, uniqueness and iterative approximations of fixed points for contractive mappings of integral type in complete metric spaces are established. As applications, the existence, uniqueness and iterative approximations of solutions for a class of functional equations arising in dynamic programming are discussed. The results presented in this paper extend and improve essentially the results of Branciari (A fixed point theorem for mappings satisfying a general contractive condition of integral type. Int. J. Math. Math. Sci. 29, 531-536, 2002, Kannan (Some results on fixed points. Bull. Calcutta Math. Soc. 60, 71-76, 1968 and several known results. Four concrete examples involving the contractive mappings of integral type with uncountably many points are constructed. 2010 Mathematics Subject Classfication: 54H25, 47H10, 49L20, 49L99, 90C39
Nezir, Veysel; Mustafa, Nizami
2017-04-01
In 2008, P.K. Lin provided the first example of a nonreflexive space that can be renormed to have fixed point property for nonexpansive mappings. This space was the Banach space of absolutely summable sequences l1 and researchers aim to generalize this to c0, Banach space of null sequences. Before P.K. Lin's intriguing result, in 1979, Goebel and Kuczumow showed that there is a large class of non-weak* compact closed, bounded, convex subsets of l1 with fixed point property for nonexpansive mappings. Then, P.K. Lin inspired by Goebel and Kuczumow's ideas to give his result. Similarly to P.K. Lin's study, Hernández-Linares worked on L1 and in his Ph.D. thesis, supervisored under Maria Japón, showed that L1 can be renormed to have fixed point property for affine nonexpansive mappings. Then, related questions for c0 have been considered by researchers. Recently, Nezir constructed several equivalent norms on c0 and showed that there are non-weakly compact closed, bounded, convex subsets of c0 with fixed point property for affine nonexpansive mappings. In this study, we construct a family of equivalent norms containing those developed by Nezir as well and show that there exists a large class of non-weakly compact closed, bounded, convex subsets of c0 with fixed point property for affine nonexpansive mappings.
Directory of Open Access Journals (Sweden)
N. Shahzad
2013-01-01
Full Text Available In 1994, Matthews introduced the notion of partial metric space with the aim of providing a quantitative mathematical model suitable for program verification. Concretely, Matthews proved a partial metric version of the celebrated Banach fixed point theorem which has become an appropriate quantitative fixed point technique to capture the meaning of recursive denotational specifications in programming languages. In this paper we show that a few assumptions in statement of Matthews fixed point theorem can be relaxed in order to provide a quantitative fixed point technique useful to analyze the meaning of the aforementioned recursive denotational specifications in programming languages. In particular, we prove a new fixed point theorem for self-mappings between partial metric spaces in which the completeness has been replaced by 0-completeness and the contractive condition has been weakened in such a way that the new one best fits the requirements of practical problems in denotational semantics. Moreover, we provide examples that show that the hypothesis in the statement of our new result cannot be weakened. Finally, we show the potential applicability of the developed theory by means of analyzing a few concrete recursive denotational specifications, some of them admitting a unique meaning and others supporting multiple ones.
Infrared fixed point solution for the top quark mass and unification of couplings in the MSSM
International Nuclear Information System (INIS)
Bardeen, W.A.; Carena, M.; Pokorski, S.; Wagner, C.E.M.
1993-08-01
We analyze the implications of the infrared quasi fixed point solution for the top quark mass in the Minimal Supersymmetric Standard Model. This solution could explain in a natural way the relatively large value of the top quark mass and, if confirmed experimentally, may be suggestive of the onset of nonperturbative physics at very high energy scales. In the framework of grand unification, the expected bottom quark -- tau lepton Yukawa coupling unification is very sensitive to the fixed point structure of the top quark mass. For the presently allowed values of the electroweak parameters and the bottom quark mass, the Yukawa coupling unification implies that the top quark mass must be within ten percent of its fixed point values
Employing Common Limit Range Property to Prove Unified Metrical Common Fixed Point Theorems
Directory of Open Access Journals (Sweden)
Mohammad Imdad
2013-01-01
Full Text Available The purpose of this paper is to emphasize the role of “common limit range property” to ascertain the existence of common fixed point in metric spaces satisfying an implicit function essentially due to the paper of Ali and Imdad (2008. As an application to our main result, we derive a fixed point theorem for four finite families of self-mappings which can be utilized to derive common fixed point theorems involving any finite number of mappings. Our results improve and extend a host of previously known results including the ones contained in the paper of Ali and Imdad (2008. We also furnish some illustrative examples to support our main results.
Topological fixed point theory for singlevalued and multivalued mappings and applications
Ben Amar, Afif
2016-01-01
This is a monograph covering topological fixed point theory for several classes of single and multivalued maps. The authors begin by presenting basic notions in locally convex topological vector spaces. Special attention is then devoted to weak compactness, in particular to the theorems of Eberlein–Šmulian, Grothendick and Dunford–Pettis. Leray–Schauder alternatives and eigenvalue problems for decomposable single-valued nonlinear weakly compact operators in Dunford–Pettis spaces are considered, in addition to some variants of Schauder, Krasnoselskii, Sadovskii, and Leray–Schauder type fixed point theorems for different classes of weakly sequentially continuous operators on general Banach spaces. The authors then proceed with an examination of Sadovskii, Furi–Pera, and Krasnoselskii fixed point theorems and nonlinear Leray–Schauder alternatives in the framework of weak topologies and involving multivalued mappings with weakly sequentially closed graph. These results are formulated in terms of ax...
Fixed-point theorems for families of weakly non-expansive maps
Mai, Jie-Hua; Liu, Xin-He
2007-10-01
In this paper, we present some fixed-point theorems for families of weakly non-expansive maps under some relatively weaker and more general conditions. Our results generalize and improve several results due to Jungck [G. Jungck, Fixed points via a generalized local commutativity, Int. J. Math. Math. Sci. 25 (8) (2001) 497-507], Jachymski [J. Jachymski, A generalization of the theorem by Rhoades and Watson for contractive type mappings, Math. Japon. 38 (6) (1993) 1095-1102], Guo [C. Guo, An extension of fixed point theorem of Krasnoselski, Chinese J. Math. (P.O.C.) 21 (1) (1993) 13-20], Rhoades [B.E. Rhoades, A comparison of various definitions of contractive mappings, Trans. Amer. Math. Soc. 226 (1977) 257-290], and others.
International Nuclear Information System (INIS)
Anselmi, Damiano
2004-01-01
I discuss several issues about the irreversibility of the RG flow and the trace anomalies c, a and a'. First I argue that in quantum field theory: (i) the scheme-invariant area Δ a' of the graph of the effective beta function between the fixed points defines the length of the RG flow; (ii) the minimum of Δ a' in the space of flows connecting the same UV and IR fixed points defines the (oriented) distance between the fixed points and (iii) in even dimensions, the distance between the fixed points is equal to Δ a = a UV - a IR . In even dimensions, these statements imply the inequalities 0 ≤ Δ a ≤ Δ a' and therefore the irreversibility of the RG flow. Another consequence is the inequality a ≤ c for free scalars and fermions (but not vectors), which can be checked explicitly. Secondly, I elaborate a more general axiomatic set-up where irreversibility is defined as the statement that there exist no pairs of non-trivial flows connecting interchanged UV and IR fixed points. The axioms, based on the notions of length of the flow, oriented distance between the fixed points and certain 'oriented-triangle inequalities', imply the irreversibility of the RG flow without a global a function. I conjecture that the RG flow is also irreversible in odd dimensions (without a global a function). In support of this, I check the axioms of irreversibility in a class of d = 3 theories where the RG flow is integrable at each order of the large N expansion
LDPC-PPM Coding Scheme for Optical Communication
Barsoum, Maged; Moision, Bruce; Divsalar, Dariush; Fitz, Michael
2009-01-01
In a proposed coding-and-modulation/demodulation-and-decoding scheme for a free-space optical communication system, an error-correcting code of the low-density parity-check (LDPC) type would be concatenated with a modulation code that consists of a mapping of bits to pulse-position-modulation (PPM) symbols. Hence, the scheme is denoted LDPC-PPM. This scheme could be considered a competitor of a related prior scheme in which an outer convolutional error-correcting code is concatenated with an interleaving operation, a bit-accumulation operation, and a PPM inner code. Both the prior and present schemes can be characterized as serially concatenated pulse-position modulation (SCPPM) coding schemes. Figure 1 represents a free-space optical communication system based on either the present LDPC-PPM scheme or the prior SCPPM scheme. At the transmitting terminal, the original data (u) are processed by an encoder into blocks of bits (a), and the encoded data are mapped to PPM of an optical signal (c). For the purpose of design and analysis, the optical channel in which the PPM signal propagates is modeled as a Poisson point process. At the receiving terminal, the arriving optical signal (y) is demodulated to obtain an estimate (a^) of the coded data, which is then processed by a decoder to obtain an estimate (u^) of the original data.
Directory of Open Access Journals (Sweden)
Abdul Latif
2014-01-01
Full Text Available We extend the notion of generalized weakly contraction mappings due to Choudhury et al. (2011 to generalized α-β-weakly contraction mappings. We show with examples that our new class of mappings is a real generalization of several known classes of mappings. We also establish fixed point results for such mappings in metric spaces. Applying our new results, we obtain fixed point results on ordinary metric spaces, metric spaces endowed with an arbitrary binary relation, and metric spaces endowed with graph.
One loop beta functions and fixed points in higher derivative sigma models
International Nuclear Information System (INIS)
Percacci, Roberto; Zanusso, Omar
2010-01-01
We calculate the one loop beta functions of nonlinear sigma models in four dimensions containing general two- and four-derivative terms. In the O(N) model there are four such terms and nontrivial fixed points exist for all N≥4. In the chiral SU(N) models there are in general six couplings, but only five for N=3 and four for N=2; we find fixed points only for N=2, 3. In the approximation considered, the four-derivative couplings are asymptotically free but the coupling in the two-derivative term has a nonzero limit. These results support the hypothesis that certain sigma models may be asymptotically safe.
Generalized Mann Iterations for Approximating Fixed Points of a Family of Hemicontractions
Directory of Open Access Journals (Sweden)
Jin Liang
2008-06-01
Full Text Available This paper concerns common fixed points for a finite family of hemicontractions or a finite family of strict pseudocontractions on uniformly convex Banach spaces. By introducing a new iteration process with error term, we obtain sufficient and necessary conditions, as well as sufficient conditions, for the existence of a fixed point. As one will see, we derive these strong convergence theorems in uniformly convex Banach spaces and without any requirement of the compactness on the domain of the mapping. The results given in this paper extend some previous theorems.
Expected Number of Fixed Points in Boolean Networks with Arbitrary Topology.
Mori, Fumito; Mochizuki, Atsushi
2017-07-14
Boolean network models describe genetic, neural, and social dynamics in complex networks, where the dynamics depend generally on network topology. Fixed points in a genetic regulatory network are typically considered to correspond to cell types in an organism. We prove that the expected number of fixed points in a Boolean network, with Boolean functions drawn from probability distributions that are not required to be uniform or identical, is one, and is independent of network topology if only a feedback arc set satisfies a stochastic neutrality condition. We also demonstrate that the expected number is increased by the predominance of positive feedback in a cycle.
Parallel Fixed Point Implementation of a Radial Basis Function Network in an FPGA
Directory of Open Access Journals (Sweden)
Alisson C. D. de Souza
2014-09-01
Full Text Available This paper proposes a parallel fixed point radial basis function (RBF artificial neural network (ANN, implemented in a field programmable gate array (FPGA trained online with a least mean square (LMS algorithm. The processing time and occupied area were analyzed for various fixed point formats. The problems of precision of the ANN response for nonlinear classification using the XOR gate and interpolation using the sine function were also analyzed in a hardware implementation. The entire project was developed using the System Generator platform (Xilinx, with a Virtex-6 xc6vcx240t-1ff1156 as the target FPGA.
The Fixed-Point Theory of Strictly Contracting Functions on Generalized Ultrametric Semilattices
Directory of Open Access Journals (Sweden)
Eleftherios Matsikoudis
2013-08-01
Full Text Available We introduce a new class of abstract structures, which we call generalized ultrametric semilattices, and in which the meet operation of the semilattice coexists with a generalized distance function in a tightly coordinated way. We prove a constructive fixed-point theorem for strictly contracting functions on directed-complete generalized ultrametric semilattices, and introduce a corresponding induction principle. We cite examples of application in the semantics of logic programming and timed computation, where, until now, the only tool available has been the non-constructive fixed-point theorem of Priess-Crampe and Ribenboim for strictly contracting functions on spherically complete generalized ultrametric semilattices.
Decoding LDPC Convolutional Codes on Markov Channels
Directory of Open Access Journals (Sweden)
Kashyap Manohar
2008-01-01
Full Text Available Abstract This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveals that our pipelined algorithm reduces the number of operations per time step compared to LDPC block codes, at the expense of increased memory and latency. This tradeoff is favorable for low-power applications.
Decoding LDPC Convolutional Codes on Markov Channels
Directory of Open Access Journals (Sweden)
Chris Winstead
2008-04-01
Full Text Available This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveals that our pipelined algorithm reduces the number of operations per time step compared to LDPC block codes, at the expense of increased memory and latency. This tradeoff is favorable for low-power applications.
Hrouza, Ondřej
2012-01-01
Práce se zabývá problematikou LDPC kódů. Jsou zde popsány metody vytváření paritní matice, kde je kladen důraz především na strukturované vytváření této matice za použití konečné geometrie: Euklidovské geometrie a projektivní geometrie. Další oblastí, které se práce věnuje je dekódování LDPC kódů. Práce porovnává čtyři dekódovací metody: Hard-Decision algoritmus, Bit-Flipping algoritmus, The Sum-Product algoritmus a Log Likelihood algoritmus, při kterých je kladen důraz především na iterativn...
Combined GPS/GLONASS Precise Point Positioning with Fixed GPS Ambiguities
Pan, Lin; Cai, Changsheng; Santerre, Rock; Zhu, Jianjun
2014-01-01
Precise point positioning (PPP) technology is mostly implemented with an ambiguity-float solution. Its performance may be further improved by performing ambiguity-fixed resolution. Currently, the PPP integer ambiguity resolutions (IARs) are mainly based on GPS-only measurements. The integration of GPS and GLONASS can speed up the convergence and increase the accuracy of float ambiguity estimates, which contributes to enhancing the success rate and reliability of fixing ambiguities. This paper presents an approach of combined GPS/GLONASS PPP with fixed GPS ambiguities (GGPPP-FGA) in which GPS ambiguities are fixed into integers, while all GLONASS ambiguities are kept as float values. An improved minimum constellation method (MCM) is proposed to enhance the efficiency of GPS ambiguity fixing. Datasets from 20 globally distributed stations on two consecutive days are employed to investigate the performance of the GGPPP-FGA, including the positioning accuracy, convergence time and the time to first fix (TTFF). All datasets are processed for a time span of three hours in three scenarios, i.e., the GPS ambiguity-float solution, the GPS ambiguity-fixed resolution and the GGPPP-FGA resolution. The results indicate that the performance of the GPS ambiguity-fixed resolutions is significantly better than that of the GPS ambiguity-float solutions. In addition, the GGPPP-FGA improves the positioning accuracy by 38%, 25% and 44% and reduces the convergence time by 36%, 36% and 29% in the east, north and up coordinate components over the GPS-only ambiguity-fixed resolutions, respectively. Moreover, the TTFF is reduced by 27% after adding GLONASS observations. Wilcoxon rank sum tests and chi-square two-sample tests are made to examine the significance of the improvement on the positioning accuracy, convergence time and TTFF. PMID:25237901
Combined GPS/GLONASS Precise Point Positioning with Fixed GPS Ambiguities
Directory of Open Access Journals (Sweden)
Lin Pan
2014-09-01
Full Text Available Precise point positioning (PPP technology is mostly implemented with an ambiguity-float solution. Its performance may be further improved by performing ambiguity-fixed resolution. Currently, the PPP integer ambiguity resolutions (IARs are mainly based on GPS-only measurements. The integration of GPS and GLONASS can speed up the convergence and increase the accuracy of float ambiguity estimates, which contributes to enhancing the success rate and reliability of fixing ambiguities. This paper presents an approach of combined GPS/GLONASS PPP with fixed GPS ambiguities (GGPPP-FGA in which GPS ambiguities are fixed into integers, while all GLONASS ambiguities are kept as float values. An improved minimum constellation method (MCM is proposed to enhance the efficiency of GPS ambiguity fixing. Datasets from 20 globally distributed stations on two consecutive days are employed to investigate the performance of the GGPPP-FGA, including the positioning accuracy, convergence time and the time to first fix (TTFF. All datasets are processed for a time span of three hours in three scenarios, i.e., the GPS ambiguity-float solution, the GPS ambiguity-fixed resolution and the GGPPP-FGA resolution. The results indicate that the performance of the GPS ambiguity-fixed resolutions is significantly better than that of the GPS ambiguity-float solutions. In addition, the GGPPP-FGA improves the positioning accuracy by 38%, 25% and 44% and reduces the convergence time by 36%, 36% and 29% in the east, north and up coordinate components over the GPS-only ambiguity-fixed resolutions, respectively. Moreover, the TTFF is reduced by 27% after adding GLONASS observations. Wilcoxon rank sum tests and chi-square two-sample tests are made to examine the significance of the improvement on the positioning accuracy, convergence time and TTFF.
A Coupled Fixed Point Theorem in Fuzzy Metric Space Satisfying ϕ-Contractive Condition
Directory of Open Access Journals (Sweden)
B. D. Pant
2013-01-01
Full Text Available The intent of this paper is to prove a coupled fixed point theorem for two pairs of compatible and subsequentially continuous (alternately subcompatible and reciprocally continuous mappings, satisfying ϕ-contractive conditions in a fuzzy metric space. We also furnish some illustrative examples to support our results.
$β'_{IR}$ at an Infrared Fixed Point in Chiral Gauge Theories
DEFF Research Database (Denmark)
Ryttov, Thomas A.; Shrock, Robert
2018-01-01
We present scheme-independent calculations of the derivative of the beta function, denoted $\\beta'_{IR}$, at a conformally invariant infrared (IR) fixed point, in several asymptotically free chiral gauge theories, namely SO($4k+2$) with $2 \\le k \\le 4$ with respective numbers $N_f$ of fermions...
Two fixed point theorems on quasi-metric spaces via mw- distances
Energy Technology Data Exchange (ETDEWEB)
Alegre, C.
2017-07-01
In this paper we prove a Banach-type fixed point theorem and a Kannan-type theorem in the setting of quasi-metric spaces using the notion of mw-distance. These theorems generalize some results that have recently appeared in the literature. (Author)
New versions of the Fan-Browder fixed point theorem and existence of economic equilibria
Directory of Open Access Journals (Sweden)
Park Sehie
2004-01-01
Full Text Available We introduce a generalized form of the Fan-Browder fixed point theorem and apply to game-theoretic and economic equilibrium existence problem under the more generous restrictions. Consequently, we state some of recent results of Urai (2000 in more general and efficient forms.
Common Fixed Points via λ-Sequences in G-Metric Spaces
Directory of Open Access Journals (Sweden)
Yaé Ulrich Gaba
2017-01-01
Full Text Available We use λ-sequences in this article to derive common fixed points for a family of self-mappings defined on a complete G-metric space. We imitate some existing techniques in our proofs and show that the tools employed can be used at a larger scale. These results generalize well known results in the literature.
Directory of Open Access Journals (Sweden)
Xiangbing Zhou
2012-01-01
Full Text Available We generalize a fixed point theorem in partially ordered complete metric spaces in the study of A. Amini-Harandi and H. Emami (2010. We also give an application on the existence and uniqueness of the positive solution of a multipoint boundary value problem with fractional derivatives.
Extension of Kirk-Saliga Fixed Point Theorem in a Metric Space with a Reflexive Digraph
Directory of Open Access Journals (Sweden)
Karim Chaira
2018-01-01
Full Text Available We extend the result of Kirk-Saliga and we generalize Alfuraidan and Khamsi theorem for reflexive graphs. As a consequence, we obtain the ordered version of Caristi’s fixed point theorem. Some concrete examples are given to support the obtained results.
An application of Darbo\\'s fixed point theorem in the relative ...
African Journals Online (AJOL)
Sufficient conditions for the relative controllability of a class of nonlinear systems with distributed delays in the control are established. Our results are based on the measure of non-compactness of a set and the Darbo's fixed point theorem. Global Jouranl of Mathematical Sciences Vol. 6 (1) 2007: pp. 21-26 ...
Establishment of the Co-C Eutectic Fixed-Point Cell for Thermocouple Calibrations at NIMT
Ongrai, O.; Elliott, C. J.
2017-08-01
In 2015, NIMT first established a Co-C eutectic temperature reference (fixed-point) cell measurement capability for thermocouple calibration to support the requirements of Thailand's heavy industries and secondary laboratories. The Co-C eutectic fixed-point cell is a facility transferred from NPL, where the design was developed through European and UK national measurement system projects. In this paper, we describe the establishment of a Co-C eutectic fixed-point cell for thermocouple calibration at NIMT. This paper demonstrates achievement of the required furnace uniformity, the Co-C plateau realization and the comparison data between NIMT and NPL Co-C cells by using the same standard Pt/Pd thermocouple, demonstrating traceability. The NIMT measurement capability for noble metal type thermocouples at the new Co-C eutectic fixed point (1324.06°C) is estimated to be within ± 0.60 K (k=2). This meets the needs of Thailand's high-temperature thermocouple users—for which previously there has been no traceable calibration facility.
Generalized fixed point theorems for compatible mappings with some types in fuzzy metric spaces
International Nuclear Information System (INIS)
Cho, Yeol Je; Sedghi, Shaban; Shobe, Nabi
2009-01-01
In this paper, we give some new definitions of compatible mappings of types (I) and (II) in fuzzy metric spaces and prove some common fixed point theorems for four mappings under the condition of compatible mappings of types (I) and (II) in complete fuzzy metric spaces. Our results extend, generalize and improve the corresponding results given by many authors.
Some Fixed Point Results for Caristi Type Mappings in Modular Metric Spaces with an Application
Directory of Open Access Journals (Sweden)
Duran Turkoglu
2016-08-01
Full Text Available In this paper we give Caristi type fixed point theorem in complete modular metric spaces. Moreover we give a theorem which can be derived from Caristi type. Also an application for the bounded solution of funcional equations is investigated.
Fixed Point of Generalized Eventual Cyclic Gross in Fuzzy Norm Spaces for Contractive Mappings
Directory of Open Access Journals (Sweden)
S. A. M. Mohsenialhosseini
2015-01-01
Full Text Available We define generalized eventual cyclic gross contractive mapping in fuzzy norm spaces, which is a generalization of the eventual cyclic gross contractions. Also we prove the existence of a fixed point for this type of contractive mapping on fuzzy norm spaces.
2010-10-01
... 47 Telecommunication 5 2010-10-01 2010-10-01 false Operation of internal transmitter control... Transmitter Control Internal Transmitter Control Systems § 90.473 Operation of internal transmitter control systems through licensed fixed control points. An internal transmitter control system may be operated...
An application of a discrete fixed point theorem to the Cournot model
Sato, Junichi
2008-01-01
In this paper, we apply a discrete fixed point theorem of [7] to the Cournot model [1]. Then we can deal with the Cournot model where the production of the enterprises is discrete. To handle it, we define a discrete Cournot-Nash equilibrium, and prove its existence.
Numerical Treatment of Fixed Point Applied to the Nonlinear Fredholm Integral Equation
Directory of Open Access Journals (Sweden)
Berenguer MI
2009-01-01
Full Text Available The authors present a method of numerical approximation of the fixed point of an operator, specifically the integral one associated with a nonlinear Fredholm integral equation, that uses strongly the properties of a classical Schauder basis in the Banach space .
Chen, Guiling
2013-01-01
This thesis studies asymptotic behavior and stability of determinsitic and stochastic delay differential equations. The approach used in this thesis is based on fixed point theory, which does not resort to any Liapunov function or Liapunov functional. The main contribution of this thesis is to study
TARDEC FIXED HEEL POINT (FHP): DRIVER CAD ACCOMMODATION MODEL VERIFICATION REPORT
2017-11-09
Public Release Disclaimer: Reference herein to any specific commercial company, product , process, or service by trade name, trademark, manufacturer , or...not actively engaged HSI until MSB or the Engineering Manufacturing and Development (EMD) Phase, resulting in significant design and cost changes...and shall not be used for advertising or product endorsement purposes. TARDEC Fixed Heel Point (FHP): Driver CAD Accommodation Model Verification
A Borsuk-Ulam type generalization of the Leray-Schauder fixed point theorem
International Nuclear Information System (INIS)
Prykarpatsky, A.K.
2007-05-01
A generalization of the classical Leray-Schauder fixed point theorem, based on the infinite-dimensional Borsuk-Ulam type antipode construction, is proposed. Two completely different proofs based on the projection operator approach and on a weak version of the well known Krein-Milman theorem are presented. (author)
Discussion on LDPC Codes and Uplink Coding
Andrews, Ken; Divsalar, Dariush; Dolinar, Sam; Moision, Bruce; Hamkins, Jon; Pollara, Fabrizio
2007-01-01
This slide presentation reviews the progress that the workgroup on Low-Density Parity-Check (LDPC) for space link coding. The workgroup is tasked with developing and recommending new error correcting codes for near-Earth, Lunar, and deep space applications. Included in the presentation is a summary of the technical progress of the workgroup. Charts that show the LDPC decoder sensitivity to symbol scaling errors are reviewed, as well as a chart showing the performance of several frame synchronizer algorithms compared to that of some good codes and LDPC decoder tests at ESTL. Also reviewed is a study on Coding, Modulation, and Link Protocol (CMLP), and the recommended codes. A design for the Pseudo-Randomizer with LDPC Decoder and CRC is also reviewed. A chart that summarizes the three proposed coding systems is also presented.
Battuello, M.; Florio, M.; Girard, F.
2010-06-01
An indirect determination of the thermodynamic temperature of the fixed point of copper was made at INRIM by measuring four cells with a Si-based and an InGaAs-based precision radiation thermometer carrying approximated thermodynamic scales realized up to the Ag point. An average value TCu = 1357.840 K was found with a standard uncertainty of 0.047 K. A consequent (T - T90)Cu value of 70 mK can be derived which is 18 mK higher than, but consistent with, the presently available (T - T90)Cu as elaborated by the CCT-WG4.
Optimal Design of Fixed-Point and Floating-Point Arithmetic Units for Scientific Applications
Pongyupinpanich, Surapong
2012-01-01
The challenge in designing a floating-point arithmetic co-processor/processor for scientific and engineering applications is to improve the performance, efficiency, and computational accuracy of the arithmetic unit. The arithmetic unit should efficiently support several mathematical functions corresponding to scientific and engineering computation demands. Moreover, the computations should be performed as fast as possible with a high degree of accuracy. Thus, this thesis proposes algorithm, d...
Study on the fixed point in crustal deformation before strong earthquake
Niu, A.; Li, Y.; Yan, W. Mr
2017-12-01
Usually, scholars believe that the fault pre-sliding or expansion phenomenon will be observed near epicenter area before strong earthquake, but more and more observations show that the crust deformation nearby epicenter area is smallest(Zhou, 1997; Niu,2009,2012;Bilham, 2005; Amoruso et al., 2010). The theory of Fixed point t is a branch of mathematics that arises from the theory of topological transformation and has important applications in obvious model analysis. An important precursory was observed by two tilt-meter sets, installed at Wenchuan Observatory in the epicenter area, that the tilt changes were the smallest compared with the other 8 stations around them in one year before the Wenchuan earthquake. To subscribe the phenomenon, we proposed the minimum annual variation range that used as a topological transformation. The window length is 1 year, and the sliding length is 1 day. The convergence of points with minimum annual change in the 3 years before the Wenchuan earthquake is studied. And the results show that the points with minimum deformation amplitude basically converge to the epicenter region before the earthquake. The possible mechanism of fixed point of crustal deformation was explored. Concerning the fixed point of crust deformation, the liquidity of lithospheric medium and the isostasy theory are accepted by many scholars (Bott &Dean, 1973; Merer et al.1988; Molnar et al., 1975,1978; Tapponnier et al., 1976; Wang et al., 2001). To explain the fixed point of crust deformation before earthquakes, we study the plate bending model (Bai, et al., 2003). According to plate bending model and real deformation data, we have found that the earthquake rupture occurred around the extreme point of plate bending, where the velocities of displacement, tilt, strain, gravity and so on are close to zero, and the fixed points are located around the epicenter.The phenomenon of fixed point of crust deformation is different from former understandings about the
Bojkovski, J.; Veliki, T.; Zvizdić, D.; Drnovšek, J.
2011-08-01
The objective of project EURAMET 1127 (Bilateral comparison of triple point of mercury and melting point of gallium) in the field of thermometry is to compare realization of a triple point of mercury (-38.8344 °C) and melting point of gallium (29.7646 °C) between the Slovenian national laboratory MIRS/UL-FE/LMK and the Croatian national laboratory HMI/FSB-LPM using a long-stem 25 Ω standard platinum resistance thermometer (SPRT). MIRS/UL/FE-LMK participated in a number of intercomparisons on the level of EURAMET. On the other hand, the HMI/LPM-FSB laboratory recently acquired new fixed-point cells which had to be evaluated in the process of intercomparisons. A quartz-sheathed SPRT has been selected and calibrated at HMI/LPM-FSB at the triple point of mercury, the melting point of gallium, and the water triple point. A second set of measurements was made at MIRS/UL/FE-LMK. After its return, the SPRT was again recalibrated at HMI/LPM-FSB. In the comparison, the W value of the SPRT has been used. Results of the bilateral intercomparison confirmed that the new gallium cell of the HMI/LPM-FSB has a value that is within uncertainty limits of both laboratories that participated in the exercise, while the mercury cell experienced problems. After further research, a small leakage in the mercury fixed-point cell has been found.
Searching for fixed point combinators by using automated theorem proving: A preliminary report
International Nuclear Information System (INIS)
Wos, L.; McCune, W.
1988-09-01
In this report, we establish that the use of an automated theorem- proving program to study deep questions from mathematics and logic is indeed an excellent move. Among such problems, we focus mainly on that concerning the construction of fixed point combinators---a problem considered by logicians to be significant and difficult to solve, and often computationally intensive and arduous. To be a fixed point combinator, Θ must satisfy the equation Θx = x(Θx) for all combinators x. The specific questions on which we focus most heavily ask, for each chosen set of combinators, whether a fixed point combinator can be constructed from the members of that set. For answering questions of this type, we present a new, sound, and efficient method, called the kernel method, which can be applied quite easily by hand and very easily by an automated theorem-proving program. For the application of the kernel method by a theorem-proving program, we illustrate the vital role that is played by both paramodulation and demodulation---two of the powerful features frequently offered by an automated theorem-proving program for treating equality as if it is ''understood.'' We also state a conjecture that, if proved, establishes the completeness of the kernel method. From what we can ascertain, this method---which relies on the introduced concepts of kernel and superkernel---offers the first systematic approach for searching for fixed point combinators. We successfully apply the new kernel method to various sets of combinators and, for the set consisting of the combinators B and W, construct an infinite set of fixed point combinators such that no two of the combinators are equal even in the presence of extensionality---a law that asserts that two combinators are equal if they behave the same. 18 refs
Searching for fixed point combinators by using automated theorem proving: A preliminary report
Energy Technology Data Exchange (ETDEWEB)
Wos, L.; McCune, W.
1988-09-01
In this report, we establish that the use of an automated theorem- proving program to study deep questions from mathematics and logic is indeed an excellent move. Among such problems, we focus mainly on that concerning the construction of fixed point combinators---a problem considered by logicians to be significant and difficult to solve, and often computationally intensive and arduous. To be a fixed point combinator, THETA must satisfy the equation THETAx = x(THETAx) for all combinators x. The specific questions on which we focus most heavily ask, for each chosen set of combinators, whether a fixed point combinator can be constructed from the members of that set. For answering questions of this type, we present a new, sound, and efficient method, called the kernel method, which can be applied quite easily by hand and very easily by an automated theorem-proving program. For the application of the kernel method by a theorem-proving program, we illustrate the vital role that is played by both paramodulation and demodulation---two of the powerful features frequently offered by an automated theorem-proving program for treating equality as if it is ''understood.'' We also state a conjecture that, if proved, establishes the completeness of the kernel method. From what we can ascertain, this method---which relies on the introduced concepts of kernel and superkernel---offers the first systematic approach for searching for fixed point combinators. We successfully apply the new kernel method to various sets of combinators and, for the set consisting of the combinators B and W, construct an infinite set of fixed point combinators such that no two of the combinators are equal even in the presence of extensionality---a law that asserts that two combinators are equal if they behave the same. 18 refs.
Evolution families of conformal mappings with fixed points and the Löwner-Kufarev equation
International Nuclear Information System (INIS)
Goryainov, V V
2015-01-01
The paper is concerned with evolution families of conformal mappings of the unit disc to itself that fix an interior point and a boundary point. Conditions are obtained for the evolution families to be differentiable, and an existence and uniqueness theorem for an evolution equation is proved. A convergence theorem is established which describes the topology of locally uniform convergence of evolution families in terms of infinitesimal generating functions. The main result in this paper is the embedding theorem which shows that any conformal mapping of the unit disc to itself with two fixed points can be embedded into a differentiable evolution family of such mappings. This result extends the range of the parametric method in the theory of univalent functions. In this way the problem of the mutual change of the derivative at an interior point and the angular derivative at a fixed point on the boundary is solved for a class of mappings of the unit disc to itself. In particular, the rotation theorem is established for this class of mappings. Bibliography: 27 titles
Indirect Determination of the Thermodynamic Temperature of a Gold Fixed-Point Cell
Battuello, M.; Girard, F.; Florio, M.
2010-09-01
Since the value T 90(Au) was fixed on the ITS-90, some determinations of the thermodynamic temperature of the gold point have been performed which form, with other renormalized results of previous measurements by radiation thermometry, the basis for the current best estimates of ( T - T 90)Au = 39.9 mK as elaborated by the CCT-WG4. Such a value, even if consistent with the behavior of T - T 90 differences at lower temperatures, is quite influenced by the low values of T Au as determined with few radiometric measurements. At INRIM, an independent indirect determination of the thermodynamic temperature of gold was performed by means of a radiation thermometry approach. A fixed-point technique was used to realize approximated thermodynamic scales from the Zn point up to the Cu point. A Si-based standard radiation thermometer working at 900 nm and 950 nm was used. The low uncertainty presently associated to the thermodynamic temperature of fixed points and the accuracy of INRIM realizations, allowed scales with an uncertainty lower than 0.03 K in terms of the thermodynamic temperature to be realized. A fixed-point cell filled with gold, 99.999 % in purity, was measured, and its freezing temperature was determined by both interpolation and extrapolation. An average T Au = 1337.395 K was found with a combined standard uncertainty of 23 mK. Such a value is 25 mK higher than the presently available value as derived by the CCT-WG4 value of ( T - T 90)Au = 39.9 mK.
Protograph LDPC Codes with Node Degrees at Least 3
Divsalar, Dariush; Jones, Christopher
2006-01-01
In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower, by about 0.2 dB, than the best known irregular LDPC codes with degree at least 3. The main motivation is to gain linear minimum distance to achieve low error floor. Also to construct rate-compatible protograph-based LDPC codes for fixed block length that simultaneously achieves low iterative decoding threshold and linear minimum distance. We start with a rate 1/2 protograph LDPC code with degree-3 nodes and one high degree node. Higher rate codes are obtained by connecting check nodes with degree-2 non-transmitted nodes. This is equivalent to constraint combining in the protograph. The condition where all constraints are combined corresponds to the highest rate code. This constraint must be connected to nodes of degree at least three for the graph to have linear minimum distance. Thus having node degree at least 3 for rate 1/2 guarantees linear minimum distance property to be preserved for higher rates. Through examples we show that the iterative decoding threshold as low as 0.544 dB can be achieved for small protographs with node degrees at least three. A family of low- to high-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented. FPGA simulation results for a few example codes show that the proposed codes perform as predicted.
Rigorous high-precision enclosures of fixed points and their invariant manifolds
Wittig, Alexander N.
The well established concept of Taylor Models is introduced, which offer highly accurate C0 enclosures of functional dependencies, combining high-order polynomial approximation of functions and rigorous estimates of the truncation error, performed using verified arithmetic. The focus of this work is on the application of Taylor Models in algorithms for strongly non-linear dynamical systems. A method is proposed to extend the existing implementation of Taylor Models in COSY INFINITY from double precision coefficients to arbitrary precision coefficients. Great care is taken to maintain the highest efficiency possible by adaptively adjusting the precision of higher order coefficients in the polynomial expansion. High precision operations are based on clever combinations of elementary floating point operations yielding exact values for round-off errors. An experimental high precision interval data type is developed and implemented. Algorithms for the verified computation of intrinsic functions based on the High Precision Interval datatype are developed and described in detail. The application of these operations in the implementation of High Precision Taylor Models is discussed. An application of Taylor Model methods to the verification of fixed points is presented by verifying the existence of a period 15 fixed point in a near standard Henon map. Verification is performed using different verified methods such as double precision Taylor Models, High Precision intervals and High Precision Taylor Models. Results and performance of each method are compared. An automated rigorous fixed point finder is implemented, allowing the fully automated search for all fixed points of a function within a given domain. It returns a list of verified enclosures of each fixed point, optionally verifying uniqueness within these enclosures. An application of the fixed point finder to the rigorous analysis of beam transfer maps in accelerator physics is presented. Previous work done by
The resolution of field identification fixed points in diagonal coset theories
International Nuclear Information System (INIS)
Fuchs, J.; Schellekens, B.; Schweigert, C.
1995-09-01
The fixed point resolution problem is solved for diagonal coset theories. The primary fields into which the fixed points are resolved are described by submodules of the branching spaces, obtained as eigenspaces of the automorphisms that implement field identification. To compute the characters and the modular S-matrix we use ''orbit Lie algebras'' and ''twining characters'', which were introduced in a previous paper. The characters of the primary fields are expressed in terms branching functions of twining characters. This allows us to express the modular S-matrix through the S-matrices of the orbit Lie algebras associated to the identification group. Our results can be extended to the larger class of ''generalized diagonal cosets''. (orig.)
Alignment Solution for CT Image Reconstruction using Fixed Point and Virtual Rotation Axis.
Jun, Kyungtaek; Yoon, Seokhwan
2017-01-25
Since X-ray tomography is now widely adopted in many different areas, it becomes more crucial to find a robust routine of handling tomographic data to get better quality of reconstructions. Though there are several existing techniques, it seems helpful to have a more automated method to remove the possible errors that hinder clearer image reconstruction. Here, we proposed an alternative method and new algorithm using the sinogram and the fixed point. An advanced physical concept of Center of Attenuation (CA) was also introduced to figure out how this fixed point is applied to the reconstruction of image having errors we categorized in this article. Our technique showed a promising performance in restoring images having translation and vertical tilt errors.
On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems
DEFF Research Database (Denmark)
Kohlenbach, Ulrich
2001-01-01
This paper is part of a case study in proof mining applied to non-effective proofs in nonlinear functional analysis. More specifically, we are concerned with the fixed point theory of nonexpansive selfmappings f of convex sets C in normed spaces. We study Krasnoselski and more general so-called K......This paper is part of a case study in proof mining applied to non-effective proofs in nonlinear functional analysis. More specifically, we are concerned with the fixed point theory of nonexpansive selfmappings f of convex sets C in normed spaces. We study Krasnoselski and more general so...... and Shafrir (1992) to unbounded sets C. Our explicit bounds also imply new qualitative results concerning the independence of the rate of asymptotic regularity from various data....
Emittance and damping of electrons in the neighborhood of resonance fixed points
International Nuclear Information System (INIS)
Crosbie, E.A.
1993-01-01
The stable fixed points generated by nonlinear field harmonics in a cyclic lattice define a multiturn stable orbit. The position of the orbit for each turn in each magnet of the lattice determines the betatron tunes and lattice dispersion functions describing the linear motion of charged particles with respect to the stable orbit. Since the position of the fixed points is dependent in part on the central orbit tune, it turns out that the multiturn orbit dispersion function depends to a large extent on the central orbit chromaticity. In particular, the horizontal partition number can be made to vary from values less than zero (horizontal antidamping for electrons) to values greater than three (longitudinal antidamping). The central orbit chromaticity therefore plays a major role in determining the characteristic emittance of an electron beam with respect to the multiturn orbit
Computing fixed points of nonexpansive mappings by $\\alpha$-dense curves
Directory of Open Access Journals (Sweden)
G. García
2017-08-01
Full Text Available Given a multivalued nonexpansive mapping defined on a convex and compact set of a Banach space, with values in the class of convex and compact subsets of its domain, we present an iteration scheme which (under suitable conditions converges to a fixed point of such mapping. This new iteration provides us another method to approximate the fixed points of a singlevalued nonexpansive mapping, defined on a compact and convex set into itself. Moreover, the conditions for the singlevalued case are less restrictive than for the multivalued case. Our main tool will be the so called $\\alpha$-dense curves, which will allow us to construct such iterations. Some numerical examples are provided to illustrate our results.
1989-01-01
This selection of papers from the Beijing conference gives a cross-section of the current trends in the field of fixed point theory as seen by topologists and analysts. Apart from one survey article, they are all original research articles, on topics including equivariant theory, extensions of Nielsen theory, periodic orbits of discrete and continuous dynamical systems, and new invariants and techniques in topological approaches to analytic problems.
Storti, Mario A.; Nigro, Norberto M.; Paz, Rodrigo R.; Dalcín, Lisandro D.
2009-03-01
In this paper some results on the convergence of the Gauss-Seidel iteration when solving fluid/structure interaction problems with strong coupling via fixed point iteration are presented. The flow-induced vibration of a flat plate aligned with the flow direction at supersonic Mach number is studied. The precision of different predictor schemes and the influence of the partitioned strong coupling on stability is discussed.
Chiral measurements with the Fixed-Point Dirac operator and construction of chiral currents
International Nuclear Information System (INIS)
Hasenfratz, P.; Hauswirth, S.; Holland, K.; Joerg, T.; Niedermayer, F.
2002-01-01
In this preliminary study, we examine the chiral properties of the parametrized Fixed-Point Dirac operator D FP , see how to improve its chirality via the Overlap construction, measure the renormalized quark condensate Σ-circumflex and the topological susceptibility χ t , and investigate local chirality of near zero modes of the Dirac operator. We also give a general construction of chiral currents and densities for chiral lattice actions
Energy efficient smartphone-based activity recognition using fixed-point arithmetic
Anguita, Davide; Ghio, Alessandro; Oneto, Luca; Llanas Parra, Francesc Xavier; Reyes Ortiz, Jorge Luis
2013-01-01
In this paper we propose a novel energy efficient approach for the recognition of human activities using smartphones as wearable sensing devices, targeting assisted living applications such as remote patient activity monitoring for the disabled and the elderly. The method exploits fixed-point arithmetic to propose a modified multiclass Support Vector Machine (SVM) learning algorithm, allowing to better pre- serve the smartphone battery lifetime with respect to the conventional flo...
Directory of Open Access Journals (Sweden)
Hao Tao
2012-01-01
analysis of real estate asset securitization by using the generalized fixed point theorem for weakly contractive mappings in partially ordered sets. Based on the analysis for the existence and uniqueness of the solution and scientific numerical calculation of the solution, in further study, some optimization schemes for traditional risk control process will be obtained, and then the main results of this paper can be applied to the forefront of research of real estate asset securitization.
Common Fixed Point of Multivalued Generalized φ-Weak Contractive Mappings
Directory of Open Access Journals (Sweden)
Behzad Djafari Rouhani
2010-01-01
Full Text Available Fixed point and coincidence results are presented for multivalued generalized φ-weak contractive mappings on complete metric spaces, where φ:[0,+∞→[0,+∞ is a lower semicontinuous function with φ(0=0 and φ(t>0 for all t>0. Our results extend previous results by Zhang and Song (2009, as well as by Rhoades (2001, Nadler (1969, and Daffer and Kaneko (1995.
Wähmer, M.; Anhalt, K.; Hollandt, J.; Klein, R.; Taubert, R. D.; Thornagel, R.; Ulm, G.; Gavrilov, V.; Grigoryeva, I.; Khlevnoy, B.; Sapritsky, V.
2017-10-01
Absolute spectral radiometry is currently the only established primary thermometric method for the temperature range above 1300 K. Up to now, the ongoing improvements of high-temperature fixed points and their formal implementation into an improved temperature scale with the mise en pratique for the definition of the kelvin, rely solely on single-wavelength absolute radiometry traceable to the cryogenic radiometer. Two alternative primary thermometric methods, yielding comparable or possibly even smaller uncertainties, have been proposed in the literature. They use ratios of irradiances to determine the thermodynamic temperature traceable to blackbody radiation and synchrotron radiation. At PTB, a project has been established in cooperation with VNIIOFI to use, for the first time, all three methods simultaneously for the determination of the phase transition temperatures of high-temperature fixed points. For this, a dedicated four-wavelengths ratio filter radiometer was developed. With all three thermometric methods performed independently and in parallel, we aim to compare the potential and practical limitations of all three methods, disclose possibly undetected systematic effects of each method and thereby confirm or improve the previous measurements traceable to the cryogenic radiometer. This will give further and independent confidence in the thermodynamic temperature determination of the high-temperature fixed point's phase transitions.
A Fixed Point VHDL Component Library for a High Efficiency Reconfigurable Radio Design Methodology
Hoy, Scott D.; Figueiredo, Marco A.
2006-01-01
Advances in Field Programmable Gate Array (FPGA) technologies enable the implementation of reconfigurable radio systems for both ground and space applications. The development of such systems challenges the current design paradigms and requires more robust design techniques to meet the increased system complexity. Among these techniques is the development of component libraries to reduce design cycle time and to improve design verification, consequently increasing the overall efficiency of the project development process while increasing design success rates and reducing engineering costs. This paper describes the reconfigurable radio component library developed at the Software Defined Radio Applications Research Center (SARC) at Goddard Space Flight Center (GSFC) Microwave and Communications Branch (Code 567). The library is a set of fixed-point VHDL components that link the Digital Signal Processing (DSP) simulation environment with the FPGA design tools. This provides a direct synthesis path based on the latest developments of the VHDL tools as proposed by the BEE VBDL 2004 which allows for the simulation and synthesis of fixed-point math operations while maintaining bit and cycle accuracy. The VHDL Fixed Point Reconfigurable Radio Component library does not require the use of the FPGA vendor specific automatic component generators and provide a generic path from high level DSP simulations implemented in Mathworks Simulink to any FPGA device. The access to the component synthesizable, source code provides full design verification capability:
Solutions to second order non-homogeneous multi-point BVPs using a fixed-point theorem
Directory of Open Access Journals (Sweden)
Yuji Liu
2008-07-01
Full Text Available In this article, we study five non-homogeneous multi-point boundary-value problems (BVPs of second order differential equations with the one-dimensional p-Laplacian. These problems have a common equation (in different function domains and different boundary conditions. We find conditions that guarantee the existence of at least three positive solutions. The results obtained generalize several known ones and are illustrated by examples. It is also shown that the approach for getting three positive solutions by using multi-fixed-point theorems can be extended to nonhomogeneous BVPs. The emphasis is on the nonhomogeneous boundary conditions and the nonlinear term involving first order derivative of the unknown. Some open problems are also proposed.
QC-LDPC code-based cryptography
Baldi, Marco
2014-01-01
This book describes the fundamentals of cryptographic primitives based on quasi-cyclic low-density parity-check (QC-LDPC) codes, with a special focus on the use of these codes in public-key cryptosystems derived from the McEliece and Niederreiter schemes. In the first part of the book, the main characteristics of QC-LDPC codes are reviewed, and several techniques for their design are presented, while tools for assessing the error correction performance of these codes are also described. Some families of QC-LDPC codes that are best suited for use in cryptography are also presented. The second part of the book focuses on the McEliece and Niederreiter cryptosystems, both in their original forms and in some subsequent variants. The applicability of QC-LDPC codes in these frameworks is investigated by means of theoretical analyses and numerical tools, in order to assess their benefits and drawbacks in terms of system efficiency and security. Several examples of QC-LDPC code-based public key cryptosystems are prese...
A simple proof of the exactness of expanding maps of the interval with an indifferent fixed point
International Nuclear Information System (INIS)
Lenci, Marco
2016-01-01
Expanding maps with indifferent fixed points, a.k.a. intermittent maps, are popular models in nonlinear dynamics and infinite ergodic theory. We present a simple proof of the exactness of a wide class of expanding maps of [0, 1], with countably many surjective branches and a strongly neutral fixed point in 0.
International Nuclear Information System (INIS)
Vidossich, G.
1979-01-01
The paper presents a proof of two fixed-point theorems, which unify previous results on periodic solutions of second-order ordinary differential equations, in the sense that the existence part of these solutions become a corollay of the fixed-point theorems. (author)
Protograph LDPC Codes for the Erasure Channel
Pollara, Fabrizio; Dolinar, Samuel J.; Divsalar, Dariush
2006-01-01
This viewgraph presentation reviews the use of protograph Low Density Parity Check (LDPC) codes for erasure channels. A protograph is a Tanner graph with a relatively small number of nodes. A "copy-and-permute" operation can be applied to the protograph to obtain larger derived graphs of various sizes. For very high code rates and short block sizes, a low asymptotic threshold criterion is not the best approach to designing LDPC codes. Simple protographs with much regularity and low maximum node degrees appear to be the best choices Quantized-rateless protograph LDPC codes can be built by careful design of the protograph such that multiple puncturing patterns will still permit message passing decoding to proceed
LDPC Decoding on GPU for Mobile Device
Directory of Open Access Journals (Sweden)
Yiqin Lu
2016-01-01
Full Text Available A flexible software LDPC decoder that exploits data parallelism for simultaneous multicode words decoding on the mobile device is proposed in this paper, supported by multithreading on OpenCL based graphics processing units. By dividing the check matrix into several parts to make full use of both the local memory and private memory on GPU and properly modify the code capacity each time, our implementation on a mobile phone shows throughputs above 100 Mbps and delay is less than 1.6 millisecond in decoding, which make high-speed communication like video calling possible. To realize efficient software LDPC decoding on the mobile device, the LDPC decoding feature on communication baseband chip should be replaced to save the cost and make it easier to upgrade decoder to be compatible with a variety of channel access schemes.
Rate-Compatible LDPC Codes with Linear Minimum Distance
Divsalar, Dariush; Jones, Christopher; Dolinar, Samuel
2009-01-01
A recently developed method of constructing protograph-based low-density parity-check (LDPC) codes provides for low iterative decoding thresholds and minimum distances proportional to block sizes, and can be used for various code rates. A code constructed by this method can have either fixed input block size or fixed output block size and, in either case, provides rate compatibility. The method comprises two submethods: one for fixed input block size and one for fixed output block size. The first mentioned submethod is useful for applications in which there are requirements for rate-compatible codes that have fixed input block sizes. These are codes in which only the numbers of parity bits are allowed to vary. The fixed-output-blocksize submethod is useful for applications in which framing constraints are imposed on the physical layers of affected communication systems. An example of such a system is one that conforms to one of many new wireless-communication standards that involve the use of orthogonal frequency-division modulation
Reliability of High-Temperature Fixed-Point Installations over 8 Years
Elliott, C. J.; Ford, T.; Ongrai, O.; Pearce, J. V.
2017-12-01
At NPL, high-temperature metal-carbon eutectic fixed points have been set up for thermocouple calibration purposes since 2006, for realising reference temperatures above the highest point specified in the International Temperature Scale of 1990 for contact thermometer calibrations. Additionally, cells of the same design have been provided by NPL to other national measurement institutes (NMIs) and calibration laboratories over this period, creating traceable and ISO 17025 accredited facilities around the world for calibrating noble metal thermocouples at 1324 {°}C (Co-C) and 1492 {°}C (Pd-C). This paper shows collections of thermocouple calibration results obtained during use of the high-temperature fixed-point cells at NPL and, as further examples, the use of cells installed at CCPI Europe (UK) and NIMT (Thailand). The lifetime of the cells can now be shown to be in excess of 7 years, whether used on a weekly or monthly basis, and whether used in an NMI or industrial calibration laboratory.
Protograph LDPC Codes Over Burst Erasure Channels
Divsalar, Dariush; Dolinar, Sam; Jones, Christopher
2006-01-01
In this paper we design high rate protograph based LDPC codes suitable for binary erasure channels. To simplify the encoder and decoder implementation for high data rate transmission, the structure of codes are based on protographs and circulants. These LDPC codes can improve data link and network layer protocols in support of communication networks. Two classes of codes were designed. One class is designed for large block sizes with an iterative decoding threshold that approaches capacity of binary erasure channels. The other class is designed for short block sizes based on maximizing minimum stopping set size. For high code rates and short blocks the second class outperforms the first class.
Random fixed point equations and inverse problems using "collage method" for contraction mappings
Kunze, H. E.; La Torre, D.; Vrscay, E. R.
2007-10-01
In this paper we are interested in the direct and inverse problems for the following class of random fixed point equations T(w,x(w))=x(w) where is a given operator, [Omega] is a probability space and X is a Polish metric space. The inverse problem is solved by recourse to the collage theorem for contractive maps. We then consider two applications: (i) random integral equations, and (ii) random iterated function systems with greyscale maps (RIFSM), for which noise is added to the classical IFSM.
A New Iterative Method for Equilibrium Problems and Fixed Point Problems
Directory of Open Access Journals (Sweden)
Abdul Latif
2013-01-01
Full Text Available Introducing a new iterative method, we study the existence of a common element of the set of solutions of equilibrium problems for a family of monotone, Lipschitz-type continuous mappings and the sets of fixed points of two nonexpansive semigroups in a real Hilbert space. We establish strong convergence theorems of the new iterative method for the solution of the variational inequality problem which is the optimality condition for the minimization problem. Our results improve and generalize the corresponding recent results of Anh (2012, Cianciaruso et al. (2010, and many others.
Tail estimates for stochastic fixed point equations via nonlinear renewal theory
DEFF Research Database (Denmark)
Collamore, Jeffrey F.; Vidyashankar, Anand N.
2013-01-01
estimate P(V>u)~Cu^{-r} as u tends to infinity, and also present a corresponding Lundberg-type upper bound. To this end, we introduce a novel dual change of measure on a random time interval and analyze the path properties, using nonlinear renewal theory, of the Markov chain resulting from the forward...... iteration of the given stochastic fixed point equation. In the process, we establish several new results in the realm of nonlinear renewal theory for these processes. As a consequence of our techniques, we also establish a new characterization of the extremal index. Finally, we provide some extensions...... of our methods to Markov-driven processes....
(0,2) SCFTs from the Leigh-Strassler fixed point
Energy Technology Data Exchange (ETDEWEB)
Bobev, Nikolay [Perimeter Institute for Theoretical Physics, 31 Caroline Street North, Waterloo, ON N2L 2Y5 (Canada); Pilch, Krzysztof; Vasilakis, Orestis [Department of Physics and Astronomy, University of Southern California, Los Angeles, CA 90089 (United States)
2014-06-17
We show that there is a family of two-dimensional (0,2) SCFTs associated with twisted compactifications of the four-dimensional N=1 Leigh-Strassler fixed point on a closed hyperbolic Riemann surface. We calculate the central charges for this class of theories using anomalies and c-extremization. In a suitable truncation of the five-dimensional maximal supergravity, we construct supersymmetric AdS{sub 3} solutions that are holographic duals of those two-dimensional (0,2) SCFTs. We also exhibit supersymmetric domain wall solutions that are holographically dual to the RG flows between the four-dimensional and two-dimensional theories.
Approximation of fixed points of Lipschitz pseudo-contractive mapping in Banach spaces
International Nuclear Information System (INIS)
Chidume, C.E.
1988-01-01
Let K be a subset of a real Banach space X. A mapping T:K → X is called pseudo-contractive if the inequality ||x-y|| ≤ ||(1+r)(x-y)-r(Tx-Ty)|| holds for all x,y in K and r > 0. Fixed points of Lipschitz pseudo-contractive maps are approximated under appropriate conditions, by an iteration process of the type introduced by W.R. Mann. This gives an affirmative answer to the problem stated by T.L. Hicks and J.R. Rubicek (J. Math. Anal. Appl. 59 (1977) 504). (author). 28 refs
(0,2) SCFTs from the Leigh-Strassler fixed point
International Nuclear Information System (INIS)
Bobev, Nikolay; Pilch, Krzysztof; Vasilakis, Orestis
2014-01-01
We show that there is a family of two-dimensional (0,2) SCFTs associated with twisted compactifications of the four-dimensional N=1 Leigh-Strassler fixed point on a closed hyperbolic Riemann surface. We calculate the central charges for this class of theories using anomalies and c-extremization. In a suitable truncation of the five-dimensional maximal supergravity, we construct supersymmetric AdS 3 solutions that are holographic duals of those two-dimensional (0,2) SCFTs. We also exhibit supersymmetric domain wall solutions that are holographically dual to the RG flows between the four-dimensional and two-dimensional theories.
Grand unified theory precursors and nontrivial fixed points in higher-dimensional gauge theories
International Nuclear Information System (INIS)
Dienes, Keith R.; Dudas, Emilian; Gherghetta, Tony
2003-01-01
Within the context of traditional logarithmic grand unification at M GUT ≅10 16 GeV, we show that it is nevertheless possible to observe certain GUT states such as X and Y gauge bosons at lower scales, perhaps even in the TeV range. We refer to such states as 'GUT precursors'. These states offer an interesting alternative possibility for new physics at the TeV scale, and could be used to directly probe GUT physics even though the scale of gauge coupling unification remains high. Our results also give rise to a Kaluza-Klein realization of nontrivial fixed points in higher-dimensional gauge theories
Standard map in magnetized relativistic systems: fixed points and regular acceleration.
de Sousa, M C; Steffens, F M; Pakter, R; Rizzato, F B
2010-08-01
We investigate the concept of a standard map for the interaction of relativistic particles and electrostatic waves of arbitrary amplitudes, under the action of external magnetic fields. The map is adequate for physical settings where waves and particles interact impulsively, and allows for a series of analytical result to be exactly obtained. Unlike the traditional form of the standard map, the present map is nonlinear in the wave amplitude and displays a series of peculiar properties. Among these properties we discuss the relation involving fixed points of the maps and accelerator regimes.
Rare event simulation for stochastic fixed point equations related to the smoothing transform
DEFF Research Database (Denmark)
Collamore, Jeffrey F.; Vidyashankar, Anand N.; Xu, Jie
2013-01-01
In several applications arising in computer science, cascade theory, and other applied areas, it is of interest to evaluate the tail probabilities of non-homogeneous stochastic fixed point equations. Recently, techniques have been developed for the related linear recursions, yielding tail estimates...... and importance sampling methods for these recursions. However, such methods do not routinely generalize to non-homogeneous recursions. Drawing on techniques from the weighted branching process literature, we present a consistent, strongly efficient importance sampling algorithm for estimating the tail...
Large deviation tail estimates and related limit laws for stochastic fixed point equations
DEFF Research Database (Denmark)
Collamore, Jeffrey F.; Vidyashankar, Anand N.
2013-01-01
We study the forward and backward recursions generated by a stochastic fixed point equation (SFPE) of the form $V \\stackrel{d}{=} A\\max\\{V, D\\}+B$, where $(A, B, D) \\in (0, \\infty)\\times {\\mathbb R}^2$, for both the stationary and explosive cases. In the stationary case (when ${\\bf E} [\\log \\: A......] explosive case (when ${\\bf E} [\\log \\: A] > 0)$, we establish a central limit theorem for the forward recursion generated by the SFPE, namely the process $V_n= A_n \\max\\{V_{n-1...
Isotopic effects in the neon fixed point: uncertainty of the calibration data correction
Steur, Peter P. M.; Pavese, Franco; Fellmuth, Bernd; Hermier, Yves; Hill, Kenneth D.; Seog Kim, Jin; Lipinski, Leszek; Nagao, Keisuke; Nakano, Tohru; Peruzzi, Andrea; Sparasci, Fernando; Szmyrka-Grzebyk, Anna; Tamura, Osamu; Tew, Weston L.; Valkiers, Staf; van Geel, Jan
2015-02-01
The neon triple point is one of the defining fixed points of the International Temperature Scale of 1990 (ITS-90). Although recognizing that natural neon is a mixture of isotopes, the ITS-90 definition only states that the neon should be of ‘natural isotopic composition’, without any further requirements. A preliminary study in 2005 indicated that most of the observed variability in the realized neon triple point temperatures within a range of about 0.5 mK can be attributed to the variability in isotopic composition among different samples of ‘natural’ neon. Based on the results of an International Project (EUROMET Project No. 770), the Consultative Committee for Thermometry decided to improve the realization of the neon fixed point by assigning the ITS-90 temperature value 24.5561 K to neon with the isotopic composition recommended by IUPAC, accompanied by a quadratic equation to take the deviations from the reference composition into account. In this paper, the uncertainties of the equation are discussed and an uncertainty budget is presented. The resulting standard uncertainty due to the isotopic effect (k = 1) after correction of the calibration data is reduced to (4 to 40) μK when using neon of ‘natural’ isotopic composition or to 30 μK when using 20Ne. For comparison, an uncertainty component of 0.15 mK should be included in the uncertainty budget for the neon triple point if the isotopic composition is unknown, i.e. whenever the correction cannot be applied.
Non-thermal fixed points and solitons in a one-dimensional Bose gas
International Nuclear Information System (INIS)
Schmidt, Maximilian; Erne, Sebastian; Nowak, Boris; Sexty, Dénes; Gasenzer, Thomas
2012-01-01
Single-particle momentum spectra for a dynamically evolving one-dimensional Bose gas are analysed in the semi-classical wave limit. Representing one of the simplest correlation functions, these provide information on a possible universal scaling behaviour. Motivated by the previously discovered connection between (quasi-) topological field configurations, strong wave turbulence and non-thermal fixed points of quantum field dynamics, soliton formation is studied with respect to the appearance of transient power-law spectra. A random-soliton model is developed for describing the spectra analytically, and the analogies and differences between the emerging power laws and those found in a field theory approach to strong wave turbulence are discussed. The results open a new perspective on solitary wave dynamics from the point of view of critical phenomena far from thermal equilibrium and the possibility of studying this dynamics by experiment without the need for detecting solitons in situ. (paper)
The general problem of the motion of coupled rigid bodies about a fixed point
Leimanis, Eugene
1965-01-01
In the theory of motion of several coupled rigid bodies about a fixed point one can distinguish three basic ramifications. 1. The first, the so-called classical direction of investigations, is concerned with particular cases of integrability ot the equations of motion of a single rigid body about a fixed point,1 and with their geo metrical interpretation. This path of thought was predominant until the beginning of the 20th century and its most illustrious represen tatives are L. EULER (1707-1783), J L. LAGRANGE (1736-1813), L. POINSOT (1777-1859), S. V. KOVALEVSKAYA (1850-1891), and others. Chapter I of the present monograph intends to reflect this branch of investigations. For collateral reading on the general questions dealt with in this chapter the reader is referred to the following textbooks and reports: A. DOMOGAROV [1J, F. KLEIN and A. SOMMERFELD [11, 1 , 1 J, A. G. 2 3 GREENHILL [10J, A. GRAY [1J, R. GRAMMEL [4 J, E. J. ROUTH [21' 2 , 1 2 31' 32J, J. B. SCARBOROUGH [1J, and V. V. GOLUBEV [1, 2J.
Common Fixed Points for Asymptotic Pointwise Nonexpansive Mappings in Metric and Banach Spaces
Directory of Open Access Journals (Sweden)
P. Pasom
2012-01-01
Full Text Available Let C be a nonempty bounded closed convex subset of a complete CAT(0 space X. We prove that the common fixed point set of any commuting family of asymptotic pointwise nonexpansive mappings on C is nonempty closed and convex. We also show that, under some suitable conditions, the sequence {xk}k=1∞ defined by xk+1=(1-tmkxk⊕tmkTmnky(m-1k, y(m-1k=(1-t(m-1kxk⊕t(m-1kTm-1nky(m-2k,y(m-2k=(1-t(m-2kxk⊕t(m-2kTm-2nky(m-3k,…,y2k=(1-t2kxk⊕t2kT2nky1k,y1k=(1-t1kxk⊕t1kT1nky0k,y0k=xk, k∈N, converges to a common fixed point of T1,T2,…,Tm where they are asymptotic pointwise nonexpansive mappings on C, {tik}k=1∞ are sequences in [0,1] for all i=1,2,…,m, and {nk} is an increasing sequence of natural numbers. The related results for uniformly convex Banach spaces are also included.
Acoustic resonator providing fixed points of temperature between 0.1 and 2 K
International Nuclear Information System (INIS)
Salmela, Anssi; Tuoriniemi, Juha; Pentti, Elias; Sebedash, Alexander; Rysti, Juho
2009-01-01
Below 2 K the speed of second sound in mixtures of liquid 3 He and 4 He first increases to a maximum of 30-40 m/s at about 1 K and then decreases again at lower temperatures to values below 15 m/s. The exact values depend on the concentration and pressure of the mixture. This can be exploited to provide fixed points in temperature by utilizing a resonator with appropriate dimensions and frequency to excite standing waves in the resonator cavity filled with helium mixture. We demonstrate that commercially mass produced quartz tuning forks can be used for this purpose. They are meant for frequency standards operating at 32 kHz. Their dimensions are typically of order 1 mm matching the wavelength of the second sound in helium mixtures at certain values of temperature. Due to the complicated geometry, we observe some 20 sharp acoustic resonances in the range 0.1l 2 K having temperature resolution of order 1 μK. The quartz resonators are cheap, compact, simple to implement, easy to measure with great accuracy, and, above all, they are not sensitive to magnetic field, which is a great advantage compared to fixed point devices based on superconductivity transitions. The reproducibility of the resonance pattern upon thermal cycling remains to be verified.
Directory of Open Access Journals (Sweden)
Wilson Rodríguez Calderón
2015-04-01
Full Text Available When we need to determine the solution of a nonlinear equation there are two options: closed-methods which use intervals that contain the root and during the iterative process reduce the size of natural way, and, open-methods that represent an attractive option as they do not require an initial interval enclosure. In general, we know open-methods are more efficient computationally though they do not always converge. In this paper we are presenting a divergence case analysis when we use the method of fixed point iteration to find the normal height in a rectangular channel using the Manning equation. To solve this problem, we propose applying two strategies (developed by authors that allow to modifying the iteration function making additional formulations of the traditional method and its convergence theorem. Although Manning equation is solved with other methods like Newton when we use the iteration method of fixed-point an interesting divergence situation is presented which can be solved with a convergence higher than quadratic over the initial iterations. The proposed strategies have been tested in two cases; a study of divergence of square root of real numbers was made previously by authors for testing. Results in both cases have been successful. We present comparisons because are important for seeing the advantage of proposed strategies versus the most representative open-methods.
Fixed point theorems in locally convex spacesÃ¢Â€Â”the Schauder mapping method
Directory of Open Access Journals (Sweden)
S. Cobzaş
2006-03-01
Full Text Available In the appendix to the book by F. F. Bonsal, Lectures on Some Fixed Point Theorems of Functional Analysis (Tata Institute, Bombay, 1962 a proof by Singbal of the Schauder-Tychonoff fixed point theorem, based on a locally convex variant of Schauder mapping method, is included. The aim of this note is to show that this method can be adapted to yield a proof of Kakutani fixed point theorem in the locally convex case. For the sake of completeness we include also the proof of Schauder-Tychonoff theorem based on this method. As applications, one proves a theorem of von Neumann and a minimax result in game theory.
Fixed point and anomaly mediation in partial {\\boldsymbol{N}}=2 supersymmetric standard models
Yin, Wen
2018-01-01
Motivated by the simple toroidal compactification of extra-dimensional SUSY theories, we investigate a partial N = 2 supersymmetric (SUSY) extension of the standard model which has an N = 2 SUSY sector and an N = 1 SUSY sector. We point out that below the scale of the partial breaking of N = 2 to N = 1, the ratio of Yukawa to gauge couplings embedded in the original N = 2 gauge interaction in the N = 2 sector becomes greater due to a fixed point. Since at the partial breaking scale the sfermion masses in the N = 2 sector are suppressed due to the N = 2 non-renormalization theorem, the anomaly mediation effect becomes important. If dominant, the anomaly-induced masses for the sfermions in the N = 2 sector are almost UV-insensitive due to the fixed point. Interestingly, these masses are always positive, i.e. there is no tachyonic slepton problem. From an example model, we show interesting phenomena differing from ordinary MSSM. In particular, the dark matter particle can be a sbino, i.e. the scalar component of the N = 2 vector multiplet of {{U}}{(1)}Y. To obtain the correct dark matter abundance, the mass of the sbino, as well as the MSSM sparticles in the N = 2 sector which have a typical mass pattern of anomaly mediation, is required to be small. Therefore, this scenario can be tested and confirmed in the LHC and may be further confirmed by the measurement of the N = 2 Yukawa couplings in future colliders. This model can explain dark matter, the muon g-2 anomaly, and gauge coupling unification, and relaxes some ordinary problems within the MSSM. It is also compatible with thermal leptogenesis.
Design and Evaluation of Large-Aperture Gallium Fixed-Point Blackbody
Khromchenko, V. B.; Mekhontsev, S. N.; Hanssen, L. M.
2009-02-01
To complement existing water bath blackbodies that now serve as NIST primary standard sources in the temperature range from 15 °C to 75 °C, a gallium fixed-point blackbody has been recently built. The main objectives of the project included creating an extended-area radiation source with a target emissivity of 0.9999 capable of operating either inside a cryo-vacuum chamber or in a standard laboratory environment. A minimum aperture diameter of 45 mm is necessary for the calibration of radiometers with a collimated input geometry or large spot size. This article describes the design and performance evaluation of the gallium fixed-point blackbody, including the calculation and measurements of directional effective emissivity, estimates of uncertainty due to the temperature drop across the interface between the pure metal and radiating surfaces, as well as the radiometrically obtained spatial uniformity of the radiance temperature and the melting plateau stability. Another important test is the measurement of the cavity reflectance, which was achieved by using total integrated scatter measurements at a laser wavelength of 10.6 μm. The result allows one to predict the performance under the low-background conditions of a cryo-chamber. Finally, results of the spectral radiance comparison with the NIST water-bath blackbody are provided. The experimental results are in good agreement with predicted values and demonstrate the potential of our approach. It is anticipated that, after completion of the characterization, a similar source operating at the water triple point will be constructed.
Fixed Points and Fuzzy Stability of Functional Equations Related to Inner Product
Directory of Open Access Journals (Sweden)
Hassan Azadi Kenary
2012-04-01
Full Text Available In , Th.M. Rassias introduced the following equality sum_{i,j=1}^m |x_i - x_j |^2 = 2m sum_{i=1}^m|x_i|^2, qquad sum_{i=1}^m x_i =0 for a fixed integer $m ge 3$. Let $V, W$ be real vector spaces. It is shown that if a mapping $f : V ightarrow W$ satisfies sum_{i,j=1}^m f(x_i - x_j = 2m sum_{i=1}^m f(x_i for all $x_1, ldots, x_{m} in V$ with $sum_{i=1}^m x_i =0$, then the mapping $f : V ightarrow W$ is realized as the sum of an additive mapping and a quadratic mapping. From the above equality we can define the functional equation f(x-y +f(2x+y + f(x+2y= 3f(x+ 3f(y + 3f(x+y , which is called a {it quadratic functional equation}. Every solution of the quadratic functional equation is said to be a {it quadratic mapping}. Using fixed point theorem we prove the Hyers-Ulam stability of the functional equation ( in fuzzy Banach spaces.
Solution of the Stokes system by boundary integral equations and fixed point iterative schemes
International Nuclear Information System (INIS)
Chidume, C.E.; Lubuma, M.S.
1990-01-01
The solution to the exterior three dimensional Stokes problem is sought in the form of a single layer potential of unknown density. This reduces the problem to a boundary integral equation of the first kind whose operator is the velocity component of the single layer potential. It is shown that this component is an isomorphism between two appropriate Sobolev spaces containing the unknown densities and the data respectively. The isomorphism corresponds to a variational problem with coercive bilinear form. The latter property allows us to consider various fixed point iterative schemes that converge to the unique solution of the integral equation. Explicit error estimates are also obtained. The successive approximations are also considered in a more computable form by using the product integration method of Atkinson. (author). 47 refs
Gilchrist, S. A.; Braun, D. C.; Barnes, G.
2016-12-01
Magnetohydrostatic models of the solar atmosphere are often based on idealized analytic solutions because the underlying equations are too difficult to solve in full generality. Numerical approaches, too, are often limited in scope and have tended to focus on the two-dimensional problem. In this article we develop a numerical method for solving the nonlinear magnetohydrostatic equations in three dimensions. Our method is a fixed-point iteration scheme that extends the method of Grad and Rubin ( Proc. 2nd Int. Conf. on Peaceful Uses of Atomic Energy 31, 190, 1958) to include a finite gravity force. We apply the method to a test case to demonstrate the method in general and our implementation in code in particular.
'Fixed point' QCD analysis of the CCFR data on deep inelastic neutrino-nucleon scattering
International Nuclear Information System (INIS)
Sidorov, A.V.; Stamenov, D.B.
1995-01-01
The results of LO Fixed point QCD (FP-QCD) analysis of the CCFR data for the nucleon structure function xF 3 (x,Q 2 ) are presented. The predictions of FP-QCD, in which α S (Q 2 ) tends to a nonzero coupling constant α 0 as Q 2 → ∞, are in good agreement with the data. The description of the data is even better than that in the case of LO QCD. The FP-QCD parameter α 0 is determined with a good accuracy: α 0 0.198 ± 0.009. Having in mind the recent QCD fits to the same data we conclude that unlike the high precision and large (x,Q 2 ) kinematic range of the CCFR data they cannot discriminate between QCD and FP-QCD predictions for xF 3 (x,Q 2 ). 11 refs., 1 tab
Point and Fixed Plot Sampling Inventory Estimates at the Savannah River Site, South Carolina.
Energy Technology Data Exchange (ETDEWEB)
Parresol, Bernard, R.
2004-02-01
This report provides calculation of systematic point sampling volume estimates for trees greater than or equal to 5 inches diameter breast height (dbh) and fixed radius plot volume estimates for trees < 5 inches dbh at the Savannah River Site (SRS), Aiken County, South Carolina. The inventory of 622 plots was started in March 1999 and completed in January 2002 (Figure 1). Estimates are given in cubic foot volume. The analyses are presented in a series of Tables and Figures. In addition, a preliminary analysis of fuel levels on the SRS is given, based on depth measurements of the duff and litter layers on the 622 inventory plots plus line transect samples of down coarse woody material. Potential standing live fuels are also included. The fuels analyses are presented in a series of tables.
Hoyos Velasco, Fredy Edimer; García, Nicolás Toro; Garcés Gómez, Yeison Alberto
In this paper, the output voltage of a buck power converter is controlled by means of a quasi-sliding scheme. The Fixed Point Inducting Control (FPIC) technique is used for the control design, based on the Zero Average Dynamics (ZAD) strategy, including load estimation by means of the Least Mean Squares (LMS) method. The control scheme is tested in a Rapid Control Prototyping (RCP) system based on Digital Signal Processing (DSP) for dSPACE platform. The closed loop system shows adequate performance. The experimental and simulation results match. The main contribution of this paper is to introduce the load estimator by means of LMS, to make ZAD and FPIC control feasible in load variation conditions. In addition, comparison results for controlled buck converter with SMC, PID and ZAD-FPIC control techniques are shown.
Directory of Open Access Journals (Sweden)
Phayap Katchang
2010-01-01
Full Text Available The purpose of this paper is to investigate the problem of finding a common element of the set of solutions for mixed equilibrium problems, the set of solutions of the variational inclusions with set-valued maximal monotone mappings and inverse-strongly monotone mappings, and the set of fixed points of a family of finitely nonexpansive mappings in the setting of Hilbert spaces. We propose a new iterative scheme for finding the common element of the above three sets. Our results improve and extend the corresponding results of the works by Zhang et al. (2008, Peng et al. (2008, Peng and Yao (2009, as well as Plubtieng and Sriprad (2009 and some well-known results in the literature.
Finite size scaling of the Higgs-Yukawa model near the Gaussian fixed point
Energy Technology Data Exchange (ETDEWEB)
Chu, David Y.J.; Lin, C.J. David [National Chiao-Tung Univ., Hsinchu, Taiwan (China); Jansen, Karl [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC; Knippschild, Bastian [HISKP, Bonn (Germany); Nagy, Attila [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC; Humboldt-Univ. Berlin (Germany)
2016-12-15
We study the scaling properties of Higgs-Yukawa models. Using the technique of Finite-Size Scaling, we are able to derive scaling functions that describe the observables of the model in the vicinity of a Gaussian fixed point. A feasibility study of our strategy is performed for the pure scalar theory in the weak-coupling regime. Choosing the on-shell renormalisation scheme gives us an advantage to fit the scaling functions against lattice data with only a small number of fit parameters. These formulae can be used to determine the universality of the observed phase transitions, and thus play an essential role in future investigations of Higgs-Yukawa models, in particular in the strong Yukawa coupling region.
Equivalence of two Fixed-Point Semantics for Definitional Higher-Order Logic Programs
Directory of Open Access Journals (Sweden)
Angelos Charalambidis
2015-09-01
Full Text Available Two distinct research approaches have been proposed for assigning a purely extensional semantics to higher-order logic programming. The former approach uses classical domain theoretic tools while the latter builds on a fixed-point construction defined on a syntactic instantiation of the source program. The relationships between these two approaches had not been investigated until now. In this paper we demonstrate that for a very broad class of programs, namely the class of definitional programs introduced by W. W. Wadge, the two approaches coincide (with respect to ground atoms that involve symbols of the program. On the other hand, we argue that if existential higher-order variables are allowed to appear in the bodies of program rules, the two approaches are in general different. The results of the paper contribute to a better understanding of the semantics of higher-order logic programming.
Non-binary Hybrid LDPC Codes: Structure, Decoding and Optimization
Sassatelli, Lucile; Declercq, David
2007-01-01
In this paper, we propose to study and optimize a very general class of LDPC codes whose variable nodes belong to finite sets with different orders. We named this class of codes Hybrid LDPC codes. Although efficient optimization techniques exist for binary LDPC codes and more recently for non-binary LDPC codes, they both exhibit drawbacks due to different reasons. Our goal is to capitalize on the advantages of both families by building codes with binary (or small finite set order) and non-bin...
New Approach in Filling of Fixed-Point Cells: Case Study of the Melting Point of Gallium
Bojkovski, J.; Hiti, M.; Batagelj, V.; Drnovšek, J.
2008-02-01
The typical way of constructing fixed-point cells is very well described in the literature. The crucible is loaded with shot, or any other shape of pure metal, inside an argon-filled glove box. Then, the crucible is carefully slid into a fused-silica tube that is closed at the top with an appropriate cap. After that, the cell is removed from the argon glove box and melted inside a furnace while under vacuum or filled with an inert gas like argon. Since the metal comes as shot, or in some other shape such as rods of various sizes, and takes more volume than the melted material, it is necessary to repeat the procedure until a sufficient amount of material is introduced into the crucible. With such a procedure, there is the possibility of introducing additional impurities into the pure metal with each cycle of melting the material and putting it back into the glove box to fill the cell. Our new approach includes the use of a special, so-called dry-box system, which is well known in chemistry. The atmosphere inside the dry box contains less than 20 ppm of water and less than 3 ppm of oxygen. Also, the size of the dry box allows it to contain a furnace for melting materials, not only for gallium but for higher-temperature materials as well. With such an approach, the cell and all its parts (pure metal, graphite, fused-silica tube, and cap) are constantly inside the controlled atmosphere, even while melting the material and filling the crucible. With such a method, the possibility of contaminating the cell during the filling process is minimized.
Metal Carbon Eutectics to Extend the Use of the Fixed-Point Technique in Precision IR Thermometry
Battuello, M.; Girard, F.; Florio, M.
2008-06-01
The high-temperature extension of the fixed-point technique for primary calibration of precision infrared (IR) thermometers was investigated both through mathematical simulations and laboratory investigations. Simulations were performed with Co C (1,324°C) and Pd C (1, 492°C) eutectic fixed points, and a precision IR thermometer was calibrated from the In point (156.5985°C) up to the Co C point. Mathematical simulations suggested the possibility of directly deriving the transition temperature of the Co C and Pd C points by extrapolating the calibration derived from fixed-point measurements from In to the Cu point. Both temperatures, as a result of the low uncertainty associated with the In Cu calibration and the high number of fixed points involved in the calibration process, can be derived with an uncertainty of 0.11°C for Co C and 0.18°C for Pd C. A transition temperature of 1,324.3°C for Co C was determined from the experimental verification, a value higher than, but compatible with, the one proposed by the thermometry community for inclusion as a secondary reference point for ITS-90 dissemination, i.e., 1,324.0°C.
Investigation of the Behavior of the Co C Eutectic Fixed Point
Girard, F.; Battuello, M.; Florio, M.
2007-12-01
The behavior of the Co C eutectic fixed point was investigated at INRIM. Several cells of different design and volume, and filled with cobalt of different purity were constructed and investigated with both Pt/Pd thermocouples and radiation thermometers. The melting behavior was investigated with respect to the melting rate, the pre-freezing rate, and the annealing time. The melting temperatures, as defined, were not significantly affected by the different testing conditions, even if the shape and duration of the plateaux were influenced. Several tens of melt and freeze cycles were performed with the different cells. The spread in the results for all of the different conditions was very limited in extent, giving rise to a standard deviation of less than 0.04 °C; a repeatability of better than 0.02 °C was found with both Pt/Pd thermocouples and radiation thermometers. The results of our measurements are encouraging and confirm the suitability of Co C as a reference point for the high-temperature range in a possible future temperature scale. Investigations of long-term stability remain ongoing.
Analyzing survival curves at a fixed point in time for paired and clustered right-censored data
Su, Pei-Fang; Chi, Yunchan; Lee, Chun-Yi; Shyr, Yu; Liao, Yi-De
2018-01-01
In clinical trials, information about certain time points may be of interest in making decisions about treatment effectiveness. Rather than comparing entire survival curves, researchers can focus on the comparison at fixed time points that may have a clinical utility for patients. For two independent samples of right-censored data, Klein et al. (2007) compared survival probabilities at a fixed time point by studying a number of tests based on some transformations of the Kaplan-Meier estimators of the survival function. However, to compare the survival probabilities at a fixed time point for paired right-censored data or clustered right-censored data, their approach would need to be modified. In this paper, we extend the statistics to accommodate the possible within-paired correlation and within-clustered correlation, respectively. We use simulation studies to present comparative results. Finally, we illustrate the implementation of these methods using two real data sets. PMID:29456280
Codeword Structure Analysis for LDPC Convolutional Codes
Directory of Open Access Journals (Sweden)
Hua Zhou
2015-12-01
Full Text Available The codewords of a low-density parity-check (LDPC convolutional code (LDPC-CC are characterised into structured and non-structured. The number of the structured codewords is dominated by the size of the polynomial syndrome former matrix H T ( D , while the number of the non-structured ones depends on the particular monomials or polynomials in H T ( D . By evaluating the relationship of the codewords between the mother code and its super codes, the low weight non-structured codewords in the super codes can be eliminated by appropriately choosing the monomials or polynomials in H T ( D , resulting in improved distance spectrum of the mother code.
Resource Efficient LDPC Decoders for Multimedia Communication
Chandrasetty, Vikram Arkalgud; Aziz, Syed Mahfuzul
2013-01-01
Achieving high image quality is an important aspect in an increasing number of wireless multimedia applications. These applications require resource efficient error correction hardware to detect and correct errors introduced by the communication channel. This paper presents an innovative flexible architecture for error correction using Low-Density Parity-Check (LDPC) codes. The proposed partially-parallel decoder architecture utilizes a novel code construction technique based on multi-level H...
There is no non-zero stable fixed point for dense networks in the homogeneous Kuramoto model
International Nuclear Information System (INIS)
Taylor, Richard
2012-01-01
This paper is concerned with the existence of multiple stable fixed point solutions of the homogeneous Kuramoto model. We develop a necessary condition for the existence of stable fixed points for the general network Kuramoto model. This condition is applied to show that for sufficiently dense n-node networks, with node degrees at least 0.9395(n−1), the homogeneous (equal frequencies) model has only one stable fixed point solution over the full space of phase angles in the range −π to π. This is the zero fixed point solution defined by all phase angle differences being zero. This result, together with existing research, proves a conjecture of Verwoerd and Mason (2007 Proc. of the American Control Conf. pp 4613–8) that for the complete network and the homogeneous model, the zero fixed point has a basin of attraction consisting of the entire space minus a set of measure zero. The necessary conditions are also tested to see how close to sufficiency they might be by applying them to a class of regular degree networks studied by Wiley et al (2006 Chaos 16 015103). (paper)
DNA Barcoding through Quaternary LDPC Codes.
Tapia, Elizabeth; Spetale, Flavio; Krsticevic, Flavia; Angelone, Laura; Bulacio, Pilar
2015-01-01
For many parallel applications of Next-Generation Sequencing (NGS) technologies short barcodes able to accurately multiplex a large number of samples are demanded. To address these competitive requirements, the use of error-correcting codes is advised. Current barcoding systems are mostly built from short random error-correcting codes, a feature that strongly limits their multiplexing accuracy and experimental scalability. To overcome these problems on sequencing systems impaired by mismatch errors, the alternative use of binary BCH and pseudo-quaternary Hamming codes has been proposed. However, these codes either fail to provide a fine-scale with regard to size of barcodes (BCH) or have intrinsic poor error correcting abilities (Hamming). Here, the design of barcodes from shortened binary BCH codes and quaternary Low Density Parity Check (LDPC) codes is introduced. Simulation results show that although accurate barcoding systems of high multiplexing capacity can be obtained with any of these codes, using quaternary LDPC codes may be particularly advantageous due to the lower rates of read losses and undetected sample misidentification errors. Even at mismatch error rates of 10(-2) per base, 24-nt LDPC barcodes can be used to multiplex roughly 2000 samples with a sample misidentification error rate in the order of 10(-9) at the expense of a rate of read losses just in the order of 10(-6).
DNA Barcoding through Quaternary LDPC Codes.
Directory of Open Access Journals (Sweden)
Elizabeth Tapia
Full Text Available For many parallel applications of Next-Generation Sequencing (NGS technologies short barcodes able to accurately multiplex a large number of samples are demanded. To address these competitive requirements, the use of error-correcting codes is advised. Current barcoding systems are mostly built from short random error-correcting codes, a feature that strongly limits their multiplexing accuracy and experimental scalability. To overcome these problems on sequencing systems impaired by mismatch errors, the alternative use of binary BCH and pseudo-quaternary Hamming codes has been proposed. However, these codes either fail to provide a fine-scale with regard to size of barcodes (BCH or have intrinsic poor error correcting abilities (Hamming. Here, the design of barcodes from shortened binary BCH codes and quaternary Low Density Parity Check (LDPC codes is introduced. Simulation results show that although accurate barcoding systems of high multiplexing capacity can be obtained with any of these codes, using quaternary LDPC codes may be particularly advantageous due to the lower rates of read losses and undetected sample misidentification errors. Even at mismatch error rates of 10(-2 per base, 24-nt LDPC barcodes can be used to multiplex roughly 2000 samples with a sample misidentification error rate in the order of 10(-9 at the expense of a rate of read losses just in the order of 10(-6.
Statistical mechanics analysis of LDPC coding in MIMO Gaussian channels
Energy Technology Data Exchange (ETDEWEB)
Alamino, Roberto C; Saad, David [Neural Computing Research Group, Aston University, Birmingham B4 7ET (United Kingdom)
2007-10-12
Using analytical methods of statistical mechanics, we analyse the typical behaviour of a multiple-input multiple-output (MIMO) Gaussian channel with binary inputs under low-density parity-check (LDPC) network coding and joint decoding. The saddle point equations for the replica symmetric solution are found in particular realizations of this channel, including a small and large number of transmitters and receivers. In particular, we examine the cases of a single transmitter, a single receiver and symmetric and asymmetric interference. Both dynamical and thermodynamical transitions from the ferromagnetic solution of perfect decoding to a non-ferromagnetic solution are identified for the cases considered, marking the practical and theoretical limits of the system under the current coding scheme. Numerical results are provided, showing the typical level of improvement/deterioration achieved with respect to the single transmitter/receiver result, for the various cases.
Statistical mechanics analysis of LDPC coding in MIMO Gaussian channels
International Nuclear Information System (INIS)
Alamino, Roberto C; Saad, David
2007-01-01
Using analytical methods of statistical mechanics, we analyse the typical behaviour of a multiple-input multiple-output (MIMO) Gaussian channel with binary inputs under low-density parity-check (LDPC) network coding and joint decoding. The saddle point equations for the replica symmetric solution are found in particular realizations of this channel, including a small and large number of transmitters and receivers. In particular, we examine the cases of a single transmitter, a single receiver and symmetric and asymmetric interference. Both dynamical and thermodynamical transitions from the ferromagnetic solution of perfect decoding to a non-ferromagnetic solution are identified for the cases considered, marking the practical and theoretical limits of the system under the current coding scheme. Numerical results are provided, showing the typical level of improvement/deterioration achieved with respect to the single transmitter/receiver result, for the various cases
Yokoyama, Yoshiaki; Kim, Minseok; Arai, Hiroyuki
At present, when using space-time processing techniques with multiple antennas for mobile radio communication, real-time weight adaptation is necessary. Due to the progress of integrated circuit technology, dedicated processor implementation with ASIC or FPGA can be employed to implement various wireless applications. This paper presents a resource and performance evaluation of the QRD-RLS systolic array processor based on fixed-point CORDIC algorithm with FPGA. In this paper, to save hardware resources, we propose the shared architecture of a complex CORDIC processor. The required precision of internal calculation, the circuit area for the number of antenna elements and wordlength, and the processing speed will be evaluated. The resource estimation provides a possible processor configuration with a current FPGA on the market. Computer simulations assuming a fading channel will show a fast convergence property with a finite number of training symbols. The proposed architecture has also been implemented and its operation was verified by beamforming evaluation through a radio propagation experiment.
Development of large-area high-temperature fixed-point blackbodies for photometry and radiometry
Khlevnoy, Boris; Grigoryeva, Irina; Anhalt, Klaus; Waehmer, Martin; Ivashin, Evgeniy; Otryaskin, Denis; Solodilov, Maxim; Sapritsky, Victor
2018-04-01
Large-area high-temperature fixed-point (HTFP) blackbodies with working temperatures of approximately 2748 K and 3021 K, based on an Re-C eutectic and a WC-C peritectic respectively, have been developed and investigated. The blackbodies have an emissivity of 0.9997, show high-quality phase-transition plateaus and have high repeatability of the melting temperatures, but demonstrate temperature differences (from 0.2 K to 0.6 K) compared with small-cell blackbodies of the same HTFP. We associate these temperature differences with the temperature drop effect, which may differ from cell to cell. The large radiating cavity diameter of 14 mm allows developed HTFP blackbodies to be used for photometric and radiometric applications in irradiance mode with uncertainties as small as 0.12% (k = 1) in the visible. A photometer and an irradiance-mode filter radiometer (visible range), previously calibrated at VNIIOFI, were used to measure illuminance and irradiance of the HTFP blackbodies equipped with a precise outer aperture. The values measured by the detectors agreed with those based on the blackbody calculation to within 0.2%. The large-area HTFP blackbodies will be used in a joint PTB-VNIIOFI experiment on measuring thermodynamic temperature.
Higgs and supersymmetric particle signals at the infrared fixed point of the top quark mass
International Nuclear Information System (INIS)
Carena, M.; Wagner, C.E.M.
1995-01-01
We study the properties of the Higgs and supersymmetric particle spectrum, associated with the infrared fixed point solution of the top quark mass in the Minimal Supersymmetric Standard Model. We concentrate on the possible detection of these particles, analysing the deviations from the Standard Model predictions for the leptonic and hadronic variables measured at LEP and for the b→sγ decay rate. We consider the low and moderate tan β regime, imposing the constraints derived from a proper radiative SU(2) L xU(1) Y symmetry breaking, and we study both the cases of universal and non-universal soft supersymmetry-breaking parameters at high energies. In the first case, for any given value of the top quark mass, the Higgs and supersymmetric particle spectrum is completely determined as a function of only two soft supersymmetry-breaking parameters, implying very definite experimental signatures. In the case of non-universal mass parameters at M GUT , instead, the strong correlations between the sparticle masses are relaxed, allowing a richer structure for the precision data variables. As a general feature, whenever a significant deviation from the Standard Model value of the precision data parameters is predicted, a light sparticle, which should be visible at LEP2, appears in the model. (orig.)
Stabilizing unstable fixed points of chaotic maps via minimum entropy control
Energy Technology Data Exchange (ETDEWEB)
Salarieh, Hassan [Center of Excellence in Design, Robotics and Automation, Department of Mechanical Engineering, Sharif University of Technology, P.O. Box 11365-9567, Tehran (Iran, Islamic Republic of)], E-mail: salarieh@mech.sharif.edu; Alasty, Aria [Center of Excellence in Design, Robotics and Automation, Department of Mechanical Engineering, Sharif University of Technology, P.O. Box 11365-9567, Tehran (Iran, Islamic Republic of)
2008-08-15
In this paper the problem of chaos control in nonlinear maps using minimization of entropy function is investigated. Invariant probability measure of a chaotic dynamics can be used to produce an entropy function in the sense of Shannon. In this paper it is shown that how the entropy control technique is utilized for chaos elimination. Using only the measured states of a chaotic map the probability measure of the system is numerically estimated and this estimated measure is used to obtain an estimation for the entropy of the chaotic map. The control variable of the chaotic system is determined in such a way that the entropy function descends until the chaotic trajectory of the map is replaced with a regular one. The proposed idea is applied for stabilizing the fixed points of the logistic and the Henon maps as some cases of study. Simulation results show the effectiveness of the method in chaos rejection when only the statistical information is available from the under-study systems.
CPN-1 models with a θ term and fixed point action
International Nuclear Information System (INIS)
Burkhalter, Rudolf; Imachi, Masahiro; Shinno, Yasuhiko; Yoneyama, Hiroshi
2001-01-01
The topological charge distribution P(Q) is calculated for lattice CP N-1 models. In order to suppress lattice cutoff effects, we employ a fixed point (FP) action. Through transformation of P(Q), we calculate the free energy F(θ) as a function of the θ parameter. For N=4, scaling behavior is observed for P(Q) and F(θ), as well as the correlation lengths ξ(Q). For N=2, however, scaling behavior is not observed, as expected. For comparison, we also make a calculation for the CP 3 model with a standard action. We furthermore pay special attention to the behavior of P(Q) in order to investigate the dynamics of instantons. For this purpose, we carefully consider the behavior of γ eff , which is an effective power of P(Q) (∼exp (-CQ γeff )), and reflects the local behavior of P(Q) as a function of Q. We study γ eff for two cases, the dilute gas approximation based on the Poisson distribution of instantons and the Debye-Hueckel approximation of instanton quarks. In both cases, we find behavior similar to that observed in numerical simulations. (author)
Directory of Open Access Journals (Sweden)
Ibrahim Karahan
2016-04-01
Full Text Available Let C be a nonempty closed convex subset of a real Hilbert space H. Let {T_{n}}:C›H be a sequence of nearly nonexpansive mappings such that F:=?_{i=1}^{?}F(T_{i}?Ø. Let V:C›H be a ?-Lipschitzian mapping and F:C›H be a L-Lipschitzian and ?-strongly monotone operator. This paper deals with a modified iterative projection method for approximating a solution of the hierarchical fixed point problem. It is shown that under certain approximate assumptions on the operators and parameters, the modified iterative sequence {x_{n}} converges strongly to x^{*}?F which is also the unique solution of the following variational inequality: ?0, ?x?F. As a special case, this projection method can be used to find the minimum norm solution of above variational inequality; namely, the unique solution x^{*} to the quadratic minimization problem: x^{*}=argmin_{x?F}?x?². The results here improve and extend some recent corresponding results of other authors.
Piñeiro Orioli, Asier; Boguslavski, Kirill; Berges, Jürgen
2015-07-01
We investigate universal behavior of isolated many-body systems far from equilibrium, which is relevant for a wide range of applications from ultracold quantum gases to high-energy particle physics. The universality is based on the existence of nonthermal fixed points, which represent nonequilibrium attractor solutions with self-similar scaling behavior. The corresponding dynamic universality classes turn out to be remarkably large, encompassing both relativistic as well as nonrelativistic quantum and classical systems. For the examples of nonrelativistic (Gross-Pitaevskii) and relativistic scalar field theory with quartic self-interactions, we demonstrate that infrared scaling exponents as well as scaling functions agree. We perform two independent nonperturbative calculations, first by using classical-statistical lattice simulation techniques and second by applying a vertex-resummed kinetic theory. The latter extends kinetic descriptions to the nonperturbative regime of overoccupied modes. Our results open new perspectives to learn from experiments with cold atoms aspects about the dynamics during the early stages of our universe.
Spatially coupled LDPC coding in cooperative wireless networks
Jayakody, D.N.K.; Skachek, V.; Chen, B.
2016-01-01
This paper proposes a novel technique of spatially coupled low-density parity-check (SC-LDPC) code-based soft forwarding relaying scheme for a two-way relay system. We introduce an array-based optimized SC-LDPC codes in relay channels. A more precise model is proposed to characterize the residual
DEFF Research Database (Denmark)
Beltran, H.; Perez, E.; Chen, Zhe
2009-01-01
This paper describes a Fixed Maximum Power Point analog control used in a step-down Pulse Width Modulated power converter. The DC/DC converter drives a DC motor used in small water pumping installations, without any electric storage device. The power supply is provided by PV panels working around....... The proposed Optimal Power Point fix voltage control system is analyzed in comparison to other complex controls....... their maximum power point, with a fixed operating voltage value. The control circuit implementation is not only simple and cheap, but also robust and reliable. System protections and adjustments are also proposed. Simulations and hardware are reported in the paper for a 150W water pumping application system...
Directory of Open Access Journals (Sweden)
Magnolia Tilca
2014-10-01
Full Text Available The aim of this paper is to study the existence of the solution for the overlapping generations model, using fixed point theorems in metric spaces endowed with a graph. The overlapping generations model has been introduced and developed by Maurice Allais (1947, Paul Samuelson (1958, Peter Diamond (1965 and so on. The present paper treats the case presented by Edmond (2008 in (Edmond, 2008 for a continuous time. The theorem of existence of the solution for the prices fixed point problem derived from the overlapping generations model gives an approximation of the solution via the graph theory. The tools employed in this study are based on applications of the Jachymski fixed point theorem on metric spaces endowed with a graph (Jachymski, 2008
Edler, F.; Huang, K.
2016-12-01
Fifteen miniature fixed-point cells made of three different ceramic crucible materials (Al2O3, ZrO2, and Al2O3(86 %)+ZrO2(14 %)) were filled with pure palladium and used to calibrate type B thermocouples (Pt30 %Rh/Pt6 %Rh). A critical point by using miniature fixed points with small amounts of fixed-point material is the analysis of the melting curves, which are characterized by significant slopes during the melting process compared to flat melting plateaus obtainable using conventional fixed-point cells. The method of the extrapolated starting point temperature using straight line approximation of the melting plateau was applied to analyze the melting curves. This method allowed an unambiguous determination of an electromotive force (emf) assignable as melting temperature. The strict consideration of two constraints resulted in a unique, repeatable and objective method to determine the emf at the melting temperature within an uncertainty of about 0.1 μ V. The lifetime and long-term stability of the miniature fixed points was investigated by performing more than 100 melt/freeze cycles for each crucible of the different ceramic materials. No failure of the crucibles occurred indicating an excellent mechanical stability of the investigated miniature cells. The consequent limitation of heating rates to values below {± }3.5 K min^{-1} above 1100° C and the carefully and completely filled crucibles (the liquid palladium occupies the whole volume of the crucible) are the reasons for successfully preventing the crucibles from breaking. The thermal stability of the melting temperature of palladium was excellent when using the crucibles made of Al2O3(86 %)+ZrO2(14 %) and ZrO2. Emf drifts over the total duration of the long-term investigation were below a temperature equivalent of about 0.1 K-0.2 K.
Coexistence of an unstirred chemostat model with B-D functional response by fixed point index theory
Directory of Open Access Journals (Sweden)
Xiao-zhou Feng
2016-11-01
Full Text Available Abstract This paper deals with an unstirred chemostat model with the Beddington-DeAngelis functional response. First, some prior estimates for positive solutions are proved by the maximum principle and the method of upper and lower solutions. Second, the calculation on the fixed point index of chemostat model is obtained by degree theory and the homotopy invariance theorem. Finally, some sufficient condition on the existence of positive steady-state solutions is established by fixed point index theory and bifurcation theory.
Ragay-Enot, Monalisa; Lee, Young Hee; Kim, Yong-Gyoo
2017-07-01
A mini multi-fixed-point cell (length 118 mm, diameter 33 mm) containing three materials (In-Zn eutectic (mass fraction 3.8% Zn), Sn and Pb) in a single crucible was designed and fabricated for the easy and economical fixed-point calibration of industrial platinum resistance thermometers (IPRTs) for use in industrial temperature measurements. The melting and freezing behaviors of the metals were investigated and the phase transition temperatures were determined using a commercial dry-block calibrator. Results showed that the melting plateaus are generally easy to realize and are reproducible, flatter and of longer duration. On the other hand, the freezing process is generally difficult, especially for Sn, due to the high supercooling required to initiate freezing. The observed melting temperatures at optimum set conditions were 143.11 °C (In-Zn), 231.70 °C (Sn) and 327.15 °C (Pb) with expanded uncertainties (k = 2) of 0.12 °C, 0.10 °C and 0.13 °C, respectively. This multi-fixed-point cell can be treated as a sole reference temperature-generating system. Based on the results, the realization of melting points of the mini multi-fixed-point cell can be recommended for the direct calibration of IPRTs in industrial applications without the need for a reference thermometer.
Co-C and Pd-C Eutectic Fixed Points for Radiation Thermometry and Thermocouple Thermometry
Wang, L.
2017-12-01
Two Co-C and Pd-C eutectic fixed point cells for both radiation thermometry and thermocouple thermometry were constructed at NMC. This paper describes details of the cell design, materials used, and fabrication of the cells. The melting curves of the Co-C and Pd-C cells were measured with a reference radiation thermometer realized in both a single-zone furnace and a three-zone furnace in order to investigate furnace effect. The transition temperatures in terms of ITS-90 were determined to be 1324.18 {°}C and 1491.61 {°}C with the corresponding combined standard uncertainty of 0.44 {°}C and 0.31 {°}C for Co-C and Pd-C, respectively, taking into account of the differences of two different types of furnaces used. The determined ITS-90 temperatures are also compared with that of INRIM cells obtained using the same reference radiation thermometer and the same furnaces with the same settings during a previous bilateral comparison exercise (Battuello et al. in Int J Thermophys 35:535-546, 2014). The agreements are within k=1 uncertainty for Co-C cell and k = 2 uncertainty for Pd-C cell. Shapes of the plateaus of NMC cells and INRIM cells are compared too and furnace effects are analyzed as well. The melting curves of the Co-C and Pd-C cells realized in the single-zone furnace are also measured by a Pt/Pd thermocouple, and the preliminary results are presented as well.
Castro, P.; Machin, G.; Bloembergen, P.; Lowe, D.; Whittam, A.
2014-07-01
This study forms part of the European Metrology Research Programme project implementing the New Kelvin to assign thermodynamic temperatures to a selected set of high-temperature fixed points (HTFPs), Cu, Co-C, Pt-C, and Re-C. A realistic thermal model of these HTFPs, developed in finite volume software ANSYS FLUENT, was constructed to quantify the uncertainty associated with the temperature drop across the back wall of the cell. In addition, the widely applied software package, STEEP3 was used to investigate the influence of cell emissivity. The temperature drop, , relates to the temperature difference due to the net loss of heat from the aperture of the cavity between the back wall of the cavity, viewed by the thermometer, defining the radiance temperature, and the solid-liquid interface of the alloy, defining the transition temperature of the HTFP. The actual value of can be used either as a correction (with associated uncertainty) to thermodynamic temperature evaluations of HTFPs, or as an uncertainty contribution to the overall estimated uncertainty. In addition, the effect of a range of furnace temperature profiles on the temperature drop was calculated and found to be negligible for Cu, Co-C, and Pt-C and small only for Re-C. The effective isothermal emissivity is calculated over the wavelength range from 450 nm to 850 nm for different assumed values of surface emissivity. Even when furnace temperature profiles are taken into account, the estimated emissivities change only slightly from the effective isothermal emissivity of the bare cell. These emissivity calculations are used to estimate the uncertainty in the temperature assignment due to the uncertainty in the emissivity of the blackbody.
Optimal design of a beam-based dynamic vibration absorber using fixed-points theory
Hua, Yingyu; Wong, Waion; Cheng, Li
2018-05-01
The addition of a dynamic vibration absorber (DVA) to a vibrating structure could provide an economic solution for vibration suppressions if the absorber is properly designed and located onto the structure. A common design of the DVA is a sprung mass because of its simple structure and low cost. However, the vibration suppression performance of this kind of DVA is limited by the ratio between the absorber mass and the mass of the primary structure. In this paper, a beam-based DVA (beam DVA) is proposed and optimized for minimizing the resonant vibration of a general structure. The vibration suppression performance of the proposed beam DVA depends on the mass ratio, the flexural rigidity and length of the beam. In comparison with the traditional sprung mass DVA, the proposed beam DVA shows more flexibility in vibration control design because it has more design parameters. With proper design, the beam DVA's vibration suppression capability can outperform that of the traditional DVA under the same mass constraint. The general approach is illustrated using a benchmark cantilever beam as an example. The receptance theory is introduced to model the compound system consisting of the host beam and the attached beam-based DVA. The model is validated through comparisons with the results from Abaqus as well as the Transfer Matrix method (TMM) method. Fixed-points theory is then employed to derive the analytical expressions for the optimum tuning ratio and damping ratio of the proposed beam absorber. A design guideline is then presented to choose the parameters of the beam absorber. Comparisons are finally presented between the beam absorber and the traditional DVA in terms of the vibration suppression effect. It is shown that the proposed beam absorber can outperform the traditional DVA by following this proposed guideline.
Influence of the Cavity Length on the Behavior of Hybrid Fixed-Point Cells Constructed at INRIM
Battuello, M.; Girard, F.; Florio, M.
2015-03-01
Hybrid cells with double carbon/carbon sheets are used at the Istituto Nazionale di Ricerca Metrologica (INRIM) for the realization of both pure metal fixed points and high-temperature metal-carbon eutectic points. Cells for the Cu and Co-C fixed points have been prepared to be used in the high-temperature fixed-point project of the Comité Consultatif de Thermométrie. The results of the evaluation processes were not completely satisfactory for the INRIM cells because of their low transition temperatures with respect to the best cells, and of a rather large melting range for the Co-C cell. A new design of the cells was devised, and considerable improvements were achieved with respect to the transition temperature, and the plateau shape and duration. As for the Cu point, the duration of the freezing plateaux increased by more than 50 % and the freezing temperature increased by 18 mK. As for the Co-C point, the melting temperature, expressed in terms of the point of inflection of the melting curve, increased by about 70 mK. The melting range of the plateaux, expressed as a difference was reduced from about 180 mK to about 130 mK, with melting times increased by about 50 %, as a consequence of an improvement of flatness and run-off of the plateaux.
Free-time and fixed end-point multi-target optimal control theory: Application to quantum computing
International Nuclear Information System (INIS)
Mishima, K.; Yamashita, K.
2011-01-01
Graphical abstract: The two-state Deutsch-Jozsa algortihm used to demonstrate the utility of free-time and fixed-end point multi-target optimal control theory. Research highlights: → Free-time and fixed-end point multi-target optimal control theory (FRFP-MTOCT) was constructed. → The features of our theory include optimization of the external time-dependent perturbations with high transition probabilities, that of the temporal duration, the monotonic convergence, and the ability to optimize multiple-laser pulses simultaneously. → The advantage of the theory and a comparison with conventional fixed-time and fixed end-point multi-target optimal control theory (FIFP-MTOCT) are presented by comparing data calculated using the present theory with those published previously [K. Mishima, K. Yamashita, Chem. Phys. 361 (2009) 106]. → The qubit system of our interest consists of two polar NaCl molecules coupled by dipole-dipole interaction. → The calculation examples show that our theory is useful for minor adjustment of the external fields. - Abstract: An extension of free-time and fixed end-point optimal control theory (FRFP-OCT) to monotonically convergent free-time and fixed end-point multi-target optimal control theory (FRFP-MTOCT) is presented. The features of our theory include optimization of the external time-dependent perturbations with high transition probabilities, that of the temporal duration, the monotonic convergence, and the ability to optimize multiple-laser pulses simultaneously. The advantage of the theory and a comparison with conventional fixed-time and fixed end-point multi-target optimal control theory (FIFP-MTOCT) are presented by comparing data calculated using the present theory with those published previously [K. Mishima, K. Yamashita, Chem. Phys. 361, (2009), 106]. The qubit system of our interest consists of two polar NaCl molecules coupled by dipole-dipole interaction. The calculation examples show that our theory is useful for minor
Itou, Etsuko
2013-08-01
We report the nonperturbative behavior of the twisted Polyakov loop (TPL) coupling constant for the SU(3) gauge theories defined by the ratio of Polyakov loop correlators in finite volume with twisted boundary condition. We reveal the vacuum structures and the phase structure for the lattice gauge theory with the twisted boundary condition. Carrying out the numerical simulations, we determine the nonperturbative running coupling constant in this renormalization scheme for the quenched QCD and N_f=12 SU(3) gauge theories. First, we study the quenched QCD theory using the plaquette gauge action. The TPL coupling constant has a fake fixed point in the confinement phase. We discuss this fake fixed point of the TPL scheme and obtain the nonperturbative running coupling constant in the deconfinement phase, where the magnitude of the Polyakov loop shows the nonzero values. We also investigate the system coupled to fundamental fermions. Since we use the naive staggered fermion with the twisted boundary condition in our simulation, only multiples of 12 are allowed for the number of flavors. According to the perturbative two-loop analysis, the N_f=12 SU(3) gauge theory might have a conformal fixed point in the infrared region. However, recent lattice studies show controversial results for the existence of the fixed point. We point out possible problems in previous work, and present our careful study. Finally, we find the infrared fixed point (IRFP) and discuss the robustness of the nontrivial IRFP of a many-flavor system under the change of the analysis method. Some preliminary results were reported in the proceedings [E. Bilgici et al., PoS(Lattice 2009), 063 (2009); Itou et al., PoS(Lattice 2010), 054 (2010)] and the letter paper [T. Aoyama et al., arXiv:1109.5806 [hep-lat
DEFF Research Database (Denmark)
Jensen, Eva B. Vedel; Kiêu, K
1994-01-01
Unbiased stereological estimators of d-dimensional volume in R(n) are derived, based on information from an isotropic random r-slice through a specified point. The content of the slice can be subsampled by means of a spatial grid. The estimators depend only on spatial distances. As a fundamental ...... lemma, an explicit formula for the probability that an isotropic random r-slice in R(n) through 0 hits a fixed point in R(n) is given....
Directory of Open Access Journals (Sweden)
Sunny Chauhan
2014-01-01
implicit relation, we prove a new coincidence and common fixed point theorem for a hybrid pair of occasionally coincidentally idempotent mappings in a metric space employing the common limit range property. Our main result improves and generalizes a host of previously known results. We also utilize suitable illustrative examples to substantiate the realized improvements in our results.
International Nuclear Information System (INIS)
Sharma, Sushil; Deshpande, Bhavana
2009-01-01
The purpose of this paper is to prove some common fixed point theorems for finite number of discontinuous, noncompatible mappings on noncomplete intuitionistic fuzzy metric spaces. Our results extend, generalize and intuitionistic fuzzify several known results in fuzzy metric spaces. We give an example and also give formulas for total number of commutativity conditions for finite number of mappings.
International Nuclear Information System (INIS)
Jesic, Sinisa N.; Babacev, Natasa A.
2008-01-01
The purpose of this paper is to prove some common fixed point theorems for a pair of R-weakly commuting mappings defined on intuitionistic fuzzy metric spaces [Park JH. Intuitionistic fuzzy metric spaces. Chaos, Solitons and Fractals 2004;22:1039-46] and L-fuzzy metric spaces [Saadati R, Razani A, Adibi H. A common fixed point theorem in L-fuzzy metric spaces. Chaos, Solitons and Fractals, doi:10.1016/j.chaos.2006.01.023], with nonlinear contractive condition, defined with function, first observed by Boyd and Wong [Boyd DW, Wong JSW. On nonlinear contractions. Proc Am Math Soc 1969;20:458-64]. Following Pant [Pant RP. Common fixed points of noncommuting mappings. J Math Anal Appl 1994;188:436-40] we define R-weak commutativity for a pair of mappings and then prove the main results. These results generalize some known results due to Saadati et al., and Jungck [Jungck G. Commuting maps and fixed points. Am Math Mon 1976;83:261-3]. Some examples and comments according to the preceding results are given
L-fuzzy/span> fixed points theorems for L-fuzzy/span> mappings via βℱL-admissible pair.
Rashid, Maliha; Azam, Akbar; Mehmood, Nayyar
2014-01-01
We define the concept of βℱL-admissible for a pair of L-fuzzy/span> mappings and establish the existence of common L-fuzzy/span> fixed point theorem. Our result generalizes some useful results in the literature. We provide an example to support our result.
M. Aamri; A. Bassou; S. Bennani; D. El Moutawakil
2007-01-01
The main purpose of this paper is to give some common fixed point theorems of mappings and set-valued mappings of a symmetric space with some applications to probabilistic spaces. In order to get these results, we define the concept of E-weak compatibility between set-valued and single-valued mappings of a symmetric space.
Some Common Fixed Point Theorems for F-Contraction Type Mappings in 0-Complete Partial Metric Spaces
Directory of Open Access Journals (Sweden)
Satish Shukla
2013-01-01
Full Text Available We prove some common fixed point theorems for F-contractions in 0-complete partial metric spaces. Our results extend, generalize, and unify several known results in the literature. Some examples are included which show that the generalization is proper.
Directory of Open Access Journals (Sweden)
Kazuhiko W. Nakamura
2018-06-01
Full Text Available In order to foster leaders and supporters of fixed-point observation for sustainable forest management, it is considered effective to focus on students who have demonstrated potential for fixed-point observations of forests in the universal education stage. This study aims to identify the characteristics of students who frequently conduct plant observations, which is the basis for the fixed-point observation of forests, including methods involving photography. We conducted a questionnaire survey, which consisted of 19 questions that provided insight into junior high school students’ experiences, opportunities, and interests related to plant observation. We compared students who have conducted plant observations with those who have not, using Fisher’s exact test and multiple comparisons using the Benjamini and Hochberg method. The ratio of students who frequently conducted plant observations was significantly higher among female students than male students, and their characteristics differed by gender. The significant characteristics of male students included farm work experience and niche hobbies such as camping and lighting a bonfire, as well as using digital single-lens reflex cameras for photography; female students had relatively niche hobbies such as enjoying science. Students who increased the frequency of plant observations after the lecture about fixed-point observations of forests had an inclination toward social studies and tended not to use a smartphone for photography.
Directory of Open Access Journals (Sweden)
Yazheng Dang
2013-01-01
Full Text Available Inspired by the Moudafi (2010, we propose an algorithm for solving the split common fixed-point problem for a wide class of asymptotically quasi-nonexpansive operators and the weak and strong convergence of the algorithm are shown under some suitable conditions in Hilbert spaces. The algorithm and its convergence results improve and develop previous results for split feasibility problems.
Directory of Open Access Journals (Sweden)
Urriza I
2010-01-01
Full Text Available Abstract This paper presents a word length selection method for the implementation of digital controllers in both fixed-point and floating-point hardware on FPGAs. This method uses the new types defined in the VHDL-2008 fixed-point and floating-point packages. These packages allow customizing the word length of fixed and floating point representations and shorten the design cycle simplifying the design of arithmetic operations. The method performs bit-true simulations in order to determine the word length to represent the constant coefficients and the internal signals of the digital controller while maintaining the control system specifications. A mixed-signal simulation tool is used to simulate the closed loop system as a whole in order to analyze the impact of the quantization effects and loop delays on the control system performance. The method is applied to implement a digital controller for a switching power converter. The digital circuit is implemented on an FPGA, and the simulations are experimentally verified.
Rate-Compatible Protograph LDPC Codes
Nguyen, Thuy V. (Inventor); Nosratinia, Aria (Inventor); Divsalar, Dariush (Inventor)
2014-01-01
Digital communication coding methods resulting in rate-compatible low density parity-check (LDPC) codes built from protographs. Described digital coding methods start with a desired code rate and a selection of the numbers of variable nodes and check nodes to be used in the protograph. Constraints are set to satisfy a linear minimum distance growth property for the protograph. All possible edges in the graph are searched for the minimum iterative decoding threshold and the protograph with the lowest iterative decoding threshold is selected. Protographs designed in this manner are used in decode and forward relay channels.
Pilotless Frame Synchronization Using LDPC Code Constraints
Jones, Christopher; Vissasenor, John
2009-01-01
A method of pilotless frame synchronization has been devised for low- density parity-check (LDPC) codes. In pilotless frame synchronization , there are no pilot symbols; instead, the offset is estimated by ex ploiting selected aspects of the structure of the code. The advantag e of pilotless frame synchronization is that the bandwidth of the sig nal is reduced by an amount associated with elimination of the pilot symbols. The disadvantage is an increase in the amount of receiver data processing needed for frame synchronization.
Structured LDPC Codes over Integer Residue Rings
Directory of Open Access Journals (Sweden)
Marc A. Armand
2008-07-01
Full Text Available This paper presents a new class of low-density parity-check (LDPC codes over Ã¢Â„Â¤2a represented by regular, structured Tanner graphs. These graphs are constructed using Latin squares defined over a multiplicative group of a Galois ring, rather than a finite field. Our approach yields codes for a wide range of code rates and more importantly, codes whose minimum pseudocodeword weights equal their minimum Hamming distances. Simulation studies show that these structured codes, when transmitted using matched signal sets over an additive-white-Gaussian-noise channel, can outperform their random counterparts of similar length and rate.
Structured LDPC Codes over Integer Residue Rings
Directory of Open Access Journals (Sweden)
Mo Elisa
2008-01-01
Full Text Available Abstract This paper presents a new class of low-density parity-check (LDPC codes over represented by regular, structured Tanner graphs. These graphs are constructed using Latin squares defined over a multiplicative group of a Galois ring, rather than a finite field. Our approach yields codes for a wide range of code rates and more importantly, codes whose minimum pseudocodeword weights equal their minimum Hamming distances. Simulation studies show that these structured codes, when transmitted using matched signal sets over an additive-white-Gaussian-noise channel, can outperform their random counterparts of similar length and rate.
On the performance of 1-level LDPC lattices
Sadeghi, Mohammad-Reza; Sakzad, Amin
2013-01-01
The low-density parity-check (LDPC) lattices perform very well in high dimensions under generalized min-sum iterative decoding algorithm. In this work we focus on 1-level LDPC lattices. We show that these lattices are the same as lattices constructed based on Construction A and low-density lattice-code (LDLC) lattices. In spite of having slightly lower coding gain, 1-level regular LDPC lattices have remarkable performances. The lower complexity nature of the decoding algorithm for these type ...
On Analyzing LDPC Codes over Multiantenna MC-CDMA System
Directory of Open Access Journals (Sweden)
S. Suresh Kumar
2014-01-01
Full Text Available Multiantenna multicarrier code-division multiple access (MC-CDMA technique has been attracting much attention for designing future broadband wireless systems. In addition, low-density parity-check (LDPC code, a promising near-optimal error correction code, is also being widely considered in next generation communication systems. In this paper, we propose a simple method to construct a regular quasicyclic low-density parity-check (QC-LDPC code to improve the transmission performance over the precoded MC-CDMA system with limited feedback. Simulation results show that the coding gain of the proposed QC-LDPC codes is larger than that of the Reed-Solomon codes, and the performance of the multiantenna MC-CDMA system can be greatly improved by these QC-LDPC codes when the data rate is high.
LDPC coded OFDM over the atmospheric turbulence channel.
Djordjevic, Ivan B; Vasic, Bane; Neifeld, Mark A
2007-05-14
Low-density parity-check (LDPC) coded optical orthogonal frequency division multiplexing (OFDM) is shown to significantly outperform LDPC coded on-off keying (OOK) over the atmospheric turbulence channel in terms of both coding gain and spectral efficiency. In the regime of strong turbulence at a bit-error rate of 10(-5), the coding gain improvement of the LDPC coded single-side band unclipped-OFDM system with 64 sub-carriers is larger than the coding gain of the LDPC coded OOK system by 20.2 dB for quadrature-phase-shift keying (QPSK) and by 23.4 dB for binary-phase-shift keying (BPSK).
Multilevel LDPC Codes Design for Multimedia Communication CDMA System
Directory of Open Access Journals (Sweden)
Hou Jia
2004-01-01
Full Text Available We design multilevel coding (MLC with a semi-bit interleaved coded modulation (BICM scheme based on low density parity check (LDPC codes. Different from the traditional designs, we joined the MLC and BICM together by using the Gray mapping, which is suitable to transmit the data over several equivalent channels with different code rates. To perform well at signal-to-noise ratio (SNR to be very close to the capacity of the additive white Gaussian noise (AWGN channel, random regular LDPC code and a simple semialgebra LDPC (SA-LDPC code are discussed in MLC with parallel independent decoding (PID. The numerical results demonstrate that the proposed scheme could achieve both power and bandwidth efficiency.
Merzlikin, Boris S.; Shapiro, Ilya L.; Wipf, Andreas; Zanusso, Omar
2017-12-01
Using covariant methods, we construct and explore the Wetterich equation for a nonminimal coupling F (ϕ )R of a quantized scalar field to the Ricci scalar of a prescribed curved space. This includes the often considered nonminimal coupling ξ ϕ2R as a special case. We consider the truncations without and with scale- and field-dependent wave-function renormalization in dimensions between four and two. Thereby the main emphasis is on analytic and numerical solutions of the fixed point equations and the behavior in the vicinity of the corresponding fixed points. We determine the nonminimal coupling in the symmetric and spontaneously broken phases with vanishing and nonvanishing average fields, respectively. Using functional perturbative renormalization group methods, we discuss the leading universal contributions to the RG flow below the upper critical dimension d =4 .
Directory of Open Access Journals (Sweden)
Lu-Chuan Ceng
2014-01-01
Full Text Available We introduce and analyze one iterative algorithm by hybrid shrinking projection method for finding a solution of the minimization problem for a convex and continuously Fréchet differentiable functional, with constraints of several problems: finitely many generalized mixed equilibrium problems, finitely many variational inequalities, the general system of variational inequalities and the fixed point problem of an asymptotically strict pseudocontractive mapping in the intermediate sense in a real Hilbert space. We prove strong convergence theorem for the iterative algorithm under suitable conditions. On the other hand, we also propose another iterative algorithm by hybrid shrinking projection method for finding a fixed point of infinitely many nonexpansive mappings with the same constraints, and derive its strong convergence under mild assumptions.
Weight Distribution for Non-binary Cluster LDPC Code Ensemble
Nozaki, Takayuki; Maehara, Masaki; Kasai, Kenta; Sakaniwa, Kohichi
In this paper, we derive the average weight distributions for the irregular non-binary cluster low-density parity-check (LDPC) code ensembles. Moreover, we give the exponential growth rate of the average weight distribution in the limit of large code length. We show that there exist $(2,d_c)$-regular non-binary cluster LDPC code ensembles whose normalized typical minimum distances are strictly positive.
Fast QC-LDPC code for free space optical communication
Wang, Jin; Zhang, Qi; Udeh, Chinonso Paschal; Wu, Rangzhong
2017-02-01
Free Space Optical (FSO) Communication systems use the atmosphere as a propagation medium. Hence the atmospheric turbulence effects lead to multiplicative noise related with signal intensity. In order to suppress the signal fading induced by multiplicative noise, we propose a fast Quasi-Cyclic (QC) Low-Density Parity-Check (LDPC) code for FSO Communication systems. As a linear block code based on sparse matrix, the performances of QC-LDPC is extremely near to the Shannon limit. Currently, the studies on LDPC code in FSO Communications is mainly focused on Gauss-channel and Rayleigh-channel, respectively. In this study, the LDPC code design over atmospheric turbulence channel which is nether Gauss-channel nor Rayleigh-channel is closer to the practical situation. Based on the characteristics of atmospheric channel, which is modeled as logarithmic-normal distribution and K-distribution, we designed a special QC-LDPC code, and deduced the log-likelihood ratio (LLR). An irregular QC-LDPC code for fast coding, of which the rates are variable, is proposed in this paper. The proposed code achieves excellent performance of LDPC codes and can present the characteristics of high efficiency in low rate, stable in high rate and less number of iteration. The result of belief propagation (BP) decoding shows that the bit error rate (BER) obviously reduced as the Signal-to-Noise Ratio (SNR) increased. Therefore, the LDPC channel coding technology can effectively improve the performance of FSO. At the same time, the BER, after decoding reduces with the increase of SNR arbitrarily, and not having error limitation platform phenomenon with error rate slowing down.
Directory of Open Access Journals (Sweden)
Wei-Qi Deng
2013-01-01
Full Text Available Based on an original idea, namely, a specific way of choosing the indexes of the involved mappings, we propose a new hybrid shrinking iteration scheme for approximating some common fixed points of a countable family of asymptotically strictly quasi-ϕ-pseudocontractions and obtain a strong convergence theorem in the framework of Banach space. Our result extends other authors, related results existing in the current literature. As application, an iterative solution to a system of equilibrium problems is provided.
Fröb, Markus B.
2018-02-01
We study a proposal for gauge-invariant correlation functions in perturbative quantum gravity, which are obtained by fixing the geodesic distance between points in the fluctuating geometry. These correlation functions are non-local and strongly divergent, and we show how to renormalise them by performing a ‘wave function renormalisation’ of the geodesic embedding coordinates. The result is finite and gauge-independent, but displays unusual features such as double logarithms at one-loop order.
Directory of Open Access Journals (Sweden)
Bessem Samet
2011-09-01
Full Text Available Recently, Azam, Arshad and Beg [ Banach contraction principle on cone rectangular metric spaces, Appl. Anal. Discrete Math. 2009] introduced the notion of cone rectangular metric spaces by replacing the triangular inequality of a cone metric space by a rectangular inequality. In this paper, we introduce the notion of c-chainable cone rectangular metric space and we establish a fixed point theorem for uniformly locally contractive mappings in such spaces. An example is given to illustrate our obtained result.
Small copper fixed-point cells of the hybrid type to be used in place of normal larger cells
Battuello, M.; Girard, F.; Florio, M.
2012-10-01
Two small cells for the realization of the fixed point of copper were constructed and investigated at INRIM. They are of the same hybrid design generally adopted for the eutectic high-temperature fixed-point cells, namely a structure with a sacrificial graphite sleeve and a layer of flexible carbon-carbon composite sheet (C/C sheet). Because of the largely different design with respect to the cells normally adopted for the construction of pure metal fixed points, they were compared and characterized with respect to the normal cells used at INRIM for the ITS-90 realization. Two different furnaces were used to compare hybrid and normal cells. One of the hybrid cells was also used in different configurations, i.e. without the C/C sheet and with two layers of sheet. The cells were compared with different operative conditions, i.e. temperature settings of the furnaces for inducing the freeze, and repeatability and reproducibility were investigated. Freezing temperature and shape of the plateaux obtained under the different conditions were analysed. As expected the duration of the plateaux obtained with the hybrid cells is considerably shorter than with the normal cell, but this does not affect the results in terms of freezing temperature. Measurements with the modified cell showed that the use of a double C/C sheet may improve both repeatability and reproducibility of the plateaux.
Small copper fixed-point cells of the hybrid type to be used in place of normal larger cells
International Nuclear Information System (INIS)
Battuello, M; Girard, F; Florio, M
2012-01-01
Two small cells for the realization of the fixed point of copper were constructed and investigated at INRIM. They are of the same hybrid design generally adopted for the eutectic high-temperature fixed-point cells, namely a structure with a sacrificial graphite sleeve and a layer of flexible carbon–carbon composite sheet (C/C sheet). Because of the largely different design with respect to the cells normally adopted for the construction of pure metal fixed points, they were compared and characterized with respect to the normal cells used at INRIM for the ITS-90 realization. Two different furnaces were used to compare hybrid and normal cells. One of the hybrid cells was also used in different configurations, i.e. without the C/C sheet and with two layers of sheet. The cells were compared with different operative conditions, i.e. temperature settings of the furnaces for inducing the freeze, and repeatability and reproducibility were investigated. Freezing temperature and shape of the plateaux obtained under the different conditions were analysed. As expected the duration of the plateaux obtained with the hybrid cells is considerably shorter than with the normal cell, but this does not affect the results in terms of freezing temperature. Measurements with the modified cell showed that the use of a double C/C sheet may improve both repeatability and reproducibility of the plateaux. (paper)
Directory of Open Access Journals (Sweden)
Svetoslav Ganchev Nikolov
2015-07-01
Full Text Available The study of the dynamic behavior of a rigid body with one fixed point (gyroscope has a long history. A number of famous mathematicians and mechanical engineers have devoted enormous time and effort to clarify the role of dynamic effects on its movement (behavior – stable, periodic, quasi-periodic or chaotic. The main objectives of this review are: 1 to outline the characteristic features of the theory of dynamical systems and 2 to reveal the specific properties of the motion of a rigid body with one fixed point (gyroscope.This article consists of six sections. The first section addresses the main concepts of the theory of dynamical systems. Section two presents the main theoretical results (obtained so far concerning the dynamic behavior of a solid with one fixed point (gyroscope. Section three examines the problem of gyroscopic stabilization. Section four deals with the non-linear (chaotic dynamics of the gyroscope. Section five is a brief analysis of the gyroscope applications in engineering. The final section provides conclusions and generalizations on why the theory of dynamical systems should be used in the study of the movement of gyroscopic systems.
Energy Technology Data Exchange (ETDEWEB)
Laurie, M.; Vlahovic, L.; Rondinella, V.V. [European Commission, Joint Research Centre, Institute for Transuranium Elements, P.O. Box 2340, D-76125 Karlsruhe, (Germany); Sadli, M.; Failleau, G. [Laboratoire Commun de Metrologie, LNE-Cnam, Saint-Denis, (France); Fuetterer, M.; Lapetite, J.M. [European Commission, Joint Research Centre, Institute for Energy and Transport, P.O. Box 2, NL-1755 ZG Petten, (Netherlands); Fourrez, S. [Thermocoax, 8 rue du pre neuf, F-61100 St Georges des Groseillers, (France)
2015-07-01
Temperature measurements in the nuclear field require a high degree of reliability and accuracy. Despite their sheathed form, thermocouples subjected to nuclear radiations undergo changes due to radiation damage and transmutation that lead to significant EMF drift during long-term fuel irradiation experiment. For the purpose of a High Temperature Reactor fuel irradiation to take place in the High Flux Reactor Petten, a dedicated fixed-point cell was jointly developed by LNE-Cnam and JRC-IET. The developed cell to be housed in the irradiation rig was tailor made to quantify the thermocouple drift during the irradiation (about two year duration) and withstand high temperature (in the range 950 deg. C - 1100 deg. C) in the presence of contaminated helium in a graphite environment. Considering the different levels of temperature achieved in the irradiation facility and the large palette of thermocouple types aimed at surveying the HTR fuel pebble during the qualification test both copper (1084.62 deg. C) and gold (1064.18 deg. C) fixed-point materials were considered. The aim of this paper is to first describe the fixed-point mini-cell designed to be embedded in the reactor rig and to discuss the preliminary results achieved during some out of pile tests as much as some robustness tests representative of the reactor scram scenarios. (authors)
FPGA implementation of low complexity LDPC iterative decoder
Verma, Shivani; Sharma, Sanjay
2016-07-01
Low-density parity-check (LDPC) codes, proposed by Gallager, emerged as a class of codes which can yield very good performance on the additive white Gaussian noise channel as well as on the binary symmetric channel. LDPC codes have gained lots of importance due to their capacity achieving property and excellent performance in the noisy channel. Belief propagation (BP) algorithm and its approximations, most notably min-sum, are popular iterative decoding algorithms used for LDPC and turbo codes. The trade-off between the hardware complexity and the decoding throughput is a critical factor in the implementation of the practical decoder. This article presents introduction to LDPC codes and its various decoding algorithms followed by realisation of LDPC decoder by using simplified message passing algorithm and partially parallel decoder architecture. Simplified message passing algorithm has been proposed for trade-off between low decoding complexity and decoder performance. It greatly reduces the routing and check node complexity of the decoder. Partially parallel decoder architecture possesses high speed and reduced complexity. The improved design of the decoder possesses a maximum symbol throughput of 92.95 Mbps and a maximum of 18 decoding iterations. The article presents implementation of 9216 bits, rate-1/2, (3, 6) LDPC decoder on Xilinx XC3D3400A device from Spartan-3A DSP family.
High-throughput GPU-based LDPC decoding
Chang, Yang-Lang; Chang, Cheng-Chun; Huang, Min-Yu; Huang, Bormin
2010-08-01
Low-density parity-check (LDPC) code is a linear block code known to approach the Shannon limit via the iterative sum-product algorithm. LDPC codes have been adopted in most current communication systems such as DVB-S2, WiMAX, WI-FI and 10GBASE-T. LDPC for the needs of reliable and flexible communication links for a wide variety of communication standards and configurations have inspired the demand for high-performance and flexibility computing. Accordingly, finding a fast and reconfigurable developing platform for designing the high-throughput LDPC decoder has become important especially for rapidly changing communication standards and configurations. In this paper, a new graphic-processing-unit (GPU) LDPC decoding platform with the asynchronous data transfer is proposed to realize this practical implementation. Experimental results showed that the proposed GPU-based decoder achieved 271x speedup compared to its CPU-based counterpart. It can serve as a high-throughput LDPC decoder.
The EuroSITES network: Integrating and enhancing fixed-point open ocean observatories around Europe
Lampitt, Richard S.; Larkin, Kate E.; EuroSITES Consortium
2010-05-01
EuroSITES is a 3 year (2008-2011) EU collaborative project (3.5MEuro) with the objective to integrate and enhance the nine existing open ocean fixed point observatories around Europe (www.eurosites.info). These observatories are primarily composed of full depth moorings and make multidisciplinary in situ observations within the water column as the European contribution to the global array OceanSITES (www.oceansites.org). In the first 18 months, all 9 observatories have been active and integration has been significant through the maintenance and enhancement of observatory hardware. Highlights include the enhancement of observatories with sensors to measure O2, pCO2, chlorophyll, and nitrate in near real-time from the upper 1000 m. In addition, some seafloor missions are also actively supported. These include seafloor platforms currently deployed in the Mediterranean, one for tsunami detection and one to monitor fluid flow related to seismic activity and slope stability. Upcoming seafloor science missions in 2010 include monitoring benthic biological communities and associated biogeochemistry as indicators of climate change in both the Northeast Atlantic and Mediterranean. EuroSITES also promotes the development of innovative sensors and samplers in order to progress capability to measure climate-relevant properties of the ocean. These include further developing current technologies for autonomous long-term monitoring of oxygen consumption in the mesopelagic, pH and mesozooplankton abundance. Many of these science missions are directly related to complementary activities in other European projects such as EPOCA, HYPOX and ESONET. In 2010 a direct collaboration including in situ field work will take place between ESONET and EuroSITES. The demonstration mission MODOO (funded by ESONET) will be implemented in 2010 at the EuroSITES PAP observatory. Field work will include deployment of a seafloor lander system with various sensors which will send data to shore in real
Dermíšek, Radovan; McGinnis, Navin
2018-03-01
We use the IR fixed point predictions for gauge couplings and the top Yukawa coupling in the minimal supersymmetric model (MSSM) extended with vectorlike families to infer the scale of vectorlike matter and superpartners. We quote results for several extensions of the MSSM and present results in detail for the MSSM extended with one complete vectorlike family. We find that for a unified gauge coupling αG>0.3 vectorlike matter or superpartners are expected within 1.7 TeV (2.5 TeV) based on all three gauge couplings being simultaneously within 1.5% (5%) from observed values. This range extends to about 4 TeV for αG>0.2 . We also find that in the scenario with two additional large Yukawa couplings of vectorlike quarks the IR fixed point value of the top Yukawa coupling independently points to a multi-TeV range for vectorlike matter and superpartners. Assuming a universal value for all large Yukawa couplings at the grand unified theory scale, the measured top quark mass can be obtained from the IR fixed point for tan β ≃4 . The range expands to any tan β >3 for significant departures from the universality assumption. Considering that the Higgs boson mass also points to a multi-TeV range for superpartners in the MSSM, adding a complete vectorlike family at the same scale provides a compelling scenario where the values of gauge couplings and the top quark mass are understood as a consequence of the particle content of the model.
Directory of Open Access Journals (Sweden)
B. Kuyper
2018-04-01
Full Text Available Bromoform mixing ratios in marine air were measured at Cape Point Global Atmospheric Watch Station, South Africa. This represents the first such bromoform data set recorded at this location. Manual daily measurements were made during a month-long field campaign (austral spring 2011 using a gas chromatograph-electron capture detector (GC-ECD with a custom-built front end thermal desorption trap. The measured concentrations ranged between 4.4 and 64.6 (± 22.2 % ppt with a mean of 24.8 ± 14.8 ppt. The highest mixing ratios recorded here occurred at, or shortly after, low tide. The diurnal cycle exhibited a morning and evening maximum with lower concentrations throughout the rest of the day. Initial analysis of the data presented indicates that the local kelp beds were the dominant source of the bromoform reported. A concentration-weighted trajectory analysis of the bromoform measurements suggests that two offshore source areas may exist. These source areas appear to be centred on the Agulhas retroflection and extend from St Helena Bay to the southwest.
Kuyper, Brett; Palmer, Carl J.; Labuschagne, Casper; Reason, Chris J. C.
2018-04-01
Bromoform mixing ratios in marine air were measured at Cape Point Global Atmospheric Watch Station, South Africa. This represents the first such bromoform data set recorded at this location. Manual daily measurements were made during a month-long field campaign (austral spring 2011) using a gas chromatograph-electron capture detector (GC-ECD) with a custom-built front end thermal desorption trap. The measured concentrations ranged between 4.4 and 64.6 (± 22.2 %) ppt with a mean of 24.8 ± 14.8 ppt. The highest mixing ratios recorded here occurred at, or shortly after, low tide. The diurnal cycle exhibited a morning and evening maximum with lower concentrations throughout the rest of the day. Initial analysis of the data presented indicates that the local kelp beds were the dominant source of the bromoform reported. A concentration-weighted trajectory analysis of the bromoform measurements suggests that two offshore source areas may exist. These source areas appear to be centred on the Agulhas retroflection and extend from St Helena Bay to the southwest.
On large N fixed points of a U(N) symmetric (phisup(*)xphi)3sub(D=3) model coupled to fermions
International Nuclear Information System (INIS)
Nissimov, E.R.; Pacheva, S.J.
1984-01-01
The three-dimensional U(N) symmetric eta(phisup(*) x phi) 3 model coupled to N component fermions is considered within the 1/N expansion. In contrast to the purely bosonic case, here we find in the large N limit only a (nonperturbative) ultraviolet fixed point at eta=etasup(*) approx.= 179, whereas infrared fixed points are absent. (orig.)
Bilayer expurgated LDPC codes with uncoded relaying
Directory of Open Access Journals (Sweden)
Md. Noor-A-Rahim
2017-08-01
Full Text Available Bilayer low-density parity-check (LDPC codes are an effective coding technique for decode-and-forward relaying, where the relay forwards extra parity bits to help the destination to decode the source bits correctly. In the existing bilayer coding scheme, these parity bits are protected by an error correcting code and assumed reliably available at the receiver. We propose an uncoded relaying scheme, where the extra parity bits are forwarded to the destination without any protection. Through density evolution analysis and simulation results, we show that our proposed scheme achieves better performance in terms of bit erasure probability than the existing relaying scheme. In addition, our proposed scheme results in lower complexity at the relay.
Experimental demonstration of nonbinary LDPC convolutional codes for DP-64QAM/256QAM
Koike-Akino, T.; Sugihara, K.; Millar, D.S.; Pajovic, M.; Matsumoto, W.; Alvarado, A.; Maher, R.; Lavery, D.; Paskov, M.; Kojima, K.; Parsons, K.; Thomsen, B.C.; Savory, S.J.; Bayvel, P.
2016-01-01
We show the great potential of nonbinary LDPC convolutional codes (NB-LDPC-CC) with low-latency windowed decoding. It is experimentally demonstrated that NB-LDPC-CC can offer a performance improvement of up to 5 dB compared with binary coding.
Investigations on Two Co-C Fixed-Point Cells Prepared at INRIM and LNE-Cnam
Battuello, M.; Florio, M.; Sadli, M.; Bourson, F.
2011-08-01
INRIM and LNE-Cnam agreed to undertake a collaboration aimed to verify, through the use of metal-carbon eutectic fixed-point cells, methods and facilities used for defining the transition temperature of eutectic fixed points and manufacturing procedures of cells. To this purpose and as a first step of the cooperation, a Co-C cell manufactured at LNE-Cnam was measured at INRIM and compared with a local cell. The two cells were of different designs: the INRIM cell of 10 cm3 inner volume and the LNE-Cnam one of 3.9 cm3. The external dimensions of the two cells were noticeably different, namely, 40 mm in length and 24 mm in diameter for the LNE-Cnam cell 3Co4 and 110 mm in length and 42 mm in diameter for the INRIM cell. Consequently, the investigation of the effect of temperature distributions in the heating furnace was undertaken by implementing the cells inside single-zone and three-zone furnaces. The transition temperature of the cell was determined at the two institutes making use of different techniques: at INRIM radiation scales at 900 nm, 950 nm, and 1.6 μm were realized from In to Cu and then used to define T 90(Co-C) by extrapolation. At LNE-Cnam, a radiance comparator based on a grating monochromator was used for the extrapolation from the Cu fixed point. This paper presents a comparative description of the cells and the manufacturing methods and the results in terms of equivalence between the two cells and melting temperatures determined at INRIM and LNE-Cnam.
International Nuclear Information System (INIS)
Znojil, M.
1986-01-01
The radial Schroedinger equation and its bound-state solutions for the interaction V(r)=Vsub(coulomb)+Vsub(Pade), where Vsub(Pade)(r)=(b+cr)/(1+drsup(2)) are considered. In order to construct exactly the Feshbach effective Hamiltonian Hsup(eff), the fixed-point-substraction technique is employed and its simplification is proposed. The first two terms in the resulting asymptotic expansions of PSIsub(n) and Hsup(eff) are calculated and interpreted as a new type of perturbation theory
Zhao, Jing; Zong, Haili
2018-01-01
In this paper, we propose parallel and cyclic iterative algorithms for solving the multiple-set split equality common fixed-point problem of firmly quasi-nonexpansive operators. We also combine the process of cyclic and parallel iterative methods and propose two mixed iterative algorithms. Our several algorithms do not need any prior information about the operator norms. Under mild assumptions, we prove weak convergence of the proposed iterative sequences in Hilbert spaces. As applications, we obtain several iterative algorithms to solve the multiple-set split equality problem.
International Nuclear Information System (INIS)
Kainz, K; Prah, D; Ahunbay, E; Li, X
2014-01-01
Purpose: A novel modulated arc therapy technique, mARC, enables superposition of step-and-shoot IMRT segments upon a subset of the optimization points (OPs) of a continuous-arc delivery. We compare two approaches to mARC planning: one with the number of OPs fixed throughout optimization, and another where the planning system determines the number of OPs in the final plan, subject to an upper limit defined at the outset. Methods: Fixed-OP mARC planning was performed for representative cases using Panther v. 5.01 (Prowess, Inc.), while variable-OP mARC planning used Monaco v. 5.00 (Elekta, Inc.). All Monaco planning used an upper limit of 91 OPs; those OPs with minimal MU were removed during optimization. Plans were delivered, and delivery times recorded, on a Siemens Artiste accelerator using a flat 6MV beam with 300 MU/min rate. Dose distributions measured using ArcCheck (Sun Nuclear Corporation, Inc.) were compared with the plan calculation; the two were deemed consistent if they agreed to within 3.5% in absolute dose and 3.5 mm in distance-to-agreement among > 95% of the diodes within the direct beam. Results: Example cases included a prostate and a head-and-neck planned with a single arc and fraction doses of 1.8 and 2.0 Gy, respectively. Aside from slightly more uniform target dose for the variable-OP plans, the DVHs for the two techniques were similar. For the fixed-OP technique, the number of OPs was 38 and 39, and the delivery time was 228 and 259 seconds, respectively, for the prostate and head-and-neck cases. For the final variable-OP plans, there were 91 and 85 OPs, and the delivery time was 296 and 440 seconds, correspondingly longer than for fixed-OP. Conclusion: For mARC, both the fixed-OP and variable-OP approaches produced comparable-quality plans whose delivery was successfully verified. To keep delivery time per fraction short, a fixed-OP planning approach is preferred
Energy Technology Data Exchange (ETDEWEB)
Kainz, K; Prah, D; Ahunbay, E; Li, X [Medical College of Wisconsin, Milwaukee, WI (United States)
2014-06-01
Purpose: A novel modulated arc therapy technique, mARC, enables superposition of step-and-shoot IMRT segments upon a subset of the optimization points (OPs) of a continuous-arc delivery. We compare two approaches to mARC planning: one with the number of OPs fixed throughout optimization, and another where the planning system determines the number of OPs in the final plan, subject to an upper limit defined at the outset. Methods: Fixed-OP mARC planning was performed for representative cases using Panther v. 5.01 (Prowess, Inc.), while variable-OP mARC planning used Monaco v. 5.00 (Elekta, Inc.). All Monaco planning used an upper limit of 91 OPs; those OPs with minimal MU were removed during optimization. Plans were delivered, and delivery times recorded, on a Siemens Artiste accelerator using a flat 6MV beam with 300 MU/min rate. Dose distributions measured using ArcCheck (Sun Nuclear Corporation, Inc.) were compared with the plan calculation; the two were deemed consistent if they agreed to within 3.5% in absolute dose and 3.5 mm in distance-to-agreement among > 95% of the diodes within the direct beam. Results: Example cases included a prostate and a head-and-neck planned with a single arc and fraction doses of 1.8 and 2.0 Gy, respectively. Aside from slightly more uniform target dose for the variable-OP plans, the DVHs for the two techniques were similar. For the fixed-OP technique, the number of OPs was 38 and 39, and the delivery time was 228 and 259 seconds, respectively, for the prostate and head-and-neck cases. For the final variable-OP plans, there were 91 and 85 OPs, and the delivery time was 296 and 440 seconds, correspondingly longer than for fixed-OP. Conclusion: For mARC, both the fixed-OP and variable-OP approaches produced comparable-quality plans whose delivery was successfully verified. To keep delivery time per fraction short, a fixed-OP planning approach is preferred.
Directory of Open Access Journals (Sweden)
Eleonora Pantano
2013-05-01
Full Text Available The current advances in information and communications technologies developed new tools for retailers to innovate. In fact, the increasing computing capacity and the advancements in networking systems provided a new ubiquitous scenario that can be adapted for retailing in order to develop innovative shopping environments. The aim of this paper is to deeply understand the emergence of the ubiquitous retailing phenomenon and the possible shift from the physical point of sale to a ubiquitous one, by analysing this radical innovation and the main consequences for frms and market.
Non-Binary Protograph-Based LDPC Codes: Analysis,Enumerators and Designs
Sun, Yizeng
2013-01-01
Non-binary LDPC codes can outperform binary LDPC codes using sum-product algorithm with higher computation complexity. Non-binary LDPC codes based on protographs have the advantage of simple hardware architecture. In the first part of this thesis, we will use EXIT chart analysis to compute the thresholds of different protographs over GF(q). Based on threshold computation, some non-binary protograph-based LDPC codes are designed and their frame error rates are compared with binary LDPC codes. ...
Energy Technology Data Exchange (ETDEWEB)
Ancsin, J. [National Research Council of Canada, Ottawa, ON (Canada). Inst. for National Measurement Standards; Mendez-Lango, E. [Centro Nacional de Metrologia (CENAM), Div. Termometria, Queretaro (Mexico)
1999-07-01
The reproducibility of some thermometric fixed points and the accuracy of four platinum resistance thermometers (PRTs) were studied. It was found that the fixed points of aluminium (Al), zinc (Zn), tin (Sn), indium (In) and gallium (Ga) were realized reproducibly within {+-}0.17 mK; {+-}0.11 mK; {+-}0.10 mK; {+-}0.13 mK and {+-}0.12 mK, respectively. Because the actual impurities and their concentration in our samples (of 99.9999 % or 99.999 99 % purity) are unknown, the systematic uncertainly due to impurities cannot be estimated. However, any of the samples of Ga, In, Sn, Zn and Al is consistent with the rest within {+-}0.2 mK, using a cubic or quadratic deviation function, in the temperature range 0 deg C to 660 deg C. This indicates that the effect of impurities is negligible. Four PRTs were selected at random. They were calibrated repeatedly, first up to the Zn point and then up to the Al point. The resistance of each PRT drifted. From time to time, for each PRT, a seemingly well-established resistance drift suddenly and unpredictably changed to a different rate of drift. Occasionally, the resistance of the PRTs shifted. Such unpredictable changes obviously limit the accuracy of temperature measurements using PRTs no matter what the accuracy of their calibrations. In the case of our four PRTs, the uncertainty of temperature measurements near 660 deg C ranged from about {+-}1 mK to about {+-}2,5 mK even though they were all calibrated at all fixed points well within {+-}0.25 mK uncertainty. Possible explanations are offered for the apparently permanent drifts and the erratic shifts in the resistance of the PRTs. Some comments are made concerning the ambiguity of 'immersion tests' in general. The furnaces of the National Research Council of Canada used in this work are high-temperature adiabatic calorimeters. (authors)
International Nuclear Information System (INIS)
Sidorov, A.V.; Stamenov, D.B.
1996-01-01
The results of LO fixed point QCD (FP-QCD) analysis of the CCFR data for the nucleon structure function xF 3 (x,Q 2 ) are presented. The predictions of FR-QCD, in which the Callan-Symanzik β-function admits a second order ultraviolet zero at α=α 0 are in good agreement with the data. Constraints on possible values of the β-function parameter b regulating how fast α s (Q 2 ) tends to its asymptotic value α 0 ≠0 are found from the data. The corresponding values of α 0 are also determined. Having in mind our recent 'first-order fixed point' QCD fit to the same data we conclude that in spite of a high precision and a large (x,Q 2 ) kinematic range of the CCFR data they cannot discriminate between QCD and FP-QCD predictions for xF 3 (x,Q 2 ). 14 refs., 1 tab
Directory of Open Access Journals (Sweden)
Lu-Chuan Ceng
2014-01-01
Full Text Available We introduce and analyze a hybrid iterative algorithm by virtue of Korpelevich's extragradient method, viscosity approximation method, hybrid steepest-descent method, and averaged mapping approach to the gradient-projection algorithm. It is proven that under appropriate assumptions, the proposed algorithm converges strongly to a common element of the fixed point set of infinitely many nonexpansive mappings, the solution set of finitely many generalized mixed equilibrium problems (GMEPs, the solution set of finitely many variational inequality problems (VIPs, the solution set of general system of variational inequalities (GSVI, and the set of minimizers of convex minimization problem (CMP, which is just a unique solution of a triple hierarchical variational inequality (THVI in a real Hilbert space. In addition, we also consider the application of the proposed algorithm to solve a hierarchical fixed point problem with constraints of finitely many GMEPs, finitely many VIPs, GSVI, and CMP. The results obtained in this paper improve and extend the corresponding results announced by many others.
Directory of Open Access Journals (Sweden)
Yan Zhang
2015-01-01
Full Text Available This paper presents four different integer sequences to construct quasi-cyclic low-density parity-check (QC-LDPC codes with mathematical theory. The paper introduces the procedure of the coding principle and coding. Four different integer sequences constructing QC-LDPC code are compared with LDPC codes by using PEG algorithm, array codes, and the Mackey codes, respectively. Then, the integer sequence QC-LDPC codes are used in coded cooperative communication. Simulation results show that the integer sequence constructed QC-LDPC codes are effective, and overall performance is better than that of other types of LDPC codes in the coded cooperative communication. The performance of Dayan integer sequence constructed QC-LDPC is the most excellent performance.
The analytic structure of conformal blocks and the generalized Wilson-Fisher fixed points
Energy Technology Data Exchange (ETDEWEB)
Gliozzi, Ferdinando [Dipartimento di Fisica, Università di Torino andIstituto Nazionale di Fisica Nucleare - sezione di Torino,Via P. Giuria 1, I-10125 Torino (Italy); Guerrieri, Andrea L. [Department of Physics, Faculty of Science, Chulalongkorn University,Thanon Phayathai, Pathumwan, Bangkok 10330 (Thailand); I.N.F.N. Sezione di Roma Tor Vergata,Via della Ricerca Scientifica, I-00133 Roma (Italy); Petkou, Anastasios C. [Institute of Theoretical Physics, Aristotle University of Thessaloniki,54124 Thessaloniki (Greece); Wen, Congkao [Walter Burke Institute for Theoretical Physics, California Institute of Technology,Pasadena, CA 91125 (United States); Mani L. Bhaumik Institute for Theoretical Physics,Department of Physics and Astronomy, UCLA,Los Angeles, CA 90095 (United States)
2017-04-11
We describe in detail the method used in our previous work https://arxiv.org/abs/1611.10344 to study the Wilson-Fisher critical points nearby generalized free CFTs, exploiting the analytic structure of conformal blocks as functions of the conformal dimension of the exchanged operator. Our method is equivalent to the mechanism of conformal multiplet recombination set up by null states. We compute, to the first non-trivial order in the ϵ-expansion, the anomalous dimensions and the OPE coefficients of infinite classes of scalar local operators using just CFT data. We study single-scalar and O(N)-invariant theories, as well as theories with multiple deformations. When available we agree with older results, but we also produce a wealth of new ones. Unitarity and crossing symmetry are not used in our approach and we are able to apply our method to non-unitary theories as well. Some implications of our results for the study of the non-unitary theories containing partially conserved higher-spin currents are briefly mentioned.
Construction of Home-Made Tin Fixed-Point Cell at TUBITAK UME
Kalemci, M.; Arifovic, N.; Bağçe, A.; Aytekin, S. O.; Ince, A. T.
2015-08-01
TUBITAK UME Temperature Laboratory initiated a new study which focuses on the construction of a tin freezing-point cell as a primary temperature standard. The design is an open-cell type similar to the National Institute of Standards and Technology design. With this aim, a brand new vacuum and filling line employing an oil diffusion pump and two cold traps (liquid nitrogen and dry ice) was set-up. The graphite parts (crucible, thermometer well, etc.) have been baked at high temperature under vacuum. Each cell was filled with approximately 1 kg of high-purity tin (99.9999 %) in a three-zone furnace. Then several melting and freezing curves were obtained to assess the quality of the home-made cell, and also the new cell was compared with the existing reference cell of the laboratory. The results obtained are very close to the reference cell of UME, indicating that the method used for fabrication was promising and satisfactory and also seems to meet the requirements to have a primary level temperature standard.
Expansion of a stochastic stationary optical field at a fixed point
International Nuclear Information System (INIS)
Martinez-Herrero, R.; Mejias, P.M.
1984-01-01
An important problem in single and multifold photoelectron statistics is to determine the statistical properties of a totally polarized optical field at some point →r from the photoelectron counts registered by the detector. The solution to this problem may be found in the determination of the statistical properties of an integral over a stochastic process; a complicated and formidable task. This problem can be solved in some cases of interest by expanding the process V(t) (which represents the field at →r) in a set of complete orthonormal deterministic functions, resulting in the so-called Karhunen-Loeve expansion of V(t). Two disadvantages are that the process must be defined over a finite time interval, and that each term of the series does not represent any special optical field. Taking into account these limitations of the expansion, the purpose of this work is to find another alternative expansion of stationary optical fields defined over the infinite time interval, and whose terms represent stochastic fields
Analysis of Minimal LDPC Decoder System on a Chip Implementation
Directory of Open Access Journals (Sweden)
T. Palenik
2015-09-01
Full Text Available This paper presents a practical method of potential replacement of several different Quasi-Cyclic Low-Density Parity-Check (QC-LDPC codes with one, with the intention of saving as much memory as required to implement the LDPC encoder and decoder in a memory-constrained System on a Chip (SoC. The presented method requires only a very small modification of the existing encoder and decoder, making it suitable for utilization in a Software Defined Radio (SDR platform. Besides the analysis of the effects of necessary variable-node value fixation during the Belief Propagation (BP decoding algorithm, practical standard-defined code parameters are scrutinized in order to evaluate the feasibility of the proposed LDPC setup simplification. Finally, the error performance of the modified system structure is evaluated and compared with the original system structure by means of simulation.
Transmission over UWB channels with OFDM system using LDPC coding
Dziwoki, Grzegorz; Kucharczyk, Marcin; Sulek, Wojciech
2009-06-01
Hostile wireless environment requires use of sophisticated signal processing methods. The paper concerns on Ultra Wideband (UWB) transmission over Personal Area Networks (PAN) including MB-OFDM specification of physical layer. In presented work the transmission system with OFDM modulation was connected with LDPC encoder/decoder. Additionally the frame and bit error rate (FER and BER) of the system was decreased using results from the LDPC decoder in a kind of turbo equalization algorithm for better channel estimation. Computational block using evolutionary strategy, from genetic algorithms family, was also used in presented system. It was placed after SPA (Sum-Product Algorithm) decoder and is conditionally turned on in the decoding process. The result is increased effectiveness of the whole system, especially lower FER. The system was tested with two types of LDPC codes, depending on type of parity check matrices: randomly generated and constructed deterministically, optimized for practical decoder architecture implemented in the FPGA device.
Multiple LDPC decoding for distributed source coding and video coding
DEFF Research Database (Denmark)
Forchhammer, Søren; Luong, Huynh Van; Huang, Xin
2011-01-01
Distributed source coding (DSC) is a coding paradigm for systems which fully or partly exploit the source statistics at the decoder to reduce the computational burden at the encoder. Distributed video coding (DVC) is one example. This paper considers the use of Low Density Parity Check Accumulate...... (LDPCA) codes in a DSC scheme with feed-back. To improve the LDPC coding performance in the context of DSC and DVC, while retaining short encoder blocks, this paper proposes multiple parallel LDPC decoding. The proposed scheme passes soft information between decoders to enhance performance. Experimental...
The application of LDPC code in MIMO-OFDM system
Liu, Ruian; Zeng, Beibei; Chen, Tingting; Liu, Nan; Yin, Ninghao
2018-03-01
The combination of MIMO and OFDM technology has become one of the key technologies of the fourth generation mobile communication., which can overcome the frequency selective fading of wireless channel, increase the system capacity and improve the frequency utilization. Error correcting coding introduced into the system can further improve its performance. LDPC (low density parity check) code is a kind of error correcting code which can improve system reliability and anti-interference ability, and the decoding is simple and easy to operate. This paper mainly discusses the application of LDPC code in MIMO-OFDM system.
Performance analysis of LDPC codes on OOK terahertz wireless channels
International Nuclear Information System (INIS)
Liu Chun; Wang Chang; Cao Jun-Cheng
2016-01-01
Atmospheric absorption, scattering, and scintillation are the major causes to deteriorate the transmission quality of terahertz (THz) wireless communications. An error control coding scheme based on low density parity check (LDPC) codes with soft decision decoding algorithm is proposed to improve the bit-error-rate (BER) performance of an on-off keying (OOK) modulated THz signal through atmospheric channel. The THz wave propagation characteristics and channel model in atmosphere is set up. Numerical simulations validate the great performance of LDPC codes against the atmospheric fading and demonstrate the huge potential in future ultra-high speed beyond Gbps THz communications. (paper)
Enhancement of Unequal Error Protection Properties of LDPC Codes
Directory of Open Access Journals (Sweden)
Poulliat Charly
2007-01-01
Full Text Available It has been widely recognized in the literature that irregular low-density parity-check (LDPC codes exhibit naturally an unequal error protection (UEP behavior. In this paper, we propose a general method to emphasize and control the UEP properties of LDPC codes. The method is based on a hierarchical optimization of the bit node irregularity profile for each sensitivity class within the codeword by maximizing the average bit node degree while guaranteeing a minimum degree as high as possible. We show that this optimization strategy is efficient, since the codes that we optimize show better UEP capabilities than the codes optimized for the additive white Gaussian noise channel.
2016-04-01
AND ROTORCRAFT FROM DISCRETE -POINT LINEAR MODELS Eric L. Tobias and Mark B. Tischler Aviation Development Directorate Aviation and Missile...Stitching Architecture for Continuous Full Flight-Envelope Simulation of Fixed-Wing Aircraft and Rotorcraft from Discrete -Point Linear Models 5...of discrete -point linear models and trim data. The model stitching simulation architecture is applicable to any aircraft configuration readily
De la Sen, M.
2015-01-01
In the framework of complete probabilistic metric spaces and, in particular, in probabilistic Menger spaces, this paper investigates some relevant properties of convergence of sequences to probabilistic α-fuzzy fixed points under some types of probabilistic contractive conditions.
Directory of Open Access Journals (Sweden)
Sunny Chauhan
2013-11-01
Full Text Available In this paper, we utilize the notion of common limit range property in Non-Archimedean Menger PM-spaces and prove some fixed point theorems for two pairs of weakly compatible mappings. Some illustrative examples are furnished to support our results. As an application to our main result, we present a common fixed point theorem for four finite families of self mappings. Our results improve and extend several known results existing in the literature.
Directory of Open Access Journals (Sweden)
Cai Gang
2009-01-01
Full Text Available We introduce two modifications of the Mann iteration, by using the hybrid methods, for equilibrium and fixed point problems for an infinite family of asymptotically nonexpansive mappings in a Hilbert space. Then, we prove that such two sequences converge strongly to a common element of the set of solutions of an equilibrium problem and the set of common fixed points of an infinite family of asymptotically nonexpansive mappings. Our results improve and extend the results announced by many others.
Directory of Open Access Journals (Sweden)
Tong-Huei Chang
2009-01-01
Full Text Available We use a concept of abstract convexity to define the almost S-KKM𝒞 property, al-S-KKM𝒞(X,Y family, and almost Φ-spaces. We get some new approximate fixed point theorems and fixed point theorems in almost Φ-spaces. Our results extend some results of other authors.
Advanced error-prediction LDPC with temperature compensation for highly reliable SSDs
Tokutomi, Tsukasa; Tanakamaru, Shuhei; Iwasaki, Tomoko Ogura; Takeuchi, Ken
2015-09-01
To improve the reliability of NAND Flash memory based solid-state drives (SSDs), error-prediction LDPC (EP-LDPC) has been proposed for multi-level-cell (MLC) NAND Flash memory (Tanakamaru et al., 2012, 2013), which is effective for long retention times. However, EP-LDPC is not as effective for triple-level cell (TLC) NAND Flash memory, because TLC NAND Flash has higher error rates and is more sensitive to program-disturb error. Therefore, advanced error-prediction LDPC (AEP-LDPC) has been proposed for TLC NAND Flash memory (Tokutomi et al., 2014). AEP-LDPC can correct errors more accurately by precisely describing the error phenomena. In this paper, the effects of AEP-LDPC are investigated in a 2×nm TLC NAND Flash memory with temperature characterization. Compared with LDPC-with-BER-only, the SSD's data-retention time is increased by 3.4× and 9.5× at room-temperature (RT) and 85 °C, respectively. Similarly, the acceptable BER is increased by 1.8× and 2.3×, respectively. Moreover, AEP-LDPC can correct errors with pre-determined tables made at higher temperatures to shorten the measurement time before shipping. Furthermore, it is found that one table can cover behavior over a range of temperatures in AEP-LDPC. As a result, the total table size can be reduced to 777 kBytes, which makes this approach more practical.
DEFF Research Database (Denmark)
Filipiuk, Piotr; Nielson, Flemming; Nielson, Hanne Riis
2012-01-01
We present a logic for the specification of static analysis problems that goes beyond the logics traditionally used. Its most prominent feature is the direct support for both inductive computations of behaviors as well as co-inductive specifications of properties. Two main theoretical contributions...... are a Moore Family result and a parametrized worst case time complexity result. We show that the logic and the associated solver can be used for rapid prototyping of analyses and illustrate a wide variety of applications within Static Analysis, Constraint Satisfaction Problems and Model Checking. In all cases...
He, Jing; Wen, Xuejie; Chen, Ming; Chen, Lin
2015-09-01
In this paper, a Golay complementary training sequence (TS)-based symbol synchronization scheme is proposed and experimentally demonstrated in multiband orthogonal frequency division multiplexing (MB-OFDM) ultra-wideband over fiber (UWBoF) system with a variable rate low-density parity-check (LDPC) code. Meanwhile, the coding gain and spectral efficiency in the variable rate LDPC-coded MB-OFDM UWBoF system are investigated. By utilizing the non-periodic auto-correlation property of the Golay complementary pair, the start point of LDPC-coded MB-OFDM UWB signal can be estimated accurately. After 100 km standard single-mode fiber (SSMF) transmission, at the bit error rate of 1×10-3, the experimental results show that the short block length 64QAM-LDPC coding provides a coding gain of 4.5 dB, 3.8 dB and 2.9 dB for a code rate of 62.5%, 75% and 87.5%, respectively.
LDPC Codes--Structural Analysis and Decoding Techniques
Zhang, Xiaojie
2012-01-01
Low-density parity-check (LDPC) codes have been the focus of much research over the past decade thanks to their near Shannon limit performance and to their efficient message-passing (MP) decoding algorithms. However, the error floor phenomenon observed in MP decoding, which manifests itself as an abrupt change in the slope of the error-rate curve,…
Hardwarearchitektur für einen universellen LDPC Decoder
Directory of Open Access Journals (Sweden)
C. Beuschel
2009-05-01
Full Text Available Im vorliegenden Beitrag wird eine universelle Decoderarchitektur für einen Low-Density Parity-Check (LDPC Code Decoder vorgestellt. Anders als bei den in der Literatur häufig beschriebenen Architekturen für strukturierte Codes ist die hier vorgestellte Architektur frei programmierbar, so dass jeder beliebige LDPC Code durch eine Änderung der Initialisierung des Speichers für die Prüfmatrix mit derselben Hardware decodiert werden kann. Die größte Herausforderung beim Entwurf von teilparallelen LDPC Decoder Architekturen liegt im konfliktfreien Datenaustausch zwischen mehreren parallelen Speichern und Berechnungseinheiten, wozu ein Mapping und Scheduling Algorithmus benötigt wird. Der hier vorgestellte Algorithmus stützt sich auf Graphentheorie und findet für jeden beliebigen LDPC Code eine für die Architektur optimale Lösung. Damit sind keine Wartezyklen notwendig und die Parallelität der Architektur wird zu jedem Zeitpunkt voll ausgenutzt.
The Infrared Fixed Points of 3d $\\mathcal{N}=4$ $USp(2N)$ SQCD Theories arXiv
Assel, Benjamin
We derive the algebraic description of the Coulomb branch of 3d $\\mathcal{N}=4$ $USp(2N)$ SQCD theories with $N_f$ fundamental hypermultiplets and determine their low energy physics in any vacuum from the local geometry of the moduli space, identifying the interacting SCFTs which arise at singularities and possible extra free sectors. The SCFT with the largest moduli space arises at the most singular locus on the Coulomb branch. For $N_f>2N$ (good theories) it sits at the origin of the conical variety as expected. For $N_f =2N$ we find two separate most singular points, from which the two isomorphic components of the Higgs branch of the UV theory emanate. The SCFTs sitting at any of these two vacua have only odd dimensional Coulomb branch generators, which transform under an accidental $SU(2)$ global symmetry. We provide a direct derivation of their moduli spaces of vacua, and propose a Lagrangian mirror theory for these fixed points. For $2 \\le N_f < 2N$ the most singular locus has one or two extended com...
Optimisation des codes LDPC irréguliers et algorithmes de décodage des codes LDPC q-aires
Cances , Jean-Pierre
2013-01-01
Cette note technique rappelle les principes d'optimisation pour obtenir les profils de codes LDPC irréguliers performants et rappelle les principes des algorithmes de décodage utilizes pour les codes LDPC q-aires à grande efficacité spectrale.
Construction of Quasi-Cyclic LDPC Codes Based on Fundamental Theorem of Arithmetic
Directory of Open Access Journals (Sweden)
Hai Zhu
2018-01-01
Full Text Available Quasi-cyclic (QC LDPC codes play an important role in 5G communications and have been chosen as the standard codes for 5G enhanced mobile broadband (eMBB data channel. In this paper, we study the construction of QC LDPC codes based on an arbitrary given expansion factor (or lifting degree. First, we analyze the cycle structure of QC LDPC codes and give the necessary and sufficient condition for the existence of short cycles. Based on the fundamental theorem of arithmetic in number theory, we divide the integer factorization into three cases and present three classes of QC LDPC codes accordingly. Furthermore, a general construction method of QC LDPC codes with girth of at least 6 is proposed. Numerical results show that the constructed QC LDPC codes perform well over the AWGN channel when decoded with the iterative algorithms.
A good performance watermarking LDPC code used in high-speed optical fiber communication system
Zhang, Wenbo; Li, Chao; Zhang, Xiaoguang; Xi, Lixia; Tang, Xianfeng; He, Wenxue
2015-07-01
A watermarking LDPC code, which is a strategy designed to improve the performance of the traditional LDPC code, was introduced. By inserting some pre-defined watermarking bits into original LDPC code, we can obtain a more correct estimation about the noise level in the fiber channel. Then we use them to modify the probability distribution function (PDF) used in the initial process of belief propagation (BP) decoding algorithm. This algorithm was tested in a 128 Gb/s PDM-DQPSK optical communication system and results showed that the watermarking LDPC code had a better tolerances to polarization mode dispersion (PMD) and nonlinearity than that of traditional LDPC code. Also, by losing about 2.4% of redundancy for watermarking bits, the decoding efficiency of the watermarking LDPC code is about twice of the traditional one.
Implementation of Layered Decoding Architecture for LDPC Code using Layered Min-Sum Algorithm
Sandeep Kakde; Atish Khobragade; Shrikant Ambatkar; Pranay Nandanwar
2017-01-01
For binary field and long code lengths, Low Density Parity Check (LDPC) code approaches Shannon limit performance. LDPC codes provide remarkable error correction performance and therefore enlarge the design space for communication systems.In this paper, we have compare different digital modulation techniques and found that BPSK modulation technique is better than other modulation techniques in terms of BER. It also gives error performance of LDPC decoder over AWGN channel using Min-Sum algori...
Kódování a efektivita LDPC kódů
Kozlík, Andrew
2011-01-01
Low-density parity-check (LDPC) codes are linear error correcting codes which are capable of performing near channel capacity. Furthermore, they admit efficient decoding algorithms that provide near optimum performance. Their main disadvantage is that most LDPC codes have relatively complex encoders. In this thesis, we begin by giving a detailed discussion of the sum-product decoding algorithm, we then study the performance of LDPC codes on the binary erasure channel under sum-product decodin...
Using LDPC Code Constraints to Aid Recovery of Symbol Timing
Jones, Christopher; Villasnor, John; Lee, Dong-U; Vales, Esteban
2008-01-01
A method of utilizing information available in the constraints imposed by a low-density parity-check (LDPC) code has been proposed as a means of aiding the recovery of symbol timing in the reception of a binary-phase-shift-keying (BPSK) signal representing such a code in the presence of noise, timing error, and/or Doppler shift between the transmitter and the receiver. This method and the receiver architecture in which it would be implemented belong to a class of timing-recovery methods and corresponding receiver architectures characterized as pilotless in that they do not require transmission and reception of pilot signals. Acquisition and tracking of a signal of the type described above have traditionally been performed upstream of, and independently of, decoding and have typically involved utilization of a phase-locked loop (PLL). However, the LDPC decoding process, which is iterative, provides information that can be fed back to the timing-recovery receiver circuits to improve performance significantly over that attainable in the absence of such feedback. Prior methods of coupling LDPC decoding with timing recovery had focused on the use of output code words produced as the iterations progress. In contrast, in the present method, one exploits the information available from the metrics computed for the constraint nodes of an LDPC code during the decoding process. In addition, the method involves the use of a waveform model that captures, better than do the waveform models of the prior methods, distortions introduced by receiver timing errors and transmitter/ receiver motions. An LDPC code is commonly represented by use of a bipartite graph containing two sets of nodes. In the graph corresponding to an (n,k) code, the n variable nodes correspond to the code word symbols and the n-k constraint nodes represent the constraints that the code places on the variable nodes in order for them to form a valid code word. The decoding procedure involves iterative computation
Wu, Menglong; Han, Dahai; Zhang, Xiang; Zhang, Feng; Zhang, Min; Yue, Guangxin
2014-03-10
We have implemented a modified Low-Density Parity-Check (LDPC) codec algorithm in ultraviolet (UV) communication system. Simulations are conducted with measured parameters to evaluate the LDPC-based UV system performance. Moreover, LDPC (960, 480) and RS (18, 10) are implemented and experimented via a non-line-of-sight (NLOS) UV test bed. The experimental results are in agreement with the simulation and suggest that based on the given power and 10(-3)bit error rate (BER), in comparison with an uncoded system, average communication distance increases 32% with RS code, while 78% with LDPC code.
Design of ACM system based on non-greedy punctured LDPC codes
Lu, Zijun; Jiang, Zihong; Zhou, Lin; He, Yucheng
2017-08-01
In this paper, an adaptive coded modulation (ACM) scheme based on rate-compatible LDPC (RC-LDPC) codes was designed. The RC-LDPC codes were constructed by a non-greedy puncturing method which showed good performance in high code rate region. Moreover, the incremental redundancy scheme of LDPC-based ACM system over AWGN channel was proposed. By this scheme, code rates vary from 2/3 to 5/6 and the complication of the ACM system is lowered. Simulations show that more and more obvious coding gain can be obtained by the proposed ACM system with higher throughput.
Bent, J. D.; Sweeney, C.; Tans, P. P.; Newberger, T.; Higgs, J. A.; Wolter, S.
2017-12-01
Accurate estimates of point source gas emissions are essential for reconciling top-down and bottom-up greenhouse gas measurements, but sampling such sources is challenging. Remote sensing methods are limited by resolution and cloud cover; aircraft methods are limited by air traffic control clearances, and the need to properly determine boundary layer height. A new sampling approach leverages the ability of unmanned aerial systems (UAS) to measure all the way to the surface near the source of emissions, improving sample resolution, and reducing the need to characterize a wide downstream swath, or measure to the full height of the planetary boundary layer (PBL). The "Active-AirCore" sampler, currently under development, will fly on a fixed wing UAS in Class G airspace, spiraling from the surface to 1200 ft AGL around point sources such as leaking oil wells to measure methane, carbon dioxide and carbon monoxide. The sampler collects a 100-meter long sample "core" of air in an 1/8" passivated stainless steel tube. This "core" is run on a high-precision instrument shortly after the UAS is recovered. Sample values are mapped to a specific geographic location by cross-referencing GPS and flow/pressure metadata, and fluxes are quantified by applying Gauss's theorem to the data, mapped onto the spatial "cylinder" circumscribed by the UAS. The AirCore-Active builds off the sampling ability and analytical approach of the related AirCore sampler, which profiles the atmosphere passively using a balloon launch platform, but will add an active pumping capability needed for near-surface horizontal sampling applications. Here, we show design elements, laboratory and field test results for methane, describe the overall goals of the mission, and discuss how the platform can be adapted, with minimal effort, to measure other gas species.
Directory of Open Access Journals (Sweden)
Douglas Scott C
2007-01-01
Full Text Available We derive new fixed-point algorithms for the blind separation of complex-valued mixtures of independent, noncircularly symmetric, and non-Gaussian source signals. Leveraging recently developed results on the separability of complex-valued signal mixtures, we systematically construct iterative procedures on a kurtosis-based contrast whose evolutionary characteristics are identical to those of the FastICA algorithm of Hyvarinen and Oja in the real-valued mixture case. Thus, our methods inherit the fast convergence properties, computational simplicity, and ease of use of the FastICA algorithm while at the same time extending this class of techniques to complex signal mixtures. For extracting multiple sources, symmetric and asymmetric signal deflation procedures can be employed. Simulations for both noiseless and noisy mixtures indicate that the proposed algorithms have superior finite-sample performance in data-starved scenarios as compared to existing complex ICA methods while performing about as well as the best of these techniques for larger data-record lengths.
Colli, Pierluigi; Gilardi, Gianni; Sprekels, Jürgen
2016-06-01
This paper investigates a nonlocal version of a model for phase separation on an atomic lattice that was introduced by P. Podio-Guidugli (2006) [36]. The model consists of an initial-boundary value problem for a nonlinearly coupled system of two partial differential equations governing the evolution of an order parameter ρ and the chemical potential μ. Singular contributions to the local free energy in the form of logarithmic or double-obstacle potentials are admitted. In contrast to the local model, which was studied by P. Podio-Guidugli and the present authors in a series of recent publications, in the nonlocal case the equation governing the evolution of the order parameter contains in place of the Laplacian a nonlocal expression that originates from nonlocal contributions to the free energy and accounts for possible long-range interactions between the atoms. It is shown that just as in the local case the model equations are well posed, where the technique of proving existence is entirely different: it is based on an application of Tikhonov's fixed point theorem in a rather unusual separable and reflexive Banach space.
LDPC Codes with Minimum Distance Proportional to Block Size
Divsalar, Dariush; Jones, Christopher; Dolinar, Samuel; Thorpe, Jeremy
2009-01-01
Low-density parity-check (LDPC) codes characterized by minimum Hamming distances proportional to block sizes have been demonstrated. Like the codes mentioned in the immediately preceding article, the present codes are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. The previously mentioned codes have low decoding thresholds and reasonably low error floors. However, the minimum Hamming distances of those codes do not grow linearly with code-block sizes. Codes that have this minimum-distance property exhibit very low error floors. Examples of such codes include regular LDPC codes with variable degrees of at least 3. Unfortunately, the decoding thresholds of regular LDPC codes are high. Hence, there is a need for LDPC codes characterized by both low decoding thresholds and, in order to obtain acceptably low error floors, minimum Hamming distances that are proportional to code-block sizes. The present codes were developed to satisfy this need. The minimum Hamming distances of the present codes have been shown, through consideration of ensemble-average weight enumerators, to be proportional to code block sizes. As in the cases of irregular ensembles, the properties of these codes are sensitive to the proportion of degree-2 variable nodes. A code having too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code having too many such nodes tends not to exhibit a minimum distance that is proportional to block size. Results of computational simulations have shown that the decoding thresholds of codes of the present type are lower than those of regular LDPC codes. Included in the simulations were a few examples from a family of codes characterized by rates ranging from low to high and by thresholds that adhere closely to their respective channel capacity thresholds; the simulation results from these examples showed that the codes in question have low
International Nuclear Information System (INIS)
Singh, Vimal
2007-01-01
In [Singh V. Elimination of overflow oscillations in fixed-point state-space digital filters using saturation arithmetic. IEEE Trans Circ Syst 1990;37(6):814-8], a frequency-domain criterion for the suppression of limit cycles in fixed-point state-space digital filters using saturation overflow arithmetic was presented. The passivity property owing to the presence of multiple saturation nonlinearities was exploited therein. In the present paper, a new notion of passivity, namely, that involving the state variables is considered, thereby arriving at an entirely new frequency-domain criterion for the suppression of limit cycles in such filters
International Nuclear Information System (INIS)
Howard, Lee M.
2014-01-01
Sharkovskii proved that, for continuous maps on intervals, the existence of 3-cycle implies the existence of all others. Li and Yorke proved that 3-cycle implies chaos. To establish a domain of uncountable cycles in the logistic map and to understand chaos in it, the fixed points of 3-cycle are obtained analytically by solving a sextic equation. At one parametric value, a fixed-point spectrum, resulted from the Sharkovskii limit, helps to realize chaos in the sense of Li and Yorke. (general)
Yang, Chen; Li, Bingyi; Chen, Liang; Wei, Chunpeng; Xie, Yizhuang; Chen, He; Yu, Wenyue
2017-06-24
With the development of satellite load technology and very large scale integrated (VLSI) circuit technology, onboard real-time synthetic aperture radar (SAR) imaging systems have become a solution for allowing rapid response to disasters. A key goal of the onboard SAR imaging system design is to achieve high real-time processing performance with severe size, weight, and power consumption constraints. In this paper, we analyse the computational burden of the commonly used chirp scaling (CS) SAR imaging algorithm. To reduce the system hardware cost, we propose a partial fixed-point processing scheme. The fast Fourier transform (FFT), which is the most computation-sensitive operation in the CS algorithm, is processed with fixed-point, while other operations are processed with single precision floating-point. With the proposed fixed-point processing error propagation model, the fixed-point processing word length is determined. The fidelity and accuracy relative to conventional ground-based software processors is verified by evaluating both the point target imaging quality and the actual scene imaging quality. As a proof of concept, a field- programmable gate array-application-specific integrated circuit (FPGA-ASIC) hybrid heterogeneous parallel accelerating architecture is designed and realized. The customized fixed-point FFT is implemented using the 130 nm complementary metal oxide semiconductor (CMOS) technology as a co-processor of the Xilinx xc6vlx760t FPGA. A single processing board requires 12 s and consumes 21 W to focus a 50-km swath width, 5-m resolution stripmap SAR raw data with a granularity of 16,384 × 16,384.
Directory of Open Access Journals (Sweden)
Chen Yang
2017-06-01
Full Text Available With the development of satellite load technology and very large scale integrated (VLSI circuit technology, onboard real-time synthetic aperture radar (SAR imaging systems have become a solution for allowing rapid response to disasters. A key goal of the onboard SAR imaging system design is to achieve high real-time processing performance with severe size, weight, and power consumption constraints. In this paper, we analyse the computational burden of the commonly used chirp scaling (CS SAR imaging algorithm. To reduce the system hardware cost, we propose a partial fixed-point processing scheme. The fast Fourier transform (FFT, which is the most computation-sensitive operation in the CS algorithm, is processed with fixed-point, while other operations are processed with single precision floating-point. With the proposed fixed-point processing error propagation model, the fixed-point processing word length is determined. The fidelity and accuracy relative to conventional ground-based software processors is verified by evaluating both the point target imaging quality and the actual scene imaging quality. As a proof of concept, a field- programmable gate array−application-specific integrated circuit (FPGA-ASIC hybrid heterogeneous parallel accelerating architecture is designed and realized. The customized fixed-point FFT is implemented using the 130 nm complementary metal oxide semiconductor (CMOS technology as a co-processor of the Xilinx xc6vlx760t FPGA. A single processing board requires 12 s and consumes 21 W to focus a 50-km swath width, 5-m resolution stripmap SAR raw data with a granularity of 16,384 × 16,384.
Zhang, Yequn; Arabaci, Murat; Djordjevic, Ivan B
2012-04-09
Leveraging the advanced coherent optical communication technologies, this paper explores the feasibility of using four-dimensional (4D) nonbinary LDPC-coded modulation (4D-NB-LDPC-CM) schemes for long-haul transmission in future optical transport networks. In contrast to our previous works on 4D-NB-LDPC-CM which considered amplified spontaneous emission (ASE) noise as the dominant impairment, this paper undertakes transmission in a more realistic optical fiber transmission environment, taking into account impairments due to dispersion effects, nonlinear phase noise, Kerr nonlinearities, and stimulated Raman scattering in addition to ASE noise. We first reveal the advantages of using 4D modulation formats in LDPC-coded modulation instead of conventional two-dimensional (2D) modulation formats used with polarization-division multiplexing (PDM). Then we demonstrate that 4D LDPC-coded modulation schemes with nonbinary LDPC component codes significantly outperform not only their conventional PDM-2D counterparts but also the corresponding 4D bit-interleaved LDPC-coded modulation (4D-BI-LDPC-CM) schemes, which employ binary LDPC codes as component codes. We also show that the transmission reach improvement offered by the 4D-NB-LDPC-CM over 4D-BI-LDPC-CM increases as the underlying constellation size and hence the spectral efficiency of transmission increases. Our results suggest that 4D-NB-LDPC-CM can be an excellent candidate for long-haul transmission in next-generation optical networks.
Hahl, Sayuri K; Kremling, Andreas
2016-01-01
In the mathematical modeling of biochemical reactions, a convenient standard approach is to use ordinary differential equations (ODEs) that follow the law of mass action. However, this deterministic ansatz is based on simplifications; in particular, it neglects noise, which is inherent to biological processes. In contrast, the stochasticity of reactions is captured in detail by the discrete chemical master equation (CME). Therefore, the CME is frequently applied to mesoscopic systems, where copy numbers of involved components are small and random fluctuations are thus significant. Here, we compare those two common modeling approaches, aiming at identifying parallels and discrepancies between deterministic variables and possible stochastic counterparts like the mean or modes of the state space probability distribution. To that end, a mathematically flexible reaction scheme of autoregulatory gene expression is translated into the corresponding ODE and CME formulations. We show that in the thermodynamic limit, deterministic stable fixed points usually correspond well to the modes in the stationary probability distribution. However, this connection might be disrupted in small systems. The discrepancies are characterized and systematically traced back to the magnitude of the stoichiometric coefficients and to the presence of nonlinear reactions. These factors are found to synergistically promote large and highly asymmetric fluctuations. As a consequence, bistable but unimodal, and monostable but bimodal systems can emerge. This clearly challenges the role of ODE modeling in the description of cellular signaling and regulation, where some of the involved components usually occur in low copy numbers. Nevertheless, systems whose bimodality originates from deterministic bistability are found to sustain a more robust separation of the two states compared to bimodal, but monostable systems. In regulatory circuits that require precise coordination, ODE modeling is thus still
Improved Design of Unequal Error Protection LDPC Codes
Directory of Open Access Journals (Sweden)
Sandberg Sara
2010-01-01
Full Text Available We propose an improved method for designing unequal error protection (UEP low-density parity-check (LDPC codes. The method is based on density evolution. The degree distribution with the best UEP properties is found, under the constraint that the threshold should not exceed the threshold of a non-UEP code plus some threshold offset. For different codeword lengths and different construction algorithms, we search for good threshold offsets for the UEP code design. The choice of the threshold offset is based on the average a posteriori variable node mutual information. Simulations reveal the counter intuitive result that the short-to-medium length codes designed with a suitable threshold offset all outperform the corresponding non-UEP codes in terms of average bit-error rate. The proposed codes are also compared to other UEP-LDPC codes found in the literature.
Improving a Power Line Communications Standard with LDPC Codes
Directory of Open Access Journals (Sweden)
Hsu Christine
2007-01-01
Full Text Available We investigate a power line communications (PLC scheme that could be used to enhance the HomePlug 1.0 standard, specifically its ROBO mode which provides modest throughput for the worst case PLC channel. The scheme is based on using a low-density parity-check (LDPC code, in lieu of the concatenated Reed-Solomon and convolutional codes in ROBO mode. The PLC channel is modeled with multipath fading and Middleton's class A noise. Clipping is introduced to mitigate the effect of impulsive noise. A simple and effective method is devised to estimate the variance of the clipped noise for LDPC decoding. Simulation results show that the proposed scheme outperforms the HomePlug 1.0 ROBO mode and has lower computational complexity. The proposed scheme also dispenses with the repetition of information bits in ROBO mode to gain time diversity, resulting in 4-fold increase in physical layer throughput.
Cooperative optimization and their application in LDPC codes
Chen, Ke; Rong, Jian; Zhong, Xiaochun
2008-10-01
Cooperative optimization is a new way for finding global optima of complicated functions of many variables. The proposed algorithm is a class of message passing algorithms and has solid theory foundations. It can achieve good coding gains over the sum-product algorithm for LDPC codes. For (6561, 4096) LDPC codes, the proposed algorithm can achieve 2.0 dB gains over the sum-product algorithm at BER of 4×10-7. The decoding complexity of the proposed algorithm is lower than the sum-product algorithm can do; furthermore, the former can achieve much lower error floor than the latter can do after the Eb / No is higher than 1.8 dB.
Peeling Decoding of LDPC Codes with Applications in Compressed Sensing
Directory of Open Access Journals (Sweden)
Weijun Zeng
2016-01-01
Full Text Available We present a new approach for the analysis of iterative peeling decoding recovery algorithms in the context of Low-Density Parity-Check (LDPC codes and compressed sensing. The iterative recovery algorithm is particularly interesting for its low measurement cost and low computational complexity. The asymptotic analysis can track the evolution of the fraction of unrecovered signal elements in each iteration, which is similar to the well-known density evolution analysis in the context of LDPC decoding algorithm. Our analysis shows that there exists a threshold on the density factor; if under this threshold, the recovery algorithm is successful; otherwise it will fail. Simulation results are also provided for verifying the agreement between the proposed asymptotic analysis and recovery algorithm. Compared with existing works of peeling decoding algorithm, focusing on the failure probability of the recovery algorithm, our proposed approach gives accurate evolution of performance with different parameters of measurement matrices and is easy to implement. We also show that the peeling decoding algorithm performs better than other schemes based on LDPC codes.
Construction of Protograph LDPC Codes with Linear Minimum Distance
Divsalar, Dariush; Dolinar, Sam; Jones, Christopher
2006-01-01
A construction method for protograph-based LDPC codes that simultaneously achieve low iterative decoding threshold and linear minimum distance is proposed. We start with a high-rate protograph LDPC code with variable node degrees of at least 3. Lower rate codes are obtained by splitting check nodes and connecting them by degree-2 nodes. This guarantees the linear minimum distance property for the lower-rate codes. Excluding checks connected to degree-1 nodes, we show that the number of degree-2 nodes should be at most one less than the number of checks for the protograph LDPC code to have linear minimum distance. Iterative decoding thresholds are obtained by using the reciprocal channel approximation. Thresholds are lowered by using either precoding or at least one very high-degree node in the base protograph. A family of high- to low-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented. FPGA simulation results for a few example codes show that the proposed codes perform as predicted.
An Area-Efficient Reconfigurable LDPC Decoder with Conflict Resolution
Zhou, Changsheng; Huang, Yuebin; Huang, Shuangqu; Chen, Yun; Zeng, Xiaoyang
Based on Turbo-Decoding Message-Passing (TDMP) and Normalized Min-Sum (NMS) algorithm, an area efficient LDPC decoder that supports both structured and unstructured LDPC codes is proposed in this paper. We introduce a solution to solve the memory access conflict problem caused by TDMP algorithm. We also arrange the main timing schedule carefully to handle the operations of our solution while avoiding much additional hardware consumption. To reduce the memory bits needed, the extrinsic message storing strategy is also optimized. Besides the extrinsic message recover and the accumulate operation are merged together. To verify our architecture, a LDPC decoder that supports both China Multimedia Mobile Broadcasting (CMMB) and Digital Terrestrial/ Television Multimedia Broadcasting (DTMB) standards is developed using SMIC 0.13µm standard CMOS process. The core area is 4.75mm2 and the maximum operating clock frequency is 200MHz. The estimated power consumption is 48.4mW at 25MHz for CMMB and 130.9mW at 50MHz for DTMB with 5 iterations and 1.2V supply.
LDPC and SHA based iris recognition for image authentication
Directory of Open Access Journals (Sweden)
K. Seetharaman
2012-11-01
Full Text Available We introduce a novel way to authenticate an image using Low Density Parity Check (LDPC and Secure Hash Algorithm (SHA based iris recognition method with reversible watermarking scheme, which is based on Integer Wavelet Transform (IWT and threshold embedding technique. The parity checks and parity matrix of LDPC encoding and cancellable biometrics i.e., hash string of unique iris code from SHA-512 are embedded into an image for authentication purpose using reversible watermarking scheme based on IWT and threshold embedding technique. Simply by reversing the embedding process, the original image, parity checks, parity matrix and SHA-512 hash are extracted back from watermarked-image. For authentication, the new hash string produced by employing SHA-512 on error corrected iris code from live person is compared with hash string extracted from watermarked-image. The LDPC code reduces the hamming distance for genuine comparisons by a larger amount than for the impostor comparisons. This results in better separation between genuine and impostor users which improves the authentication performance. Security of this scheme is very high due to the security complexity of SHA-512, which is 2256 under birthday attack. Experimental results show that this approach can assure more accurate authentication with a low false rejection or false acceptance rate and outperforms the prior arts in terms of PSNR.
Bellver-Cebreros, Consuelo; Rodriguez-Danta, Marcelo
2009-01-01
An apparently unnoticed analogy between the torque-free motion of a rotating rigid body about a fixed point and the propagation of light in anisotropic media is stated. First, a new plane construction for visualizing this torque-free motion is proposed. This method uses an intrinsic representation alternative to angular momentum and independent of…
Joint design of QC-LDPC codes for coded cooperation system with joint iterative decoding
Zhang, Shunwai; Yang, Fengfan; Tang, Lei; Ejaz, Saqib; Luo, Lin; Maharaj, B. T.
2016-03-01
In this paper, we investigate joint design of quasi-cyclic low-density-parity-check (QC-LDPC) codes for coded cooperation system with joint iterative decoding in the destination. First, QC-LDPC codes based on the base matrix and exponent matrix are introduced, and then we describe two types of girth-4 cycles in QC-LDPC codes employed by the source and relay. In the equivalent parity-check matrix corresponding to the jointly designed QC-LDPC codes employed by the source and relay, all girth-4 cycles including both type I and type II are cancelled. Theoretical analysis and numerical simulations show that the jointly designed QC-LDPC coded cooperation well combines cooperation gain and channel coding gain, and outperforms the coded non-cooperation under the same conditions. Furthermore, the bit error rate performance of the coded cooperation employing jointly designed QC-LDPC codes is better than those of random LDPC codes and separately designed QC-LDPC codes over AWGN channels.
Constructing LDPC Codes from Loop-Free Encoding Modules
Divsalar, Dariush; Dolinar, Samuel; Jones, Christopher; Thorpe, Jeremy; Andrews, Kenneth
2009-01-01
A method of constructing certain low-density parity-check (LDPC) codes by use of relatively simple loop-free coding modules has been developed. The subclasses of LDPC codes to which the method applies includes accumulate-repeat-accumulate (ARA) codes, accumulate-repeat-check-accumulate codes, and the codes described in Accumulate-Repeat-Accumulate-Accumulate Codes (NPO-41305), NASA Tech Briefs, Vol. 31, No. 9 (September 2007), page 90. All of the affected codes can be characterized as serial/parallel (hybrid) concatenations of such relatively simple modules as accumulators, repetition codes, differentiators, and punctured single-parity check codes. These are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. These codes can also be characterized as hybrid turbolike codes that have projected graph or protograph representations (for example see figure); these characteristics make it possible to design high-speed iterative decoders that utilize belief-propagation algorithms. The present method comprises two related submethods for constructing LDPC codes from simple loop-free modules with circulant permutations. The first submethod is an iterative encoding method based on the erasure-decoding algorithm. The computations required by this method are well organized because they involve a parity-check matrix having a block-circulant structure. The second submethod involves the use of block-circulant generator matrices. The encoders of this method are very similar to those of recursive convolutional codes. Some encoders according to this second submethod have been implemented in a small field-programmable gate array that operates at a speed of 100 megasymbols per second. By use of density evolution (a computational- simulation technique for analyzing performances of LDPC codes), it has been shown through some examples that as the block size goes to infinity, low iterative decoding thresholds close to
New Technique for Improving Performance of LDPC Codes in the Presence of Trapping Sets
Directory of Open Access Journals (Sweden)
Mohamed Adnan Landolsi
2008-06-01
Full Text Available Trapping sets are considered the primary factor for degrading the performance of low-density parity-check (LDPC codes in the error-floor region. The effect of trapping sets on the performance of an LDPC code becomes worse as the code size decreases. One approach to tackle this problem is to minimize trapping sets during LDPC code design. However, while trapping sets can be reduced, their complete elimination is infeasible due to the presence of cycles in the underlying LDPC code bipartite graph. In this work, we introduce a new technique based on trapping sets neutralization to minimize the negative effect of trapping sets under belief propagation (BP decoding. Simulation results for random, progressive edge growth (PEG and MacKay LDPC codes demonstrate the effectiveness of the proposed technique. The hardware cost of the proposed technique is also shown to be minimal.
Directory of Open Access Journals (Sweden)
Tian Zhou Xu
2010-01-01
Full Text Available Using the fixed point methods, we prove the generalized Hyers-Ulam stability of the general mixed additive-quadratic-cubic-quartic functional equation f(x+ky+f(x−ky=k2f(x+y+k2f(x−y+2(1−k2f(x+((k4−k2/12[f(2y+f(−2y−4f(y−4f(−y] for a fixed integer k with k≠0,±1 in non-Archimedean normed spaces.
Directory of Open Access Journals (Sweden)
Manish Jain
2013-01-01
Full Text Available We establish the existence and uniqueness of coupled common fixed point for symmetric (φ,ψ-contractive mappings in the framework of ordered G-metric spaces. Present work extends, generalize, and enrich the recent results of Choudhury and Maity (2011, Nashine (2012, and Mohiuddine and Alotaibi (2012, thereby, weakening the involved contractive conditions. Our theoretical results are accompanied by suitable examples and an application to integral equations.
An LDPC decoder architecture for wireless sensor network applications.
Biroli, Andrea Dario Giancarlo; Martina, Maurizio; Masera, Guido
2012-01-01
The pervasive use of wireless sensors in a growing spectrum of human activities reinforces the need for devices with low energy dissipation. In this work, coded communication between a couple of wireless sensor devices is considered as a method to reduce the dissipated energy per transmitted bit with respect to uncoded communication. Different Low Density Parity Check (LDPC) codes are considered to this purpose and post layout results are shown for a low-area low-energy decoder, which offers percentage energy savings with respect to the uncoded solution in the range of 40%-80%, depending on considered environment, distance and bit error rate.
An LDPC Decoder Architecture for Wireless Sensor Network Applications
Giancarlo Biroli, Andrea Dario; Martina, Maurizio; Masera, Guido
2012-01-01
The pervasive use of wireless sensors in a growing spectrum of human activities reinforces the need for devices with low energy dissipation. In this work, coded communication between a couple of wireless sensor devices is considered as a method to reduce the dissipated energy per transmitted bit with respect to uncoded communication. Different Low Density Parity Check (LDPC) codes are considered to this purpose and post layout results are shown for a low-area low-energy decoder, which offers percentage energy savings with respect to the uncoded solution in the range of 40%–80%, depending on considered environment, distance and bit error rate. PMID:22438724
Bounded-Angle Iterative Decoding of LDPC Codes
Dolinar, Samuel; Andrews, Kenneth; Pollara, Fabrizio; Divsalar, Dariush
2009-01-01
Bounded-angle iterative decoding is a modified version of conventional iterative decoding, conceived as a means of reducing undetected-error rates for short low-density parity-check (LDPC) codes. For a given code, bounded-angle iterative decoding can be implemented by means of a simple modification of the decoder algorithm, without redesigning the code. Bounded-angle iterative decoding is based on a representation of received words and code words as vectors in an n-dimensional Euclidean space (where n is an integer).
The serial message-passing schedule for LDPC decoding algorithms
Liu, Mingshan; Liu, Shanshan; Zhou, Yuan; Jiang, Xue
2015-12-01
The conventional message-passing schedule for LDPC decoding algorithms is the so-called flooding schedule. It has the disadvantage that the updated messages cannot be used until next iteration, thus reducing the convergence speed . In this case, the Layered Decoding algorithm (LBP) based on serial message-passing schedule is proposed. In this paper the decoding principle of LBP algorithm is briefly introduced, and then proposed its two improved algorithms, the grouped serial decoding algorithm (Grouped LBP) and the semi-serial decoding algorithm .They can improve LBP algorithm's decoding speed while maintaining a good decoding performance.
Design LDPC Codes without Cycles of Length 4 and 6
Directory of Open Access Journals (Sweden)
Kiseon Kim
2008-04-01
Full Text Available We present an approach for constructing LDPC codes without cycles of length 4 and 6. Firstly, we design 3 submatrices with different shifting functions given by the proposed schemes, then combine them into the matrix specified by the proposed approach, and, finally, expand the matrix into a desired parity-check matrix using identity matrices and cyclic shift matrices of the identity matrices. The simulation result in AWGN channel verifies that the BER of the proposed code is close to those of Mackay's random codes and Tanner's QC codes, and the good BER performance of the proposed can remain at high code rates.
Min-Max decoding for non binary LDPC codes
Savin, Valentin
2008-01-01
Iterative decoding of non-binary LDPC codes is currently performed using either the Sum-Product or the Min-Sum algorithms or slightly different versions of them. In this paper, several low-complexity quasi-optimal iterative algorithms are proposed for decoding non-binary codes. The Min-Max algorithm is one of them and it has the benefit of two possible LLR domain implementations: a standard implementation, whose complexity scales as the square of the Galois field's cardinality and a reduced c...
Directory of Open Access Journals (Sweden)
Wiyada Kumam
2016-05-01
Full Text Available In this article, we introduce a new multi-step iteration for approximating a common fixed point of a finite class of multi-valued Bregman relatively nonexpansive mappings in the setting of reflexive Banach spaces. We prove a strong convergence theorem for the proposed iterative algorithm under certain hypotheses. Additionally, we also use our results for the solution of variational inequality problems and to find the zero points of maximal monotone operators. The theorems furnished in this work are new and well-established and generalize many well-known recent research works in this field.
Mutiple LDPC Decoding using Bitplane Correlation for Transform Domain Wyner-Ziv Video Coding
DEFF Research Database (Denmark)
Luong, Huynh Van; Huang, Xin; Forchhammer, Søren
2011-01-01
Distributed video coding (DVC) is an emerging video coding paradigm for systems which fully or partly exploit the source statistics at the decoder to reduce the computational burden at the encoder. This paper considers a Low Density Parity Check (LDPC) based Transform Domain Wyner-Ziv (TDWZ) video...... codec. To improve the LDPC coding performance in the context of TDWZ, this paper proposes a Wyner-Ziv video codec using bitplane correlation through multiple parallel LDPC decoding. The proposed scheme utilizes inter bitplane correlation to enhance the bitplane decoding performance. Experimental results...
Performance Analysis of Faulty Gallager-B Decoding of QC-LDPC Codes with Applications
Directory of Open Access Journals (Sweden)
O. Al Rasheed
2014-06-01
Full Text Available In this paper we evaluate the performance of Gallager-B algorithm, used for decoding low-density parity-check (LDPC codes, under unreliable message computation. Our analysis is restricted to LDPC codes constructed from circular matrices (QC-LDPC codes. Using Monte Carlo simulation we investigate the effects of different code parameters on coding system performance, under a binary symmetric communication channel and independent transient faults model. One possible application of the presented analysis in designing memory architecture with unreliable components is considered.
Performance analysis of LDPC codes on OOK terahertz wireless channels
Chun, Liu; Chang, Wang; Jun-Cheng, Cao
2016-02-01
Atmospheric absorption, scattering, and scintillation are the major causes to deteriorate the transmission quality of terahertz (THz) wireless communications. An error control coding scheme based on low density parity check (LDPC) codes with soft decision decoding algorithm is proposed to improve the bit-error-rate (BER) performance of an on-off keying (OOK) modulated THz signal through atmospheric channel. The THz wave propagation characteristics and channel model in atmosphere is set up. Numerical simulations validate the great performance of LDPC codes against the atmospheric fading and demonstrate the huge potential in future ultra-high speed beyond Gbps THz communications. Project supported by the National Key Basic Research Program of China (Grant No. 2014CB339803), the National High Technology Research and Development Program of China (Grant No. 2011AA010205), the National Natural Science Foundation of China (Grant Nos. 61131006, 61321492, and 61204135), the Major National Development Project of Scientific Instrument and Equipment (Grant No. 2011YQ150021), the National Science and Technology Major Project (Grant No. 2011ZX02707), the International Collaboration and Innovation Program on High Mobility Materials Engineering of the Chinese Academy of Sciences, and the Shanghai Municipal Commission of Science and Technology (Grant No. 14530711300).
Short-Block Protograph-Based LDPC Codes
Divsalar, Dariush; Dolinar, Samuel; Jones, Christopher
2010-01-01
Short-block low-density parity-check (LDPC) codes of a special type are intended to be especially well suited for potential applications that include transmission of command and control data, cellular telephony, data communications in wireless local area networks, and satellite data communications. [In general, LDPC codes belong to a class of error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels.] The codes of the present special type exhibit low error floors, low bit and frame error rates, and low latency (in comparison with related prior codes). These codes also achieve low maximum rate of undetected errors over all signal-to-noise ratios, without requiring the use of cyclic redundancy checks, which would significantly increase the overhead for short blocks. These codes have protograph representations; this is advantageous in that, for reasons that exceed the scope of this article, the applicability of protograph representations makes it possible to design highspeed iterative decoders that utilize belief- propagation algorithms.
Analysis of error floor of LDPC codes under LP decoding over the BSC
Energy Technology Data Exchange (ETDEWEB)
Chertkov, Michael [Los Alamos National Laboratory; Chilappagari, Shashi [UNIV OF AZ; Vasic, Bane [UNIV OF AZ; Stepanov, Mikhail [UNIV OF AZ
2009-01-01
We consider linear programming (LP) decoding of a fixed low-density parity-check (LDPC) code over the binary symmetric channel (BSC). The LP decoder fails when it outputs a pseudo-codeword which is not a codeword. We propose an efficient algorithm termed the instanton search algorithm (ISA) which, given a random input, generates a set of flips called the BSC-instanton and prove that: (a) the LP decoder fails for any set of flips with support vector including an instanton; (b) for any input, the algorithm outputs an instanton in the number of steps upper-bounded by twice the number of flips in the input. We obtain the number of unique instantons of different sizes by running the ISA sufficient number of times. We then use the instanton statistics to predict the performance of the LP decoding over the BSC in the error floor region. We also propose an efficient semi-analytical method to predict the performance of LP decoding over a large range of transition probabilities of the BSC.
A Low-Complexity Euclidean Orthogonal LDPC Architecture for Low Power Applications
Directory of Open Access Journals (Sweden)
M. Revathy
2015-01-01
Full Text Available Low-density parity-check (LDPC codes have been implemented in latest digital video broadcasting, broadband wireless access (WiMax, and fourth generation of wireless standards. In this paper, we have proposed a high efficient low-density parity-check code (LDPC decoder architecture for low power applications. This study also considers the design and analysis of check node and variable node units and Euclidean orthogonal generator in LDPC decoder architecture. The Euclidean orthogonal generator is used to reduce the error rate of the proposed LDPC architecture, which can be incorporated between check and variable node architecture. This proposed decoder design is synthesized on Xilinx 9.2i platform and simulated using Modelsim, which is targeted to 45 nm devices. Synthesis report proves that the proposed architecture greatly reduces the power consumption and hardware utilizations on comparing with different conventional architectures.
FPGA implementation of high-performance QC-LDPC decoder for optical communications
Zou, Ding; Djordjevic, Ivan B.
2015-01-01
Forward error correction is as one of the key technologies enabling the next-generation high-speed fiber optical communications. Quasi-cyclic (QC) low-density parity-check (LDPC) codes have been considered as one of the promising candidates due to their large coding gain performance and low implementation complexity. In this paper, we present our designed QC-LDPC code with girth 10 and 25% overhead based on pairwise balanced design. By FPGAbased emulation, we demonstrate that the 5-bit soft-decision LDPC decoder can achieve 11.8dB net coding gain with no error floor at BER of 10-15 avoiding using any outer code or post-processing method. We believe that the proposed single QC-LDPC code is a promising solution for 400Gb/s optical communication systems and beyond.
A Low-Complexity Euclidean Orthogonal LDPC Architecture for Low Power Applications.
Revathy, M; Saravanan, R
2015-01-01
Low-density parity-check (LDPC) codes have been implemented in latest digital video broadcasting, broadband wireless access (WiMax), and fourth generation of wireless standards. In this paper, we have proposed a high efficient low-density parity-check code (LDPC) decoder architecture for low power applications. This study also considers the design and analysis of check node and variable node units and Euclidean orthogonal generator in LDPC decoder architecture. The Euclidean orthogonal generator is used to reduce the error rate of the proposed LDPC architecture, which can be incorporated between check and variable node architecture. This proposed decoder design is synthesized on Xilinx 9.2i platform and simulated using Modelsim, which is targeted to 45 nm devices. Synthesis report proves that the proposed architecture greatly reduces the power consumption and hardware utilizations on comparing with different conventional architectures.
Optical LDPC decoders for beyond 100 Gbits/s optical transmission.
Djordjevic, Ivan B; Xu, Lei; Wang, Ting
2009-05-01
We present an optical low-density parity-check (LDPC) decoder suitable for implementation above 100 Gbits/s, which provides large coding gains when based on large-girth LDPC codes. We show that a basic building block, the probabilities multiplier circuit, can be implemented using a Mach-Zehnder interferometer, and we propose corresponding probabilistic-domain sum-product algorithm (SPA). We perform simulations of a fully parallel implementation employing girth-10 LDPC codes and proposed SPA. The girth-10 LDPC(24015,19212) code of the rate of 0.8 outperforms the BCH(128,113)xBCH(256,239) turbo-product code of the rate of 0.82 by 0.91 dB (for binary phase-shift keying at 100 Gbits/s and a bit error rate of 10(-9)), and provides a net effective coding gain of 10.09 dB.
LDPC-coded orbital angular momentum (OAM) modulation for free-space optical communication.
Djordjevic, Ivan B; Arabaci, Murat
2010-11-22
An orbital angular momentum (OAM) based LDPC-coded modulation scheme suitable for use in FSO communication is proposed. We demonstrate that the proposed scheme can operate under strong atmospheric turbulence regime and enable 100 Gb/s optical transmission while employing 10 Gb/s components. Both binary and nonbinary LDPC-coded OAM modulations are studied. In addition to providing better BER performance, the nonbinary LDPC-coded modulation reduces overall decoder complexity and latency. The nonbinary LDPC-coded OAM modulation provides a net coding gain of 9.3 dB at the BER of 10(-8). The maximum-ratio combining scheme outperforms the corresponding equal-gain combining scheme by almost 2.5 dB.
Encoding of QC-LDPC Codes of Rank Deficient Parity Matrix
Directory of Open Access Journals (Sweden)
Mohammed Kasim Mohammed Al-Haddad
2016-05-01
Full Text Available the encoding of long low density parity check (LDPC codes presents a challenge compared to its decoding. The Quasi Cyclic (QC LDPC codes offer the advantage for reducing the complexity for both encoding and decoding due to its QC structure. Most QC-LDPC codes have rank deficient parity matrix and this introduces extra complexity over the codes with full rank parity matrix. In this paper an encoding scheme of QC-LDPC codes is presented that is suitable for codes with full rank parity matrix and rank deficient parity matrx. The extra effort required by the codes with rank deficient parity matrix over the codes of full rank parity matrix is investigated.
Balle, C; Fortescue-Beck, E; Vauthier, N
2013-01-01
The cernox™ sensor is delivered with a 3-point resistance versus temperature cal-ibration that permits the construction of an individual interpolation table by using the data in the CERN thermometer database. For instance at the 4.2 K point, the individual calibration and the manufacturer data are within +/-0.1 K for 99.39% of a sample population of about 5700 sensors. Preliminary results also indicate that accuracies of 0.1 K and 1 K can be obtained below respectively 5 K and 77 K.
LDPC code decoding adapted to the precoded partial response magnetic recording channels
International Nuclear Information System (INIS)
Lee, Jun; Kim, Kyuyong; Lee, Jaejin; Yang, Gijoo
2004-01-01
We propose a signal processing technique using LDPC (low-density parity-check) code instead of PRML (partial response maximum likelihood) system for the longitudinal magnetic recording channel. The scheme is designed by the precoder admitting level detection at the receiver-end and modifying the likelihood function for LDPC code decoding. The scheme can be collaborated with other decoder for turbo-like systems. The proposed algorithm can contribute to improve the performance of the conventional turbo-like systems
Batshon, Hussam G; Djordjevic, Ivan; Schmidt, Ted
2010-09-13
We propose a subcarrier-multiplexed four-dimensional LDPC bit-interleaved coded modulation scheme that is capable of achieving beyond 480 Gb/s single-channel transmission rate over optical channels. Subcarrier-multiplexed four-dimensional LDPC coded modulation scheme outperforms the corresponding dual polarization schemes by up to 4.6 dB in OSNR at BER 10(-8).
LDPC code decoding adapted to the precoded partial response magnetic recording channels
Energy Technology Data Exchange (ETDEWEB)
Lee, Jun E-mail: leejun28@sait.samsung.co.kr; Kim, Kyuyong; Lee, Jaejin; Yang, Gijoo
2004-05-01
We propose a signal processing technique using LDPC (low-density parity-check) code instead of PRML (partial response maximum likelihood) system for the longitudinal magnetic recording channel. The scheme is designed by the precoder admitting level detection at the receiver-end and modifying the likelihood function for LDPC code decoding. The scheme can be collaborated with other decoder for turbo-like systems. The proposed algorithm can contribute to improve the performance of the conventional turbo-like systems.
A novel construction method of QC-LDPC codes based on CRT for optical communications
Yuan, Jian-guo; Liang, Meng-qi; Wang, Yong; Lin, Jin-zhao; Pang, Yu
2016-05-01
A novel construction method of quasi-cyclic low-density parity-check (QC-LDPC) codes is proposed based on Chinese remainder theory (CRT). The method can not only increase the code length without reducing the girth, but also greatly enhance the code rate, so it is easy to construct a high-rate code. The simulation results show that at the bit error rate ( BER) of 10-7, the net coding gain ( NCG) of the regular QC-LDPC(4 851, 4 546) code is respectively 2.06 dB, 1.36 dB, 0.53 dB and 0.31 dB more than those of the classic RS(255, 239) code in ITU-T G.975, the LDPC(32 640, 30 592) code in ITU-T G.975.1, the QC-LDPC(3 664, 3 436) code constructed by the improved combining construction method based on CRT and the irregular QC-LDPC(3 843, 3 603) code constructed by the construction method based on the Galois field ( GF( q)) multiplicative group. Furthermore, all these five codes have the same code rate of 0.937. Therefore, the regular QC-LDPC(4 851, 4 546) code constructed by the proposed construction method has excellent error-correction performance, and can be more suitable for optical transmission systems.
Differentially Encoded LDPC Codes—Part II: General Case and Code Optimization
Directory of Open Access Journals (Sweden)
Li (Tiffany Jing
2008-01-01
Full Text Available This two-part series of papers studies the theory and practice of differentially encoded low-density parity-check (DE-LDPC codes, especially in the context of noncoherent detection. Part I showed that a special class of DE-LDPC codes, product accumulate codes, perform very well with both coherent and noncoherent detections. The analysis here reveals that a conventional LDPC code, however, is not fitful for differential coding and does not, in general, deliver a desirable performance when detected noncoherently. Through extrinsic information transfer (EXIT analysis and a modified "convergence-constraint" density evolution (DE method developed here, we provide a characterization of the type of LDPC degree profiles that work in harmony with differential detection (or a recursive inner code in general, and demonstrate how to optimize these LDPC codes. The convergence-constraint method provides a useful extension to the conventional "threshold-constraint" method, and can match an outer LDPC code to any given inner code with the imperfectness of the inner decoder taken into consideration.
A novel QC-LDPC code based on the finite field multiplicative group for optical communications
Yuan, Jian-guo; Xu, Liang; Tong, Qing-zhen
2013-09-01
A novel construction method of quasi-cyclic low-density parity-check (QC-LDPC) code is proposed based on the finite field multiplicative group, which has easier construction, more flexible code-length code-rate adjustment and lower encoding/decoding complexity. Moreover, a regular QC-LDPC(5334,4962) code is constructed. The simulation results show that the constructed QC-LDPC(5334,4962) code can gain better error correction performance under the condition of the additive white Gaussian noise (AWGN) channel with iterative decoding sum-product algorithm (SPA). At the bit error rate (BER) of 10-6, the net coding gain (NCG) of the constructed QC-LDPC(5334,4962) code is 1.8 dB, 0.9 dB and 0.2 dB more than that of the classic RS(255,239) code in ITU-T G.975, the LDPC(32640,30592) code in ITU-T G.975.1 and the SCG-LDPC(3969,3720) code constructed by the random method, respectively. So it is more suitable for optical communication systems.
Directory of Open Access Journals (Sweden)
Liu Min
2010-01-01
Full Text Available In this paper, we introduce a hybrid iterative scheme for finding a common element of the set of solutions for a system of mixed equilibrium problems, the set of common fixed points for a nonexpansive semigroup and the set of solutions of the quasi-variational inclusion problem with multi-valued maximal monotone mappings and inverse-strongly monotone mappings in a Hilbert space. Under suitable conditions, some strong convergence theorems are proved. Our results extend some recent results in the literature.
Directory of Open Access Journals (Sweden)
V. S. Serov
2010-01-01
Full Text Available A method based on the Banach fixed-point theorem is proposed for obtaining certain solutions (TE-polarized electromagnetic waves of the Helmholtz equation describing the reflection and transmission of a plane monochromatic wave at a nonlinear lossy dielectric film situated between two lossless linear semiinfinite media. All three media are assumed to be nonmagnetic and isotropic. The permittivity of the film is modelled by a continuously differentiable function of the transverse coordinate with a saturating Kerr nonlinearity. It is shown that the solution of the Helmholtz equation exists in form of a uniformly convergent sequence of iterations of the equivalent Volterra integral equation. Numerical results are presented.
Yuan, Jian-guo; Liang, Meng-qi; Wang, Yong; Lin, Jin-zhao; Pang, Yu
2016-03-01
A novel lower-complexity construction scheme of quasi-cyclic low-density parity-check (QC-LDPC) codes for optical transmission systems is proposed based on the structure of the parity-check matrix for the Richardson-Urbanke (RU) algorithm. Furthermore, a novel irregular QC-LDPC(4 288, 4 020) code with high code-rate of 0.937 is constructed by this novel construction scheme. The simulation analyses show that the net coding gain ( NCG) of the novel irregular QC-LDPC(4 288,4 020) code is respectively 2.08 dB, 1.25 dB and 0.29 dB more than those of the classic RS(255, 239) code, the LDPC(32 640, 30 592) code and the irregular QC-LDPC(3 843, 3 603) code at the bit error rate ( BER) of 10-6. The irregular QC-LDPC(4 288, 4 020) code has the lower encoding/decoding complexity compared with the LDPC(32 640, 30 592) code and the irregular QC-LDPC(3 843, 3 603) code. The proposed novel QC-LDPC(4 288, 4 020) code can be more suitable for the increasing development requirements of high-speed optical transmission systems.
Joint Carrier-Phase Synchronization and LDPC Decoding
Simon, Marvin; Valles, Esteban
2009-01-01
A method has been proposed to increase the degree of synchronization of a radio receiver with the phase of a suppressed carrier signal modulated with a binary- phase-shift-keying (BPSK) or quaternary- phase-shift-keying (QPSK) signal representing a low-density parity-check (LDPC) code. This method is an extended version of the method described in Using LDPC Code Constraints to Aid Recovery of Symbol Timing (NPO-43112), NASA Tech Briefs, Vol. 32, No. 10 (October 2008), page 54. Both methods and the receiver architectures in which they would be implemented belong to a class of timing- recovery methods and corresponding receiver architectures characterized as pilotless in that they do not require transmission and reception of pilot signals. The proposed method calls for the use of what is known in the art as soft decision feedback to remove the modulation from a replica of the incoming signal prior to feeding this replica to a phase-locked loop (PLL) or other carrier-tracking stage in the receiver. Soft decision feedback refers to suitably processed versions of intermediate results of iterative computations involved in the LDPC decoding process. Unlike a related prior method in which hard decision feedback (the final sequence of decoded symbols) is used to remove the modulation, the proposed method does not require estimation of the decoder error probability. In a basic digital implementation of the proposed method, the incoming signal (having carrier phase theta theta (sub c) plus noise would first be converted to inphase (I) and quadrature (Q) baseband signals by mixing it with I and Q signals at the carrier frequency [wc/(2 pi)] generated by a local oscillator. The resulting demodulated signals would be processed through one-symbol-period integrate and- dump filters, the outputs of which would be sampled and held, then multiplied by a soft-decision version of the baseband modulated signal. The resulting I and Q products consist of terms proportional to the cosine
Directory of Open Access Journals (Sweden)
F. O. Isiogugu
2016-01-01
Full Text Available The strong convergence of a hybrid algorithm to a common element of the fixed point sets of multivalued strictly pseudocontractive-type mappings and the set of solutions of an equilibrium problem in Hilbert spaces is obtained using a strict fixed point set condition. The obtained results improve, complement, and extend the results on multivalued and single-valued mappings in the contemporary literature.
Implementation of Layered Decoding Architecture for LDPC Code using Layered Min-Sum Algorithm
Directory of Open Access Journals (Sweden)
Sandeep Kakde
2017-12-01
Full Text Available For binary field and long code lengths, Low Density Parity Check (LDPC code approaches Shannon limit performance. LDPC codes provide remarkable error correction performance and therefore enlarge the design space for communication systems.In this paper, we have compare different digital modulation techniques and found that BPSK modulation technique is better than other modulation techniques in terms of BER. It also gives error performance of LDPC decoder over AWGN channel using Min-Sum algorithm. VLSI Architecture is proposed which uses the value re-use property of min-sum algorithm and gives high throughput. The proposed work has been implemented and tested on Xilinx Virtex 5 FPGA. The MATLAB result of LDPC decoder for low bit error rate (BER gives bit error rate in the range of 10-1 to 10-3.5 at SNR=1 to 2 for 20 no of iterations. So it gives good bit error rate performance. The latency of the parallel design of LDPC decoder has also reduced. It has accomplished 141.22 MHz maximum frequency and throughput of 2.02 Gbps while consuming less area of the design.
Power Allocation Optimization: Linear Precoding Adapted to NB-LDPC Coded MIMO Transmission
Directory of Open Access Journals (Sweden)
Tarek Chehade
2015-01-01
Full Text Available In multiple-input multiple-output (MIMO transmission systems, the channel state information (CSI at the transmitter can be used to add linear precoding to the transmitted signals in order to improve the performance and the reliability of the transmission system. This paper investigates how to properly join precoded closed-loop MIMO systems and nonbinary low density parity check (NB-LDPC. The q elements in the Galois field, GF(q, are directly mapped to q transmit symbol vectors. This allows NB-LDPC codes to perfectly fit with a MIMO precoding scheme, unlike binary LDPC codes. The new transmission model is detailed and studied for several linear precoders and various designed LDPC codes. We show that NB-LDPC codes are particularly well suited to be jointly used with precoding schemes based on the maximization of the minimum Euclidean distance (max-dmin criterion. These results are theoretically supported by extrinsic information transfer (EXIT analysis and are confirmed by numerical simulations.
Braun, Jens; Leonhardt, Marc; Pospiech, Martin
2018-04-01
Nambu-Jona-Lasinio-type models are often employed as low-energy models for the theory of the strong interaction to analyze its phase structure at finite temperature and quark chemical potential. In particular, at low temperature and large chemical potential, where the application of fully first-principles approaches is currently difficult at best, this class of models still plays a prominent role in guiding our understanding of the dynamics of dense strong-interaction matter. In this work, we consider a Fierz-complete version of the Nambu-Jona-Lasinio model with two massless quark flavors and study its renormalization group flow and fixed-point structure at leading order of the derivative expansion of the effective action. Sum rules for the various four-quark couplings then allow us to monitor the strength of the breaking of the axial UA(1 ) symmetry close to and above the phase boundary. We find that the dynamics in the ten-dimensional Fierz-complete space of four-quark couplings can only be reduced to a one-dimensional space associated with the scalar-pseudoscalar coupling in the strict large-Nc limit. Still, the interacting fixed point associated with this one-dimensional subspace appears to govern the dynamics at small quark chemical potential even beyond the large-Nc limit. At large chemical potential, corrections beyond the large-Nc limit become important, and the dynamics is dominated by diquarks, favoring the formation of a chirally symmetric diquark condensate. In this regime, our study suggests that the phase boundary is shifted to higher temperatures when a Fierz-complete set of four-quark interactions is considered.
He, Jing; Dai, Min; Chen, Qinghui; Deng, Rui; Xiang, Changqing; Chen, Lin
2017-07-01
In this paper, an effective bit-loading combined with adaptive LDPC code rate algorithm is proposed and investigated in software reconfigurable multiband UWB over fiber system. To compensate the power fading and chromatic dispersion for the high frequency of multiband OFDM UWB signal transmission over standard single mode fiber (SSMF), a Mach-Zehnder modulator (MZM) with negative chirp parameter is utilized. In addition, the negative power penalty of -1 dB for 128 QAM multiband OFDM UWB signal are measured at the hard-decision forward error correction (HD-FEC) limitation of 3.8 × 10-3 after 50 km SSMF transmission. The experimental results show that, compared to the fixed coding scheme with the code rate of 75%, the signal-to-noise (SNR) is improved by 2.79 dB for 128 QAM multiband OFDM UWB system after 100 km SSMF transmission using ALCR algorithm. Moreover, by employing bit-loading combined with ALCR algorithm, the bit error rate (BER) performance of system can be further promoted effectively. The simulation results present that, at the HD-FEC limitation, the value of Q factor is improved by 3.93 dB at the SNR of 19.5 dB over 100 km SSMF transmission, compared to the fixed modulation with uncoded scheme at the same spectrum efficiency (SE).
Weighted-Bit-Flipping-Based Sequential Scheduling Decoding Algorithms for LDPC Codes
Directory of Open Access Journals (Sweden)
Qing Zhu
2013-01-01
Full Text Available Low-density parity-check (LDPC codes can be applied in a lot of different scenarios such as video broadcasting and satellite communications. LDPC codes are commonly decoded by an iterative algorithm called belief propagation (BP over the corresponding Tanner graph. The original BP updates all the variable-nodes simultaneously, followed by all the check-nodes simultaneously as well. We propose a sequential scheduling algorithm based on weighted bit-flipping (WBF algorithm for the sake of improving the convergence speed. Notoriously, WBF is a low-complexity and simple algorithm. We combine it with BP to obtain advantages of these two algorithms. Flipping function used in WBF is borrowed to determine the priority of scheduling. Simulation results show that it can provide a good tradeoff between FER performance and computation complexity for short-length LDPC codes.
High Girth Column-Weight-Two LDPC Codes Based on Distance Graphs
Directory of Open Access Journals (Sweden)
Gabofetswe Malema
2007-01-01
Full Text Available LDPC codes of column weight of two are constructed from minimal distance graphs or cages. Distance graphs are used to represent LDPC code matrices such that graph vertices that represent rows and edges are columns. The conversion of a distance graph into matrix form produces an adjacency matrix with column weight of two and girth double that of the graph. The number of 1's in each row (row weight is equal to the degree of the corresponding vertex. By constructing graphs with different vertex degrees, we can vary the rate of corresponding LDPC code matrices. Cage graphs are used as examples of distance graphs to design codes with different girths and rates. Performance of obtained codes depends on girth and structure of the corresponding distance graphs.
Experimental study of non-binary LDPC coding for long-haul coherent optical QPSK transmissions.
Zhang, Shaoliang; Arabaci, Murat; Yaman, Fatih; Djordjevic, Ivan B; Xu, Lei; Wang, Ting; Inada, Yoshihisa; Ogata, Takaaki; Aoki, Yasuhiro
2011-09-26
The performance of rate-0.8 4-ary LDPC code has been studied in a 50 GHz-spaced 40 Gb/s DWDM system with PDM-QPSK modulation. The net effective coding gain of 10 dB is obtained at BER of 10(-6). With the aid of time-interleaving polarization multiplexing and MAP detection, 10,560 km transmission over legacy dispersion managed fiber is achieved without any countable errors. The proposed nonbinary quasi-cyclic LDPC code achieves an uncoded BER threshold at 4×10(-2). Potential issues like phase ambiguity and coding length are also discussed when implementing LDPC in current coherent optical systems. © 2011 Optical Society of America
Characterization and Optimization of LDPC Codes for the 2-User Gaussian Multiple Access Channel
Directory of Open Access Journals (Sweden)
Declercq David
2007-01-01
Full Text Available We address the problem of designing good LDPC codes for the Gaussian multiple access channel (MAC. The framework we choose is to design multiuser LDPC codes with joint belief propagation decoding on the joint graph of the 2-user case. Our main result compared to existing work is to express analytically EXIT functions of the multiuser decoder with two different approximations of the density evolution. This allows us to propose a very simple linear programming optimization for the complicated problem of LDPC code design with joint multiuser decoding. The stability condition for our case is derived and used in the optimization constraints. The codes that we obtain for the 2-user case are quite good for various rates, especially if we consider the very simple optimization procedure.
Evaluation of large girth LDPC codes for PMD compensation by turbo equalization.
Minkov, Lyubomir L; Djordjevic, Ivan B; Xu, Lei; Wang, Ting; Kueppers, Franko
2008-08-18
Large-girth quasi-cyclic LDPC codes have been experimentally evaluated for use in PMD compensation by turbo equalization for a 10 Gb/s NRZ optical transmission system, and observing one sample per bit. Net effective coding gain improvement for girth-10, rate 0.906 code of length 11936 over maximum a posteriori probability (MAP) detector for differential group delay of 125 ps is 6.25 dB at BER of 10(-6). Girth-10 LDPC code of rate 0.8 outperforms the girth-10 code of rate 0.906 by 2.75 dB, and provides the net effective coding gain improvement of 9 dB at the same BER. It is experimentally determined that girth-10 LDPC codes of length around 15000 approach channel capacity limit within 1.25 dB.
On the reduced-complexity of LDPC decoders for ultra-high-speed optical transmission.
Djordjevic, Ivan B; Xu, Lei; Wang, Ting
2010-10-25
We propose two reduced-complexity (RC) LDPC decoders, which can be used in combination with large-girth LDPC codes to enable ultra-high-speed serial optical transmission. We show that optimally attenuated RC min-sum sum algorithm performs only 0.46 dB (at BER of 10(-9)) worse than conventional sum-product algorithm, while having lower storage memory requirements and much lower latency. We further study the use of RC LDPC decoding algorithms in multilevel coded modulation with coherent detection and show that with RC decoding algorithms we can achieve the net coding gain larger than 11 dB at BERs below 10(-9).
Construction of Short-Length High-Rates LDPC Codes Using Difference Families
Directory of Open Access Journals (Sweden)
Deny Hamdani
2010-10-01
Full Text Available Low-density parity-check (LDPC code is linear-block error-correcting code defined by sparse parity-check matrix. It is decoded using the massage-passing algorithm, and in many cases, capable of outperforming turbo code. This paper presents a class of low-density parity-check (LDPC codes showing good performance with low encoding complexity. The code is constructed using difference families from combinatorial design. The resulting code, which is designed to have short code length and high code rate, can be encoded with low complexity due to its quasi-cyclic structure, and performs well when it is iteratively decoded with the sum-product algorithm. These properties of LDPC code are quite suitable for applications in future wireless local area network.
Directory of Open Access Journals (Sweden)
Surbhi Sharma
2011-06-01
Full Text Available Irregular low-density parity-check (LDPC codes have been found to show exceptionally good performance for single antenna systems over a wide class of channels. In this paper, the performance of LDPC codes with multiple antenna systems is investigated in flat Rayleigh and Rician fading channels for different modulation schemes. The focus of attention is mainly on the concatenation of irregular LDPC codes with complex orthogonal space-time codes. Iterative decoding is carried out with a density evolution method that sets a threshold above which the code performs well. For the proposed concatenated system, the simulation results show that the QAM technique achieves a higher coding gain of 8.8 dB and 3.2 dB over the QPSK technique in Rician (LOS and Rayleigh (NLOS faded environments respectively.
Energy Technology Data Exchange (ETDEWEB)
Kijima, K; Murata, W; Furukawa, Y [Kyushu University, Fukuoka (Japan). Faculty of Engineering
1997-10-01
The control system for keeping the fixed-point of ships against disturbance was designed by applying an ILQ (Inverse Linear Quadratic) control (possible to specify the response of controlled systems with time constant) theory, to study the effect of different time constants as design parameter on a fixed-point keeping performance. It was assumed that the controlled ship is equipped with two bow thrusters and one stern thruster of 30ton in output to generate a control force. For fixed-point keeping control, the state equation was derived to slave the controlled system to a target input. The ILQ design method uses the result of the inverse problem of optimum regulators. For designing control systems by using the ILQ control theory, the smallest time constant should be selected according to the most severe disturbance condition considering the response performance of controllers, to achieve fixed-point keeping of ships. In fixed-point keeping, it is also essential to put the initial position as close as possible to the target point. 2 refs., 6 figs., 2 tabs.
Energy Technology Data Exchange (ETDEWEB)
Bloembergen, P.; Yamada, Y.; Sasajima, N.; Yamamoto, N. [National Metrology Institute of Japan (NMIJ), AIST, Tsukuba (Japan); Torizuka, S.; Yoshida, N. [National Institute for Materials Science (NIMS), Tsukuba (Japan)
2004-12-01
A survey will be given of metal-carbon (M-C) and metal carbide-carbon (MC-C) systems presently in development for applications in thermometry in the range from 1000 K to about 3500 K. The advantages of these systems as fixed points at high temperatures as compared to systems relying on pure metals will be elucidated. Purification of the components making up the M-C or MC-C systems is a prerequisite to their implementation as reference fixed points in thermometry, requiring a high level of reproducibility of the eutectic temperature. To set an example a study on the effect of impurities on the eutectic transition of Fe-C is included in the survey. Experimentally obtained melting curves are compared with the curves calculated on the basis of a thermodynamic model, which includes the impurities in question as components. The calculations of the melting curves are based upon: (1) the Equilibrium solidification model and (2) the Scheil-Gulliver solidification model, which handle the effects of the impurities on the transition process in such a way that they may be assumed to set lower and upper boundaries to the associated melting ranges, respectively. We will conclude pointing out fields of common interest to materials science and thermometry within the realm of ultra-pure materials. (authors)
Directory of Open Access Journals (Sweden)
Houzeng Han
2016-07-01
Full Text Available Precise Point Positioning (PPP makes use of the undifferenced pseudorange and carrier phase measurements with ionospheric-free (IF combinations to achieve centimeter-level positioning accuracy. Conventionally, the IF ambiguities are estimated as float values. To improve the PPP positioning accuracy and shorten the convergence time, the integer phase clock model with between-satellites single-difference (BSSD operation is used to recover the integer property. However, the continuity and availability of stand-alone PPP is largely restricted by the observation environment. The positioning performance will be significantly degraded when GPS operates under challenging environments, if less than five satellites are present. A commonly used approach is integrating a low cost inertial sensor to improve the positioning performance and robustness. In this study, a tightly coupled (TC algorithm is implemented by integrating PPP with inertial navigation system (INS using an Extended Kalman filter (EKF. The navigation states, inertial sensor errors and GPS error states are estimated together. The troposphere constrained approach, which utilizes external tropospheric delay as virtual observation, is applied to further improve the ambiguity-fixed height positioning accuracy, and an improved adaptive filtering strategy is implemented to improve the covariance modelling considering the realistic noise effect. A field vehicular test with a geodetic GPS receiver and a low cost inertial sensor was conducted to validate the improvement on positioning performance with the proposed approach. The results show that the positioning accuracy has been improved with inertial aiding. Centimeter-level positioning accuracy is achievable during the test, and the PPP/INS TC integration achieves a fast re-convergence after signal outages. For troposphere constrained solutions, a significant improvement for the height component has been obtained. The overall positioning accuracies
Opportunistic Adaptive Transmission for Network Coding Using Nonbinary LDPC Codes
Directory of Open Access Journals (Sweden)
Cocco Giuseppe
2010-01-01
Full Text Available Network coding allows to exploit spatial diversity naturally present in mobile wireless networks and can be seen as an example of cooperative communication at the link layer and above. Such promising technique needs to rely on a suitable physical layer in order to achieve its best performance. In this paper, we present an opportunistic packet scheduling method based on physical layer considerations. We extend channel adaptation proposed for the broadcast phase of asymmetric two-way bidirectional relaying to a generic number of sinks and apply it to a network context. The method consists of adapting the information rate for each receiving node according to its channel status and independently of the other nodes. In this way, a higher network throughput can be achieved at the expense of a slightly higher complexity at the transmitter. This configuration allows to perform rate adaptation while fully preserving the benefits of channel and network coding. We carry out an information theoretical analysis of such approach and of that typically used in network coding. Numerical results based on nonbinary LDPC codes confirm the effectiveness of our approach with respect to previously proposed opportunistic scheduling techniques.
Unitals and ovals of symmetric block designs in LDPC and space-time coding
Andriamanalimanana, Bruno R.
2004-08-01
An approach to the design of LDPC (low density parity check) error-correction and space-time modulation codes involves starting with known mathematical and combinatorial structures, and deriving code properties from structure properties. This paper reports on an investigation of unital and oval configurations within generic symmetric combinatorial designs, not just classical projective planes, as the underlying structure for classes of space-time LDPC outer codes. Of particular interest are the encoding and iterative (sum-product) decoding gains that these codes may provide. Various small-length cases have been numerically implemented in Java and Matlab for a number of channel models.
PMD compensation in fiber-optic communication systems with direct detection using LDPC-coded OFDM.
Djordjevic, Ivan B
2007-04-02
The possibility of polarization-mode dispersion (PMD) compensation in fiber-optic communication systems with direct detection using a simple channel estimation technique and low-density parity-check (LDPC)-coded orthogonal frequency division multiplexing (OFDM) is demonstrated. It is shown that even for differential group delay (DGD) of 4/BW (BW is the OFDM signal bandwidth), the degradation due to the first-order PMD can be completely compensated for. Two classes of LDPC codes designed based on two different combinatorial objects (difference systems and product of combinatorial designs) suitable for use in PMD compensation are introduced.
Simultaneous chromatic dispersion and PMD compensation by using coded-OFDM and girth-10 LDPC codes.
Djordjevic, Ivan B; Xu, Lei; Wang, Ting
2008-07-07
Low-density parity-check (LDPC)-coded orthogonal frequency division multiplexing (OFDM) is studied as an efficient coded modulation scheme suitable for simultaneous chromatic dispersion and polarization mode dispersion (PMD) compensation. We show that, for aggregate rate of 10 Gb/s, accumulated dispersion over 6500 km of SMF and differential group delay of 100 ps can be simultaneously compensated with penalty within 1.5 dB (with respect to the back-to-back configuration) when training sequence based channel estimation and girth-10 LDPC codes of rate 0.8 are employed.
Product code optimization for determinate state LDPC decoding in robust image transmission.
Thomos, Nikolaos; Boulgouris, Nikolaos V; Strintzis, Michael G
2006-08-01
We propose a novel scheme for error-resilient image transmission. The proposed scheme employs a product coder consisting of low-density parity check (LDPC) codes and Reed-Solomon codes in order to deal effectively with bit errors. The efficiency of the proposed scheme is based on the exploitation of determinate symbols in Tanner graph decoding of LDPC codes and a novel product code optimization technique based on error estimation. Experimental evaluation demonstrates the superiority of the proposed system in comparison to recent state-of-the-art techniques for image transmission.
Threshold Multi Split-Row algorithm for decoding irregular LDPC codes
Directory of Open Access Journals (Sweden)
Chakir Aqil
2017-12-01
Full Text Available In this work, we propose a new threshold multi split-row algorithm in order to improve the multi split-row algorithm for LDPC irregular codes decoding. We give a complete description of our algorithm as well as its advantages for the LDPC codes. The simulation results over an additive white gaussian channel show that an improvement in code error performance between 0.4 dB and 0.6 dB compared to the multi split-row algorithm.
Performance Analysis of Iterative Decoding Algorithms for PEG LDPC Codes in Nakagami Fading Channels
Directory of Open Access Journals (Sweden)
O. Al Rasheed
2013-11-01
Full Text Available In this paper we give a comparative analysis of decoding algorithms of Low Density Parity Check (LDPC codes in a channel with the Nakagami distribution of the fading envelope. We consider the Progressive Edge-Growth (PEG method and Improved PEG method for the parity check matrix construction, which can be used to avoid short girths, small trapping sets and a high level of error floor. A comparative analysis of several classes of LDPC codes in various propagation conditions and decoded using different decoding algorithms is also presented.
Construction of Short-length High-rates Ldpc Codes Using Difference Families
Deny Hamdani; Ery Safrianti
2007-01-01
Low-density parity-check (LDPC) code is linear-block error-correcting code defined by sparse parity-check matrix. It isdecoded using the massage-passing algorithm, and in many cases, capable of outperforming turbo code. This paperpresents a class of low-density parity-check (LDPC) codes showing good performance with low encoding complexity.The code is constructed using difference families from combinatorial design. The resulting code, which is designed tohave short code length and high code r...
Error floor behavior study of LDPC codes for concatenated codes design
Chen, Weigang; Yin, Liuguo; Lu, Jianhua
2007-11-01
Error floor behavior of low-density parity-check (LDPC) codes using quantized decoding algorithms is statistically studied with experimental results on a hardware evaluation platform. The results present the distribution of the residual errors after decoding failure and reveal that the number of residual error bits in a codeword is usually very small using quantized sum-product (SP) algorithm. Therefore, LDPC code may serve as the inner code in a concatenated coding system with a high code rate outer code and thus an ultra low error floor can be achieved. This conclusion is also verified by the experimental results.
Construction of LDPC codes over GF(q) with modified progressive edge growth
Institute of Scientific and Technical Information of China (English)
CHEN Xin; MEN Ai-dong; YANG Bo; QUAN Zi-yi
2009-01-01
A parity check matrix construction method for constructing a low-density parity-check (LDPC) codes over GF(q) (q>2) based on the modified progressive edge growth (PEG) algorithm is introduced. First, the nonzero locations of the parity check matrix are selected using the PEG algorithm. Then the nonzero elements are defined by avoiding the definition of subcode. A proof is given to show the good minimum distance property of constructed GF(q)-LDPC codes. Simulations are also presented to illustrate the good error performance of the designed codes.
Lowe, David; Machin, Graham
2012-06-01
The future mise en pratique for the realization of the kelvin will be founded on the melting temperatures of particular metal-carbon eutectic alloys as thermodynamic temperature references. However, at the moment there is no consensus on what should be taken as the melting temperature. An ideal melting or freezing curve should be a completely flat plateau at a specific temperature. Any departure from the ideal is due to shortcomings in the realization and should be accommodated within the uncertainty budget. However, for the proposed alloy-based fixed points, melting takes place over typically some hundreds of millikelvins. Including the entire melting range within the uncertainties would lead to an unnecessarily pessimistic view of the utility of these as reference standards. Therefore, detailed analysis of the shape of the melting curve is needed to give a value associated with some identifiable aspect of the phase transition. A range of approaches are or could be used; some purely practical, determining the point of inflection (POI) of the melting curve, some attempting to extrapolate to the liquidus temperature just at the end of melting, and a method that claims to give the liquidus temperature and an impurity correction based on the analytical Scheil model of solidification that has not previously been applied to eutectic melting. The different methods have been applied to cobalt-carbon melting curves that were obtained under conditions for which the Scheil model might be valid. In the light of the findings of this study it is recommended that the POI continue to be used as a pragmatic measure of temperature but where required a specified limits approach should be used to define and determine the melting temperature.
Iterative decoding of SOVA and LDPC product code for bit-patterned media recoding
Jeong, Seongkwon; Lee, Jaejin
2018-05-01
The demand for high-density storage systems has increased due to the exponential growth of data. Bit-patterned media recording (BPMR) is one of the promising technologies to achieve the density of 1Tbit/in2 and higher. To increase the areal density in BPMR, the spacing between islands needs to be reduced, yet this aggravates inter-symbol interference and inter-track interference and degrades the bit error rate performance. In this paper, we propose a decision feedback scheme using low-density parity check (LDPC) product code for BPMR. This scheme can improve the decoding performance using an iterative approach with extrinsic information and log-likelihood ratio value between iterative soft output Viterbi algorithm and LDPC product code. Simulation results show that the proposed LDPC product code can offer 1.8dB and 2.3dB gains over the one LDPC code at the density of 2.5 and 3 Tb/in2, respectively, when bit error rate is 10-6.
Design and Analysis of Adaptive Message Coding on LDPC Decoder with Faulty Storage
Directory of Open Access Journals (Sweden)
Guangjun Ge
2018-01-01
Full Text Available Unreliable message storage severely degrades the performance of LDPC decoders. This paper discusses the impacts of message errors on LDPC decoders and schemes improving the robustness. Firstly, we develop a discrete density evolution analysis for faulty LDPC decoders, which indicates that protecting the sign bits of messages is effective enough for finite-precision LDPC decoders. Secondly, we analyze the effects of quantization precision loss for static sign bit protection and propose an embedded dynamic coding scheme by adaptively employing the least significant bits (LSBs to protect the sign bits. Thirdly, we give a construction of Hamming product code for the adaptive coding and present low complexity decoding algorithms. Theoretic analysis indicates that the proposed scheme outperforms traditional triple modular redundancy (TMR scheme in decoding both threshold and residual errors, while Monte Carlo simulations show that the performance loss is less than 0.2 dB when the storage error probability varies from 10-3 to 10-4.
Directory of Open Access Journals (Sweden)
H. Prashantha Kumar
2011-09-01
Full Text Available Low density parity check (LDPC codes are capacity-approaching codes, which means that practical constructions exist that allow the noise threshold to be set very close to the theoretical Shannon limit for a memory less channel. LDPC codes are finding increasing use in applications like LTE-Networks, digital television, high density data storage systems, deep space communication systems etc. Several algebraic and combinatorial methods are available for constructing LDPC codes. In this paper we discuss a novel low complexity algebraic method for constructing regular LDPC like codes derived from full rank codes. We demonstrate that by employing these codes over AWGN channels, coding gains in excess of 2dB over un-coded systems can be realized when soft iterative decoding using a parity check tree is employed.
Arabaci, Murat; Djordjevic, Ivan B; Saunders, Ross; Marcoccia, Roberto M
2010-02-01
In order to achieve high-speed transmission over optical transport networks (OTNs) and maximize its throughput, we propose using a rate-adaptive polarization-multiplexed coded multilevel modulation with coherent detection based on component non-binary quasi-cyclic (QC) LDPC codes. Compared to prior-art bit-interleaved LDPC-coded modulation (BI-LDPC-CM) scheme, the proposed non-binary LDPC-coded modulation (NB-LDPC-CM) scheme not only reduces latency due to symbol- instead of bit-level processing but also provides either impressive reduction in computational complexity or striking improvements in coding gain depending on the constellation size. As the paper presents, compared to its prior-art binary counterpart, the proposed NB-LDPC-CM scheme addresses the needs of future OTNs, which are achieving the target BER performance and providing maximum possible throughput both over the entire lifetime of the OTN, better.
Directory of Open Access Journals (Sweden)
Rovini Massimo
2009-01-01
Full Text Available This is a reply to the comments by Gunnam et al. "Comments on 'Techniques and architectures for hazard-free semi-parallel decoding of LDPC codes'", EURASIP Journal on Embedded Systems, vol. 2009, Article ID 704174 on our recent work "Techniques and architectures for hazard-free semi-parallel decoding of LDPC codes", EURASIP Journal on Embedded Systems, vol. 2009, Article ID 723465.
Differentially Encoded LDPC CodesÃ¢Â€Â”Part II: General Case and Code Optimization
Directory of Open Access Journals (Sweden)
Jing Li (Tiffany
2008-04-01
Full Text Available This two-part series of papers studies the theory and practice of differentially encoded low-density parity-check (DE-LDPC codes, especially in the context of noncoherent detection. Part I showed that a special class of DE-LDPC codes, product accumulate codes, perform very well with both coherent and noncoherent detections. The analysis here reveals that a conventional LDPC code, however, is not fitful for differential coding and does not, in general, deliver a desirable performance when detected noncoherently. Through extrinsic information transfer (EXIT analysis and a modified Ã¢Â€Âœconvergence-constraintÃ¢Â€Â density evolution (DE method developed here, we provide a characterization of the type of LDPC degree profiles that work in harmony with differential detection (or a recursive inner code in general, and demonstrate how to optimize these LDPC codes. The convergence-constraint method provides a useful extension to the conventional Ã¢Â€Âœthreshold-constraintÃ¢Â€Â method, and can match an outer LDPC code to any given inner code with the imperfectness of the inner decoder taken into consideration.
Combining Ratio Estimation for Low Density Parity Check (LDPC) Coding
Mahmoud, Saad; Hi, Jianjun
2012-01-01
The Low Density Parity Check (LDPC) Code decoding algorithm make use of a scaled receive signal derived from maximizing the log-likelihood ratio of the received signal. The scaling factor (often called the combining ratio) in an AWGN channel is a ratio between signal amplitude and noise variance. Accurately estimating this ratio has shown as much as 0.6 dB decoding performance gain. This presentation briefly describes three methods for estimating the combining ratio: a Pilot-Guided estimation method, a Blind estimation method, and a Simulation-Based Look-Up table. The Pilot Guided Estimation method has shown that the maximum likelihood estimates of signal amplitude is the mean inner product of the received sequence and the known sequence, the attached synchronization marker (ASM) , and signal variance is the difference of the mean of the squared received sequence and the square of the signal amplitude. This method has the advantage of simplicity at the expense of latency since several frames worth of ASMs. The Blind estimation method s maximum likelihood estimator is the average of the product of the received signal with the hyperbolic tangent of the product combining ratio and the received signal. The root of this equation can be determined by an iterative binary search between 0 and 1 after normalizing the received sequence. This method has the benefit of requiring one frame of data to estimate the combining ratio which is good for faster changing channels compared to the previous method, however it is computationally expensive. The final method uses a look-up table based on prior simulated results to determine signal amplitude and noise variance. In this method the received mean signal strength is controlled to a constant soft decision value. The magnitude of the deviation is averaged over a predetermined number of samples. This value is referenced in a look up table to determine the combining ratio that prior simulation associated with the average magnitude of
Low Complexity Encoder of High Rate Irregular QC-LDPC Codes for Partial Response Channels
Directory of Open Access Journals (Sweden)
IMTAWIL, V.
2011-11-01
Full Text Available High rate irregular QC-LDPC codes based on circulant permutation matrices, for efficient encoder implementation, are proposed in this article. The structure of the code is an approximate lower triangular matrix. In addition, we present two novel efficient encoding techniques for generating redundant bits. The complexity of the encoder implementation depends on the number of parity bits of the code for the one-stage encoding and the length of the code for the two-stage encoding. The advantage of both encoding techniques is that few XOR-gates are used in the encoder implementation. Simulation results on partial response channels also show that the BER performance of the proposed code has gain over other QC-LDPC codes.
Analysis and Construction of Full-Diversity Joint Network-LDPC Codes for Cooperative Communications
Directory of Open Access Journals (Sweden)
Capirone Daniele
2010-01-01
Full Text Available Transmit diversity is necessary in harsh environments to reduce the required transmit power for achieving a given error performance at a certain transmission rate. In networks, cooperative communication is a well-known technique to yield transmit diversity and network coding can increase the spectral efficiency. These two techniques can be combined to achieve a double diversity order for a maximum coding rate on the Multiple-Access Relay Channel (MARC, where two sources share a common relay in their transmission to the destination. However, codes have to be carefully designed to obtain the intrinsic diversity offered by the MARC. This paper presents the principles to design a family of full-diversity LDPC codes with maximum rate. Simulation of the word error rate performance of the new proposed family of LDPC codes for the MARC confirms the full diversity.
Low Complexity Approach for High Throughput Belief-Propagation based Decoding of LDPC Codes
Directory of Open Access Journals (Sweden)
BOT, A.
2013-11-01
Full Text Available The paper proposes a low complexity belief propagation (BP based decoding algorithm for LDPC codes. In spite of the iterative nature of the decoding process, the proposed algorithm provides both reduced complexity and increased BER performances as compared with the classic min-sum (MS algorithm, generally used for hardware implementations. Linear approximations of check-nodes update function are used in order to reduce the complexity of the BP algorithm. Considering this decoding approach, an FPGA based hardware architecture is proposed for implementing the decoding algorithm, aiming to increase the decoder throughput. FPGA technology was chosen for the LDPC decoder implementation, due to its parallel computation and reconfiguration capabilities. The obtained results show improvements regarding decoding throughput and BER performances compared with state-of-the-art approaches.
LDPC product coding scheme with extrinsic information for bit patterned media recoding
Directory of Open Access Journals (Sweden)
Seongkwon Jeong
2017-05-01
Full Text Available Since the density limit of the current perpendicular magnetic storage system will soon be reached, bit patterned media recording (BPMR is a promising candidate for the next generation storage system to achieve an areal density beyond 1 Tb/in2. Each recording bit is stored in a fabricated magnetic island and the space between the magnetic islands is nonmagnetic in BPMR. To approach recording densities of 1 Tb/in2, the spacing of the magnetic islands must be less than 25 nm. Consequently, severe inter-symbol interference (ISI and inter-track interference (ITI occur. ITI and ISI degrade the performance of BPMR. In this paper, we propose a low-density parity check (LDPC product coding scheme that exploits extrinsic information for BPMR. This scheme shows an improved bit error rate performance compared to that in which one LDPC code is used.
LDPC product coding scheme with extrinsic information for bit patterned media recoding
Jeong, Seongkwon; Lee, Jaejin
2017-05-01
Since the density limit of the current perpendicular magnetic storage system will soon be reached, bit patterned media recording (BPMR) is a promising candidate for the next generation storage system to achieve an areal density beyond 1 Tb/in2. Each recording bit is stored in a fabricated magnetic island and the space between the magnetic islands is nonmagnetic in BPMR. To approach recording densities of 1 Tb/in2, the spacing of the magnetic islands must be less than 25 nm. Consequently, severe inter-symbol interference (ISI) and inter-track interference (ITI) occur. ITI and ISI degrade the performance of BPMR. In this paper, we propose a low-density parity check (LDPC) product coding scheme that exploits extrinsic information for BPMR. This scheme shows an improved bit error rate performance compared to that in which one LDPC code is used.
Rate-compatible protograph LDPC code families with linear minimum distance
Divsalar, Dariush (Inventor); Dolinar, Jr., Samuel J. (Inventor); Jones, Christopher R. (Inventor)
2012-01-01
Digital communication coding methods are shown, which generate certain types of low-density parity-check (LDPC) codes built from protographs. A first method creates protographs having the linear minimum distance property and comprising at least one variable node with degree less than 3. A second method creates families of protographs of different rates, all structurally identical for all rates except for a rate-dependent designation of certain variable nodes as transmitted or non-transmitted. A third method creates families of protographs of different rates, all structurally identical for all rates except for a rate-dependent designation of the status of certain variable nodes as non-transmitted or set to zero. LDPC codes built from the protographs created by these methods can simultaneously have low error floors and low iterative decoding thresholds.
Low Power LDPC Code Decoder Architecture Based on Intermediate Message Compression Technique
Shimizu, Kazunori; Togawa, Nozomu; Ikenaga, Takeshi; Goto, Satoshi
Reducing the power dissipation for LDPC code decoder is a major challenging task to apply it to the practical digital communication systems. In this paper, we propose a low power LDPC code decoder architecture based on an intermediate message-compression technique which features as follows: (i) An intermediate message compression technique enables the decoder to reduce the required memory capacity and write power dissipation. (ii) A clock gated shift register based intermediate message memory architecture enables the decoder to decompress the compressed messages in a single clock cycle while reducing the read power dissipation. The combination of the above two techniques enables the decoder to reduce the power dissipation while keeping the decoding throughput. The simulation results show that the proposed architecture improves the power efficiency up to 52% and 18% compared to that of the decoder based on the overlapped schedule and the rapid convergence schedule without the proposed techniques respectively.
Performance analysis of WS-EWC coded optical CDMA networks with/without LDPC codes
Huang, Chun-Ming; Huang, Jen-Fa; Yang, Chao-Chin
2010-10-01
One extended Welch-Costas (EWC) code family for the wavelength-division-multiplexing/spectral-amplitude coding (WDM/SAC; WS) optical code-division multiple-access (OCDMA) networks is proposed. This system has a superior performance as compared to the previous modified quadratic congruence (MQC) coded OCDMA networks. However, since the performance of such a network is unsatisfactory when the data bit rate is higher, one class of quasi-cyclic low-density parity-check (QC-LDPC) code is adopted to improve that. Simulation results show that the performance of the high-speed WS-EWC coded OCDMA network can be greatly improved by using the LDPC codes.
Huang, Sheng; Ao, Xiang; Li, Yuan-yuan; Zhang, Rui
2016-09-01
In order to meet the needs of high-speed development of optical communication system, a construction method of quasi-cyclic low-density parity-check (QC-LDPC) codes based on multiplicative group of finite field is proposed. The Tanner graph of parity check matrix of the code constructed by this method has no cycle of length 4, and it can make sure that the obtained code can get a good distance property. Simulation results show that when the bit error rate ( BER) is 10-6, in the same simulation environment, the net coding gain ( NCG) of the proposed QC-LDPC(3 780, 3 540) code with the code rate of 93.7% in this paper is improved by 2.18 dB and 1.6 dB respectively compared with those of the RS(255, 239) code in ITU-T G.975 and the LDPC(3 2640, 3 0592) code in ITU-T G.975.1. In addition, the NCG of the proposed QC-LDPC(3 780, 3 540) code is respectively 0.2 dB and 0.4 dB higher compared with those of the SG-QC-LDPC(3 780, 3 540) code based on the two different subgroups in finite field and the AS-QC-LDPC(3 780, 3 540) code based on the two arbitrary sets of a finite field. Thus, the proposed QC-LDPC(3 780, 3 540) code in this paper can be well applied in optical communication systems.
Simulasi Low Density Parity Check (Ldpc) dengan Standar Dvb-t2
Kurniawan, Yusuf; Hafizh, Idham
2014-01-01
Artikel ini berisi implementasi simulasi encoding-decoding yang dilakukanpada suatu sampel data biner acak sesuai dengan standar yang digunakanpada Digital Video Broadcasting – Terrestrial 2nd Generation (DVB-T2),dengan menggunakan MATLAB. Low Density Parity Check (LDPC)digunakan dalam proses encoding-decoding sebagai fitur untuk melakukankoreksi kesalahan pada saat pengiriman data. Modulasi yang digunakandalam simulasi adalah BPSK dengan model kanal AWGN. Dalam simulasitersebut, diperbanding...
Construction of Rate-Compatible LDPC Codes Utilizing Information Shortening and Parity Puncturing
Directory of Open Access Journals (Sweden)
Jones Christopher R
2005-01-01
Full Text Available This paper proposes a method for constructing rate-compatible low-density parity-check (LDPC codes. The construction considers the problem of optimizing a family of rate-compatible degree distributions as well as the placement of bipartite graph edges. A hybrid approach that combines information shortening and parity puncturing is proposed. Local graph conditioning techniques for the suppression of error floors are also included in the construction methodology.
Co-operation of digital nonlinear equalizers and soft-decision LDPC FEC in nonlinear transmission.
Tanimura, Takahito; Oda, Shoichiro; Hoshida, Takeshi; Aoki, Yasuhiko; Tao, Zhenning; Rasmussen, Jens C
2013-12-30
We experimentally and numerically investigated the characteristics of 128 Gb/s dual polarization - quadrature phase shift keying signals received with two types of nonlinear equalizers (NLEs) followed by soft-decision (SD) low-density parity-check (LDPC) forward error correction (FEC). Successful co-operation among SD-FEC and NLEs over various nonlinear transmissions were demonstrated by optimization of parameters for NLEs.
Drăghici, S.; Proştean, O.; Răduca, E.; Haţiegan, C.; Hălălae, I.; Pădureanu, I.; Nedeloni, M.; (Barboni Haţiegan, L.
2017-01-01
In this paper a method with which a set of characteristic functions are associated to a LDPC code is shown and also functions that represent the evolution density of messages that go along the edges of a Tanner graph. Graphic representations of the density evolution are shown respectively the study and simulation of likelihood threshold that render asymptotic boundaries between which there are decodable codes were made using MathCad V14 software.
Optimized Fast Walsh–Hadamard Transform on GPUs for non-binary LDPC decoding
Andrade, Joao; Falcao, Gabriel; Silva, Vitor
2014-01-01
The Fourier Transform Sum-Product Algorithm (FT-SPA) used in non-binary Low-Density Parity-Check (LDPC) decoding makes extensive use of the Walsh–Hadamard Transform (WHT). We have developed a massively parallel Fast Walsh–Hadamard Transform (FWHT) which exploits the Graphics Processing Unit (GPU) pipeline and memory hierarchy, thereby minimizing the level of memory bank conflicts and maximizing the number of returned instructions per clock cycle for different generations of graphics processor...
A Low-Complexity Joint Detection-Decoding Algorithm for Nonbinary LDPC-Coded Modulation Systems
Wang, Xuepeng; Bai, Baoming; Ma, Xiao
2010-01-01
In this paper, we present a low-complexity joint detection-decoding algorithm for nonbinary LDPC codedmodulation systems. The algorithm combines hard-decision decoding using the message-passing strategy with the signal detector in an iterative manner. It requires low computational complexity, offers good system performance and has a fast rate of decoding convergence. Compared to the q-ary sum-product algorithm (QSPA), it provides an attractive candidate for practical applications of q-ary LDP...
Differentially Encoded LDPC Codes—Part I: Special Case of Product Accumulate Codes
Directory of Open Access Journals (Sweden)
(Tiffany JingLi
2008-01-01
Full Text Available Part I of a two-part series investigates product accumulate codes, a special class of differentially-encoded low density parity check (DE-LDPC codes with high performance and low complexity, on flat Rayleigh fading channels. In the coherent detection case, Divsalar's simple bounds and iterative thresholds using density evolution are computed to quantify the code performance at finite and infinite lengths, respectively. In the noncoherent detection case, a simple iterative differential detection and decoding (IDDD receiver is proposed and shown to be robust for different Doppler shifts. Extrinsic information transfer (EXIT charts reveal that, with pilot symbol assisted differential detection, the widespread practice of inserting pilot symbols to terminate the trellis actually incurs a loss in capacity, and a more efficient way is to separate pilots from the trellis. Through analysis and simulations, it is shown that PA codes perform very well with both coherent and noncoherent detections. The more general case of DE-LDPC codes, where the LDPC part may take arbitrary degree profiles, is studied in Part II Li 2008.
Techniques and Architectures for Hazard-Free Semi-Parallel Decoding of LDPC Codes
Directory of Open Access Journals (Sweden)
Rovini Massimo
2009-01-01
Full Text Available The layered decoding algorithm has recently been proposed as an efficient means for the decoding of low-density parity-check (LDPC codes, thanks to the remarkable improvement in the convergence speed (2x of the decoding process. However, pipelined semi-parallel decoders suffer from violations or "hazards" between consecutive updates, which not only violate the layered principle but also enforce the loops in the code, thus spoiling the error correction performance. This paper describes three different techniques to properly reschedule the decoding updates, based on the careful insertion of "idle" cycles, to prevent the hazards of the pipeline mechanism. Also, different semi-parallel architectures of a layered LDPC decoder suitable for use with such techniques are analyzed. Then, taking the LDPC codes for the wireless local area network (IEEE 802.11n as a case study, a detailed analysis of the performance attained with the proposed techniques and architectures is reported, and results of the logic synthesis on a 65 nm low-power CMOS technology are shown.
Protograph based LDPC codes with minimum distance linearly growing with block size
Divsalar, Dariush; Jones, Christopher; Dolinar, Sam; Thorpe, Jeremy
2005-01-01
We propose several LDPC code constructions that simultaneously achieve good threshold and error floor performance. Minimum distance is shown to grow linearly with block size (similar to regular codes of variable degree at least 3) by considering ensemble average weight enumerators. Our constructions are based on projected graph, or protograph, structures that support high-speed decoder implementations. As with irregular ensembles, our constructions are sensitive to the proportion of degree-2 variable nodes. A code with too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code with too many such nodes tends to not exhibit a minimum distance that grows linearly in block length. In this paper we also show that precoding can be used to lower the threshold of regular LDPC codes. The decoding thresholds of the proposed codes, which have linearly increasing minimum distance in block size, outperform that of regular LDPC codes. Furthermore, a family of low to high rate codes, with thresholds that adhere closely to their respective channel capacity thresholds, is presented. Simulation results for a few example codes show that the proposed codes have low error floors as well as good threshold SNFt performance.
45 Gb/s low complexity optical front-end for soft-decision LDPC decoders.
Sakib, Meer Nazmus; Moayedi, Monireh; Gross, Warren J; Liboiron-Ladouceur, Odile
2012-07-30
In this paper a low complexity and energy efficient 45 Gb/s soft-decision optical front-end to be used with soft-decision low-density parity-check (LDPC) decoders is demonstrated. The results show that the optical front-end exhibits a net coding gain of 7.06 and 9.62 dB for post forward error correction bit error rate of 10(-7) and 10(-12) for long block length LDPC(32768,26803) code. The performance over a hard decision front-end is 1.9 dB for this code. It is shown that the soft-decision circuit can also be used as a 2-bit flash type analog-to-digital converter (ADC), in conjunction with equalization schemes. At bit rate of 15 Gb/s using RS(255,239), LDPC(672,336), (672, 504), (672, 588), and (1440, 1344) used with a 6-tap finite impulse response (FIR) equalizer will result in optical power savings of 3, 5, 7, 9.5 and 10.5 dB, respectively. The 2-bit flash ADC consumes only 2.71 W at 32 GSamples/s. At 45 GSamples/s the power consumption is estimated to be 4.95 W.
A PEG Construction of LDPC Codes Based on the Betweenness Centrality Metric
Directory of Open Access Journals (Sweden)
BHURTAH-SEEWOOSUNGKUR, I.
2016-05-01
Full Text Available Progressive Edge Growth (PEG constructions are usually based on optimizing the distance metric by using various methods. In this work however, the distance metric is replaced by a different one, namely the betweenness centrality metric, which was shown to enhance routing performance in wireless mesh networks. A new type of PEG construction for Low-Density Parity-Check (LDPC codes is introduced based on the betweenness centrality metric borrowed from social networks terminology given that the bipartite graph describing the LDPC is analogous to a network of nodes. The algorithm is very efficient in filling edges on the bipartite graph by adding its connections in an edge-by-edge manner. The smallest graph size the new code could construct surpasses those obtained from a modified PEG algorithm - the RandPEG algorithm. To the best of the authors' knowledge, this paper produces the best regular LDPC column-weight two graphs. In addition, the technique proves to be competitive in terms of error-correcting performance. When compared to MacKay, PEG and other recent modified-PEG codes, the algorithm gives better performance over high SNR due to its particular edge and local graph properties.
Construction and Iterative Decoding of LDPC Codes Over Rings for Phase-Noisy Channels
Directory of Open Access Journals (Sweden)
William G. Cowley
2008-04-01
Full Text Available This paper presents the construction and iterative decoding of low-density parity-check (LDPC codes for channels affected by phase noise. The LDPC code is based on integer rings and designed to converge under phase-noisy channels. We assume that phase variations are small over short blocks of adjacent symbols. A part of the constructed code is inherently built with this knowledge and hence able to withstand a phase rotation of 2ÃÂ€/M radians, where Ã¢Â€ÂœMÃ¢Â€Â is the number of phase symmetries in the signal set, that occur at different observation intervals. Another part of the code estimates the phase ambiguity present in every observation interval. The code makes use of simple blind or turbo phase estimators to provide phase estimates over every observation interval. We propose an iterative decoding schedule to apply the sum-product algorithm (SPA on the factor graph of the code for its convergence. To illustrate the new method, we present the performance results of an LDPC code constructed over Ã¢Â„Â¤4 with quadrature phase shift keying (QPSK modulated signals transmitted over a static channel, but affected by phase noise, which is modeled by the Wiener (random-walk process. The results show that the code can withstand phase noise of 2Ã¢ÂˆÂ˜ standard deviation per symbol with small loss.
Construction and Iterative Decoding of LDPC Codes Over Rings for Phase-Noisy Channels
Directory of Open Access Journals (Sweden)
Karuppasami Sridhar
2008-01-01
Full Text Available Abstract This paper presents the construction and iterative decoding of low-density parity-check (LDPC codes for channels affected by phase noise. The LDPC code is based on integer rings and designed to converge under phase-noisy channels. We assume that phase variations are small over short blocks of adjacent symbols. A part of the constructed code is inherently built with this knowledge and hence able to withstand a phase rotation of radians, where " " is the number of phase symmetries in the signal set, that occur at different observation intervals. Another part of the code estimates the phase ambiguity present in every observation interval. The code makes use of simple blind or turbo phase estimators to provide phase estimates over every observation interval. We propose an iterative decoding schedule to apply the sum-product algorithm (SPA on the factor graph of the code for its convergence. To illustrate the new method, we present the performance results of an LDPC code constructed over with quadrature phase shift keying (QPSK modulated signals transmitted over a static channel, but affected by phase noise, which is modeled by the Wiener (random-walk process. The results show that the code can withstand phase noise of standard deviation per symbol with small loss.
2008-01-01
Ansambel Fix peab 13. detsembril Tallinnas Saku Suurhallis oma 40. sünnipäeva. Kontserdi erikülaline on ansambel Apelsin, kaastegevad Jassi Zahharov ja HaleBopp Singers. Õhtut juhib Tarmo Leinatamm
He, Jing; Wen, Xuejie; Chen, Ming; Chen, Lin; Su, Jinshu
2015-01-01
To improve the transmission performance of multiband orthogonal frequency division multiplexing (MB-OFDM) ultra-wideband (UWB) over optical fiber, a pre-coding scheme based on low-density parity-check (LDPC) is adopted and experimentally demonstrated in the intensity-modulation and direct-detection MB-OFDM UWB over fiber system. Meanwhile, a symbol synchronization and pilot-aided channel estimation scheme is implemented on the receiver of the MB-OFDM UWB over fiber system. The experimental results show that the LDPC pre-coding scheme can work effectively in the MB-OFDM UWB over fiber system. After 70 km standard single-mode fiber (SSMF) transmission, at the bit error rate of 1 × 10-3, the receiver sensitivities are improved about 4 dB when the LDPC code rate is 75%.
Wang, Liming; Qiao, Yaojun; Yu, Qian; Zhang, Wenbo
2016-04-01
We introduce a watermark non-binary low-density parity check code (NB-LDPC) scheme, which can estimate the time-varying noise variance by using prior information of watermark symbols, to improve the performance of NB-LDPC codes. And compared with the prior-art counterpart, the watermark scheme can bring about 0.25 dB improvement in net coding gain (NCG) at bit error rate (BER) of 1e-6 and 36.8-81% reduction of the iteration numbers. Obviously, the proposed scheme shows great potential in terms of error correction performance and decoding efficiency.
Diseño de decodificadores de altas prestaciones para código LDPC
Angarita Preciado, Fabian Enrique
2013-01-01
En esta tesis se han investigado los algoritmos de decodificación para códigos de comprobación de paridad de baja densidad (LDPC) y las arquitecturas para la implementación hardware de éstos. El trabajo realizado se centra en los algoritmos del tipo de intercambio de mensajes para códigos estructurados los cuales se incluyen en varios estándares de comunicaciones. Inicialmente se han evaluado las prestaciones de los algoritmos existentes Sum-product, Min-Sum y las principales variantes de...
A new LDPC decoding scheme for PDM-8QAM BICM coherent optical communication system
Liu, Yi; Zhang, Wen-bo; Xi, Li-xia; Tang, Xian-feng; Zhang, Xiao-guang
2015-11-01
A new log-likelihood ratio (LLR) message estimation method is proposed for polarization-division multiplexing eight quadrature amplitude modulation (PDM-8QAM) bit-interleaved coded modulation (BICM) optical communication system. The formulation of the posterior probability is theoretically analyzed, and the way to reduce the pre-decoding bit error rate ( BER) of the low density parity check (LDPC) decoder for PDM-8QAM constellations is presented. Simulation results show that it outperforms the traditional scheme, i.e., the new post-decoding BER is decreased down to 50% of that of the traditional post-decoding algorithm.
LDPC-based iterative joint source-channel decoding for JPEG2000.
Pu, Lingling; Wu, Zhenyu; Bilgin, Ali; Marcellin, Michael W; Vasic, Bane
2007-02-01
A framework is proposed for iterative joint source-channel decoding of JPEG2000 codestreams. At the encoder, JPEG2000 is used to perform source coding with certain error-resilience (ER) modes, and LDPC codes are used to perform channel coding. During decoding, the source decoder uses the ER modes to identify corrupt sections of the codestream and provides this information to the channel decoder. Decoding is carried out jointly in an iterative fashion. Experimental results indicate that the proposed method requires fewer iterations and improves overall system performance.
Construction of type-II QC-LDPC codes with fast encoding based on perfect cyclic difference sets
Li, Ling-xiang; Li, Hai-bing; Li, Ji-bi; Jiang, Hua
2017-09-01
In view of the problems that the encoding complexity of quasi-cyclic low-density parity-check (QC-LDPC) codes is high and the minimum distance is not large enough which leads to the degradation of the error-correction performance, the new irregular type-II QC-LDPC codes based on perfect cyclic difference sets (CDSs) are constructed. The parity check matrices of these type-II QC-LDPC codes consist of the zero matrices with weight of 0, the circulant permutation matrices (CPMs) with weight of 1 and the circulant matrices with weight of 2 (W2CMs). The introduction of W2CMs in parity check matrices makes it possible to achieve the larger minimum distance which can improve the error- correction performance of the codes. The Tanner graphs of these codes have no girth-4, thus they have the excellent decoding convergence characteristics. In addition, because the parity check matrices have the quasi-dual diagonal structure, the fast encoding algorithm can reduce the encoding complexity effectively. Simulation results show that the new type-II QC-LDPC codes can achieve a more excellent error-correction performance and have no error floor phenomenon over the additive white Gaussian noise (AWGN) channel with sum-product algorithm (SPA) iterative decoding.
Advanced GF(32) nonbinary LDPC coded modulation with non-uniform 9-QAM outperforming star 8-QAM.
Liu, Tao; Lin, Changyu; Djordjevic, Ivan B
2016-06-27
In this paper, we first describe a 9-symbol non-uniform signaling scheme based on Huffman code, in which different symbols are transmitted with different probabilities. By using the Huffman procedure, prefix code is designed to approach the optimal performance. Then, we introduce an algorithm to determine the optimal signal constellation sets for our proposed non-uniform scheme with the criterion of maximizing constellation figure of merit (CFM). The proposed nonuniform polarization multiplexed signaling 9-QAM scheme has the same spectral efficiency as the conventional 8-QAM. Additionally, we propose a specially designed GF(32) nonbinary quasi-cyclic LDPC code for the coded modulation system based on the 9-QAM non-uniform scheme. Further, we study the efficiency of our proposed non-uniform 9-QAM, combined with nonbinary LDPC coding, and demonstrate by Monte Carlo simulation that the proposed GF(23) nonbinary LDPC coded 9-QAM scheme outperforms nonbinary LDPC coded uniform 8-QAM by at least 0.8dB.
Error Correction using Quantum Quasi-Cyclic Low-Density Parity-Check(LDPC) Codes
Jing, Lin; Brun, Todd; Quantum Research Team
Quasi-cyclic LDPC codes can approach the Shannon capacity and have efficient decoders. Manabu Hagiwara et al., 2007 presented a method to calculate parity check matrices with high girth. Two distinct, orthogonal matrices Hc and Hd are used. Using submatrices obtained from Hc and Hd by deleting rows, we can alter the code rate. The submatrix of Hc is used to correct Pauli X errors, and the submatrix of Hd to correct Pauli Z errors. We simulated this system for depolarizing noise on USC's High Performance Computing Cluster, and obtained the block error rate (BER) as a function of the error weight and code rate. From the rates of uncorrectable errors under different error weights we can extrapolate the BER to any small error probability. Our results show that this code family can perform reasonably well even at high code rates, thus considerably reducing the overhead compared to concatenated and surface codes. This makes these codes promising as storage blocks in fault-tolerant quantum computation. Error Correction using Quantum Quasi-Cyclic Low-Density Parity-Check(LDPC) Codes.
Interior point decoding for linear vector channels
International Nuclear Information System (INIS)
Wadayama, T
2008-01-01
In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector channels include many practically important channels such as inter-symbol interference channels and partial response channels. It is shown that the maximum likelihood decoding (MLD) rule for a linear vector channel can be relaxed to a convex optimization problem, which is called a relaxed MLD problem
Interior point decoding for linear vector channels
Energy Technology Data Exchange (ETDEWEB)
Wadayama, T [Nagoya Institute of Technology, Gokiso, Showa-ku, Nagoya, Aichi, 466-8555 (Japan)], E-mail: wadayama@nitech.ac.jp
2008-01-15
In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector channels include many practically important channels such as inter-symbol interference channels and partial response channels. It is shown that the maximum likelihood decoding (MLD) rule for a linear vector channel can be relaxed to a convex optimization problem, which is called a relaxed MLD problem.
Multiple component codes based generalized LDPC codes for high-speed optical transport.
Djordjevic, Ivan B; Wang, Ting
2014-07-14
A class of generalized low-density parity-check (GLDPC) codes suitable for optical communications is proposed, which consists of multiple local codes. It is shown that Hamming, BCH, and Reed-Muller codes can be used as local codes, and that the maximum a posteriori probability (MAP) decoding of these local codes by Ashikhmin-Lytsin algorithm is feasible in terms of complexity and performance. We demonstrate that record coding gains can be obtained from properly designed GLDPC codes, derived from multiple component codes. We then show that several recently proposed classes of LDPC codes such as convolutional and spatially-coupled codes can be described using the concept of GLDPC coding, which indicates that the GLDPC coding can be used as a unified platform for advanced FEC enabling ultra-high speed optical transport. The proposed class of GLDPC codes is also suitable for code-rate adaption, to adjust the error correction strength depending on the optical channel conditions.
High performance reconciliation for continuous-variable quantum key distribution with LDPC code
Lin, Dakai; Huang, Duan; Huang, Peng; Peng, Jinye; Zeng, Guihua
2015-03-01
Reconciliation is a significant procedure in a continuous-variable quantum key distribution (CV-QKD) system. It is employed to extract secure secret key from the resulted string through quantum channel between two users. However, the efficiency and the speed of previous reconciliation algorithms are low. These problems limit the secure communication distance and the secure key rate of CV-QKD systems. In this paper, we proposed a high-speed reconciliation algorithm through employing a well-structured decoding scheme based on low density parity-check (LDPC) code. The complexity of the proposed algorithm is reduced obviously. By using a graphics processing unit (GPU) device, our method may reach a reconciliation speed of 25 Mb/s for a CV-QKD system, which is currently the highest level and paves the way to high-speed CV-QKD.
Percolation bounds for decoding thresholds with correlated erasures in quantum LDPC codes
Hamilton, Kathleen; Pryadko, Leonid
Correlations between errors can dramatically affect decoding thresholds, in some cases eliminating the threshold altogether. We analyze the existence of a threshold for quantum low-density parity-check (LDPC) codes in the case of correlated erasures. When erasures are positively correlated, the corresponding multi-variate Bernoulli distribution can be modeled in terms of cluster errors, where qubits in clusters of various size can be marked all at once. In a code family with distance scaling as a power law of the code length, erasures can be always corrected below percolation on a qubit adjacency graph associated with the code. We bound this correlated percolation transition by weighted (uncorrelated) percolation on a specially constructed cluster connectivity graph, and apply our recent results to construct several bounds for the latter. This research was supported in part by the NSF Grant PHY-1416578 and by the ARO Grant W911NF-14-1-0272.
Adaptive transmission based on multi-relay selection and rate-compatible LDPC codes
Su, Hualing; He, Yucheng; Zhou, Lin
2017-08-01
In order to adapt to the dynamical changeable channel condition and improve the transmissive reliability of the system, a cooperation system of rate-compatible low density parity check (RC-LDPC) codes combining with multi-relay selection protocol is proposed. In traditional relay selection protocol, only the channel state information (CSI) of source-relay and the CSI of relay-destination has been considered. The multi-relay selection protocol proposed by this paper takes the CSI between relays into extra account in order to obtain more chances of collabration. Additionally, the idea of hybrid automatic request retransmission (HARQ) and rate-compatible are introduced. Simulation results show that the transmissive reliability of the system can be significantly improved by the proposed protocol.
Recursive construction of (J,L (J,L QC LDPC codes with girth 6
Directory of Open Access Journals (Sweden)
Mohammad Gholami
2016-06-01
Full Text Available In this paper, a recursive algorithm is presented to generate some exponent matrices which correspond to Tanner graphs with girth at least 6. For a J×L J×L exponent matrix E E, the lower bound Q(E Q(E is obtained explicitly such that (J,L (J,L QC LDPC codes with girth at least 6 exist for any circulant permutation matrix (CPM size m≥Q(E m≥Q(E. The results show that the exponent matrices constructed with our recursive algorithm have smaller lower-bound than the ones proposed recently with girth 6
MIMO-OFDM System's Performance Using LDPC Codes for a Mobile Robot
Daoud, Omar; Alani, Omar
This work deals with the performance of a Sniffer Mobile Robot (SNFRbot)-based spatial multiplexed wireless Orthogonal Frequency Division Multiplexing (OFDM) transmission technology. The use of Multi-Input Multi-Output (MIMO)-OFDM technology increases the wireless transmission rate without increasing transmission power or bandwidth. A generic multilayer architecture of the SNFRbot is proposed with low power and low cost. Some experimental results are presented and show the efficiency of sniffing deadly gazes, sensing high temperatures and sending live videos of the monitored situation. Moreover, simulation results show the achieved performance by tackling the Peak-to-Average Power Ratio (PAPR) problem of the used technology using Low Density Parity Check (LDPC) codes; and the effect of combating the PAPR on the bit error rate (BER) and the signal to noise ratio (SNR) over a Doppler spread channel.
Some Aspects of Fixed Point Theory!
Indian Academy of Sciences (India)
1999-01-22
Jan 22, 1999 ... the quadratic equation ax2+bx+c = 0 may not have real solutions for real numbers a, band c with a i= O. How- ever, it will always have a pair of solutions in the system of complex numbers. More generally, one can consider an equation of the form g(x) = 0, where 9 is a real- valued function of a real variable.
Alarm points for fixed oxygen monitors
International Nuclear Information System (INIS)
Miller, G.C.
1987-05-01
Oxygen concentration monitors were installed in a vault where numerous pipes carried inert cryogens and gases to the Mirror Fusion Test Facility (MFTF-B) experimental vessel at Lawrence Livermore National Laboratory (LLNL). The problems associated with oxygen-monitoring systems and the reasons why such monitors were installed were reviewed. As a result of this review, the MFTF-B monitors were set to sound an evacuation alarm when the oxygen concentration fell below 18%. We chose the 18% alarm criterion to minimize false alarms and to allow time for personnel to escape in an oxygen-deficient environment
On Fixed Points of Strictly Causal Functions
2013-04-08
were defined to be the functions that are strictly contracting with respect to the Cantor metric (also called the Baire distance) on signals over non...in Computer Science, pages 447–484. Springer Berlin / Heidelberg, 1992. [36] George Markowsky. Chain-complete posets and directed sets with...Journal of Logic Programming, 42(2):59–70, 2000. [53] George M. Reed and A. William Roscoe. A timed model for communicating sequential processes. In
Fixed point theory, variational analysis, and optimization
Al-Mezel, Saleh Abdullah R; Ansari, Qamrul Hasan
2015-01-01
""There is a real need for this book. It is useful for people who work in areas of nonlinear analysis, optimization theory, variational inequalities, and mathematical economics.""-Nan-Jing Huang, Sichuan University, Chengdu, People's Republic of China
Djordjevic, Ivan B
2007-08-06
We describe a coded power-efficient transmission scheme based on repetition MIMO principle suitable for communication over the atmospheric turbulence channel, and determine its channel capacity. The proposed scheme employs the Q-ary pulse-position modulation. We further study how to approach the channel capacity limits using low-density parity-check (LDPC) codes. Component LDPC codes are designed using the concept of pairwise-balanced designs. Contrary to the several recent publications, bit-error rates and channel capacities are reported assuming non-ideal photodetection. The atmospheric turbulence channel is modeled using the Gamma-Gamma distribution function due to Al-Habash et al. Excellent bit-error rate performance improvement, over uncoded case, is found.
On the reduced-complexity of LDPC decoders for beyond 400 Gb/s serial optical transmission
Djordjevic, Ivan B.; Xu, Lei; Wang, Ting
2010-12-01
Two reduced-complexity (RC) LDPC decoders are proposed, which can be used in combination with large-girth LDPC codes to enable beyond 400 Gb/s serial optical transmission. We show that optimally attenuated RC min-sum sum algorithm performs only 0.45 dB worse than conventional sum-product algorithm, while having lower storage memory requirements and much lower latency. We further evaluate the proposed algorithms for use in beyond 400 Gb/s serial optical transmission in combination with PolMUX 32-IPQ-based signal constellation and show that low BERs can be achieved for medium optical SNRs, while achieving the net coding gain above 11.4 dB.
Comments on “Techniques and Architectures for Hazard-Free Semi-Parallel Decoding of LDPC Codes”
Directory of Open Access Journals (Sweden)
Mark B. Yeary
2009-01-01
Full Text Available This is a comment article on the publication “Techniques and Architectures for Hazard-Free Semi-Parallel Decoding of LDPC Codes” Rovini et al. (2009. We mention that there has been similar work reported in the literature before, and the previous work has not been cited correctly, for example Gunnam et al. (2006, 2007. This brief note serves to clarify these issues.
Siegel, J.; Siegel, Edward Carl-Ludwig
2011-03-01
Cook-Levin computational-"complexity"(C-C) algorithmic-equivalence reduction-theorem reducibility equivalence to renormalization-(semi)-group phase-transitions critical-phenomena statistical-physics universality-classes fixed-points, is exploited with Gauss modular/clock-arithmetic/model congruences = signal X noise PRODUCT reinterpretation. Siegel-Baez FUZZYICS=CATEGORYICS(SON of ``TRIZ''): Category-Semantics(C-S) tabular list-format truth-table matrix analytics predicts and implements "noise"-induced phase-transitions (NITs) to accelerate versus to decelerate Harel [Algorithmics(1987)]-Sipser[Intro. Theory Computation(1997) algorithmic C-C: "NIT-picking" to optimize optimization-problems optimally(OOPO). Versus iso-"noise" power-spectrum quantitative-only amplitude/magnitude-only variation stochastic-resonance, this "NIT-picking" is "noise" power-spectrum QUALitative-type variation via quantitative critical-exponents variation. Computer-"science" algorithmic C-C models: Turing-machine, finite-state-models/automata, are identified as early-days once-workable but NOW ONLY LIMITING CRUTCHES IMPEDING latter-days new-insights!!!
Yuan, Jian-guo; Zhou, Guang-xiang; Gao, Wen-chun; Wang, Yong; Lin, Jin-zhao; Pang, Yu
2016-01-01
According to the requirements of the increasing development for optical transmission systems, a novel construction method of quasi-cyclic low-density parity-check (QC-LDPC) codes based on the subgroup of the finite field multiplicative group is proposed. Furthermore, this construction method can effectively avoid the girth-4 phenomena and has the advantages such as simpler construction, easier implementation, lower encoding/decoding complexity, better girth properties and more flexible adjustment for the code length and code rate. The simulation results show that the error correction performance of the QC-LDPC(3 780,3 540) code with the code rate of 93.7% constructed by this proposed method is excellent, its net coding gain is respectively 0.3 dB, 0.55 dB, 1.4 dB and 1.98 dB higher than those of the QC-LDPC(5 334,4 962) code constructed by the method based on the inverse element characteristics in the finite field multiplicative group, the SCG-LDPC(3 969,3 720) code constructed by the systematically constructed Gallager (SCG) random construction method, the LDPC(32 640,30 592) code in ITU-T G.975.1 and the classic RS(255,239) code which is widely used in optical transmission systems in ITU-T G.975 at the bit error rate ( BER) of 10-7. Therefore, the constructed QC-LDPC(3 780,3 540) code is more suitable for optical transmission systems.
Instanton-based techniques for analysis and reduction of error floors of LDPC codes
International Nuclear Information System (INIS)
Chertkov, Michael; Chilappagari, Shashi K.; Stepanov, Mikhail G.; Vasic, Bane
2008-01-01
We describe a family of instanton-based optimization methods developed recently for the analysis of the error floors of low-density parity-check (LDPC) codes. Instantons are the most probable configurations of the channel noise which result in decoding failures. We show that the general idea and the respective optimization technique are applicable broadly to a variety of channels, discrete or continuous, and variety of sub-optimal decoders. Specifically, we consider: iterative belief propagation (BP) decoders, Gallager type decoders, and linear programming (LP) decoders performing over the additive white Gaussian noise channel (AWGNC) and the binary symmetric channel (BSC). The instanton analysis suggests that the underlying topological structures of the most probable instanton of the same code but different channels and decoders are related to each other. Armed with this understanding of the graphical structure of the instanton and its relation to the decoding failures, we suggest a method to construct codes whose Tanner graphs are free of these structures, and thus have less significant error floors.
Blind Estimation of the Phase and Carrier Frequency Offsets for LDPC-Coded Systems
Directory of Open Access Journals (Sweden)
Houcke Sebastien
2010-01-01
Full Text Available Abstract We consider in this paper the problem of phase offset and Carrier Frequency Offset (CFO estimation for Low-Density Parity-Check (LDPC coded systems. We propose new blind estimation techniques based on the calculation and minimization of functions of the Log-Likelihood Ratios (LLR of the syndrome elements obtained according to the parity check matrix of the error-correcting code. In the first part of this paper, we consider phase offset estimation for a Binary Phase Shift Keying (BPSK modulation and propose a novel estimation technique. Simulation results show that the proposed method is very effective and outperforms many existing algorithms. Then, we modify the estimation criterion so that it can work for higher-order modulations. One interesting feature of the proposed algorithm when applied to high-order modulations is that the phase offset of the channel can be blindly estimated without any ambiguity. In the second part of the paper, we consider the problem of CFO estimation and propose estimation techniques that are based on the same concept as the ones presented for the phase offset estimation. The Mean Squared Error (MSE and Bit Error Rate (BER curves show the efficiency of the proposed estimation techniques.
BER EVALUATION OF LDPC CODES WITH GMSK IN NAKAGAMI FADING CHANNEL
Directory of Open Access Journals (Sweden)
Surbhi Sharma
2010-06-01
Full Text Available LDPC codes (Low Density Parity Check Codes have already proved its efficacy while showing its performance near to the Shannon limit. Channel coding schemes are spectrally inefficient as using an unfiltered binary data stream to modulate an RF carrier that will produce an RF spectrum of considerable bandwidth. Techniques have been developed to improve this bandwidth inefficiency or spectral efficiency, and ease detection. GMSK or Gaussian-filtered Minimum Shift Keying uses a Gaussian Filter of an appropriate bandwidth so as to make system spectrally efficient. A Nakagami model provides a better explanation to less and more severe conditions than the Rayleigh and Rician model and provide a better fit to the mobile communication channel data. In this paper we have demonstrated the performance of Low Density Parity Check codes with GMSK modulation (BT product=0.25 technique in Nakagami fading channel. In results it is shown that average bit error rate decreases as the ‘m’ parameter increases (Less fading.
Instanton-based techniques for analysis and reduction of error floor of LDPC codes
Energy Technology Data Exchange (ETDEWEB)
Chertkov, Michael [Los Alamos National Laboratory; Chilappagari, Shashi K [Los Alamos National Laboratory; Stepanov, Mikhail G [Los Alamos National Laboratory; Vasic, Bane [SENIOR MEMBER, IEEE
2008-01-01
We describe a family of instanton-based optimization methods developed recently for the analysis of the error floors of low-density parity-check (LDPC) codes. Instantons are the most probable configurations of the channel noise which result in decoding failures. We show that the general idea and the respective optimization technique are applicable broadly to a variety of channels, discrete or continuous, and variety of sub-optimal decoders. Specifically, we consider: iterative belief propagation (BP) decoders, Gallager type decoders, and linear programming (LP) decoders performing over the additive white Gaussian noise channel (AWGNC) and the binary symmetric channel (BSC). The instanton analysis suggests that the underlying topological structures of the most probable instanton of the same code but different channels and decoders are related to each other. Armed with this understanding of the graphical structure of the instanton and its relation to the decoding failures, we suggest a method to construct codes whose Tanner graphs are free of these structures, and thus have less significant error floors.
A Low-Complexity and High-Performance 2D Look-Up Table for LDPC Hardware Implementation
Chen, Jung-Chieh; Yang, Po-Hui; Lain, Jenn-Kaie; Chung, Tzu-Wen
In this paper, we propose a low-complexity, high-efficiency two-dimensional look-up table (2D LUT) for carrying out the sum-product algorithm in the decoding of low-density parity-check (LDPC) codes. Instead of employing adders for the core operation when updating check node messages, in the proposed scheme, the main term and correction factor of the core operation are successfully merged into a compact 2D LUT. Simulation results indicate that the proposed 2D LUT not only attains close-to-optimal bit error rate performance but also enjoys a low complexity advantage that is suitable for hardware implementation.
Fixed Wireless may be a temporary answer
Indian Academy of Sciences (India)
Possible to enhance throughput by 4 with respect to Mobile Wireless. And get 8 to 10 bps / Hz / cell; Examples: BB corDECT: today provides 256/512kbps to each connection in fixed environment. Ideal for small town / rural Broadband. Fixed 802.16d/e does the same in but at much higher price-points.
Design and performance investigation of LDPC-coded upstream transmission systems in IM/DD OFDM-PONs
Gong, Xiaoxue; Guo, Lei; Wu, Jingjing; Ning, Zhaolong
2016-12-01
In Intensity-Modulation Direct-Detection (IM/DD) Orthogonal Frequency Division Multiplexing Passive Optical Networks (OFDM-PONs), aside from Subcarrier-to-Subcarrier Intermixing Interferences (SSII) induced by square-law detection, the same laser frequency for data sending from Optical Network Units (ONUs) results in ONU-to-ONU Beating Interferences (OOBI) at the receiver. To mitigate those interferences, we design a Low-Density Parity Check (LDPC)-coded and spectrum-efficient upstream transmission system. A theoretical channel model is also derived, in order to analyze the detrimental factors influencing system performances. Simulation results demonstrate that the receiver sensitivity is improved 3.4 dB and 2.5 dB under QPSK and 8QAM, respectively, after 100 km Standard Single-Mode Fiber (SSMF) transmission. Furthermore, the spectrum efficiency can be improved by about 50%.
International Nuclear Information System (INIS)
Christiansen, D.W.
1982-01-01
This is a reusable system for fixing a nuclear reactor fuel rod to a support. An interlock cap is fixed to the fuel rod and an interlock strip is fixed to the support. The interlock cap has two opposed fingers, which are shaped so that a base is formed with a body part. The interlock strip has an extension, which is shaped so that this is rigidly fixed to the body part of the base. The fingers of the interlock cap are elastic in bending. To fix it, the interlock cap is pushed longitudinally on to the interlock strip, which causes the extension to bend the fingers open in order to engage with the body part of the base. To remove it, the procedure is reversed. (orig.) [de
Finite volume QCD at fixed topological charge
Aoki, Sinya; Fukaya, Hidenori; Hashimoto, Shoji; Onogi, Tetsuya
2007-01-01
In finite volume the partition function of QCD with a given $\\theta$ is a sum of different topological sectors with a weight primarily determined by the topological susceptibility. If a physical observable is evaluated only in a fixed topological sector, the result deviates from the true expectation value by an amount proportional to the inverse space-time volume 1/V. Using the saddle point expansion, we derive formulas to express the correction due to the fixed topological charge in terms of...