3 resultados para Coding Scheme
em Digital Commons - Michigan Tech
Resumo:
This dissertation concerns the intersection of three areas of discrete mathematics: finite geometries, design theory, and coding theory. The central theme is the power of finite geometry designs, which are constructed from the points and t-dimensional subspaces of a projective or affine geometry. We use these designs to construct and analyze combinatorial objects which inherit their best properties from these geometric structures. A central question in the study of finite geometry designs is Hamada’s conjecture, which proposes that finite geometry designs are the unique designs with minimum p-rank among all designs with the same parameters. In this dissertation, we will examine several questions related to Hamada’s conjecture, including the existence of counterexamples. We will also study the applicability of certain decoding methods to known counterexamples. We begin by constructing an infinite family of counterexamples to Hamada’s conjecture. These designs are the first infinite class of counterexamples for the affine case of Hamada’s conjecture. We further demonstrate how these designs, along with the projective polarity designs of Jungnickel and Tonchev, admit majority-logic decoding schemes. The codes obtained from these polarity designs attain error-correcting performance which is, in certain cases, equal to that of the finite geometry designs from which they are derived. This further demonstrates the highly geometric structure maintained by these designs. Finite geometries also help us construct several types of quantum error-correcting codes. We use relatives of finite geometry designs to construct infinite families of q-ary quantum stabilizer codes. We also construct entanglement-assisted quantum error-correcting codes (EAQECCs) which admit a particularly efficient and effective error-correcting scheme, while also providing the first general method for constructing these quantum codes with known parameters and desirable properties. Finite geometry designs are used to give exceptional examples of these codes.
Resumo:
KIVA is a FORTRAN code developed by Los Alamos national lab to simulate complete engine cycle. KIVA is a flow solver code which is used to perform calculation of properties in a fluid flow field. It involves using various numerical schemes and methods to solve the Navier-Stokes equation. This project involves improving the accuracy of one such scheme by upgrading it to a higher order scheme. The numerical scheme to be modified is used in the critical final stage calculation called as rezoning phase. The primitive objective of this project is to implement a higher order numerical scheme, to validate and verify that the new scheme is better than the existing scheme. The latest version of the KIVA family (KIVA 4) is used for implementing the higher order scheme to support handling the unstructured mesh. The code is validated using the traditional shock tube problem and the results are verified to be more accurate than the existing schemes in reference with the analytical result. The convection test is performed to compare the computational accuracy on convective transfer; it is found that the new scheme has less numerical diffusion compared to the existing schemes. A four valve pentroof engine, an example case of KIVA package is used as application to ensure the stability of the scheme in practical application. The results are compared for the temperature profile. In spite of all the positive results, the numerical scheme implemented has a downside of consuming more CPU time for the computational analysis. The detailed comparison is provided. However, in an overview, the implementation of the higher order scheme in the latest code KIVA 4 is verified to be successful and it gives better results than the existing scheme which satisfies the objective of this project.
Resumo:
This technical report discusses the application of Lattice Boltzmann Method (LBM) in the fluid flow simulation through porous filter-wall of disordered media. The diesel particulate filter (DPF) is an example of disordered media. DPF is developed as a cutting edge technology to reduce harmful particulate matter in the engine exhaust. Porous filter-wall of DPF traps these soot particles in the after-treatment of the exhaust gas. To examine the phenomena inside the DPF, researchers are looking forward to use the Lattice Boltzmann Method as a promising alternative simulation tool. The lattice Boltzmann method is comparatively a newer numerical scheme and can be used to simulate fluid flow for single-component single-phase, single-component multi-phase. It is also an excellent method for modelling flow through disordered media. The current work focuses on a single-phase fluid flow simulation inside the porous micro-structure using LBM. Firstly, the theory concerning the development of LBM is discussed. LBM evolution is always related to Lattice gas Cellular Automata (LGCA), but it is also shown that this method is a special discretized form of the continuous Boltzmann equation. Since all the simulations are conducted in two-dimensions, the equations developed are in reference with D2Q9 (two-dimensional 9-velocity) model. The artificially created porous micro-structure is used in this study. The flow simulations are conducted by considering air and CO2 gas as fluids. The numerical model used in this study is explained with a flowchart and the coding steps. The numerical code is constructed in MATLAB. Different types of boundary conditions and their importance is discussed separately. Also the equations specific to boundary conditions are derived. The pressure and velocity contours over the porous domain are studied and recorded. The results are compared with the published work. The permeability values obtained in this study can be fitted to the relation proposed by Nabovati [8], and the results are in excellent agreement within porosity range of 0.4 to 0.8.