Relevant bibliographies by topics / Lattice Decoder / Journal articles
To see the other types of publications on this topic, follow the link: Lattice Decoder.

Journal articles on the topic 'Lattice Decoder'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Lattice Decoder.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Alghoniemy, Masoud, and Ahmed H. Tewfik. "MIMO Cube Decoder." Journal of Communications Software and Systems 7, no. 3 (2011): 104. http://dx.doi.org/10.24138/jcomss.v7i3.176.

Full text
Abstract:
An insight on the lattice decoder for flat-fading multiple antenna wireless communications systems is presented in this paper. In particular, we show that by formulating the decoding problem as a bounded-error subset selection, theresultant decoder finds the nearest lattice point to the received signal vector such that the search is bounded inside a hypercube centered at the received vector. The dimensions and orientation of the hypercube can be adjusted based on the diversity of the channel in order to improve its performance. The search for the nearest codeword to the received signal vector
APA, Harvard, Vancouver, ISO, and other styles
2

Kubica, Aleksander, and Nicolas Delfosse. "Efficient color code decoders in d≥2 dimensions from toric code decoders." Quantum 7 (February 21, 2023): 929. http://dx.doi.org/10.22331/q-2023-02-21-929.

Full text
Abstract:
We introduce an efficient decoder of the color code in d≥2 dimensions, the Restriction Decoder, which uses any d-dimensional toric code decoder combined with a local lifting procedure to find a recovery operation. We prove that the Restriction Decoder successfully corrects errors in the color code if and only if the corresponding toric code decoding succeeds. We also numerically estimate the Restriction Decoder threshold for the color code in two and three dimensions against the bit-flip and phase-flip noise with perfect syndrome extraction. We report that the 2D color code threshol
APA, Harvard, Vancouver, ISO, and other styles
3

Dua, Arpit, Tomas Jochym-O'Connor, and Guanyu Zhu. "Quantum error correction with fractal topological codes." Quantum 7 (September 26, 2023): 1122. http://dx.doi.org/10.22331/q-2023-09-26-1122.

Full text
Abstract:
Recently, a class of fractal surface codes (FSCs), has been constructed on fractal lattices with Hausdorff dimension 2+ϵ, which admits a fault-tolerant non-Clifford CCZ gate \cite{zhu2021topological}. We investigate the performance of such FSCs as fault-tolerant quantum memories. We prove that there exist decoding strategies with non-zero thresholds for bit-flip and phase-flip errors in the FSCs with Hausdorff dimension 2+ϵ. For the bit-flip errors, we adapt the sweep decoder, developed for string-like syndromes in the regular 3D surface code, to the FSCs by designing sui
APA, Harvard, Vancouver, ISO, and other styles
4

Damen, O., A. Chkeif, and J. C. Belfiore. "Lattice code decoder for space-time codes." IEEE Communications Letters 4, no. 5 (2000): 161–63. http://dx.doi.org/10.1109/4234.846498.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Scruby, T. R., and K. Nemoto. "Local Probabilistic Decoding of a Quantum Code." Quantum 7 (August 29, 2023): 1093. http://dx.doi.org/10.22331/q-2023-08-29-1093.

Full text
Abstract:
flip is an extremely simple and maximally local classical decoder which has been used to great effect in certain classes of classical codes. When applied to quantum codes there exist constant-weight errors (such as half of a stabiliser) which are uncorrectable for this decoder, so previous studies have considered modified versions of flip, sometimes in conjunction with other decoders. We argue that this may not always be necessary, and present numerical evidence for the existence of a threshold for flip when applied to the looplike syndromes of a three-dimensional toric code on a cubic lattice
APA, Harvard, Vancouver, ISO, and other styles
6

Srivastava, Rachna, Vincent C. Gaudet, and Patrick Mitran. "Hardware Implementation of a Fixed-Point Decoder for Low-Density Lattice Codes." Journal of Signal Processing Systems 94, no. 1 (2022): 101–16. http://dx.doi.org/10.1007/s11265-021-01735-2.

