This paper proposes and proves a theorem which stipulates sufficient conditions the coefficients of two quadratic permutation polynomials (QPP) must satisfy, so that the permutations generated by them are identical. The result is used to reduce the search time of QPP interleavers with lengths given by Long Term Evolution (LTE) standard up to 512, by improving the distance spectrum over the set of polynomials with the largest spreading factor. Polynomials that lead to better performance compared to LTE standard are found for several lengths. Simulations show that 0.5 dB coding gains can be obtained compared to LTE standard.
Legumes are valuable sources of proteins and other functional components. However, the high starch content can be an impediment in developing new vegan food formulations. Enzyme-assisted hydrolysis was used to hydrolyze the starch from chickpea and broad bean vegetable milk to further develop vegetable lactic acid-fermented products. The antioxidant activity of legumes was tested, and it was observed that the overall antioxidant activity (DPPH radical scavenging ability) significantly increased after enzyme-assisted hydrolysis while total phenols content decreased. The obtained vegetable milk was then fermented using exopolysaccharides-producing lactic acid bacteria. A significant decolorization was observed after fermentation in the case of broad bean-based products. Rheological behavior of the fermented products was determined using small amplitude oscillatory measurements and the three-interval thixotropy test. Results showed higher complex viscosity values for broad bean-based products, which displayed a weak gel-like structure. The starter cultures used for vegetable milk samples fermentation influenced the resistance to flow.
Two search methods of quadratic permutation polynomials (QPP) for interleavers used in turbo codes are proposed. These methods lead to larger minimum distances and smaller multiplicities compared to the interleavers proposed by Takeshita in (Takeshita 1). The search is accomplished in a limited set of polynomials, that is, those for which the spreading factor and Ω′ metric are maximum. The minimum distance is computed by means of Garello algorithm in which the maximum weight of information sequence is 3 or 4, reducing the search time. The results obtained for two particular component codes show the efficiency of the proposed methods.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.