Optimal power allocation for complex field network coding scheme with the K-th best relay selection

Wireless relay and network coding are two critical techniques to increase the reliability and throughput of wireless cooperative communication systems. In this paper, a complex field network coding （CFNC） scheme with the K-th best relay selection （KBS） is proposed and investigated, wherein the K-th best relay is selected to forward the multiplexed signal to the destination. First, the upper bound of the symbol error probability （SEP）, the diversity order, and the coding gain are derived for the CFNC scheme with KBS. Then, the coding gain is utilized as the optimized cri- terion to determine the optimal power allocation. It is validated through analysis and simulation that the CFNC scheme with KBS can achieve full diversity only when K=I, while the diversity order decreases with increasing parameter K, and the optimal power allocation can significantly improve the performance of the CFNC scheme with KBS.

Furfural residues from straw become complex fertilizer by addition method

The additives such as phosphoric acid, calcium phosphate, calcium super phosphate, calcium over super phosphate, calcium carbonate, sodium hydrosulphite, etc. were used to produce furfural from the straw by hydrolysis with sulfuric acid. The effect of amount of the additives, the content of the added substance and the conditions of distillation on the acidity of the residues were studied. The experiment results showed that the all residues became neutral complex fertilizer, and the productivity of furfural increases under the following conditions: sulfuric acid concentration is 20% (by weight), the ratio of liquid to solid is 3∶1—4∶1 (by weight), the ratio of the additives to straw is suitable.

A Low Complexity VCS Method for PAPR Reduction in Multicarrier Code Division Multiple Access

This paper investigates a peak to average power ratio （PAPR） reduction method in multicarrier code division multiple access （MC-CDMA） system. Variable code sets （VCS）, a spreading codes selection scheme, can improve the PAPR property of the MC-CDMA signals, but this technique requires an exhaustive search over the combinations of spreading code sets. It is observed that when the number of active users increases, the search complexity will increase exponentially. Based on this fact, we propose a low complexity VCS （LC-VCS） method to reduce the computational complexity. The basic idea of LC-VCS is to derive new signals using the relationship between candidature signals. Simulation results show that the proposed approach can reduce PAPR with lower comtational pucomplexity. In addition, it can be blindly received without any side information.

Prove the Minimal Delay of Complex Orthogonal Space-Time Block Code by Hadamard Matrix

The complex orthogonal designs with maximal rates and minimal delays is an open problem for space-time block code. Maximal rate can effectively transmit symbols to the lonest distance in the space dimension ; and minimal delay is the least decoding delay in the time dimension. Many authors have observed that regarding the complex orthogonal designs for space-time block codes with the antennas n = 4k （ k ∈ N ）, its minimal delay is the same as that for n - 4k -1. However none was able to prove it. In this paper, we use the characteristics of Hadamard matrix to prove this property to fulfill this vacancy.