Showing papers on "Communication channel published in 2003"

Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels

Abstract: Multiple antennas can be used for increasing the amount of diversity or the number of degrees of freedom in wireless communication systems. We propose the point of view that both types of gains can be simultaneously obtained for a given multiple-antenna channel, but there is a fundamental tradeoff between how much of each any coding scheme can get. For the richly scattered Rayleigh-fading channel, we give a simple characterization of the optimal tradeoff curve and use it to evaluate the performance of existing multiple antenna schemes.

On the achievable throughput of a multiantenna Gaussian broadcast channel

Abstract: A Gaussian broadcast channel (GBC) with r single-antenna receivers and t antennas at the transmitter is considered. Both transmitter and receivers have perfect knowledge of the channel. Despite its apparent simplicity, this model is, in general, a nondegraded broadcast channel (BC), for which the capacity region is not fully known. For the two-user case, we find a special case of Marton's (1979) region that achieves optimal sum-rate (throughput). In brief, the transmitter decomposes the channel into two interference channels, where interference is caused by the other user signal. Users are successively encoded, such that encoding of the second user is based on the noncausal knowledge of the interference caused by the first user. The crosstalk parameters are optimized such that the overall throughput is maximum and, surprisingly, this is shown to be optimal over all possible strategies (not only with respect to Marton's achievable region). For the case of r>2 users, we find a somewhat simpler choice of Marton's region based on ordering and successively encoding the users. For each user i in the given ordering, the interference caused by users j>i is eliminated by zero forcing at the transmitter, while interference caused by users j

Capacity limits of MIMO channels

Abstract: We provide an overview of the extensive results on the Shannon capacity of single-user and multiuser multiple-input multiple-output (MIMO) channels. Although enormous capacity gains have been predicted for such channels, these predictions are based on somewhat unrealistic assumptions about the underlying time-varying channel model and how well it can be tracked at the receiver, as well as at the transmitter. More realistic assumptions can dramatically impact the potential capacity gains of MIMO techniques. For time-varying MIMO channels there are multiple Shannon theoretic capacity definitions and, for each definition, different correlation models and channel information assumptions that we consider. We first provide a comprehensive summary of ergodic and capacity versus outage results for single-user MIMO channels. These results indicate that the capacity gain obtained from multiple antennas heavily depends on the available channel information at either the receiver or transmitter, the channel signal-to-noise ratio, and the correlation between the channel gains on each antenna element. We then focus attention on the capacity region of the multiple-access channels (MACs) and the largest known achievable rate region for the broadcast channel. In contrast to single-user MIMO channels, capacity results for these multiuser MIMO channels are quite difficult to obtain, even for constant channels. We summarize results for the MIMO broadcast and MAC for channels that are either constant or fading with perfect instantaneous knowledge of the antenna gains at both transmitter(s) and receiver(s). We show that the capacity region of the MIMO multiple access and the largest known achievable rate region (called the dirty-paper region) for the MIMO broadcast channel are intimately related via a duality transformation. This transformation facilitates finding the transmission strategies that achieve a point on the boundary of the MIMO MAC capacity region in terms of the transmission strategies of the MIMO broadcast dirty-paper region and vice-versa. Finally, we discuss capacity results for multicell MIMO channels with base station cooperation. The base stations then act as a spatially diverse antenna array and transmission strategies that exploit this structure exhibit significant capacity gains. This section also provides a brief discussion of system level issues associated with MIMO cellular. Open problems in this field abound and are discussed throughout the paper.

How much training is needed in multiple-antenna wireless links?

Abstract: Multiple-antenna wireless communication links promise very high data rates with low error probabilities, especially when the wireless channel response is known at the receiver. In practice, knowledge of the channel is often obtained by sending known training symbols to the receiver. We show how training affects the capacity of a fading channel-too little training and the channel is improperly learned, too much training and there is no time left for data transmission before the channel changes. We compute a lower bound on the capacity of a channel that is learned by training, and maximize the bound as a function of the received signal-to-noise ratio (SNR), fading coherence time, and number of transmitter antennas. When the training and data powers are allowed to vary, we show that the optimal number of training symbols is equal to the number of transmit antennas-this number is also the smallest training interval length that guarantees meaningful estimates of the channel matrix. When the training and data powers are instead required to be equal, the optimal number of symbols may be larger than the number of antennas. We show that training-based schemes can be optimal at high SNR, but suboptimal at low SNR.

