OFDM-Aided Differential Space-Time Shift Keying Using Iterative Soft Multiple-Symbol Differential Sphere Decoding

Soft-decision multiple-symbol differential sphere decoding (MSDSD) is proposed for orthogonal frequency-division multiplexing (OFDM)-aided differential space-time shift keying (DSTSK)-aided transmission over frequency-selective channels. Specifically, the DSTSK signaling blocks are generated by the channel-encoded source information and the space-time (ST) blocks are appropriately mapped to a number of OFDM subcarriers. After OFDM demodulation, the DSTSK signal is noncoherently detected by our soft-decision MSDSD detector. A novel soft-decision MSDSD detector is designed, and the associated decision rule is derived for the DSTSK scheme. Our simulation results demonstrate that an SNR reduction of 2 dB is achieved by the proposed scheme using an MSDSD window size of N-w = 4 over the conventional soft-decision-aided differential detection benchmarker, while communicating over dispersive channels and dispensing with channel estimation (CE).

Performance Analysis of Space-Shift Keying in Decode-and-Forward Multihop MIMO Networks

In this paper, space-shift keying (SSK) is considered for multihop multiple-input-multiple-output (MIMO) networks. In SSK, only one among n(s) = 2(m) available transmit antennas, chosen on the basis of m information bits, is activated during transmission. We consider two different systems of multihop co-operation, where each node has multiple antennas and employs SSK. In system I, a multihop diversity relaying scheme is considered. In system II, a multihop multibranch relaying scheme is considered. In both systems, we adopt decode-and-forward (DF) relaying, where each relay forwards the signal only when it correctly decodes. We analyze the end-to-end bit error rate (BER) and diversity order of both the systems with SSK. For binary SSK (n(s) = 2), our analytical BER expression is exact, and our numerical results show that the BERs evaluated through the analytical expression overlap with those obtained through Monte Carlo simulations. For nonbinary SSK (n(s) > 2), we derive an approximate BER expression, where the analytically evaluated BER results closely follow the simulated BER results. We show the comparison of the BERs of SSK and conventional phase-shift keying (PSK) and also show the instances where SSK outperforms PSK. We also present the diversity analyses for SSK in systems I and II, which predict the achievable diversity orders as a function of system parameters.

Novel Transmit Precoding Methods for Rayleigh Fading Multiuser TDD-MIMO Systems With CSIT and No CSIR

In this paper, we present novel precoding methods for multiuser Rayleigh fading multiple-input-multiple-output (MIMO) systems when channel state information (CSI) is available at the transmitter (CSIT) but not at the receiver (CSIR). Such a scenario is relevant, for example, in time-division duplex (TDD) MIMO communications, where, due to channel reciprocity, CSIT can be directly acquired by sending a training sequence from the receiver to the transmitter(s). We propose three transmit precoding schemes that convert the fading MIMO channel into a fixed-gain additive white Gaussian noise (AWGN) channel while satisfying an average power constraint. We also extend one of the precoding schemes to the multiuser Rayleigh fading multiple-access channel (MAC), broadcast channel (BC), and interference channel (IC). The proposed schemes convert the fading MIMO channel into fixed-gain parallel AWGN channels in all three cases. Hence, they achieve an infinite diversity order, which is in sharp contrast to schemes based on perfect CSIR and no CSIT, which, at best, achieve a finite diversity order. Further, we show that a polynomial diversity order is retained, even in the presence of channel estimation errors at the transmitter. Monte Carlo simulations illustrate the bit error rate (BER) performance obtainable from the proposed precoding scheme compared with existing transmit precoding schemes.

Minimum-Error-Probability CFO Estimation for Multiuser MIMO-OFDM Systems

