Imbibition dynamics of nano-particulate ink-jet drops on micro-porous media

Ink-jet printing of nano-metallic colloidal fluids on to porous media such as coated papers has become a viable method to produce conductive tracks for low-cost, disposable printed electronic devices. However, the formation of well-defined and functional tracks on an absorbing surface is controlled by the drop imbibition dynamics in addition to the well-studied post-impact drop spreading behavior. This study represents the first investigation of the real-time imbibition of ink-jet deposited nano-Cu colloid drops on to coated paper substrates. In addition, the same ink was deposited on to a non-porous polymer surface as a control substrate. By using high-speed video imaging to capture the deposition of ink-jet drops, the time-scales of drop spreading and imbibition were quantified and compared with model predictions. The influences of the coating pore size on the bulk absorption rate and nano-Cu particle distribution have also been studied.

Nearest neighbour decoding and pilot-aided channel estimation in stationary Gaussian flat-fading channels

We study the information rates of non-coherent, stationary, Gaussian, multiple-input multiple-output (MIMO) flat-fading channels that are achievable with nearest neighbour decoding and pilot-aided channel estimation. In particular, we analyse the behaviour of these achievable rates in the limit as the signal-to-noise ratio (SNR) tends to infinity. We demonstrate that nearest neighbour decoding and pilot-aided channel estimation achieves the capacity pre-logwhich is defined as the limiting ratio of the capacity to the logarithm of SNR as the SNR tends to infinityof non-coherent multiple-input single-output (MISO) flat-fading channels, and it achieves the best so far known lower bound on the capacity pre-log of non-coherent MIMO flat-fading channels. © 2011 IEEE.

Is the assumption of perfect channel-state information in fading channels a good assumption?

Fading channels, which are used as a model for wireless communication, are often analyzed by assuming that the receiver is aware of the realization of the channel. This is commonly justified by saying that the channel varies typically slowly with time, and the receiver is thus able to estimate it. However, this assumption is optimistic, since it is prima facie not clear whether the channel can be estimated perfectly. This paper investigates the quality of this assumption by means of the channel capacity. In particular, results on the channel capacity of fading channels are presented, both when the receiver is aware of the realization of the channel and when it is aware only of its statistics. A comparison of these results demonstrates that information- theoretic analyses of fading channels that are based on the assumption that the receiver is aware of the channel's realization can yield helpful insights, but have to be taken with a pinch of salt. ©2009 IEEE.

Channels that heat up

This paper considers an additive noise channel where the time-κ noise variance is a weighted sum of the squared magnitudes of the previous channel inputs plus a constant. This channel model accounts for the dependence of the intrinsic thermal noise on the data due to the heat dissipation associated with the transmission of data in electronic circuits: the data determine the transmitted signal, which in turn heats up the circuit and thus influences the power of the thermal noise. The capacity of this channel (both with and without feedback) is studied at low transmit powers and at high transmit powers. At low transmit powers, the slope of the capacity-versus-power curve at zero is computed and it is shown that the heating-up effect is beneficial. At high transmit powers, conditions are determined under which the capacity is bounded, i.e., under which the capacity does not grow to infinity as the allowed average power tends to infinity. © 2009 IEEE.

Multipath channels of unbounded capacity

The capacity of discrete-time, noncoherent, multipath fading channels is considered. It is shown that if the variances of the path gains decay faster than exponentially, then capacity is unbounded in the transmit power. © 2008 IEEE.

Nearest neighbour decoding with pilot-assisted channel estimation for fading multiple-access channels

This paper studies a noncoherent multiple-input multiple-output (MIMO) fading multiple-access channel (MAC). The rate region that is achievable with nearest neighbour decoding and pilot-assisted channel estimation is analysed and the corresponding pre-log region, defined as the limiting ratio of the rate region to the logarithm of the signal-to-noise ratio (SNR) as the SNR tends to infinity, is determined. © 2011 IEEE.

On bandlimited fading channels at high SNR

This paper provides an overview of results on the capacity of noncoherent, multiple-input multiple-output (MIMO) flat-fading channels with a bandlimited power spectral density. The focus is on results that concern the capacity at high signal-to-noise ratio (SNR). In particular, the capacity pre-log, defined as the limiting ratio of the capacity to the logarithm of the SNR as the SNR tends to infinity, is studied. It is observed that the capacity pre-log is a function of the number of antennas as well as of the bandwidth of the fading channel's power spectral density. It is further observed that the capacity pre-log can be achieved with a simple communication system where the data detection and the channel estimation are performed separately. © 2011 ACM.

Outage exponents of block-fading channels with power allocation

Power allocation is studied for fixed-rate transmission over block-fading channels with arbitrary continuous fading distributions and perfect transmitter and receiver channel state information. Both short- and long-term power constraints for arbitrary input distributions are considered. Optimal power allocation schemes are shown to be direct applications of previous results in the literature. It is shown that the short- and long-term outage exponents for arbitrary input distributions are related through a simple formula. The formula is useful to predict when the delay-limited capacity is positive. Furthermore, this characterization is useful for the design of efficient coding schemes for this relevant channel model. © 2010 IEEE.

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.