Thrombolysis for evolving myocardial infarction in a rural primary care clinic

Early thrombolytic therapy gives maximum benefit in acute myocardial infarction. In remote rural areas with no mobile intensive care service there is a significant delay between onset of symptoms and administration of thrombolytic therapy which has a critical impact on revascularization. Thrombolytic therapy with streptokinase 1,500,000 U was given in a primary care rural clinic to 2 patients with evolving myocardial infarction 45-50 minutes from onset of symptoms. In both patients, who were transported to hospital after the therapy, there were clinical signs of reperfusion. There were no complications during treatment or transportation. We conclude that thrombolytic therapy given for evolving myocardial infarction in a rural primary care clinic is possible and safe.     

Achievable performance over the correlated Rician channel

The correlated Rician channel is a useful model for a slowly fading channel, in which the complex fading process is composed of two quadrature Gaussian processes with a given autocorrelation function. For slow fading the correlation between adjacent symbols is relatively high. The authors investigate the achievable error probabilities over the channel, employing coherent detection and ideal side information on the realization of the fading processes at the receiver. An underlying decoding delay constraint which precludes the use of (ideal) interleaving is assumed. Coded BPSK performance is addressed both with and without the piecewise constant approximation (according to which the fading value remains constant during the symbol duration). For the latter case, that is no piecewise constant approximation, the analysis relies on the Fredholm determinant associated with the fading process autocorrelation function. The authors focus on the exponentially correlated channel. The “worst case” pairs of codewords are identified. The exponential behavior of the error probability with random coding (and i.i.d. Gaussian inputs) is analyzed, and the behavior of the cut-off rate and capacity is addressed. The results enhance the insight to the effect of the basic parameters governing the performance and these are examined in view of previous works and compared to relevant performance results for the block-fading channel model     

Bounds on the symmetric binary cutoff rate for dispersive Gaussianchannels

Bounds on the symmetric binary cutoff rate for a pulse amplitude modulated (PAM) signaling over dispersive Gaussian channels are evaluated and discussed. These easily calculable bounds can be used to estimate the reliable rate of information transmission and the error exponent behavior for binary (two-level) PAM schemes, operating through a prefiltered additive white Gaussian channel, the memory of which is long enough to make the exact evaluation of the cutoff rate formidable. The core of the bounding technique relies on a probabilistic interpretation of a fundamental theorem in matrix theory, regarding the logarithm of the largest eigenvalue of a nonnegative primitive matrix, commonly applied in large deviation problems. These bounds are calculated for some examples and their respective tightness is considered. Further potential applications of the proposed bounding technique are pointed out     

Relaying protocols for two colocated users

We consider a wireless network where a remote source sends information to one of two colocated users, and where the second user can serve as a relay. The source's transmission is subjected to quasi-static flat Rayleigh fading, while the transmission of the relay experiences a fixed amplitude gain with a uniform random phase, capturing its close proximity to the destination. All communications share the same time/bandwith resources, and perfect channel state information is known only to the receivers. We propose relaying protocols which are based on Wyner-Ziv quantization at the relay, and demonstrate their high efficiency (in terms of expected throughput) with respect to previously reported relaying schemes based on amplify-and-forward and decode-and-forward. A salient feature of these protocols is that the relay need not know the actual fading gain experienced by the destination in order to perform the quantization. We also consider a hybrid amplify-quantize-decode-and-forward scheme which exhibits superior performance.     

Linear precoding via conic optimization for fixed MIMO receivers

In this paper, the problem of designing linear precoders for fixed multiple-input-multiple-output (MIMO) receivers is considered. Two different design criteria are considered. In the first, the transmitted power is minimized subject to signal-to-interference-plus-noise-ratio (SINR) constraints. In the second, the worst case SINR is maximized subject to a power constraint. It is shown that both problems can be solved using standard conic optimization packages. In addition, conditions are developed for the optimal precoder for both of these problems, and two simple fixed-point iterations are proposed to find the solutions that satisfy these conditions. The relation to the well-known uplink-downlink duality in the context of joint transmit beamforming and power control is also explored. The proposed precoder design is general, and as a special case, it solves the transmit rank-one beamforming problem. Simulation results in a multiuser system show that the resulting precoders can significantly outperform existing linear precoders.     

Constrained Information Combining: Theory and Applications for LDPC Coded Systems

