Results 11 to 20 of about 79,105 (243)

Optimization and FPGA implementation of RS coding algorithm

open access: yesDianzi Jishu Yingyong, 2020
Aiming at the problems of large amount of computation and high complexity of multiplication of Galois Field(GF) in the common RS coding algorithm, the RS coding module is optimized and the multiplier factor is obtained.
Li Jinming, Liu Mengxin, Cheng Naipeng
doaj   +1 more source

Throughput analysis of nonbinary type-II hybrid ARQ [PDF]

open access: yes, 2003
Nonbinary type-II hybrid ARQ (HARQ), which combines shortened Reed-Solomon (RS) code with ARQ, is proposed. Its throughput is obtained by extending Lin and Yu's analysis of binary type-II HARQ.
Cao, Z, Li, VOK, Zhang, L
core   +1 more source

Genotoxic evaluation of infusions of Urera baccifera leaves and roots in Allium cepa cells [PDF]

open access: yesJournal of Pharmacy & Pharmacognosy Research, 2015
Context: The aqueous extracts of Urera baccifera Wedd. leaves and roots are used to inflammatory and infectious diseases in Brazilian folk medicine. Oxalic acid, a substance co-related with toxicity and stinging, was already quantified in this plant ...
Amanda L. Gindri   +3 more
doaj  

The expansion of Brazilian agriculture: Soil erosion scenarios

open access: yesInternational Soil and Water Conservation Research, 2013
During the next 10 years Brazil’s agricultural area will expand to meet increased domestic and worldwide demand for food, fuel, and fiber. Present choices regarding land use will determine to what degree this expansion will have adverse effects that ...
Gustavo H. Merten, Jean P.G. Minella
doaj   +1 more source

Iterative Soft Input Soft Output Decoding of Reed-Solomon Codes by Adapting the Parity Check Matrix [PDF]

open access: yes, 2005
An iterative algorithm is presented for soft-input-soft-output (SISO) decoding of Reed-Solomon (RS) codes. The proposed iterative algorithm uses the sum product algorithm (SPA) in conjunction with a binary parity check matrix of the RS code.
Jiang, Jing, Narayanan, Krishna R.
core   +5 more sources

Efficient Low-Complexity Decoding of CCSDS Reed–Solomon Codes Based on Justesen’s Concatenation

open access: yesIEEE Access, 2019
Forward error correction (FEC) is a key capability in modern satellite communications that provide the system designer with the needed flexibility to comply with the different applications' requirements.
Ranya Salah Elagooz   +3 more
doaj   +1 more source

Comprehensive recognition algorithm of RS code based on fast code root trial

open access: yesTongxin xuebao, 2022
In order to solve the problem of high computation and high missed alarm probability of RS (Reed-Solomon) codes for recognition, comprehensive recognition algorithm of RS codes based on fast code root trial was proposed.Firstly, the check relationship was
Xiaolin ZHANG, Xiuqiao LI, Rongchen SUN
doaj   +2 more sources

Update-Efficient Regenerating Codes with Minimum Per-Node Storage

open access: yes, 2013
Regenerating codes provide an efficient way to recover data at failed nodes in distributed storage systems. It has been shown that regenerating codes can be designed to minimize the per-node storage (called MSR) or minimize the communication overhead for
Han, Yunghsiang S.   +3 more
core   +1 more source

Subspace subcodes of Reed-Solomon codes [PDF]

open access: yes, 1998
We introduce a class of nonlinear cyclic error-correcting codes, which we call subspace subcodes of Reed-Solomon (SSRS) codes. An SSRS code is a subset of a parent Reed-Solomon (RS) code consisting of the RS codewords whose components all lie in a fixed ...
Hattori, Masayuki   +2 more
core   +1 more source

Digital Sliding Mode Controlled Three-phase Boost Inverter Implemented In A Dsc

open access: yesEletrônica de Potência, 2008
This paper presents a Digital Variable Structure Controlled Three Phase Boost Inverter. The main usage of this converter is to provide the necessary AC voltage to a three-phase induction motor from batteries.
Priscila dos Santos Garcia Giacomini   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy