DOCSLIB.ORG

Algebraic Constructions of Graph-Based Nested Codes from Protographs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Algebraic Constructions of Graph-Based Nested Codes from Protographs Algebraic Constructions of Graph-Based Nested Codes from Protographs Christine A. Kelley Jorg¨ Kliewer Department of Mathematics Klipsch School of Electrical and Computer Engineering University of Nebraska-Lincoln New Mexico State University Lincoln, NE 68588, USA Las Cruces, NM 88003, USA Email: [email protected] Email: [email protected] Abstract—Nested codes have been employed in a large number on a separation of channel and network coding for non-ergodic of communication applications as a specific case of superposition discrete-input fading channels. In these applications we require codes, for example to implement binning schemes in the presence the subcodes to be better in threshold and/or in error-floor than of noise, in joint network-channel coding, or in physical-layer secrecy. Whereas nested lattice codes have been proposed recently the global code. for continuous-input channels, in this paper we focus on the In this paper we focus on array-code type constructions [8], construction of nested linear codes for joint channel-network [9] and propose an algebraic design of nested linear codes coding problems based on algebraic protograph LDPC codes. In based on protograph LDPC codes [10], [11]. In particular, particular, over the past few years several constructions of codes in [12], [13] a lifting technique based on voltage graphs has have been proposed that are based on random lifts of suitably chosen base graphs. More recently, an algebraic analog of this been proposed which has been shown to provide a large girth approach was introduced using the theory of voltage graphs. In of the code graph and thus a good error-floor performance. this paper we illustrate how these methods can be used in the In contrast to previous approaches based on concatenated and construction of nested codes from algebraic lifts of graphs. random LDGM codes [5], [14] and also to constructions based on random LDPC codes we show that the advantage of the I. INTRODUCTION above algebraic constructions in the error floor regime also Nested codes have been widely used to implement binning carries over to the nested code setting. schemes based on coset codes in the presence of noise for II. PRELIMINARIES numerous scenarios, for example for the noisy Wyner-Ziv problem [1] and the dual Gel’fand-Pinsker problem [2]. In A. Nested codes particular, for the case with continuous-input channels, binning Consider M different information vectors i! of length K!, schemes based on nested lattice codes have been proposed ! =1,...,M,whichwewanttoencodejointlyinsuchaway in [3]. Recently, in [4] the authors consider discrete-input that each information vector is associated with a codeword channels and present compound LDGM/LDPC constructions from a different subcode. The overall codeword c is generated which are optimal under ML decoding. by multiplying the concatenation of all information vectors While nested codes in these contexts are related to joint with a generator matrix G of the global code C according to source-channel coding problems, the class of algebraic nested G1 codes we will address in this paper are defined based on a joint channel and network coding scenario. Such nested cT =[iT ,iT ...iT ] . =[iT ,iT ...iT ]G = 1 2 M . 1 2 M codes have been originally proposed in [5] for the generalized broadcast relay problem, where a relay node broadcasts N GM T T T packets to several destination nodes, which already know some i1 G1 ⊕ i2 G2 ⊕···⊕iM GM , (1) of the packets apriori.Arelatedconceptwasusedin[6] where each of the subcodes C with generator G of rate R = in the context of two-way relaying. The idea is that instead ! ! ! K /N is associated with the corresponding information vector of information words, codewords of different subcodes C , ! ! i and ⊕ represents a bitwise XOR. The goal is now to find 1 ≤ ! ≤ N,arealgebraicallysuperimposedviaabitwise ! general systematic design strategies where the subcodes, any XOR. In contrast to nested codes for the joint source-channel combination of subcodes, and the global code C have good coding scenario described above, here each subcode and any threshold and/or error floor properties. arbitrary combination of the subcodes is intended to form a For the sake of simplicity we focus on M =2and the good channel code. In particular, this also holds for the linear binary case in the following. Our aim is to design an LDPC combination of all subcodes, the global code C.Ithasbeen code such that its generator matrix G satisfies (1), where H ∈ shown in [7] for a broadcast scenario with side information {0, 1}(N−K1−K2)×N represents a corresponding parity check that such a construction is able to outperform a scheme based matrix. If G is not rank deficient, the null space of H of T T This work has been supported in part by NSF grant CCF-0830666 and in dimension (N − K1 − K2) contains the codewords c1 ⊕ c2 = T T part by NSF grant EPS-0701892. i1 G1 ⊕ i2 G2. 1 Likewise, the columns of the parity check matrices H1, 2 i H2 associated with G1, G2 each form a basis for their null i 31 2 spaces of dimensions (N − K1) and (N − K2),respectively. i i 1 3 AnecessaryconditiontopreventG from having a rank 2 (13)(2) smaller than K1 + K2 is that H1, H2 cannot have more than 3 1 2 (N − K1 − K2) linear independent parity check equations 1 3 in common. Based on these considerations, we propose the (123) 2 following design strategy. First, randomly generate a matrix i=(1)(2)(3) 3 M ∈{0, 1}N×N of full rank N,accordingtoagivenrow Fig. 1. A permutation voltage graph G is shown on the left and its derived ˆ ˆ and column degree distribution. This matrix is then partitioned graph G on the right, where G serves as a protograph for G.Thedarkeredges correspond to the connections between the clouds of verticesincidentwith into three submatrices the nontrivial labeled edges. T (N×N) (N×K2) (N×K1) (N×(N−K1−K2)) Gα,calledthe(right) derived graph,isa|G|-degree lift of G M = 'M1 M2 M3 ( . (2) and has vertex set V × G and edge set E × G,whereif(u, v) Next, the individual parity check matrices for the nested is a positively oriented edge in G with voltage b,then(u, a) is α code are obtained as connected to (v,ab) in G .Alternatively,anotherconstruction takes the voltage group to be the symmetric group S on n (N×(N−K1−K2)) T n H =[M3 ] , elements and has α map the positively-oriented edges of G into − × × − − T H((N K1) N) = M N×K2 M (N (N K1 K2)) , Sn.Thisyieldsapermutation voltage graph.Thepermutation 1 ' 1 3 ( derived graph Gα is a degree n lift (instead of n!)withvertices − × × − − T H((N K2) N) = M N×K1 M (N (N K1 K2)) . V ×{1,...,n} and edges E ×{1,...,n}.Ifπ ∈ Sn is a 2 ' 2 3 ( permutation voltage on the edge e =(u, v) of G,thenthere α Thus, both H1 and H2 are guaranteed to have a null space is an edge from (u, i) to (v,π(i)) in G for i =1, 2,...,n. of dimensions (N − K1) and (N − K2),respectively,andH We will represent each vertex (v,i) and each edge (e, i) in has (N − K1 − K2) parity check equations that are satisfied the derived graph by vi and ei,respectively.Inbothcases,the by C1 and C2. labeled base graph (i.e. voltage graph) algebraically determines Proposition 1. The nested code property in (1) holds also if aspecificliftofthegraph.Fig.1showsapermutationvoltage graph G = K , with two nontrivial permutation voltages on M and thus one or more of the matrices H, H1,andH2 are 2 3 (row) rank deficient. For a rank deficit r of the check matrix its edges to the group S3,andthecorrespondingdegree3 H the rate loss for the global code C is given as ∆R ≤ r/N. permutation derived graph. Henceforth, derived (lifted) graphs will be denoted by Gˆ Proof: Denote the rank deficit for the matrices M , M 1 2 since the voltage assignment α should be clear from context. as r ≥ 0, r ≥ 0,respectively.ThismeansthatG has 1 2 1 In this paper we will focus on permutation voltage graphs for now a rank of at least K + r + r ,andG arankofat 1 1 2 designing nested codes. least K2 + r + r2,resp.,whichleadstoanoverallrankof at least K1 + K2 + r + r1 + r2 for the generator matrix G. III. NESTED CODES FROM PROTOGRAPHS Since both subcodes have at most N − K − K − r check 1 2 We now describe a simple method to construct nested equations in common the row rank of G must not be smaller codes from protographs in which the base Tanner graphs than K + K + r to ensure the nested code property which 1 2 corresponding to small parity-check matrices H ,H ,andH is satisfied for any r ≥ 0, r ≥ 0.BysettingR# + R# = 1 2 1 2 1 2 are lifted to obtain Tanner graphs with corresponding parity- (K + K + r)/N where R# and R# denote the new rates for 1 2 1 2 check matrices Hˆ , Hˆ ,andHˆ .Thesimplicityofourmethod the subcodes C and C ,aratelossof∆R ≤ r/N for the 1 2 1 2 is that it involves just one lifting of the base graph G code C is obtained. M corresponding to M. Note that an extension of the above design strategy to M> We start with a small bipartite base graph G with n left 2 can be obtained in a straightforward way by modifying the M vertices, denoted by the set L,andn right vertices, denoted partitioning and construction of M in (2).
Load more

Recommended publications
  • Superregular Matrices and Applications to Convolutional Codes
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Repositório Institucional da Universidade de Aveiro Superregular matrices and applications to convolutional codes P. J. Almeidaa, D. Nappa, R.Pinto∗,a aCIDMA - Center for Research and Development in Mathematics and Applications, Department of Mathematics, University of Aveiro, Aveiro, Portugal. Abstract The main results of this paper are twofold: the first one is a matrix theoretical result. We say that a matrix is superregular if all of its minors that are not trivially zero are nonzero. Given a a × b, a ≥ b, superregular matrix over a field, we show that if all of its rows are nonzero then any linear combination of its columns, with nonzero coefficients, has at least a − b + 1 nonzero entries. Secondly, we make use of this result to construct convolutional codes that attain the maximum possible distance for some fixed parameters of the code, namely, the rate and the Forney indices. These results answer some open questions on distances and constructions of convolutional codes posted in the literature [6, 9]. Key words: convolutional code, Forney indices, optimal code, superregular matrix 2000MSC: 94B10, 15B33, 15B05 1. Introduction Several notions of superregular matrices (or totally positive) have appeared in different areas of mathematics and engineering having in common the specification of some properties regarding their minors [2, 3, 5, 11, 14]. In the context of coding theory these matrices have entries in a finite field F and are important because they can be used to generate linear codes with good distance properties.
    [Show full text]
  • Reed-Solomon Code and Its Application 1 Equivalence
    IERG 6120 Coding Theory for Storage Systems Lecture 5 - 27/09/2016 Reed-Solomon Code and Its Application Lecturer: Kenneth Shum Scribe: Xishi Wang 1 Equivalence of Codes Two linear codes are said to be equivalent if one of them can be obtained from the other by means of a sequence of transformations of the following types: (i) a permutation of the positions of the code; (ii) multiplication of symbols in a fixed position by a non-zero scalar in F . Note that these transformations can be applied to all code symbols. 2 Reed-Solomon Code In RS code each symbol in the codewords is the evaluation of a polynomial at one point α, namely, 2 1 3 6 α 7 6 2 7 6 α 7 f(α) = c0 c1 c2 ··· ck−1 6 7 : 6 . 7 4 . 5 αk−1 The whole codeword is given by n such evaluations at distinct points α1; ··· ; αn, 2 1 1 ··· 1 3 6 α1 α2 ··· αn 7 6 2 2 2 7 6 α1 α2 ··· αn 7 T f(α1) f(α2) ··· f(αn) = c0 c1 c2 ··· ck−1 6 7 = c G: 6 . .. 7 4 . 5 k−1 k−1 k−1 α1 α2 ··· αn G is the generator matrix of RSq(n; k; d) code. The order of writing down the field elements α1 to αn is not important as far as the code structure is concerned, as any permutation of the αi's give an equivalent code. i j=1;:::;n The generator matrix G is a Vandermonde matrix, which is of the form [aj]i=0;:::;k−1.
    [Show full text]
  • Linear Block Codes Vector Spaces
    Linear Block Codes Vector Spaces Let GF(q) be fixed, normally q=2 • The set Vn consisting of all n-dimensional vectors (a n-1, a n-2,•••a0), ai ∈ GF(q), 0 ≤i ≤n-1 forms an n-dimensional vector space. • In Vn, we can also define the inner product of any two vectors a = (a n-1, a n-2,•••a0) and b = (b n-1, b n-2,•••b0) n−1 i ab= ∑ abi i i=0 • If a•b = 0, then a and b are said to be orthogonal. Linear Block codes • Let C ⊂ Vn be a block code consisting of M codewords. • C is said to be linear if a linear combination of two codewords C1 and C2, a 1C1+a 2C2, is still a codeword, that is, C forms a subspace of Vn. a 1, ∈ a2 GF(q) • The dimension of the linear block code (a subspace of Vn) is denoted as k. M=qk. Dual codes Let C ⊂Vn be a linear code with dimension K. ┴ The dual code C of C consists of all vectors in Vn that are orthogonal to every vector in C. The dual code C┴ is also a linear code; its dimension is equal to n-k. Generator Matrix Assume q=2 Let C be a binary linear code with dimension K. Let {g1,g2,…gk} be a basis for C, where gi = (g i(n-1) , g i(n-2) , … gi0 ), 1 ≤i≤K. Then any codeword Ci in C can be represented uniquely as a linear combination of {g1,g2,…gk}.
    [Show full text]
  • On a Class of Matrices with Low Displacement Rank M
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Linear Algebra and its Applications 325 (2001) 161–176 www.elsevier.com/locate/laa On a class of matrices with low displacement rank M. Barnabei∗, L.B. Montefusco Department of Mathematics, University of Bologna, Piazza di Porta S. Donato, 5 40127 Bologna, Italy Received 5 June 2000; accepted 5 September 2000 Submitted by L. Elsner Abstract AmatrixA such that, for some matrices U and V, the matrix AU − VAor the matrix A − VAU has a rank which is small compared with the order of the matrix is called a matrix with displacement structure. In this paper the authors single out a new class of matrices with dis- placement structure—namely, finite sections of recursive matrices—which includes the class of finite Hurwitz matrices, widely used in computer graphics. For such matrices it is possible to give an explicit evaluation of the displacement rank and an algebraic description, and hence a stable numerical evaluation, of the corresponding generators. The generalized Schur algorithm can therefore be used for the fast factorization of some classes of such matrices, and exhibits a backward stable behavior. © 2001 Elsevier Science Inc. All rights reserved. AMS classification: 65F05; 65F30; 15A23; 15A57 Keywords: Recursive matrices; Displacement structure; Fast factorization algorithm; Stability 1. Introduction It is well known that the notion of matrix with displacement structure is used in the literature to define classes of matrices for which fast O(n2) factorization algorithms can be given (see, e.g., [9]).
    [Show full text]
  • Chapter 2: Linear Algebra User's Manual
    Preprint typeset in JHEP style - HYPER VERSION Chapter 2: Linear Algebra User's Manual Gregory W. Moore Abstract: An overview of some of the finer points of linear algebra usually omitted in physics courses. May 3, 2021 -TOC- Contents 1. Introduction 5 2. Basic Definitions Of Algebraic Structures: Rings, Fields, Modules, Vec- tor Spaces, And Algebras 6 2.1 Rings 6 2.2 Fields 7 2.2.1 Finite Fields 8 2.3 Modules 8 2.4 Vector Spaces 9 2.5 Algebras 10 3. Linear Transformations 14 4. Basis And Dimension 16 4.1 Linear Independence 16 4.2 Free Modules 16 4.3 Vector Spaces 17 4.4 Linear Operators And Matrices 20 4.5 Determinant And Trace 23 5. New Vector Spaces from Old Ones 24 5.1 Direct sum 24 5.2 Quotient Space 28 5.3 Tensor Product 30 5.4 Dual Space 34 6. Tensor spaces 38 6.1 Totally Symmetric And Antisymmetric Tensors 39 6.2 Algebraic structures associated with tensors 44 6.2.1 An Approach To Noncommutative Geometry 47 7. Kernel, Image, and Cokernel 47 7.1 The index of a linear operator 50 8. A Taste of Homological Algebra 51 8.1 The Euler-Poincar´eprinciple 54 8.2 Chain maps and chain homotopies 55 8.3 Exact sequences of complexes 56 8.4 Left- and right-exactness 56 { 1 { 9. Relations Between Real, Complex, And Quaternionic Vector Spaces 59 9.1 Complex structure on a real vector space 59 9.2 Real Structure On A Complex Vector Space 64 9.2.1 Complex Conjugate Of A Complex Vector Space 66 9.2.2 Complexification 67 9.3 The Quaternions 69 9.4 Quaternionic Structure On A Real Vector Space 79 9.5 Quaternionic Structure On Complex Vector Space 79 9.5.1 Complex Structure On Quaternionic Vector Space 81 9.5.2 Summary 81 9.6 Spaces Of Real, Complex, Quaternionic Structures 81 10.
    [Show full text]
  • A Standard Generator/Parity Check Matrix for Codes from the Cayley Tables Due to the Non-Associative (123)-Avoiding Patterns of AUNU Numbers
    Universal Journal of Applied Mathematics 4(2): 39-41, 2016 http://www.hrpub.org DOI: 10.13189/ujam.2016.040202 A Standard Generator/Parity Check Matrix for Codes from the Cayley Tables Due to the Non-associative (123)-Avoiding Patterns of AUNU Numbers Ibrahim A.A1, Chun P.B2,*, Abubakar S.I3, Garba A.I1, Mustafa.A1 1Department of Mathematics, Usmanu Danfodiyo University Sokoto, Nigeria 2Department of Mathematics, Plateau State University Bokkos, Nigeria 3Department of Mathematics, Sokoto State University Sokoto, Nigeria Copyright©2016 by authors, all rights reserved. Authors agree that this article remains permanently open access under the terms of the Creative Commons Attribution License 4.0 international License. Abstract In this paper, we aim at utilizing the Cayley Eulerian graphs due to AUNU patterns had been reported in tables demonstrated by the Authors[1] in the construction of [2] and [3]. This special class of the (132) and a Generator/Parity check Matrix in standard form for a Code (123)-avoiding class of permutation patterns which were first say C Our goal is achieved first by converting the Cayley reported [4], where some group and graph theoretic tables in [1] using Mod2 arithmetic into a Matrix with entries properties were identified, had enjoyed a wide range of from the binary field. Echelon Row operations are then applications in various areas of applied Mathematics. In[1], performed (carried out) on the matrix in line with existing we described how the non-associative and non-commutative algorithms and propositions to obtain a matrix say G whose properties of the patterns can be established using their rows spans C and a matrix say H whose rows spans , the Cayley tables where a binary operation was defined to act on dual code of C, where G and H are given as, G = (Ik| X ) and the (132) and (123)-avoiding patterns of the AUNU numbers T H= ( -X |In-k ).
    [Show full text]
  • Error Correcting Codes
    9 error correcting codes A main idea of this sequence of notes is that accounting is a legitimate field of academic study independent of its vocational implications and its obvious impor- tance in the economic environment. For example, the study of accounting pro- motes careful and disciplined thinking important to any intellectual pursuit. Also, studying how accounting works illuminates other fields, both academic and ap- plied. In this chapter we begin to connect the study of accounting with the study of codes. Coding theory, while theoretically rich, is also important in its applica- tions, especially with the pervasiveness of computerized information transfer and storage. Information integrity is inherently of interest to accountants, so exploring coding can be justified for both academic and applied reasons. 9.1 kinds of codes We will study three kinds of codes: error detecting, error correcting, and secret codes. The first two increase the reliability of message transmission. The third, secret codes, are designed to ensure that messages are available only to authorized users, and can’t be read by the bad guys. The sequence of events for all three types of codes is as follows. 1. determine the message to transmit. For our purposes, we will treat messages as vectors. 2. The message is encoded. The result is termed a codeword, or cyphertext, also a vector. 180 9. error correcting codes 3. The codeword is transmitted through a channel. The channel might inject noise into the codeword, or it might be vulnerable to eavesdropping. 4. The received vector is decoded. If the received vector is no longer the trans- mitted codeword, the decoding process may detect, or even correct, the er- ror.
    [Show full text]
  • Lec16.Ps (Mpage)
    Potential Problems with Large Blocks 2 CSC310 – Information Theory Sam Roweis • Using very large blocks could potentially cause some serious practical problems with storage/retrieval of codewords. • In particular, if we are encoding blocks of K bits, our code will have 2K codewords. For K ≈ 1000 this is a huge number! Lecture 16: • How could we even store all the codewords? • How could we retrieve (look up) the N bit codeword corresponding to a given K bit message? Equivalent Codes & Systematic Forms • How could we check if a given block of N bits is a valid codeword or a forbidden encoding? • Last class, we saw how to solve all these problems by representing the codes mathematically and using the magic of linear algebra. November 9, 2005 • The valid codewords formed a subspace in the vector space of the N finite field Z2 . Reminder: Dealing with Long Blocks 1 Generator and Parity Check Matrices 3 • Recall that Shannon’s second theorem tells us that for any noisy • Using aritmetic mod 2, we could represent a code using either a set channel, there is some code which allows us to achieve error free of basis functions or a set of constraint (check) equations, transmission at a rate up to the capacity. represented a generator matrix G or a parity check matrix H. • However, this might require us to encode our message in very long • Every linear combination basis vectors is a valid codeword & all blocks. Why? valid codewords are spanned by the basis; similarly all valid • Intuitively it is because we need to add just the right fraction of codewords satisfy every check equation & any bitstring which redundancy; too little and we won’t be able to correct the erorrs, satisfies all equations is a valid codeword.
    [Show full text]
  • Estimating the Generator Matrix from Discret Data Set
    Estimating the Generator Matrix from Discret Data Set Romayssa Touaimia (Algeria) Department Probability and Statistics, Mathematical Institute Eötvös Loránd University, Budapest, Hungary A thesis submitted for the degree of MSc in Mathematics 2019. May Declaration I herewith declare that I have produced this thesis without the prohibited assistance of third parties and without making use of aids other than those specified; notions taken over directly or indirectly from other sources have been identified as such. This paper has not previously been presented in identical or similar form to any other Hungarian or foreign examination board. The thesis work was conducted under the supervision of Mr. Pröhle Tamás at Eötvös Loránd University. Budapest, May, 2019 Acknowledgements First and foremost, I would like to thank my supervision and advisor Mr. Prőhle Tamás for introducing me to this topic, for his help through the difficulties that I faced, his patience with me, his helpful suggestions and his assistance in every step through the process. I am grateful for the many discussions that we had. I would like to thank my parents whom were always there for me, sup- ported me and believed in me. Abstract Continuous Markov chain is determined by its transition rates which are the entries of the generator matrix. This generator matrix is used to fully describe the process. In this work, we will first start with an introduction about the impor- tance of the application of the Markov Chains in real life, then we will give some definitions that help us to understand the discrete and continuous time Markov chains, then we will see the relation between transition matrix and the generator matrix.
    [Show full text]
  • Recovery of a Lattice Generator Matrix from Its Gram Matrix for Feedback and Precoding in MIMO
    Recovery of a Lattice Generator Matrix from its Gram Matrix for Feedback and Precoding in MIMO Francisco A. Monteiro, Student Member, IEEE, and Ian J. Wassell Abstract— Either in communication or in control applications, coding, MIMO spatial multiplexing, and even OFDM) multiple-input multiple-output systems often assume the unified from a lattice perspective as a general equalization knowledge of a matrix that relates the input and output vectors. problem (e.g., [14]). Advances in lattice theory are therefore For discrete inputs, this linear transformation generates a of great interest for MIMO engineering. multidimensional lattice. The same lattice may be described by There are several ways of describing a lattice (e.g., via an infinite number of generator matrixes, even if the rotated versions of a lattice are not considered. While obtaining the modular equations [15] or trellis structures [16]), however, Gram matrix from a given generator matrix is a trivial the two most popular ones in engineering applications are i) operation, the converse is not obvious for non-square matrixes the generator matrix and ii) the Gram matrix. The and is a research topic in algorithmic number theory. This computation of the latter given the former is trivial. The paper proposes a method to execute such a conversion and reverse is not, and an efficient algorithm for this conversion applies it in a novel MIMO system implementation where some remains an open problem in the theory of lattices. of the complexity is taken from the receiver to the transmitter. It should be noticed that an efficient algorithm for this Additionally, given the symmetry of the Gram matrix, the reverse operation can allow a lattice to be described using number of elements required in the feedback channel is nearly only about half the number of elements usually required halved.
    [Show full text]
  • An Introduction to Lattices and Their Applications in Communications Frank R
    An Introduction to Lattices and their Applications in Communications Frank R. Kschischang Chen Feng University of Toronto, Canada 2014 Australian School of Information Theory University of South Australia Institute for Telecommunications Research Adelaide, Australia November 13, 2014 Outline 1 Fundamentals 2 Packing, Covering, Quantization, Modulation 3 Lattices and Linear Codes 4 Asymptopia 5 Communications Applications 2 Part 1: Lattice Fundamentals 3 Notation • C: the complex numbers (a field) • R: the real numbers (a field) • Z: the integers (a ring) • X n: the n-fold Cartesian product of set X with itself; n X = f(x1;:::; xn): x1 2 X ; x2 2 X ;:::; xn 2 X g. If X is a field, then the elements of X n are row vectors. • X m×n: the m × n matrices with entries from X . ∗ • If (G; +) is a group with identity 0, then G , G n f0g denotes the nonzero elements of G. 4 Euclidean Space Lattices are discrete subgroups (under vector addition) of finite-dimensional Euclidean spaces such as n. R x d( • x; y) In n we have R •y Pn (0; 1) k • an inner product: hx; yi xi yi x , i=1 k k p ky • a norm: kxk , hx; xi • 0 • a metric: d(x; y) , kx − yk (1; 0) • Vectors x and y are orthogonal if hx; yi = 0. n • A ball centered at the origin in R is the set n Br = fx 2 R : kxk ≤ rg: n • If R is any subset of R , the translation of R by x is, for any n x 2 R , the set x + R = fx + y : y 2 Rg.
    [Show full text]
  • The Pennsylvania State University Schreyer Honors College
    The Pennsylvania State University Schreyer Honors College Department of Mathematics Application of Computational Linear Algebraic Methods to a Reliability Simulation Seth Henry Spring 2015 A thesis submitted in partial fulfillment of the requirements for baccalaureate degrees in Mathematics and Physics with honors in Mathematics Reviewed and approved* by the following: Christopher Griffin Sr. Research Assoc. & Assoc. Professor of Mathematics Thesis Supervisor Victoria Sadovskaya Associate Professor of Mathematics Honors Adviser *Signatures are on file in the Schreyer Honors College Abstract In this paper, numerical methods for the solution of a reliability modeling problem are presented by finding the steady state solution of a Markov chain. The reliability modeling problem analyzed is that of a large system made up of two smaller systems each with a varying number of subsystems. The focus of this study is on the optimal choice and formulation of algorithms for the steady-state solution of the gen- erator matrix for the Markov chain associated with the given reliabil- ity modeling problem. In this context, iterative linear equation solu- tion algorithms were compared. The Conjugate-Gradient method was determined to have the quickest convergence with the Gauss-Seidel method following close behind for the relevant model structures. The successive over-relaxation method was studied as well, and some op- timal relaxation parameters are presented. i Contents List of Figures iii 1 Introduction1 2 Literature Review2 2.1 Markov Chains..........................2 2.2 Reliability Theory.........................6 2.3 Numerical Analysis........................9 3 A Reliability Problem 17 4 Computational Analysis 20 5 Conclusion and Future Work 28 5.1 Conclusions...........................
    [Show full text]