We consider carrier frequency offset (CFO) estimation in the context of multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems over noisy frequency-selective wireless channels with both single- and multiuser scenarios. We conceived a new approach for parameter estimation by discretizing the continuous-valued CFO parameter into a discrete set of bins and then invoked detection theory, analogous to the minimum-bit-error-ratio optimization framework for detecting the finite-alphabet received signal. Using this radical approach, we propose a novel CFO estimation method and study its performance using both analytical results and Monte Carlo simulations. We obtain expressions for the variance of the CFO estimation error and the resultant BER degradation with the single- user scenario. Our simulations demonstrate that the overall BER performance of a MIMO-OFDM system using the proposed method is substantially improved for all the modulation schemes considered, albeit this is achieved at increased complexity.

Wireless Network-Coded Accumulate-Compute-and-Forward Two-Way Relaying

For the physical-layer network-coded wireless two-way relaying, it was observed by Koike-Akino et al. that adaptively changing the network coding map used at the relay according to channel conditions greatly reduces the impact of multiple-access interference, which occurs at the relay, and all these network coding maps should satisfy a requirement called exclusive law. We extend this approach to an accumulate-compute-and-forward protocol, which employs two phases: a multiple access (MA) phase consisting of two channel uses with independent messages in each channel use and a broadcast (BC) phase having one channel use. Assuming that the two users transmit points from the same 4-phase-shift keying (PSK) constellation, every such network coding map that satisfies the exclusive law can be represented by a Latin square of side 16, and conversely, this relationship can be used to get the network coding maps satisfying the exclusive law. Two methods of obtaining this network coding map to be used at the relay are discussed. Using the structural properties of the Latin squares for a given set of parameters, the problem of finding all the required maps is reduced to finding a small set of maps for the case. Having obtained all the Latin squares, a criterion is provided to select a Latin square for a given realization of fade state. This criterion turns out to be the same as the one used byMuralidharan et al. for two-stage bidirectional relaying.

Modelling and Simulation of ERTMS for Current and Future Mobile Technologies

Nowadays, train control in-lab simulation tools play a crucial role in reducing extensive and expensive on-site railway testing activities. In this paper, we present our contribution in this arena by detailing the internals of our European Railway Train Management System in-lab demonstrator. This demonstrator is built over a general-purpose simulation framework, Riverbed Modeler, previously Opnet Modeler. Our framework models both ERTMS subsystems, the Automatic Train Protection application layer based on movement authority message exchange and the telecommunication subsystem based on GSM-R communication technology. We provide detailed information on our modelling strategy. We also validate our simulation framework with real trace data. To conclude, under current industry migration scenario from GSM-R legacy obsolescence to IP-based heterogeneous technologies, our simulation framework represents a singular tool to railway operators. As an example, we present the assessment of related performance indicators for a specific railway network using a candidate replacement technology, LTE, versus current legacy technology. To the best of our knowledge, there is no similar initiative able to measure the impact of the telecommunication subsystem in the railway network availability.

New space-time trellis codes for two-antenna quasi-static channels

New space-time trellis codes with four- and eight-level phase-shift keying (PSK) and 16-phase quadrature amplitude modulation (QAM) for two transmit antennas in slow-fading channels are presented in this paper. Unlike most of the codes that are reported in the literature, the proposed codes are specifically designed to minimize the frame error probability from a union-bound perspective. The performance of the proposed codes with various memory orders and receive antennas is evaluated by simulation. It is shown that the proposed codes outperform previously known codes in all studied cases.

Experimental evaluation of layout designs for 3 × 3 MIMO-enabled radio-over-fiber distributed antenna systems