Full text
Abstract:
AbstractThis paper describes a field-programmable gate array (FPGA) implementation of a fixed-point low-density lattice code (LDLC) decoder where the Gaussian mixture messages that are exchanged during the iterative decoding process are approximated to a single Gaussian. A detailed quantization study is first performed to find the minimum number of bits required for the fixed-point decoder to attain a frame error rate (FER) performance similar to floating-point. Then efficient numerical methods are devised to approximate the required non-linear functions. Finally, the paper presents a comparis
APA, Harvard, Vancouver, ISO, and other styles
7

Lv, Hang, Daniel Povey, Mahsa Yarmohammadi, et al. "LET-Decoder: A WFST-Based Lazy-Evaluation Token-Group Decoder With Exact Lattice Generation." IEEE Signal Processing Letters 28 (2021): 703–7. http://dx.doi.org/10.1109/lsp.2021.3067220.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Viterbo, E., and J. Bouros. "A universal lattice code decoder for fading channels." IEEE Transactions on Information Theory 45, no. 5 (1999): 1639–42. http://dx.doi.org/10.1109/18.771234.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Milford, David, and Magnus Sandell. "Simplified Quantisation in a Reduced-Lattice MIMO Decoder." IEEE Communications Letters 15, no. 7 (2011): 725–27. http://dx.doi.org/10.1109/lcomm.2011.051011.110485.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gicev, Spiro, Lloyd C. L. Hollenberg, and Muhammad Usman. "A scalable and fast artificial neural network syndrome decoder for surface codes." Quantum 7 (July 12, 2023): 1058. http://dx.doi.org/10.22331/q-2023-07-12-1058.

Full text
Abstract:
Surface code error correction offers a highly promising pathway to achieve scalable fault-tolerant quantum computing. When operated as stabilizer codes, surface code computations consist of a syndrome decoding step where measured stabilizer operators are used to determine appropriate corrections for errors in physical qubits. Decoding algorithms have undergone substantial development, with recent work incorporating machine learning (ML) techniques. Despite promising initial results, the ML-based syndrome decoders are still limited to small scale demonstrations with low latency and are incapabl
APA, Harvard, Vancouver, ISO, and other styles
11

de Gispert, Adrià, Gonzalo Iglesias, Graeme Blackwood, Eduardo R. Banga, and William Byrne. "Hierarchical Phrase-Based Translation with Weighted Finite-State Transducers and Shallow-n Grammars." Computational Linguistics 36, no. 3 (2010): 505–33. http://dx.doi.org/10.1162/coli_a_00006.

Full text
Abstract:
In this article we describe HiFST, a lattice-based decoder for hierarchical phrase-based translation and alignment. The decoder is implemented with standard Weighted Finite-State Transducer (WFST) operations as an alternative to the well-known cube pruning procedure. We find that the use of WFSTs rather than k-best lists requires less pruning in translation search, resulting in fewer search errors, better parameter optimization, and improved translation performance. The direct generation of translation lattices in the target language can improve subsequent rescoring procedures, yielding furthe
APA, Harvard, Vancouver, ISO, and other styles
12

Taubin, Feliks, and Andrey Trofimov. "Concatenated Coding for Multilevel Flash Memory with Low Error Correction Capabilities in Outer Stage." SPIIRAS Proceedings 18, no. 5 (2019): 1149–81. http://dx.doi.org/10.15622/sp.2019.18.5.1149-1181.

Full text
Abstract:
One of the approaches to organization of error correcting coding for multilevel flash memory is based on concatenated construction, in particular, on multidimensional lattices for inner coding. A characteristic feature of such structures is the dominance of the complexity of the outer decoder in the total decoder complexity. Therefore the concatenated construction with low-complexity outer decoder may be attractive since in practical applications the decoder complexity is the crucial limitation for the usage of the error correction coding.
 We consider a concatenated coding scheme for mul
APA, Harvard, Vancouver, ISO, and other styles
13

Khodaiemehr, Hassan, Mohammad-Reza Sadeghi, and Amin Sakzad. "Practical Encoder and Decoder for Power Constrained QC LDPC-Lattice Codes." IEEE Transactions on Communications 65, no. 2 (2017): 486–500. http://dx.doi.org/10.1109/tcomm.2016.2633343.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Albreem, Mahmoud A. M., and Mohd Fadzli Mohd Salleh. "Radius selection for lattice sphere decoder-based block data transmission systems." Wireless Networks 22, no. 2 (2015): 655–62. http://dx.doi.org/10.1007/s11276-015-0993-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Chan, Tim, and Simon C. Benjamin. "Actis: A Strictly Local Union–Find Decoder." Quantum 7 (November 14, 2023): 1183. http://dx.doi.org/10.22331/q-2023-11-14-1183.

Full text
Abstract:
Fault-tolerant quantum computing requires classical hardware to perform the decoding necessary for error correction. The Union–Find decoder is one of the best candidates for this. It has remarkably organic characteristics, involving the growth and merger of data structures through nearest-neighbour steps; this naturally suggests the possibility of its realisation using a lattice of simple processors with nearest-neighbour links. In this way the computational load can be distributed with near-ideal parallelism. Here we show for the first time that this strict (rather than partial) locality is p
APA, Harvard, Vancouver, ISO, and other styles
16

Li, X., and X. Cui. "Application of lattice code decoder to SC-CP for short block length." Electronics Letters 40, no. 15 (2004): 954. http://dx.doi.org/10.1049/el:20040570.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Moniem, Tamer A. "All optical active high decoder using integrated 2D square lattice photonic crystals." Journal of Modern Optics 62, no. 19 (2015): 1643–49. http://dx.doi.org/10.1080/09500340.2015.1061061.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Ma, Xuehan, Xueyan Li, and Junfeng Song. "Point Cloud Completion Network Applied to Vehicle Data." Sensors 22, no. 19 (2022): 7346. http://dx.doi.org/10.3390/s22197346.

Full text
Abstract:
With the development of autonomous driving, augmented reality, and other fields, it is becoming increasingly important for machines to more accurately and comprehensively perceive their surrounding environment. LiDAR is one of the most important tools used by machines to obtain information about the surrounding environment. However, because of occlusion, the point cloud data obtained by LiDAR are not the complete shape of the object, and completing the incomplete point cloud shape is of great significance for further data analysis, such as classification and segmentation. In this study, we exa
APA, Harvard, Vancouver, ISO, and other styles
19

Vasic, Bane, and Anantha Krishnan. "Lozenge tiling constrained codes." Facta universitatis - series: Electronics and Energetics 27, no. 4 (2014): 521–42. http://dx.doi.org/10.2298/fuee1404521v.

Full text
Abstract:
While the field of one-dimensional constrained codes is mature, with theoretical as well as practical aspects of code- and decoder-design being well-established, such a theoretical treatment of its two-dimensional (2D) counterpart is still unavailable. Research has been conducted on a few exemplar 2D constraints, e.g., the hard triangle model, run-length limited constraints on the square lattice, and 2D checkerboard constraints. Excluding these results, 2D constrained systems remain largely uncharacterized mathematically, with only loose bounds of capacities present. In this paper we present a
APA, Harvard, Vancouver, ISO, and other styles
20

Wen, Jinming, Chao Tong, and Shi Bai. "Effects of Some Lattice Reductions on the Success Probability of the Zero-Forcing Decoder." IEEE Communications Letters 20, no. 10 (2016): 2031–34. http://dx.doi.org/10.1109/lcomm.2016.2594196.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Maleki, Mohammad Javad, Mohammad Soroosh, and Ali Mir. "Improving the Performance of 2-To-4 Optical Decoders Based on Photonic Crystal Structures." Crystals 9, no. 12 (2019): 635. http://dx.doi.org/10.3390/cryst9120635.

Full text
Abstract:
In this study, a novel, two-dimensional photonic crystal-based structure for the 2-to-4 optical decoder is presented. The structure consists of 23 rows and 14 columns of chalcogenide rods that are arranged in a square lattice with a spatial periodicity of 530 nm. The bias and the optical signals are guided toward the main waveguide through the three waveguides. Two unequal powers are applied to the input ports to approach the different intensities proportional to four working states into the main waveguide. Four cavities including the nonlinear rods are in response to drop the optical waves to
APA, Harvard, Vancouver, ISO, and other styles
22