Achieving near-capacity on a multiple-antenna channel

Abstract: Recent advancements in iterative processing of channel codes and the development of turbo codes have allowed the communications industry to achieve near-capacity on a single-antenna Gaussian or fading channel with low complexity. We show how these iterative techniques can also be used to achieve near-capacity on a multiple-antenna system where the receiver knows the channel. Combining iterative processing with multiple-antenna channels is particularly challenging because the channel capacities can be a factor of ten or more higher than their single-antenna counterparts. Using a "list" version of the sphere decoder, we provide a simple method to iteratively detect and decode any linear space-time mapping combined with any channel code that can be decoded using so-called "soft" inputs and outputs. We exemplify our technique by directly transmitting symbols that are coded with a channel code; we show that iterative processing with even this simple scheme can achieve near-capacity. We consider both simple convolutional and powerful turbo channel codes and show that excellent performance at very high data rates can be attained with either. We compare our simulation results with Shannon capacity limits for ergodic multiple-antenna channel.

Effective capacity: a wireless link model for support of quality of service

Abstract: To facilitate the efficient support of quality of service (QoS) in next-generation wireless networks, it is essential to model a wireless channel in terms of connection-level QoS metrics such as data rate, delay, and delay-violation probability. However, the existing wireless channel models, i.e., physical-layer channel models, do not explicitly characterize a wireless channel in terms of these QoS metrics. In this paper, we propose and develop a link-layer channel model termed effective capacity (EC). In this approach, we first model a wireless link by two EC functions, namely, the probability of nonempty buffer, and the QoS exponent of a connection. Then, we propose a simple and efficient algorithm to estimate these EC functions. The physical-layer analogs of these two link-layer EC functions are the marginal distribution (e.g., Rayleigh-Ricean distribution) and the Doppler spectrum, respectively. The key advantages of the EC link-layer modeling and estimation are: 1) ease of translation into QoS guarantees, such as delay bounds; 2) simplicity of implementation; and 3) accuracy, and hence, efficiency in admission control and resource reservation. We illustrate the advantage of our approach with a set of simulation experiments, which show that the actual QoS metric is closely approximated by the QoS metric predicted by the EC link-layer model, under a wide range of conditions.

Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality

Abstract: We characterize the sum capacity of the vector Gaussian broadcast channel by showing that the existing inner bound of Marton and the existing upper bound of Sato are tight for this channel. We exploit an intimate four-way connection between the vector broadcast channel, the corresponding point-to-point channel (where the receivers can cooperate), the multiple-access channel (MAC) (where the role of transmitters and receivers are reversed), and the corresponding point-to-point channel (where the transmitters can cooperate).

Performance anomaly of 802.11b

Abstract: The performance of the IEEE 802.11b wireless local area networks is analyzed. We have observed that when some mobile hosts use a lower bit rate than the others, the performance of all hosts is considerably degraded. Such a situation is a common case in wireless local area networks in which a host far away from an access point is subject to important signal fading and interference. To cope with this problem, the host changes its modulation type, which degrades its bit rate to some lower value. Typically, 802.11b products degrade the bit rate from 11 Mb/s to 5.5, 2, or 1 Mb/s when repeated unsuccessful frame transmissions are detected. In such a case, a host transmitting for example at 1 Mb/s reduces the throughput of all other hosts transmitting at 11 Mb/s to a low value below 1 Mb/s. The basic CSMA/CA channel access method is at the root of this anomaly: it guarantees an equal long term channel access probability to all hosts. When one host captures the channel for a long time because its bit rate is low, it penalizes other hosts that use the higher rate. We analyze the anomaly theoretically by deriving simple expressions for the useful throughput, validate them by means of simulation, and compare with several performance measurements.

WLAN location determination via clustering and probability distributions