This paper tightens previous information combining bounds on the performance of iterative decoding of binary low-density parity-check (LDPC) codes over binary-input symmetric-output channels by tracking the probability of erroneous bit in conjunction with mutual information. Evaluation of the new bounds as well as of other known bounds on different LDPC ensembles demonstrates sensitivity of the finite dimensional iterative bounds to lambda₂, the fraction of edges connected to degree 2 variable nodes     

LDPC coded MIMO multiple access with iterative joint decoding

An efficient scheme for the multiple-access multiple-input multiple-output (MIMO) channel is proposed, which operates well also in the single user regime, as well as in a direct-sequence spread-spectrum (DS-CDMA) setting. The design features scalability and is of limited complexity. The system employs optimized low-density parity-check (LDPC) codes and an efficient iterative (belief propagation-BP) detection which combines linear minimum mean-square error (LMMSE) detection and iterative interference cancellation (IC). This combination is found to be necessary for efficient operation in high system loads /spl alpha/>1. An asymptotic density evolution (DE) is used to optimize the degree polynomials of the underlining LDPC code, and thresholds as close as 0.77 dB to the channel capacity are evident for a system load of 2. Replacing the LMMSE with the complex individually optimal multiuser detector (IO-MUD) further improves the performance up to 0.14 dB from the capacity. Comparing the thresholds of a good single-user LDPC code to the multiuser optimized LDPC code, both over the above multiuser channel, reveals a surprising 8-dB difference, emphasizing thus the necessity of optimizing the code. The asymptotic analysis of the proposed scheme is verified by simulations of finite systems, which reveal meaningful differences between the performances of MIMO systems with single and multiple users and demonstrate performance similar to previously reported techniques, but with higher system loads, and significantly lower receiver complexity.     

Transmitting to colocated users in wireless ad hoc and sensor networks

We consider wireless ad hoc networks and sensor networks where a remotely located source is transmitting information to a destined user embedded within a group of K densely packed physically colocated users enjoying favorable signal-to-noise ratio (SNR) conditions among themselves, but suffering from quasi-static flat Rayleigh fading with respect to the source. Stringent delay constraints require that information, once available, be transmitted immediately and delivered reliably to its destination during a period of one fading block, precluding waiting until the destined user enjoys favorable fading conditions with respect to the source. A cooperative transmission strategy is proposed for this scenario and its expected throughput is investigated. The strategy exhibits a substantial gain in throughput, especially when the colocation gain factor is high. In addition, a broadcast approach is incorporated into the transmission strategy suggesting further throughput benefits.     

Mutual Information and Conditional Mean Estimation in Poisson Channels

Following the discovery of a fundamental connection between information measures and estimation measures in Gaussian channels, this paper explores the counterpart of those results in Poisson channels. In the continuous-time setting, the received signal is a doubly stochastic Poisson point process whose rate is equal to the input signal plus a dark current. It is found that, regardless of the statistics of the input, the derivative of the input-output mutual information with respect to the intensity of the additive dark current can be expressed as the expected difference between the logarithm of the input and the logarithm of its noncausal conditional mean estimate. The same holds for the derivative with respect to input scaling, but with the logarithmic function replaced by x log x. Similar relationships hold for discrete-time versions of the channel where the outputs are Poisson random variables conditioned on the input symbols.     

Information-theoretic considerations for symmetric, cellular,multiple-access fading channels. II

For pt.I see ibid., vol.43, no.6, p.1877-94 (1997). A simple idealized linear (and planar) uplink, cellular, multiple-access communication model, where only adjacent cell interference is present and all signals may experience fading is considered. Shannon theoretic arguments are invoked to gain insight into the implications on performance of the main system parameters and multiple-access techniques. The model treated in Part I (Shamai, 1997) is extended here to account for cell-site receivers that may process also the received signal at an adjacent cell site, compromising thus between the advantage of incorporating additional information from other cell sites on one hand and the associated excess processing complexity on the other. Various settings which include fading, time-division multiple access (TDMA), wideband (WB), and (optimized) fractional inter-cell time sharing (ICTS) protocols are investigated and compared. In this case and for the WB approach and a large number of users per cell it is found, surprisingly, that fading may enhance performance in terms of Shannon theoretic achievable rates. The linear model is extended to account for general linear and planar configurations. The effect of a random number of users per cell is investigated and it is demonstrated that randomization is beneficial. Certain aspects of diversity as well as some features of TDMA and orthogonal code-division multiple access (CDMA) techniques in the presence of fading are studied in an isolated cell scenario