Xia, Qing, and Hui Chen. "Performance on OCDMA Encoder Based on Photonic Crystal." Applied Mechanics and Materials 278-280 (January 2013): 1047–50. http://dx.doi.org/10.4028/www.scientific.net/amm.278-280.1047.

Full text
Abstract:
Encoder with a hexagonal lattice photonic crystal was performed by OCDMA simulation model. Filtering of photonic crystal cavity was used for encoding in spectral domain, and the distance between the dot defects was used for encoding in time domain because of its slow light effects caused by dispersion, whose time delay reached orders of ns magnitude. According to the simulation, the BER of OCDMA system with PC encoder is 10-23, while BER is 10-18 in the system with FBG encoder. By contrast, it is indicated that PC encoder requires strict demands on its own structure. With mismatching of encode
APA, Harvard, Vancouver, ISO, and other styles
23

Niroomand, Mehrdad, and Mostafa Derakhtian. "A Low Complexity Diversity Achieving Decoder Based on a Two-Stage Lattice Reduction in Frequency-Selective MIMO Channels." IEEE Transactions on Wireless Communications 16, no. 4 (2017): 2465–77. http://dx.doi.org/10.1109/twc.2017.2665485.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Farrelly, Terry, David K. Tuckett, and Thomas M. Stace. "Local tensor-network codes." New Journal of Physics 24, no. 4 (2022): 043015. http://dx.doi.org/10.1088/1367-2630/ac5e87.

Full text
Abstract:
Abstract Tensor-network codes enable the construction of large stabilizer codes out of tensors describing smaller stabilizer codes. An application of tensor-network codes was an efficient and exact decoder for holographic codes. Here, we show how to write some topological codes, including the surface code and colour code, as simple tensor-network codes. We also show how to calculate distances of stabilizer codes by contracting a tensor network. The algorithm actually gives more information, including a histogram of all logical coset weights. We prove that this method is efficient in the case o
APA, Harvard, Vancouver, ISO, and other styles
25

Gidney, Craig, Michael Newman, Austin Fowler, and Michael Broughton. "A Fault-Tolerant Honeycomb Memory." Quantum 5 (December 20, 2021): 605. http://dx.doi.org/10.22331/q-2021-12-20-605.

Full text
Abstract:
Recently, Hastings & Haah introduced a quantum memory defined on the honeycomb lattice. Remarkably, this honeycomb code assembles weight-six parity checks using only two-local measurements. The sparse connectivity and two-local measurements are desirable features for certain hardware, while the weight-six parity checks enable robust performance in the circuit model.In this work, we quantify the robustness of logical qubits preserved by the honeycomb code using a correlated minimum-weight perfect-matching decoder. Using Monte Carlo sampling, we estimate the honeycomb code's threshold in dif
APA, Harvard, Vancouver, ISO, and other styles
26

Nguyễn Minh Thường. "An Analysis of Valid Nodes Distribution for Sphere Decoding in the MIMO Wireless Communication System." Journal of Research and Development on Information and Communication Technology 2021, no. 2 (2021): 47–54. http://dx.doi.org/10.32913/mic-ict-research.v2021.n2.985.

Full text
Abstract:
Sphere Decoding (SD) algorithms can achieve a quasi-maximum likelihood (ML) decoder performance over Gaussian multiple input-multiple output (MIMO) channels with much lower complexity compared to the exhaustive search method. The SD algorithm is based on a closest lattice point search over a limited search space (hypersphere). On top of that, QR-decomposition simplifies the SD linear system's matrix to be an upper triangle matrix. The solution solver then is done by searching in the exponentially expanding search tree, started from the top with only a single node then increases by M times ever
APA, Harvard, Vancouver, ISO, and other styles
27

Asif, Rameez. "Post-Quantum Cryptosystems for Internet-of-Things: A Survey on Lattice-Based Algorithms." IoT 2, no. 1 (2021): 71–91. http://dx.doi.org/10.3390/iot2010005.

