On optimal and near-optimal turbo decoding using generalized max operator

Motivated by a recently published robust geometric programming approximation, a generalized approach for approximating efficiently the max* operator is presented. Using this approach, the max* operator is approximated by means of a generic and yet very simple max operator, instead of using additional correction term as previous approximation methods require. Following that, several turbo decoding algorithms are obtained with optimal and near-optimal bit error rate (BER) performance depending on a single parameter, namely the number of piecewise linear (PWL) approximation terms. It turns out that the known max-log-MAP algorithm can be viewed as special case of this new generalized approach. Furthermore, the decoding complexity of the most popular previously published methods is estimated, for the first time, in a unified way by hardware synthesis results, showing the practical implementation advantages of the proposed approximations against these method

Non-recursive max* operator with reduced implementation complexity for turbo decoding

In this study, the authors deal with the problem of how to effectively approximate the max?? operator when having n > 2 input values, with the aim of reducing implementation complexity of conventional Log-MAP turbo decoders. They show that, contrary to previous approaches, it is not necessary to apply the max?? operator recursively over pairs of values. Instead, a simple, yet effective, solution for the max?? operator is revealed having the advantage of being in non-recursive form and thus, requiring less computational effort. Hardware synthesis results for practical turbo decoders have shown implementation savings for the proposed method against the most recent published efficient turbo decoding algorithms by providing near optimal bit error rate (BER) performance

Simplified Log-MAP Algorithm for Very Low-Complexity Turbo Decoder Hardware Architectures

Motivated by the importance of hardware implementation in practical turbo decoders, a simplified, yet effective, n-input max∗ approximation algorithm is proposed with the aim being its efficient implementation for very low-complexity turbo decoder hardware architectures. The simplification is obtained using an appropriate digital circuit for finding the first two maximum values in a set of n data that embeds the computation of a correction term. Various implementation results show that the proposed architecture is simpler by 30%, on average, than the constant logarithmic-maximum a posteriori (Log-MAP) one, in terms of chip area with the same delay. This comes at the expense of very small performance degradation, in the order of 0.1 dB for up to moderate bit error rates, e.g., 10e−5, assuming binary turbo codes. However, when applying scaling to the extrinsic information, the proposed algorithm achieves almost identical Log-MAP turbo code performance for both binary and double-binary turbo codes, without increasing noticeably the implementation complexity

Improving Network-on-Chip-based Turbo Decoder Architectures

In this work novel results concerning Networkon- Chip-based turbo decoder architectures are presented. Stemming from previous publications, this work concentrates first on improving the throughput by exploiting adaptive-bandwidth-reduction techniques. This technique shows in the best case an improvement of more than 60 Mb/s. Moreover, it is known that double-binary turbo decoders require higher area than binary ones. This characteristic has the negative effect of increasing the data width of the network nodes. Thus, the second contribution of this work is to reduce the network complexity to support doublebinary codes, by exploiting bit-level and pseudo-floatingpoint representation of the extrinsic information. These two techniques allow for an area reduction of up to more than the 40 % with a performance degradation of about 0.2 d

Ceramic Microbial Fuel Cells Stack: Power generation in standard and supercapacitive mode

© 2018 The Author(s). In this work, a microbial fuel cell (MFC) stack containing 28 ceramic MFCs was tested in both standard and supercapacitive modes. The MFCs consisted of carbon veil anodes wrapped around the ceramic separator and air-breathing cathodes based on activated carbon catalyst pressed on a stainless steel mesh. The anodes and cathodes were connected in parallel. The electrolytes utilized had different solution conductivities ranging from 2.0 mScm-1 to 40.1 mScm-1, simulating diverse wastewaters. Polarization curves of MFCs showed a general enhancement in performance with the increase of the electrolyte solution conductivity. The maximum stationary power density was 3.2 mW (3.2 Wm-3) at 2.0 mScm-1 that increased to 10.6 mW (10.6 Wm-3) at the highest solution conductivity (40.1 mScm-1). For the first time, MFCs stack with 1 L operating volume was also tested in supercapacitive mode, where full galvanostatic discharges are presented. Also in the latter case, performance once again improved with the increase in solution conductivity. Particularly, the increase in solution conductivity decreased dramatically the ohmic resistance and therefore the time for complete discharge was elongated, with a resultant increase in power. Maximum power achieved varied between 7.6 mW (7.6 Wm-3) at 2.0 mScm-1 and 27.4 mW (27.4 Wm-3) at 40.1 mScm-1

Cooperative DVB-SH satellite broadcasting systems with rotated signal constellations

In this paper, we study the advantages of cooperation in broadcasting systems from a geosynchronous earth orbit (GEO) satellite to mobile terminals (MTs), achieved through a terrestrial complementary ground station (CGS) with fixed installment, which acts as a relay. Moreover and in the context of the digital video broadcasting-satellite-to-handheld (DVB-SH) standard, the performance improvements offered by the rotated constellations method are investigated, where prior transmission, a phase rotation of the transmitted symbols by a fixed angle is applied followed by a random component interleaver. Turbo codes with soft decision decoding and appropriate random channel interleavers are also considered. We present analytical expressions for the bit log-likelihood ratios (LLRs) that are needed for soft decision decoding at the MT turbo decoder, while the code combining technique is adapted to improve the end-to-end (E2E) performance. Then, we obtain through extensive computer simulations the average bit error probability (ABEP) of quadrature phase-shift keying (QPSK) signals received over pure land-mobile satellite (LMS) and pure CGS links for coding rates 1/3 and 6/7. Moreover, the optimal rotation angles are obtained for both links. E2E ABEP results are then presented assuming cooperation between GEO and CGS, while the power allocation issue is investigated under fixed total transmission power. Our performance evaluation results show that by using the constellation rotation technique, a performance gain can be achieved for high coding rates. © 2013 IEEE