This paper experimentally demonstrates that, for two representative indoor distributed antenna system (DAS) scenarios, existing radio-over-fiber (RoF) DAS installations can enhance the capacity advantages of broadband 3 × 3 multiple-input-multiple-output (MIMO) radio services without requiring additional fibers or multiplexing schemes. This is true for both single-and multiple-user cases with a single base station and multiple base stations. First, a theoretical example is used to illustrate that there is a negligible improvement in signal-to-noise ratio (SNR) when using a MIMO DAS with all N spatial streams replicated at N RAUs, compared with a MIMO DAS with only one of the N streams replicated at each RAU for N ≤ 4. It is then experimentally confirmed that a 3 × 3 MIMO DAS offers improved capacity and throughput compared with a 3 × 3 MIMO collocated antenna system (CAS) for the single-user case in two typical indoor DAS scenarios, i.e., one with significant line-of-sight (LOS) propagation and the other with entirely non-line-of-sight (NLOS) propagation. The improvement in capacity is 3.2% and 4.1%, respectively. Then, experimental channel measurements confirm that there is a negligible capacity increase in the 3 × 3 configuration with three spatial streams per antenna unit over the 3 × 3 configuration with a single spatial stream per antenna unit. The former layout is observed to provide an increase of ∼1% in the median channel capacity in both the single-and multiple-user scenarios. With 20 users and three base stations, a MIMO DAS using the latter layout offers median aggregate capacities of 259 and 233 bit/s/Hz for the LOS and NLOS scenarios, respectively. It is concluded that DAS installations can further enhance the capacity offered to multiple users by multiple 3 × 3 MIMO-enabled base stations. Further, designing future DAS systems to support broadband 3 × 3 MIMO systems may not require significant upgrades to existing installations for small numbers of spatial streams. © 2013 IEEE.

后向无关联性的本地验证撤销群签名研究

数字签名，是密码理论的一个重要分支，在身份认证等方面举足轻重。但随着电子商务、电子政务等业务的不断展开，在多用户参与的应用环境中显得捉襟见肘。群数字签名应运而生，主要特点是保护了签名者的匿名性。 群签名撤销研究的两个主要方向：设计算量小的撤销成员算法，以及保证成员被撤销之前签名的匿名性和无关联性。目前主要有基于撤销列表（RL）和证据的撤销算法是两类主流算法，前者更适用于移动环境中。因此，在网络化、信化的今天，基于撤销列表的群签名的研究显得弥足重要。 本地验证撤销（VLR），是目前效率最高的一种基于撤销列表的方法。后向无关联性（BU），是指当成员即使在某个时段被撤销，以前的签名仍然保持匿名性。本论文主要工作，是对有群签名方案的分析和BU-VLR方案的设计，主要有以下几个方面： 1. 2007年IEEE Transactions on Vehicular Technology上的一个方案，建立在2004年Boneh等在 CRYPTO的群签名方案。本论文指出，方案使得同一成员的签名具有关联性，导致在VLR安全模型下方案不具有匿名性。 2. 分析的另外两个群签名方案，都是方案设计者在设计签名算法时由于设计不当，使得同一成员的签名具有关联性，从而导致方案在相应的安全模型下不具有匿名性。 3. 对一种基于身份的群签名方案，有文献曾对该签名方案做过分析，在本论文将给出另外一种方法来证明方案不具有匿名性。 4. 分析指出了一种新型群签名方案，其本身是建立在一个错误的签名方案之上，因而该方案不过是空中楼阁。此外，方案还存在其他缺陷。 5.构造了一个BU-VLR群签名方案，具有较短的签名长度和较低的运算量。利用k叉树扩展了方案以减少RL的数据量。最后，对2007年IEICE中一个BU-VLR方案加以改进，签名长度为原来的77.8%，运算量不变。 6.设计的第二个方案，针对现有BU-VLR方案中存在的缺陷，使得到的方案公钥长度不再与成员个数相关；撤销上的数据不再随着时间段的更新而更新，而只是在列表需要更新的时间段更新。 7.在q-SDH假设和困难性假设较强的XDH假设下，构造了一个BU-VLR群签名方案，性能上优于目前最高效的VLR方案，即BS04方案。

Energy harvesting embedded wireless sensor system for building environment applications

For many wireless sensor networks applications, indoor light energy is the only ambient energy source commonly available. Many advantages and constraints co-exist in this technology. However, relatively few indoor light powered harvesters have been presented and much research remains to be carried out on a variety of related design considerations and trade-offs. This work presents a solution using the Tyndall mote and an indoor light powered wireless sensor node. It analyses design considerations on several issues such as indoor light characteristics, solar panel component choice, maximum power point tracking, energy storage elements and the trade-offs and choices between them.