Full text
Abstract:
The latest quantum computers have the ability to solve incredibly complex classical cryptography equations particularly to decode the secret encrypted keys and making the network vulnerable to hacking. They can solve complex mathematical problems almost instantaneously compared to the billions of years of computation needed by traditional computing machines. Researchers advocate the development of novel strategies to include data encryption in the post-quantum era. Lattices have been widely used in cryptography, somewhat peculiarly, and these algorithms have been used in both; (a) cryptoanalys
APA, Harvard, Vancouver, ISO, and other styles
28

Stemmler, Martin, Alexander Mathis, and Andreas V. M. Herz. "Connecting multiple spatial scales to decode the population activity of grid cells." Science Advances 1, no. 11 (2015): e1500816. http://dx.doi.org/10.1126/science.1500816.

Full text
Abstract:
Mammalian grid cells fire when an animal crosses the points of an imaginary hexagonal grid tessellating the environment. We show how animals can navigate by reading out a simple population vector of grid cell activity across multiple spatial scales, even though neural activity is intrinsically stochastic. This theory of dead reckoning explains why grid cells are organized into discrete modules within which all cells have the same lattice scale and orientation. The lattice scale changes from module to module and should form a geometric progression with a scale ratio of around 3/2 to minimize th
APA, Harvard, Vancouver, ISO, and other styles
29

Harshan, J., E. Viterbo, and Jean-Claude Belfiore. "Practical Encoders and Decoders for Euclidean Codes from Barnes-Wall Lattices." IEEE Transactions on Communications 61, no. 11 (2013): 4417–27. http://dx.doi.org/10.1109/tcomm.2013.100213.130018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Song, Yiwei, and Natasha Devroye. "Lattice Codes for the Gaussian Relay Channel: Decode-and-Forward and Compress-and-Forward." IEEE Transactions on Information Theory 59, no. 8 (2013): 4927–48. http://dx.doi.org/10.1109/tit.2013.2259139.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Neinavaie, Mohammad, Ali Reza Zolghadrasli, Mostafa Derakhtian, and Mehdi Zolghadrasli. "Diversity Analysis of Lattice-Reduction Aided Linear Equalizers in Decode and Forward MIMO Relay Networks." IEEE Transactions on Wireless Communications 13, no. 12 (2014): 6593–605. http://dx.doi.org/10.1109/twc.2014.2360186.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Pino, Juan, Aurelien Waite, and William Byrne. "Simple and Efficient Model Filtering in Statistical Machine Translation." Prague Bulletin of Mathematical Linguistics 98, no. 1 (2012): 5–24. http://dx.doi.org/10.2478/v10108-012-0005-x.

Full text
Abstract:
Simple and Efficient Model Filtering in Statistical Machine Translation Data availability and distributed computing techniques have allowed statistical machine translation (SMT) researchers to build larger models. However, decoders need to be able to retrieve information efficiently from these models to be able to translate an input sentence or a set of input sentences. We introduce an easy to implement and general purpose solution to tackle this problem: we store SMT models as a set of key-value pairs in an HFile. We apply this strategy to two specific tasks: test set hierarchical phrase-base
APA, Harvard, Vancouver, ISO, and other styles
33

Jalden, Joakim, and Petros Elia. "DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models." IEEE Transactions on Information Theory 56, no. 10 (2010): 4765–80. http://dx.doi.org/10.1109/tit.2010.2059493.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Amrani, O., and Y. Beery. "Efficient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code." IEEE Transactions on Communications 44, no. 5 (1996): 534–37. http://dx.doi.org/10.1109/26.494294.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Zhang, Ang, Dongbo Su, Chuangming Li, et al. "Three-dimensional phase-field lattice-Boltzmann simulations of a rising bubble interacting with obstacles: Shape quantification and parameter dependence." Physics of Fluids 34, no. 10 (2022): 103301. http://dx.doi.org/10.1063/5.0102193.

Full text
Abstract:
Exploring the bubble dynamics in the presence of obstacles can improve understanding of mechanism, design, and operation of multiphase flow. However, large deformation and complex hydrodynamics during the bubble–obstacle interaction pose challenges for shape quantification and parameter dependence. In this work, the bubble–obstacle interaction is investigated by employing a conservative phase-field lattice-Boltzmann model implemented on a parallel platform. Two shape parameters, which are the combination of the bubble geometrical parameters, are defined to characterize the bubble deformation d
APA, Harvard, Vancouver, ISO, and other styles
36

