In this paper, we study simultaneous wireless information and power transfer (SWIPT) in two-way relay channels where two users exchange information with each other via a multi-antenna relay node. The signals forwarded by the relay node are also used to supply the power to two users. We formulate a max-min optimization problem aiming to maximize the minimum harvested energy between two users to achieve fairness. We jointly optimize the relay beamforming matrix and allocating powers at the two users subject to the quality of service (QoS) constraints. To be specific, we consider the amplify-and-forward (AF) relay strategy and the time splitting SWIPT strategy. To this end, we propose two different time splitting protocols to enable relay to supply power to two users. To solve the non-convex joint optimization problem, we propose to split the original optimization problem into two subproblems and solving them iteratively to obtain the final solution. It is shown that the first subproblem dealing with the beamforming matrix can be optimally solved by using the technique of relaxed semidefinite programming (SDR), and the second subproblem, which deals with the power allocation, can be solved via linear programming. The performance comparison of two schemes as well as the one-way relaying scheme are provided and the effectiveness of the proposed schemes is verified.

A linear CMOS transconductor is presented. PMOS transistors are employed in the resistor-replacement and voltage-level shifting to avoid the body effect. To annihilate the non-linear voltage terms, the substrate-bias effect of MOS transistors is treated more accurately in our design. Consequently, the non-linearity of the large-signal transconductance is reduced. The fabricated circuit occupies an area of 245 µm176 µm ( ≈approx 0.043 mm2) and dissipates 0.87 mW from a 3.3 V supply. For an input of 1 Vp-p, the measured output total harmonic distortion is less than 1.2%. The transconductance varies by less than 0.5% in the input range.

In this letter, a Tomlinson-Harashima precoding (THP) scheme is proposed for the downlink of multiuser MIMO systems with multiple antennas at each receiver. Assuming single data stream communication for each user, joint transmitter and receiver design is done to maximize the signal to noise ratio (SNR) for each user. Furthermore, a heuristic user ordering algorithm is proposed to optimize the encoding order and improve the bit error rate (BER) performance. Simulation results have shown that the proposed approach is superior to some existing precoding schemes.

A novel low-complexity iterative receiver for coded multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems is proposed in this letter. The iterative receiver uses the parallel interference cancellation (PIC)-maximum ratio combining (MRC) detector for MIMO-OFDM detection, which is a popular alternative to the minimum mean square error (MMSE) detector due to its lower computational complexity. However, we have found that the conventional PIC-MRC detector tends to underestimate the magnitude of its output log likelihood ratios (LLRs). Based on this discovery, we propose to multiply these LLRs by a constant factor, which is optimized according to the extrinsic information transfer (EXIT) chart of the soft-in soft-out (SISO) detector. Simulation results show that the proposed scheme significantly improves the performance of the PIC-MRC-based receiver with little additional cost in computational complexity, allowing it to closely approach the performance of receiver using the much more complex MMSE detector.

In this letter, an area-efficient architecture for the hardware implementation of the real-time prime factor Fourier transform (PFFT) is presented. In the proposed architecture, a prime length DFT module with the one-point-per-cycle (OPPC) property is implemented by the parallel distributed arithmetic (DA), and a cyclic convolution feature is exploited to simplify the structure of the DA cells. Based on the proposed architecture, a real-time 65-point PFFT processor is designed, and the synthesis results show that it saves over 8% gates compared to the existing real-time 64-point DFT designs.

This study presents a new current-mirror sense amplifier (CMSA) design for high-speed static random access memory (SRAM) applications. The proposed CMSA can directly sense the current of memory cell and only needs two transistor stages cascaded from VDD to GND for achieving the low-voltage operation. Moreover, the sensing speed of the proposed CMSA is independent of the bit-line capacitances and is only slightly sensitive to the data-line capacitances. Based on the simulation with using the TSMC 0.25-µm 2P4M CMOS process parameter, the proposed CMSA can effectively work at 500 MHz-1 GHz with working voltage as low as 1.5 V. Simulated results show that the proposed CMSA has a much speed improvement compared with the conventional sense amplifiers. Also, the effectiveness of the proposed CMSA is demonstrated with a read-cycle-only memory system to show the good performance for SRAM applications.

In recent years, with the continuous development of the Internet of Things, radio frequency identification (RFID) technology has also been widely concerned. The computing power of low cost tags is limited because of their high hardware requirements. Symmetric encryption algorithms and asymmetric encryption algorithms, such as RSA, DES, AES, etc., cannot be suitable for low cost RFID protocols. Therefore, research on RFID security authentication protocols with low cost and high security has become a focus. Recently, an ultralightweight RFID authentication protocol LP2UF was proposed to provide security and prevent all possible attacks. However, it is discovered that a type of desynchronization attack can successfully break the proposed scheme. To overcome the vulnerability against desynchronization attacks, we propose here a new ultra-lightweight RFID two-way authentication protocol based on stream cipher technology that uses only XOR. The stream cipher is employed to ensure security between readers and tags. Analysis shows that our protocol can effectively resist position tracking attacks, desynchronization attacks, and replay attacks.

This paper proposes a novel RBF training algorithm based on immune operations for dynamic problem solving. The algorithm takes inspiration from the dynamic nature of natural immune system and locally-tuned structure of RBF neural network. Through immune operations of vaccination and immune response, the RBF network can dynamically adapt to environments according to changes in the training set. Simulation results demonstrate that RBF equalizer based on the proposed algorithm obtains good performance in nonlinear time-varying channels.