Abstract: We present a WLAN location determination technique, the Joint Clustering technique, that uses: (1) signal strength probability distributions to address the noisy wireless channel, and (2) clustering of locations to reduce the computational cost of searching the radio map. The Joint Clustering technique reduces computational cost by more than an order of magnitude, compared to the current state of the art techniques, allowing non-centralized implementation on mobile clients. Results from 802.11-equipped iPAQ implementations show that the new technique gives user location to within 7 feet with over 90% accuracy.

On beamforming with finite rate feedback in multiple-antenna systems

Abstract: We study a multiple-antenna system where the transmitter is equipped with quantized information about instantaneous channel realizations. Assuming that the transmitter uses the quantized information for beamforming, we derive a universal lower bound on the outage probability for any finite set of beamformers. The universal lower bound provides a concise characterization of the gain with each additional bit of feedback information regarding the channel. Using the bound, it is shown that finite information systems approach the perfect information case as (t-1)2/sup -B/t-1/, where B is the number of feedback bits and t is the number of transmit antennas. The geometrical bounding technique, used in the proof of the lower bound, also leads to a design criterion for good beamformers, whose outage performance approaches the lower bound. The design criterion minimizes the maximum inner product between any two beamforming vectors in the beamformer codebook, and is equivalent to the problem of designing unitary space-time codes under certain conditions. Finally, we show that good beamformers are good packings of two-dimensional subspaces in a 2t-dimensional real Grassmannian manifold with chordal distance as the metric.

Media delivery using quality of service differentiation within a media stream

Abstract: A WLAN system adapted to apply QoS differentiation to a media stream to be transmitted from a transmitting station (STA) to a receiving STA of that system. The transmitting STA processes the media stream to generate a base sub-stream and one or more enhancement sub-streams for subsequent transmission over a wireless communication channel and assigns different priorities to different sub-streams. Depending on the channel conditions, the transmitting STA may select to discard, without transmission, portions of data from enhancement sub-streams. The selection process is based on the assigned priority and operates to preserve as much of relatively high-priority data as possible. The receiving STA then processes the received data to generate a reconstructed media stream, which provides signal quality equal to or better than the signal quality supported by the base sub-stream. Advantageously, a WLAN system of the invention is adapted to change signal quality dynamically and incrementally in a manner commensurate with current channel conditions without the need for communication between the higher and lower network layers. In addition, it provides gradual and graceful degradation of signal quality when channel conditions deteriorate as opposed to abrupt degradation inherent in analogous prior art systems.

A survey of various propagation models for mobile communication

Abstract: In order to estimate the signal parameters accurately for mobile systems, it is necessary to estimate a system's propagation characteristics through a medium. Propagation analysis provides a good initial estimate of the signal characteristics. The ability to accurately predict radio-propagation behavior for wireless personal communication systems, such as cellular mobile radio, is becoming crucial to system design. Since site measurements are costly, propagation models have been developed as a suitable, low-cost, and convenient alternative. Channel modeling is required to predict path, loss and to characterize the impulse response of the propagating channel. The path loss is associated with the design of base stations, as this tells us how much a transmitter needs to radiate to service a given region. Channel characterization, on the other hand, deals with the fidelity of the received signals, and has to do with the nature of the waveform received at a receiver. The objective here is to design a suitable receiver that will receive the transmitted signal, distorted due to the multipath and dispersion effects of the channel, and that will decode the transmitted signal. An understanding of the various propagation models can actually address both problems. This paper begins with a review of the information available on the various propagation models for both indoor and outdoor environments. The existing models can be classified into two major classes: statistical models and site-specific models. The main characteristics of the radio channel - such as path loss, fading, and time-delay spread - are discussed. Currently, a third alternative, which includes many new numerical methods, is being introduced to propagation prediction. The advantages and disadvantages of some of these methods are summarized. In addition, an impulse-response characterization for the propagation path is also presented, including models for small-scale fading, Finally, it is shown that when two-way communication ports can be defined for a mobile system, it is possible to use reciprocity to focus the energy along the direction of an intended user without any explicit knowledge of the electromagnetic environment in which the system is operating, or knowledge of the spatial locations of the transmitter and the receiver.

Mobile Fading Channels