Habchi, Yassine, Ameur Fethi Aimer, Jamel Baili, Mustafa Inc, Younes Menni, and Giulio Lorenzini. "Improving Medical Video Coding Using Multi Scale Quincunx Lattice: From Low Bitrate to High Quality." Traitement du Signal 39, no. 4 (2022): 1191–202. http://dx.doi.org/10.18280/ts.390411.

Full text
Abstract:
In recent years, the healthcare sector has seen an increase in the use of medical images and videos. However, storage and transmission of this huge volume of data remain a challenging task, requiring the use of compression techniques. In this paper, the authors propose an algorithm to improve the visual quality of compressed medical video for lower bitrate without modifying the content of information such as edges and textures, this is a unique way for doctors to store and share medical data over the internet. The algorithm has not yet been sufficiently explored in medical video coding. In thi
APA, Harvard, Vancouver, ISO, and other styles
37

Wang, Xingyuan, Hongyu Zhao, Yutao Hou, Chao Luo, Yingqian Zhang, and Chunpeng Wang. "Chaotic image encryption algorithm based on pseudo-random bit sequence and DNA plane." Modern Physics Letters B 33, no. 22 (2019): 1950263. http://dx.doi.org/10.1142/s0217984919502634.

Full text
Abstract:
In this paper, a new chaotic image encryption algorithm based on pseudo-random bit sequence and DNA plane is proposed. The coupled map lattice (CML) is applied to design a pseudo-random bit sequence generation (PBSG) system and use the system to generate the random sequence needed in the encryption process. The initial values and parameters of the system are generated by the SHA-256 hash algorithm combined with given keys. Firstly, the plane image is decomposed into four DNA planes in combination with the DNA encoding rules, and then the four DNA planes are subjected to row circular permutatio
APA, Harvard, Vancouver, ISO, and other styles
38

Gurunath Shivakumar, Prashanth, and Panayiotis Georgiou. "Confusion2Vec: towards enriching vector space word representations with representational ambiguities." PeerJ Computer Science 5 (June 10, 2019): e195. http://dx.doi.org/10.7717/peerj-cs.195.

Full text
Abstract:
Word vector representations are a crucial part of natural language processing (NLP) and human computer interaction. In this paper, we propose a novel word vector representation, Confusion2Vec, motivated from the human speech production and perception that encodes representational ambiguity. Humans employ both acoustic similarity cues and contextual cues to decode information and we focus on a model that incorporates both sources of information. The representational ambiguity of acoustics, which manifests itself in word confusions, is often resolved by both humans and machines through contextua
APA, Harvard, Vancouver, ISO, and other styles
39

Shalaev, P. O., L. I. Kveglis, V. P. Zhereb, G. S. Bektasova, T. V. Bermeshev та N. I. Razumov. "Структурообразование в образцах оксида висмута при воздействии синхротронного излучения". Izvestiya of Altai State University, № 1(123) (18 березня 2022): 69–72. http://dx.doi.org/10.14258/izvasu(2022)1-10.

Full text
Abstract:
In this work, samples of the δ-Bi2O3 phase are investigated. This phase is known as a solid electrolyte and has a very high ionic conductivity. The investigated structure formation is caused by synchrotron radiation (SR) directed to the surface of a δ-Bi2O3 crystal. SR differs from radiation received from other sources in its wide spectral range (from infrared to hard X-ray) and high intensity. Diffraction patterns obtained during the exposure process are decoded and studied in this work. The study reveals the polymorphism that forms a phase sample of δ-Bi2O3 under the action of SR as an examp
APA, Harvard, Vancouver, ISO, and other styles
40

CHOUDHARY, SWADESH, HRISHIKESH SHARMA, and SACHIN PATKAR. "OPTIMAL FOLDING OF DATA FLOW GRAPHS BASED ON FINITE PROJECTIVE GEOMETRY USING VECTOR SPACE PARTITIONING." Discrete Mathematics, Algorithms and Applications 05, no. 04 (2013): 1350036. http://dx.doi.org/10.1142/s1793830913500365.

Full text
Abstract:
A number of computations exist, especially in area of error-control coding and matrix computations, whose underlying data flow graphs are based on finite projective-geometry (PG)-based balanced bipartite graphs. Many of these applications of finite projective geometry are actively being researched upon, especially in coding theory. Almost all these applications need large bipartite graphs, whose nodes represent parallel computations. To reduce its implementation cost, reducing amount of system/hardware resources during design is an important engineering objective. In this context, we present a
APA, Harvard, Vancouver, ISO, and other styles
41

CHOUDHARY, SWADESH, HRISHIKESH SHARMA, and SACHIN PATKAR. "OPTIMAL FOLDING OF DATA FLOW GRAPHS BASED ON FINITE PROJECTIVE GEOMETRY USING VECTOR SPACE PARTITIONING." Discrete Mathematics, Algorithms and Applications 06, no. 01 (2014): 1450004. http://dx.doi.org/10.1142/s1793830914500049.

Full text
Abstract:
A number of computations exist, especially in area of error-control coding and matrix computations, whose underlying data flow graphs are based on finite projective-geometry (PG) based balanced bipartite graphs. Many of these applications of finite projective geometry are actively being researched upon, especially in coding theory. Almost all these applications need large bipartite graphs, whose nodes represent parallel computations. To reduce its implementation cost, reducing amount of system/hardware resources during design is an important engineering objective. In this context, we present a
APA, Harvard, Vancouver, ISO, and other styles
42

Якушева, С. Ф. "LETTER AND LINE DETECTION ALGORITHM IN TEXT IMAGES TYPED BY PRINTED BRAILLE FONT." ВЕСТНИК ВОРОНЕЖСКОГО ГОСУДАРСТВЕННОГО ТЕХНИЧЕСКОГО УНИВЕРСИТЕТА, no. 3 (July 2, 2021): 52–58. http://dx.doi.org/10.36622/vstu.2021.17.3.007.

Full text
Abstract:
Предложен простой алгоритм детекции букв и выделения строк на сканах и фотографиях текстов, набранных печатным шрифтом Брайля, при помощи оконных свёрток. Алгоритм изначально разрабатывался для автоматической и полуавтоматической разметки датасетов для обучения распознающих нейронных сетей со сложными архитектурами для существенного ускорения процесса подготовки данных. Он основан на специфичности этого шрифта, в котором каждая буква кодируется комбинацией выпуклых точек, расположенных в узлах прямоугольной решетки. Для распознавания букв используется оконный фильтр, подобранный для обнаружени
APA, Harvard, Vancouver, ISO, and other styles
43

De Alvarenga, Elson Santiago, Rosmeri Terezinha Batirola Da Silva, and Vicente Wagner Dias Casali. "Effect of Magnesium phosphoricum 12c on sodium dodecylsulphate by 13C nuclear magnetic resonance." International Journal of High Dilution Research - ISSN 1982-6206 8, no. 26 (2021): 3–8. http://dx.doi.org/10.51910/ijhdr.v8i26.324.

Full text
Abstract:
Sodium dodecylsulphate (SDS) dissolved in water forms aggregates whose thermodynamic properties are well defined. The interest in polymer-surfactant systems derives from increasing possibilities to apply them in pharmaceutics, cosmetics and environmental protection. Nutrient content of soils after many years of use is a concern in many areas; on the other hand, the metabolism of plants approaches equilibrium when the conditions necessary for their growth are present. Magnesium and phosphorus are important nutrients for plants and high dilutions of Magnesium phosphoricum (Mag-p) may carry infor
APA, Harvard, Vancouver, ISO, and other styles
44

Chen, Qing-Hui, Yu-Xin Ji, Ke-Han Wang, Hong-Yang Ma, and Nai-Hua Ji. "Decoding topological XYZ$^{2}$ codes with reinforcement learning based on attention mechanisms." Chinese Physics B, March 15, 2024. http://dx.doi.org/10.1088/1674-1056/ad342b.

