Results 11 to 20 of about 76,658 (267)
Optimization and FPGA implementation of RS coding algorithm
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 +2 more sources
Soft-decision decoding of RS codes [PDF]
By introducing a few simplifying assumptions we derive a simple condition for successful decoding using the Koetter-Vardy algorithm for soft-decision decoding of RS codes. We show that the algorithm has a significant advantage over hard decision decoding when the code rate is low, when two or more sets of received symbols have substantially different ...
openaire +3 more sources
This chapter introduces the Reed-Solomon (RS) codes and the distributed RS-coded cooperative system over the Rayleigh fading channel, where the encoding and decoding procedures of the RS codes are elaborated. Besides, two optimized selection approaches, i.e., the exhaustive search approach and partial search approach, are employed in the relay to ...
Chen, ,, Fengfan, Yang,
openaire +2 more sources
Peterson–Gorenstein–Zierler algorithm for skew RS codes [PDF]
AbstractWe design a non-commutative version of the Peterson–Gorenstein–Zierler decoding algorithm for a class of codes that we call skew RS codes. These codes are left ideals of a quotient of a skew polynomial ring, which endow them of a sort of non-commutative cyclic structure.
José Gómez-Torrecillas +2 more
openaire +3 more sources
Fast decoding algorithm for RS codes
The singularity of the syndrome matrix is used to determine the error locations. After each error location has been ascertained, the syndrome values are calculated by an iteration method and the orders of the syndrome matrix are reduced by one. With the syndrome values of iteration, the error values are easily evaluated.
null Ju, null Bi
openaire +1 more source
Decoding algorithm for DEC RS codes
A step-by-step decoding algorithm is proposed for double-error-correcting Reed-Solomon codes of length n = 2m–1. Since the decoding algorithm can directly find the error value at the highest-order position in a received vector without determining the error location polynomial, the decoding procedure is very simple and regular; therefore, it is suitable
Erl-Huei Lu, Chiou-Yng Lee, Ron-Lon Tsai
openaire +1 more source
The expansion of Brazilian agriculture: Soil erosion scenarios
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
Symbol-level iterative information set decoding of RS codes
This paper presents the implementation of a low-complex iterative symbol-level decoding scheme for Reed-Solomon codes. Most soft-decision iterative decoders for Reed-Solomon codes work on a bit level due to the efficient passing of soft information due to the sparsity of the binary parity check matrix.
Yuval Genga +2 more
openaire +2 more sources
Throughput analysis of nonbinary type-II hybrid ARQ [PDF]
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]
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