Abstract: From the Publisher: All relevant components of a mobile radio system, from digital modulation techniques over channel coding through to network aspects, are determined by the propagation characteristics of the channel. Therefore, a precise knowledge of mobile radio channels is crucial for the development, evaluation and test of current and future mobile radio communication systems. This volume deals with the modelling, analysis, and simulation of mobile fading channels and provides a fundamental understanding of many issues that are currently being investigated in the area of mobile fading channel modelling. The author strongly emphasises the detailed derivation of the presented channel models and conveys a high degree of mathematical unity to the reader. Introduces the fundamentals of stochastic and deterministic channel models Features the modelling and simulation of frequency-nonselective fading channels (Rayleigh channels, Rice channels, generalized Rice channels, Nakagami channels, various types of Suzuki channels, classical and modified Loo model) Presents the modelling and simulation of frequency-selective fading channels (WSSUS models, DGUS models, channel models according to COST 207) Discusses the methods used for the design and realization of efficient channel simulators Examines the design, realization, and analysis of fast channel simulators Includes MATLAB programs for the evaluation and simulation of mobile fading channels MATLAB is a registered trademark of The MathWorks, Inc. Telecommunication engineers, computer scientists, and physicists will all find this text both informative and instructive. It is also be an indispensable reference for postgraduate and senior undergraduate students of telecommunication and electrical engineering.

Dynamic power allocation and routing for time varying wireless networks