Full text
Abstract:
Abstract Quantum error correction, a technique that relies on the principle of redundancy to encode logical information into additional qubits to better protect the system from noise, is necessary to design a viable quantum computer. For this new topological stabilizer code-XYZ$^{2}$ code defined on the cellular lattice in the paper, it is implemented on a hexagonal lattice of qubits and encodes the logical qubits with the help of stabilizer measurements of weight six and weight two. However topological stabilizer codes in cellular lattice quantum systems suffer from the detrimental effects of
APA, Harvard, Vancouver, ISO, and other styles
45

Wang, Xuebo, and Wai Ho Mow. "Efficient Decoder Design for Low-Density Lattice Codes From the Lattice Viewpoint." IEEE Open Journal of the Communications Society, 2023, 1. http://dx.doi.org/10.1109/ojcoms.2023.3305480.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Vasmer, Michael, Dan E. Browne, and Aleksander Kubica. "Cellular automaton decoders for topological quantum codes with noisy measurements and beyond." Scientific Reports 11, no. 1 (2021). http://dx.doi.org/10.1038/s41598-021-81138-2.

Full text
Abstract:
AbstractWe propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, however, we focus on the three-dimensional toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We also numerically benchmark the performance of the decoder in the setting with measurement errors using various noise models. We find that this error correction procedure is remarkably robust against measurement errors and is
APA, Harvard, Vancouver, ISO, and other styles
47

Sundaresan, Neereja, Theodore J. Yoder, Youngseok Kim, et al. "Demonstrating multi-round subsystem quantum error correction using matching and maximum likelihood decoders." Nature Communications 14, no. 1 (2023). http://dx.doi.org/10.1038/s41467-023-38247-5.

Full text
Abstract:
AbstractQuantum error correction offers a promising path for performing high fidelity quantum computations. Although fully fault-tolerant executions of algorithms remain unrealized, recent improvements in control electronics and quantum hardware enable increasingly advanced demonstrations of the necessary operations for error correction. Here, we perform quantum error correction on superconducting qubits connected in a heavy-hexagon lattice. We encode a logical qubit with distance three and perform several rounds of fault-tolerant syndrome measurements that allow for the correction of any sing
APA, Harvard, Vancouver, ISO, and other styles
48

Wang, Haowen, Yunjia Xue, Yingjie Qu, Xiaoyi Mu, and Hongyang Ma. "Multidimensional Bose quantum error correction based on neural network decoder." npj Quantum Information 8, no. 1 (2022). http://dx.doi.org/10.1038/s41534-022-00650-z.

Full text
Abstract:
AbstractBoson quantum error correction is an important means to realize quantum error correction information processing. In this paper, we consider the connection of a single-mode Gottesman-Kitaev-Preskill (GKP) code with a two-dimensional (2D) surface (surface-GKP code) on a triangular quadrilateral lattice. On the one hand, we use a Steane-type scheme with maximum likelihood estimation for surface-GKP code error correction. On the other hand, the minimum-weight perfect matching (MWPM) algorithm is used to decode surface-GKP codes. In the case where only the data GKP qubits are noisy, the thr
APA, Harvard, Vancouver, ISO, and other styles
49

Lu, Xuesong, Yulin Jiang, Yan Wei, Xingbin Tu, and Fengzhong Qu. "A Lattice-Reduction-Aided Sphere Decoder for Underwater Acoustic FBMC/OQAM Communications." IEEE Wireless Communications Letters, 2022, 1. http://dx.doi.org/10.1109/lwc.2022.3230857.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Liu, Haitao, Xuchao Cheng, Wenqing Li, et al. "A novel iterative detection method based on a lattice reduction-aided algorithm for MIMO OFDM systems." Scientific Reports 14, no. 1 (2024). http://dx.doi.org/10.1038/s41598-024-52602-6.

Full text
Abstract:
AbstractThe lattice reduction-aided algorithm has received broad attention from researchers since it operates as a maximum likelihood receiver with better system performance for multiple-input multiple-output orthogonal frequency division multiplexing systems and contains a full diversity. A novel iterative detection algorithm canceling parallel iterations that employ the lattice reduction-aided approach is proposed. Soft information is exchanged through the detector itself. Its iteration occurs inside the detector, which reduces much of the exchange cost between the multiple-input multiple-ou
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography