No abstract

No abstract

No abstract

No abstract

The diversity indices of eukaryotic microalgal groups in the Jeonglyeongchi, Waegok, and Wangdeungjae marshes of Mount Jiri, Korea, were measured using Illumina MiSeq and culture-based analyses. Waegok marsh had the highest species richness, with a Chao1 value of 828.00, and the highest levels of species diversity, with Shannon and Simpson index values of 6.36 and 0.94, respectively, while Wangdeungjae marsh had the lowest values at 2.97 and 0.75, respectively. The predominant species in all communities were Phagocata sibirica (Jeonglyeongchi, 68.64%), Aedes albopictus (Waegok, 34.77%), Chaetonotus cf. (Waegok, 24.43%), Eimeria sp. (Wangdeungjae, 26.17%), and Eumonhystera cf. (Wangdeungjae, 22.27%). Relative abundances of the microalgal groups Bacillariophyta (diatoms) and Chlorophyta (green algae) in each marsh were respectively: Jeonglyeongchi 1.38% and 0.49%, Waegok 7.0% and 0.3%, and Wangdeungjae 10.41% and 4.72%. Illumina MiSeq analyses revealed 34 types of diatoms and 13 types of green algae. Only one diatom (Nitzschia dissipata) and five green algae (Neochloris sp., Chlamydomonas sp., Chlorococcum sp., Chlorella vulgaris, Scenedesmus sp.) were identified by a culture-based analysis. Thus, Illumina MiSeq analysis can be considered an efficient tool for analyzing microbial communities. Overall, our results described the environmental factors associated with geographically isolated mountain marshes and their respective microbial and microalgal communities.

This paper proposes a high-speed and low-complexity phase recovery algorithm for 10Gb/s dual-polarization quadrature phase shift keying (DP-QPSK) optical communications. The Viterbi and Viterbi (V&V) algorithm is commonly used for phase noise recovery. However, it performs data dependency elimination by using complex multipliers, which have large silicon area and long critical path. Hence, the V&V algorithm is not suitable for extremely high-speed phase recovery. To achieve high speed and low complexity, we propose a novel algorithm for data dependency elimination. The proposed scheme only needs simple logic, and does not require complex multiplications. As a result, it can achieve significant hardware complexity reduction and higher clock rate compared with the V&V algorithm.

No abstract

This paper proposes a low-complexity generator which finds the first two minimum values using bit-serial scheme. A low-complexity generator is an important part for low-area LDPC decoders based on the min-sum decoding algorithm because the hardware complexity of generators utilizes a significant portion of LDPC decoders. To reduce hardware complexity, bit-serial LDPC decoders has been studied. The generator of the existing bit-serial LDPC decoders can find only the first minimum value, and thus it leads to a BER performance degradation. The proposed generator using bit-serial scheme finds the first two minimum values. Hence, it can improve the BER performance. In addition, the area-time complexity of the proposed generator is lower than those of the existing generators finding the first two minima.