Abstract: We consider dynamic routing and power allocation for a wireless network with time varying channels. The network consists of power constrained nodes which transmit over wireless links with adaptive transmission rates. Packets randomly enter the system at each node and wait in output queues to be transmitted through the network to their destinations. We establish the capacity region of all rate matrices (/spl lambda//sub ij/) that the system can stably support - where (/spl lambda//sub ij/) represents the rate of traffic originating at node i and destined for node j. A joint routing and power allocation policy is developed which stabilizes the system and provides bounded average delay guarantees whenever the input rates are within this capacity region. Such performance holds for general arrival and channel state processes, even if these processes are unknown to the network controller. We then apply this control algorithm to an ad-hoc wireless network where channel variations are due to user mobility, and compare its performance with the Grossglauser-Tse (2001) relay model.

MIMO WLAN system

Abstract: A multiple-access MIMO WLAN system that employs MIMO, OFDM, and TDD. The system (1) uses a channel structure with a number of configurable transport channels, (2) supports multiple rates and transmission modes, which are configurable based on channel conditions and user terminal capabilities, (3) employs a pilot structure with several types of pilot (e.g., beacon, MIMO, steered reference, and carrier pilots) for different functions, (4) implements rate, timing, and power control loops for proper system operation, and (5) employs random access for system access by the user terminals, fast acknowledgment, and quick resource assignments. Calibration may be performed to account for differences in the frequency responses of transmit/receive chains at the access point and user terminals. The spatial processing may then be simplified by taking advantage of the reciprocal nature of the downlink and uplink and the calibration.

A robust timing and frequency synchronization for OFDM systems

Abstract: A robust symbol-timing and carrier-frequency synchronization scheme applicable to orthogonal frequency-division-multiplexing systems is presented. The proposed method is based on a training symbol specifically designed to have a steep rolloff timing metric. The proposed timing metric also provides a robust sync detection capability. Both time domain training and frequency domain (FD) training are investigated. For FD training, maintaining a low peak-to-average power ratio of the training symbol was taken into consideration. The channel estimation scheme based on the designed training symbol was also incorporated in the system in order to give both fine-timing and frequency-offset estimates. For fine frequency estimation, two approaches are presented. The first one is based on the suppression of the interference introduced in the frequency estimation process by the training symbol pattern in the context of multipath dispersive channels. The second one is based on the maximum likelihood principle and does not suffer from any interference. A new performance measure is introduced for timing estimation, which is based on the plot of signal to timing-error-induced average interference power ratio against the timing estimate shift. A simple approach for finding the optimal setting of the timing estimator is presented. Finally, the sync detection, timing estimation, frequency estimation, and bit-error-rate performance of the proposed method are presented in a multipath Rayleigh fading channel.

External channel for endoscope and endoscope device

Abstract: PROBLEM TO BE SOLVED: To provide an external channel for an endoscope and an endoscope device which prevents a hole from occurring buckling or from coming along with the occurrence of a hole due to the pushing out of a procedure tool is bypassed. SOLUTION: The external channel for the endoscope and the endoscope device has a flexible procedure insertion tubular channel 11 capable of inserting and passing the procedure tool within the same, a fixing portion for fixing the procedure tool insertion tubular channel to the insertion portion of the endoscope, and a channel reinforcing material 15 for covering around the periphery of the procedure tool insertion tubular channel. COPYRIGHT: (C)2005,JPO&NCIPI

A new simple model for land mobile satellite channels: first- and second-order statistics

Abstract: We propose a new shadowed Rice (1948) model for land mobile satellite channels. In this model, the amplitude of the line-of-sight is characterized by the Nakagami distribution. The major advantage of the model is that it leads to closed-form and mathematically-tractable expressions for the fundamental channel statistics such as the envelope probability density function, moment generating function of the instantaneous power, and the level crossing rate. The model is very convenient for analytical and numerical performance prediction of complicated narrowband and wideband land mobile satellite systems, with different types of uncoded/coded modulations, with or without diversity. Comparison of the first- and the second-order statistics of the proposed model with different sets of published channel data demonstrates the flexibility of the new model in characterizing a variety of channel conditions and propagation mechanisms over satellite links. Interestingly, the proposed model provides a similar fit to the experimental data as the well-accepted Loo's (1985) model but with significantly less computational burden.

Decentralized detection in sensor networks

Abstract: In this paper, we investigate a binary decentralized detection problem in which a network of wireless sensors provides relevant information about the state of nature to a fusion center. Each sensor transmits its data over a multiple access channel. Upon reception of the information, the fusion center attempts to accurately reconstruct the state of nature. We consider the scenario where the sensor network is constrained by the capacity of the wireless channel over which the sensors are transmitting, and we study the structure of an optimal sensor configuration. For the problem of detecting deterministic signals in additive Gaussian noise, we show that having a set of identical binary sensors is asymptotically optimal, as the number of observations per sensor goes to infinity. Thus, the gain offered by having more sensors exceeds the benefits of getting detailed information from each sensor. A thorough analysis of the Gaussian case is presented along with some extensions to other observation distributions.

A performance study of dual-hop transmissions with fixed gain relays

Abstract: The paper presents a study on the end-to-end performance of dual-hop wireless communication systems equipped with non-regenerative fixed gain relays and operating over flat Rayleigh fading channels. More specifically, it first derives generic closed-form expressions for the outage probability and the average probability of error when the relays have arbitrary fixed gains. It then proposes a specific fixed gain relay that benefits from the knowledge of the first hop's average fading power and compares its performance with previously proposed relay gains that, in contrast, require knowledge of the instantaneous channel state information of the first hop. Finally, the paper investigates the effect of the relay saturation on the performance of the systems under consideration. Numerical results show that non-regenerative systems with fixed gain relays have a comparable performance to non-regenerative systems with variable gain relays. These results also show that relay saturation of these systems results in a minimal loss in performance.

To code, or not to code: lossy source-channel communication revisited

Abstract: What makes a source-channel communication system optimal? It is shown that in order to achieve an optimal cost-distortion tradeoff, the source and the channel have to be matched in a probabilistic sense. The match (or lack of it) involves the source distribution, the distortion measure, the channel conditional distribution, and the channel input cost function. Closed-form necessary and sufficient expressions relating the above entities are given. This generalizes both the separation-based approach as well as the two well-known examples of optimal uncoded communication. The condition of probabilistic matching is extended to certain nonergodic and multiuser scenarios. This leads to a result on optimal single-source broadcast communication.

Kalman filter estimation of the number of competing terminals in an IEEE 802.11 network

Abstract: Throughput performance of the IEEE 802.11 distributed coordination function (DCF) is very sensitive to the number n of competing stations. The contribute of this paper is threefold. First, we show that n can be expressed as function of the collision probability encountered on the channel; hence, it can be estimated based on run-time measurements. Second, we show that the estimation of n, based on exponential smoothing of the measured collision probability (specifically, an ARMA filter), results to be a biased estimation, with poor performance in terms of accuracy/tracking trade-offs. Third, we propose a methodology to estimate n, based on an extended Kalman filter coupled with a change detection mechanism. This approach shows both high accuracy as well as prompt reactivity to changes in the network occupancy status. Numerical results show that, although devised in the assumption of saturated terminals, our proposed approach results effective also in non-saturated conditions, and specifically in tracking the average number of competing terminals.

A system and method for routing 802.11 data traffic across channels to increase ad-hoc network capacity

Abstract: A system and method for data transmission incorporating a channel bridge node (102-6) which can identify and deliver data traffic requiring delivery via alternate 802.11 data channels (Fig.4). The system and method provides a channel bridging node which is configured to communicate via each channel of the available spectrum in series. The node advertises this capability and accepts data traffic for communication over any number of channels. Data is buffered for subsequent delivery once the node is configured to communicate via the channel to which the data is addressed. In doing so, the system and method provides a channel bridge which enables routing of 802.11 data traffic across channels in 802.11 ad-hoc networks, thus increasing ad-hoc network capacity.

MIMO capacity with interference

Abstract: System capacity is considered for a group of interfering users employing single-user detection and multiple transmit and receive antennas for flat Rayleigh-fading channels with independent fading coefficients for each path. The focus is on the case where there is no channel state information at the transmitter, but channel state information is assumed at the receiver. It is shown that the optimum signaling is sometimes different from cases where the users do not interfere with each other. In particular, the optimum signaling will sometimes put all power into a single transmitting antenna, rather than divide power equally between independent streams from the different antennas. If the interference is either sufficiently weak or sufficiently strong, we show that either the optimum interference-free approach, which puts equal power into each antenna, or the approach that puts all power into a single antenna is optimum and we show how to find the regions where each approach is best.

Link adaptation strategy for IEEE 802.11 WLAN via received signal strength measurement

Abstract: IEEE 802.11 wireless local area network (WLAN) physical layers (PHYs) support multiple transmission rates. The PHY rate to be used for a particular frame transmission is solely determined by the transmitting station. The transmitting rate should be chosen in an adaptive manner since the wireless channel condition varies over time due to such factors as station mobility, time-varying interference, and location-dependent errors. In this paper, we present a novel link adaptation algorithm, which aims to improve the system throughput by adapting the transmission rate to the current link condition. Our algorithm is simply based on the received signal strength measured from the received frames, and hence it does not require any changes in the current IEEE 802.11 WLAN medium access control (MAC) protocol. Based on the simulation and its comparison with a numerical analysis, it is shown that the proposed algorithm closely approximates the ideal case with the perfect knowledge about the channel and receiver conditions.

Optimal training for block transmissions over doubly selective wireless fading channels

Abstract: High data rates give rise to frequency-selective propagation, whereas carrier frequency-offsets and mobility-induced Doppler shifts introduce time-selectivity in wireless links. To mitigate the resulting time- and frequency-selective (or doubly selective) channels, optimal training sequences have been designed only for special cases: pilot symbol assisted modulation (PSAM) for time-selective channels and pilot tone-assisted orthogonal frequency division multiplexing (OFDM) for frequency-selective channels. Relying on a basis expansion channel model, we design low-complexity optimal PSAM for block transmissions over doubly selective channels. The optimality in designing our PSAM parameters consists of maximizing a tight lower bound on the average channel capacity that is shown to be equivalent to the minimization of the minimum mean-square channel estimation error. Numerical results corroborate our theoretical designs.

MIMO capacity through correlated channels in the presence of correlated interferers and noise: a (not so) large N analysis

Abstract: The use of multiple-antenna arrays in both transmission and reception promises huge increases in the throughput of wireless communication systems. It is therefore important to analyze the capacities of such systems in realistic situations, which may include spatially correlated channels and correlated noise, as well as correlated interferers with known channel at the receiver. Here, we present an approach that provides analytic expressions for the statistics, i.e., the moments of the distribution, of the mutual information of multiple-antenna systems with arbitrary correlations, interferers, and noise. We assume that the channels of the signal and the interference are Gaussian with arbitrary covariance. Although this method is valid formally for large antenna numbers, it produces extremely accurate results even for arrays with as few as two or three antennas. We also develop a method to analytically optimize over the input signal covariance, which enables us to calculate analytic capacities when the transmitter has knowledge of the statistics of the channel (i.e., the channel covariance). In many cases of interest, this capacity is very close to the full closed-loop capacity, in which the transmitter has instantaneous channel knowledge. We apply this analytic approach to a number of examples and we compare our results with simulations to establish the validity of this approach. This method provides a simple tool to analyze the statistics of throughput for arrays of any size. The emphasis of this paper is on elucidating the novel mathematical methods used.

Assessing Damage of Reinforced Concrete Beam using b -value Analysis of Acoustic Emission Signals

Abstract: Concrete bridges in the United Kingdom represent a major legacy that is starting to show signs of distress. Therefore, the need for monitoring them is an urgent task. The acoustic emission ~AE! technique was proposed as a valid method for monitoring these bridges but more study is needed to develop methods of analyzing the data recorded during the monitoring. The writers would like to propose a b-value analysis as a possible way to process AE data obtained during a local monitoring. The b-value is defined as the log-linear slope of the frequency-magnitude distribution of acoustic emissions. This paper presents the results of a b-value analysis carried out on data recorded during a laboratory test on a reinforced concrete beam designed as representative of a bridge beam. During the experiment, the specimen was loaded cyclically and it was continuously monitored with an AE system. The data obtained were processed and a b-value analysis was carried out. The b-value was compared with the applied load, with a damage parameter, and with the cracks appearing on the beam. The damage parameter represents the cumulative damage in terms of total sum of acoustic emissions. The results showed a good agreement with the development of the fracture process of the concrete. From a study of the b-value calculated for a whole loading cycle and for each channel, some quantitative conclusions were also drawn. Further development work is needed to make the b-value technique suitable for practical use on a real bridge.

Linear constellation precoding for OFDM with maximum multipath diversity and coding gains

Abstract: Orthogonal frequency-division multiplexing (OFDM) converts a frequency-selective fading channel into parallel flat-fading subchannels, thereby simplifying channel equalization and symbol decoding. However, OFDM's performance suffers from the loss of multipath diversity, and the inability to guarantee symbol detectability when channel nulls occur. We introduce a linear constellation precoded OFDM for wireless transmissions over frequency-selective fading channels. Exploiting the correlation structure of subchannels and choosing system parameters properly, we first perform an optimal subcarrier grouping to divide the set of subchannels into subsets. Within each subset, a linear constellation-specific precoder is then designed to maximize both diversity and coding gains. While greatly reducing the decoding complexity and simplifying the precoder design, subcarrier grouping enables the maximum possible diversity and coding gains. In addition to reduced complexity, the proposed system guarantees symbol detectability regardless of channel nulls, and does not reduce the transmission rate. Analytic evaluation and corroborating simulations reveal its performance merits.

Downlink capacity evaluation of cellular networks with known-interference cancellation

Abstract: Recently, the capacity region of a multiple-input multiple-output (MIMO) Gaussian broadcast channel, with Gaussian codebooks and known-interference cancellation through dirty paper coding, was shown to equal the union of the capacity regions of a collection of MIMO multiple-access channels. We use this duality result to evaluate the system capacity achievable in a cellular wireless network with multiple antennas at the base station and multiple antennas at each terminal. Some fundamental properties of the rate region are exhibited and algorithms for determining the optimal weighted rate sum and the optimal covariance matrices for achieving a given rate vector on the boundary of the rate region are presented. These algorithms are then used in a simulation study to determine potential capacity enhancements to a cellular system through known-interference cancellation. We study both the circuit data scenario in which each user requires a constant data rate in every frame and the packet data scenario in which users can be assigned a variable rate in each frame so as to maximize the long-term average throughput. In the case of circuit data, the outage probability as a function of the number of active users served at a given rate is determined through simulations. For the packet data case, long-term average throughputs that can be achieved using the proportionally fair scheduling algorithm are determined. We generalize the zero-forcing beamforming technique to the multiple receive antennas case and use this as the baseline for the packet data throughput evaluation.