Search

This letter presents two results for multiuser wireless systems employing dirty-paper coding strategies along with greedy scheduling over the broadcast multiple-input multiple-output channel. Specifically, an efficient and suboptimal downlink scheduler is proposed to approximate the maximum sum rate using equal power allocation, and it is shown to approach the maximum sum rate of optimal power allocation for a large number of users under optimal scheduling. The second result demonstrates that the average maximum sum rate can be tightly upper bounded when spatial multiplexing is maximized. [ABSTRACT FROM AUTHOR]

We consider practical schemes for binary dirty-paper channels and broadcast channels (BCs) with two receivers and varying channel quality. With the BC application in mind, this paper proposes a new design for binary dirty paper coding (DPC). By exploiting the concept of coset binning, the complexity of the system is greatly reduced when compared to the existing works. Some design challenges of the coset binning approach are identified and addressed. The proposed binary DPC system achieves similar performance to the state-of-the-art, superposition-coding-based system while demonstrating significant advantages in terms of complexity and flexibility of system design. For binary BCs, achieving the capacity generally requires the superposition of a normal channel code and a carefully designed channel code with non-uniform bit distribution. The non-uniform bit distribution is chosen according to the channel conditions. Therefore, to achieve the capacity for binary BCs with varying channel quality, it is necessary to use quantization codes of different rates, which significantly increases the implementation complexity. In this paper, we also propose a broadcast scheme that generalizes the concept of binary DPC, which we term soft DPC. By combining soft DPC with time sharing, we achieve a large percentage of the capacity for a wide range of channel quality with little complexity overhead. Our scheme uses only one fixed pair of codes for users 1 and 2, and a single quantization code, which possesses many practical advantages over traditional time sharing and superposition coding solutions and provides strictly better performance. [ABSTRACT FROM PUBLISHER]

Recent information-theoretic results show the optimality of dirty-paper coding (DPC) in achieving the full capacity region of the Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). This paper presents a DPC based code design for BCs. We consider the case in which there is an individual rate/signal-to-interference-plus-noise ratio (SINR) constraint for each user. For a fixed transmitter power, we choose the linear transmit precoding matrix such that the SINRs at users are uniformly maximized, thus ensuring the best bit-error rate performance. We start with Cover's simplest two-user Gaussian BC and present a coding scheme that operates 1.44 dB from the boundary of the capacity region at the rate of one bit per real sample (b/s) for each user. We then extend the coding strategy to a two-user MIMO Gaussian BC with two transmit antennas at the base-station and develop the first limit-approaching code design using nested turbo codes for DPC. At the rate of 1 b/s for each user, our design operates 1.48 dB from the capacity region boundary. We also consider the performance of our scheme over a slow fading BC. For two transmit antennas, simulation results indicate a performance loss of only 1.4 dB, 1.64 dB and 1.99 dB from the theoretical limit in terms of the total transmission power for the two, three and four user case, respectively. [ABSTRACT FROM AUTHOR]

In wireless broadcast, random linear network coding (RLNC) over GF($2^{L}$) is known to asymptotically achieve the optimal completion delay with increasing $L$. However, the high decoding complexity hinders the potential applicability of RLNC schemes over large GF($2^{L}$). In this paper, a comprehensive analysis of completion delay and decoding complexity is conducted for field-based systematic RLNC schemes in wireless broadcast. In particular, we prove that the RLNC scheme over GF(2) can also asymptotically approach the optimal completion delay per packet when the packet number goes to infinity. Moreover, we introduce a new method, based on circular-shift operations, to design RLNC schemes which avoid multiplications over large GF($2^{L}$). Based on both theoretical and numerical analyses, the new RLNC schemes turn out to have a much better trade-off between completion delay and decoding complexity. In particular, numerical results demonstrate that the proposed schemes can attain average completion delay just within 5% higher than the optimal one, while the decoding complexity is only about 3 times the one of the RLNC scheme over GF(2). [ABSTRACT FROM AUTHOR]

The two-sender unicast index coding problem consists of two senders, each having a different set of messages. Some messages may be common to both the senders. Each receiver demands a unique message and has a subset of messages known as its side-information. The senders transmit coded messages by availing the knowledge of the side-information of all the receivers, such that all the receivers are able to decode their demands. The aim is to find the optimal aggregate number of coded transmissions per message length (also called the optimal broadcast rate with finite length messages), and its limiting value as the message length tends to infinity (also called the optimal broadcast rate). In this paper, only linear coding schemes are considered. Optimal linear broadcast rate for any finite message length and optimal linear broadcast rate for a basic class of the two-sender unicast index coding problem are established. Optimal code-constructions are also provided. These results are given in terms of the corresponding results of three independent single-sender sub-problems of the two-sender unicast index coding problem. Proof techniques used to obtain the results for the two-sender problem are shown to be useful in obtaining the results for some classes of the multi-sender unicast index coding problem. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surface (RIS), a recently introduced technology for future wireless communication systems, enhances the spectral and energy efficiency by intelligently adjusting the propagation conditions between base stations (BSs) and mobile equipments (MEs). An RIS consists of many low-cost passive reflecting elements that are optimized to improve the quality of the received signal. In this paper, we study the problem of power control at the BS and RIS optimization for application to physical-layer broadcasting. Our goal is to minimize the transmit power at the BS by jointly designing the transmit beamforming at the BS and the phase shifts of the passive elements at the RIS. Furthermore, to help validate the proposed optimization methods, we derive lower bounds to quantify the average transmit power at the BS as a function of the number of MEs, the number of RIS elements, and the number of antennas at the BS. The simulation results demonstrate that the average transmit power at the BS is close to the lower bound in an RIS-aided system, and is significantly lower than the average transmit power in conventional schemes without an RIS. [ABSTRACT FROM AUTHOR]

Channel Inversion, and its Minimum Mean Square Error (MMSE) variation, are low complexity methods for Space Division Multiple Access (SDMA) in Multiple Input Multiple Output Broadcast Channel (MIMO-BC). As the channel matrix deviates from orthogonal, these methods result in a waste of transmit power. This paper proposes a trellis precoding method (across time and space) to improve the power efficiency. Adopting a 4-state trellis shaping method from [1], the complexity of the proposed method, which is entirely at the transmitter side, is equivalent to the search in a trellis with 4N states where N is the number of transmit antennas. Numerical results are presented showing that the achievable gains, which depend on the channel realization, can be significantly higher than the traditional shaping gain which is limited to 1.53dB. [ABSTRACT FROM AUTHOR]

It has been shown that random beamforming using partial channel state information (CSI) achieves the same throughput scaling as obtained from dirty paper coding for a broadcast (downlink) channel with M transmit antennas and K users where K is large [1]. In this paper, we apply this scheme to wideband MIMO broadcast channels. By using OFDM, an L-tap wideband channel can be decomposed to N parallel narrowb- and channels (subcarriers), where N > L. Neighboring subcarriers are highly correlated. Therefore, we consider neighboring subcarriers as a cluster and find the closed form solution for the joint characteristic function of SINR values at two subcarriers in a cluster. We show numerically how the knowledge of the quality of the center subcarrier sheds light about the quality of other subcarriers in the same cluster, and address the issue of cluster size. In addition, through complex and asymptotic analysis, we show that for cluster size of order N/L√logR (for large K), users need only feedback the best SINR at the center subcarrier of each cluster in order for the transmitter to perform opportunistic beamforming and maintain the same throughput scaling as when full CSI is available. Using simulation results, we verify our analytical result and show that even fewer feedback can be tolerated, and larger clusters (N/2L) can be implemented for a small throughput hit. [ABSTRACT FROM AUTHOR]

This paper proposes an architecture for using multiple-input multiple-output techniques for a multimode fiber broadcast channel, allowing simultaneous transmission of unique streams to different users on the same fiber while using square-last detection. The resulting system throughput scales nearly linearly with the number of transmitters and receivers. The paper also proposes a training scheme appropriate for use with square-law detection. [ABSTRACT FROM AUTHOR]

A two-user multiple access channel is considered, in which the channels undergo slow block fading and the state of each channel is known only to its corresponding transmitter. This paper proposes a novel broadcast strategy for multiple access communication in this channel. In the broadcast approach, in principle, a transmitter with CSI uncertainty sends multiple independent superimposed information layers where the rate of each layer is adapted to a specific channel realization. In the existing broadcast approaches to multiuser communication, the transmitters often directly adopt a single-user strategy and each transmitter adapts its transmission to one unknown channel. The novel aspect of the proposed strategy is that it adapts the designed codebooks to the state of the entire network. This is motivated by the fact that the contribution of each user to the network-wide measures (e.g., capacity region) depends not only on the user’s direct channel to the receiver, but also on the qualities of other channels. Average achievable rate region and outer bounds on the capacity region are characterized. Furthermore, the expected capacity region is investigated, where most part of the capacity region boundary is characterized. Finally, an asymptotic capacity region is also characterized. [ABSTRACT FROM AUTHOR]

We obtain in this paper generic expressions in M for the exact bit-error rate of the generalized hierarchical 2/4/ . . . /M-phase-shift keyed constellations over additive white Gaussian noise (AWGN) and fading channels. For the AWGN case, these expressions are in the form of a weighted sum of Pawula F-functions and are solely dependent on the constellation size M, the carrier-to-noise ratio, and a constellation parameter which controls the relative message importance. The mathematical expressions are illustrated with some select numerical examples. [ABSTRACT FROM AUTHOR]

This paper studies the complicated interplay of the completion time (as a measure of throughput) and the decoding delay performance in instantly decodable network coded (IDNC) systems over wireless broadcast erasure channels with memory. We propose two new algorithms that enable a tradeoff for an improved balance between completion time and decoding delay of broadcasting a block of packets. We first formulate the IDNC packet selection problem that improves the balance between completion time and decoding delay as a statistical shortest path (SSP) problem. However, since finding such packet selection policy using the SSP technique is computationally complex, we employ its geometric structure to find some guidelines and use them to propose two efficient heuristic packet selection algorithms for broadcast erasure channels with a wide range of memory conditions. It is shown that each one of the two proposed algorithms is superior for a specific range of memory conditions. Furthermore, we show that the proposed algorithms achieve an improved fairness in terms of the decoding delay across all receivers. [ABSTRACT FROM PUBLISHER]

This paper proposes a new hybrid cyclic delay diversity (HCDD) scheme for multiple input multiple output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. Unlike the existing double space time transmit diversity (DSTTD) and stacked cyclic delay diversity (SCDD) schemes that are suitable for integer multiplexing rates, the proposed HCDD scheme can achieve arbitrary non-integer multiplexing rates. Our results demonstrate that the HCDD scheme can provide flexibility in selecting the required number of transmitting antennas and in adjusting diversity and multiplexing gains to match various users requirements. The advantages of the proposed HCDD, including the flexible rate assignment and less complex receivers, are presented in applications of scalable video broadcasting (SVB). [ABSTRACT FROM AUTHOR]

A Gaussian multiple-input multiple-output broadcast channel (MIMO GBC) is considered. Throughout the paper it is assumed that 1) input signals are Gaussian and 2) perfect channel state information is available at the transmitter and at the receivers. By considering each data stream as a single user, the uplink-downlink signal-to-interference-plus-noise (SINR) duality is generalized to the MIMO case with general cross-talk matrix. The duality is subsequently applied to finding the solution for the SINR-balancing problem. The result serves as a tool for characterizing achievable rate regions of different coding strategies. Next, we investigate a superposition coding scheme proposed by Cover-van der Meulen-Hajek and Pursley (nicknamed CMHP [1]), where there is a common message to both users. We consider a MIMO broadcast channel with two users, each user has two antennas and the transmitter has four antennas. Assuming one common stream is sent by CMHP coding and successive decoding, a lower bound to the CMHP rate region is found. Behaviors of the CMHP rate region and sumrate are analyzed. We find the sumrate gaps between DPC, CMHP, and MMSE at high SNR for general 2-user multiple-input single-output (MISO) Gaussian broadcast channel. The result suggests when CMHP is beneficial for sumrate. [ABSTRACT FROM AUTHOR]

Driven by applications in data-hiding, MIMO broadcast channel coding, precoding for interference cancellation, and transmitter cooperation in wireless networks, Costa coding has lately become a very active research area. In this paper, we first offer code design guidelines in terms of source-channel coding for algebraic binning. We then address practical code design based on nested lattice codes and propose nested turbo codes using turbo-like trellis-coded quantization (TCQ) for source coding and turbo trellis-coded modulation (TTCM) for channel coding. Compared to TCQ, turbo-like TCQ offers structural similarity between the source and channel coding components, leading to more efficient nesting with TTCM and better source coding performance. Due to the difference in effective dimensionality between turbo-like TCQ and TTCM, there is a performance tradeoff between these two components when they are nested together, meaning that the performance of turbo-like TCQ worsens as the TTCM code becomes stronger and vice versa. Optimization of this performance tradeoff leads to our code design that outperforms existing TCQ/TCM and TCQ/TTCM constructions and exhibits a gap of 0.94, 1.42 and 2.65 dB to the Costa capacity at 2.0, 1.0, and 0.5 bits/sample, respectively. [ABSTRACT FROM AUTHOR]

In this paper, we develop optimization techniques for linear zero-forcing (ZF) multiple-input, multiple-output (MIMO) broadcast (BC) precoders. A computationally efficient technique based on QR-update algorithms for implementing this optimization is then proposed. The application of the proposed ZF precoders and decoders to systems with both large and small numbers of users is considered. The proposed optimization technique is also shown to perform very well in conjunction with nonlinear Tomlinson- Harashima precoding. Both coded and uncoded performances are considered. [ABSTRACT FROM AUTHOR]

Necessary and sufficient conditions for Logd(N, m, p) network to be point-to-point strictly nonblocking are known. Recently, Kabacinski and Danilewicz obtained necessary and sufficient conditions for the Log2 (N, 0, p) network to be broadcast strictly nonblocking. In this paper, we give necessary and sufficient conditions for Logd(N, m, p) to be f-cast strictly nonblocking for every f, thus covering the point-to-point case (f = 1) and the broadcast case (f = N) as special cases. [ABSTRACT FROM AUTHOR]

This paper analyzes the multiuser capacity of Gaussian frequency-selective wireline multiaccess channels. Both the uplink (multiple-access channel) and downlink (broadcast channel) capacity regions are considered. The concept of balanced capacity is introduced to characterize the multiuser channel performance. Algorithms for the computation of the balanced multiuser capacity (and the associated power allocations) are proposed for an arbitrary number of users. The optimal power allocation in a K-user memoryless Gaussian channel is analyzed in detail, and an extension to intersymbol interference channels is given with various kinds of power constraints. Results are provided for a wireline access network with 20 users. [ABSTRACT FROM AUTHOR]

This paper proposes an encoding/decoding framework for achieving the optimal channel capacities of the two-user broadcast channel where each user (receiver) has the message targeted for the other user (receiver) as side information. Since the link qualities of the channels from the base station to the two users are different, their respective single-user non-broadcast channel capacities are also different. A goal is to simultaneously achieve/approach the single-user non-broadcast channel capacities of the two users with a single broadcast transmission by applying network coding. This is referred to as the rate-diverse wireless network coding problem. For this problem, this paper presents a capacity-achieving framework based on linear-structured nested lattice codes. The significance of the proposed framework, besides its theoretical optimality, is that it suggests a general design principle for linear rate-diverse wireless network coding going beyond the use of lattice codes. We refer to this design principle as the principle of virtual single-user channels. Guided by this design principle, we propose two implementations of our encoding/decoding framework using practical linear codes amenable to decoding with affordable complexities: the first implementation is based on Low Density Lattice Codes (LDLC) and the second implementation is based on Bit-interleaved Coded Modulation (BICM). These two implementations demonstrate the validity and performance advantage of our framework. [ABSTRACT FROM PUBLISHER]

In this paper, altruistic coalition formation in cooperative relay networks is studied. The communication is performed over two phases, the broadcasting phase and the cooperation phase. In the broadcasting phase, each node broadcasts its signal in its time-slot, while in the cooperation phase, all the nodes within their coalitions simultaneously relay each others' signals. A distributed merge-and-split algorithm is proposed to allow nodes to form coalitions and improve their total achievable rate. Moreover, the impact of different power allocation criteria is studied, where the sum-of-rates maximizing power allocation is shown to promote altruistic coalition formation and results in the largest coalitions among the different power allocation criteria. Finally, the proposed algorithm is compared with centralized power allocation and coalition formation, and shown to yield a good tradeoff between network sum-rate and computational complexity. [ABSTRACT FROM AUTHOR]

This paper presents an optimization framework for a wireless sensor network whereby, in a given route, the optimal relay selection and power allocation are performed subject to signal-to-noise ratio constraints. The proposed approach determines whether a direct transmission is preferred for a given configuration of nodes, or a cooperative transmission. In the latter case, for each node, data transmission to the destination node is performed in two consecutive phases: broadcasting and relaying. The proposed strategy provides the best set of relays, the optimal broadcasting power and the optimal power values for the cooperative transmission phase. Once the minimum-energy transmission policy is obtained, the optimal routes from every node to a sink node are built-up using cooperative transmission blocks. We also present a low-complexity implementation approach of the proposed framework and provide an explicit solution to the optimization problem at hand by invoking the theory of multi-parametric programming. This technique provides the optimal solution as a function of measurable parameters in an off-line manner, and hence the on-line computational tasks are reduced to finding the parameters and evaluating simple functions. The proposed efficient approach has many potential applications in real-world problems and, to the best of the authors' knowledge, it has not been applied to communication problems before. Simulations are presented to demonstrate the efficacy of the approach. [ABSTRACT FROM AUTHOR]

Local (single-hop) broadcasting is widely employed in distributed protocols (e.g., neighbor discovery, local information exchange in distributed network optimization and gossip-based algorithms) in wireless ad hoc networks. The performance of local broadcasting is characterized by the mean number of neighbors and the probability distribution of the number of neighbors of a broadcasting node. In this paper, we study the performance of local broadcasting in heterogeneous wireless ad hoc networks in which inter-system interference dominates signal reception quality, considering general fading distributions of both the desired signal and the interfering signals. In addition, we investigate the impacts of different error control techniques (e.g., simple retransmission, Chase combining, and incremental redundancy) on the performance of local broadcasting. The increase in the mean number of neighbors of a broadcasting node with respect to the number of retransmissions of a message is clarified, facilitating QoS provisioning in reliable local broadcasting in interference-limited heterogeneous wireless ad hoc networks. [ABSTRACT FROM AUTHOR]

The interference alignment (IA) is a promising technique to efficiently mitigate interference and to enhance capacity of a wireless communication network. This paper proposes an interference alignment scheme for a network with multiple cells and multiple multiple-input and multiple-output (MIMO) users under a Gaussian interference broadcast channel (IFBC) scenario. We first extend a grouping method already known in the literature to a multiple-cells scenario and jointly design transmit and receiver beamforming vectors using a closed-form expression without iterative computation. Then we propose a new approach using the principle of multiple access channel (MAC) - broadcast channel (BC) duality to perform interference alignment while maximizing capacity of users in each cell. The algorithm in its dual form is solved using interior point methods. We show that the proposed approach outperforms the extension of the grouping method in terms of capacity and basestation complexity. Finally, a rate balancing technique is introduced to maintain fairness among users. [ABSTRACT FROM PUBLISHER]

We consider the broadcasting of a scalar memoryless Gaussian source over a two-user Gaussian broadcast channel with bandwidth expansion. In concurrent with the source description, a message that should be decoded reliably just by the “higher quality” user is sent. Conditioned on the message rate, we derive a necessary condition for the achievability of a mean-squared-error distortion pair at the two receivers, which extends the Reznic–Feder–Zamir bound. This necessary condition and a sufficient condition that we derive establish the set of achievable energy-distortion exponents for this setting. [ABSTRACT FROM AUTHOR]

In an OFDM system using pilots for channel estimation, time interpolation among pilots of different OFDM symbols is commonly used to improve the estimate. The estimated channel impulse response may be also windowed to further reduce noise and disturbances. However, for a transmission over a time-varying channel, suboptimal time interpolation, implemented with a filter having only a few taps not matched to the maximum Doppler frequency, degrades channel estimation. In this paper we provide an analysis of the effects of pilot time interpolation over time-varying channels. We show in particular that suboptimal time interpolation yields aliases in the estimated channel impulse response and we derive a closed-form expression of the aliases' variance. As aliases can lead to an erroneous estimate of channel length and consequent errors in windowing, we propose a technique to detect aliases and correct the channel length estimate. Parameters of the detection techniques are optimized by an analysis that provides closed-form expressions of the false alarm and miss detection probabilities. Numerical results show the merits of the proposed techniques in a mobile transmission of the terrestrial digital video broadcasting standard (DVB-T). [ABSTRACT FROM AUTHOR]

In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links. The wireless broadcast advantage is most useful in multicast scenarios. As such, we include network coding in our design to exploit the throughput gain brought in by network coding for multicasting. We derive a subgradient algorithm for joint rate control, network coding and scheduling, which however requires centralized link scheduling. Under the primary interference model, link scheduling problem is equivalent to a maximum weighted hypergraph matching problem that is NP-complete. To solve the scheduling problem distributedly, locally greedy and randomized approximation algorithms are proposed and shown to have bounded worst-case performance. With random network coding, we obtain a fully distributed cross-layer design. Numerical results show promising throughput gain using the proposed algorithms, and surprisingly, in some cases even with less complexity than cross-layer design without broadcast advantage. [ABSTRACT FROM AUTHOR]

Smart antenna technology can greatly improve the coverage radius of wireless systems by focusing the transmitted signal (beam) toward desired users. However, beamforming has an important side effect as it creates a region, herein referred to as the complementary region, where some users in the network cannot sense the directional signals (beams). We have referred to this as the hidden beam problem in Tarokh et al.. From a physical layer perspective, beamforming reduces cochannel interference (CCI). However, in systems that use medium access-control techniques such as the carrier-sense multiple access (CSMA) protocol in wireless local area networks, during a busy period of the channel, the users in the complementary region may wrongly decide that the medium is idle and transmit packets. This may cause CCI, unnecessary retransmissions, subsequent backoff, and increased network latency. We introduced the concept of complementary beamforming (CBF) to address this issue in Throkh et al. In this paper, we propose two new methods, called "subspace complementary beamforming" (SCBF) and "complementary superposition beamforming" (CSBF). The SCBF uses dummy data to ensure a controlled level of received energy in all directions of eigenvectors unused by downlink beamforming. The technique works in multipath fading channels. The approach achieves similar results to those reported in Tarokh et al.. However, it enables the second technique (CSBF) which can also send data content in the complementary beam. This allows passive nodes in the network to receive "broadcast" information, while the active nodes are engaged in the exchange of user-specific data. It is shown that CBF effects can be achieved simply by increasing the transmit power of only one of antenna elements when space-division multiple access is not applied. Simulations are provided in order to quantify overall network performance improvements when using CBF, confirming significant throughput and delay performance enhancements. [ABSTRACT FROM AUTHOR]

This paper considers multiple-antenna broadcast channels (BCs) with multi-dimensional space-time modulation schemes, created by various allocations of signal dimensions to transmit antennas. The signal dimensions are divided into disjoint subsets, where one is shared between all users, and each of the others are assigned to different users. This model encompasses several practical single point to multi-point wireless communication systems employing multiple antennas. Assuming space and time dispersive channels, we consider the transmission rates that are achieved by applying dirty paper coding (DPC) at the transmitter, present inner and outer bounds for the DPC rate region, and study the effects of space-time modulation formats. At high SNR, we consider the limit form of these bounds, derive an achievable multiplexing gain region, and study the effects of sharing signal dimensions between users. [ABSTRACT FROM PUBLISHER]

We propose a base-station (BS) cooperation model for broadcasting a discrete memoryless source in a cellular or heterogeneous network. The model allows the receivers to use helper BSs to improve network performance, and it permits the receivers to have prior side information about the source. We establish the model's information-theoretic limits in two operational modes: In Mode 1, the helper BSs are given information about the channel codeword transmitted by the main BS, and in Mode 2 they are provided correlated side information about the source. Optimal codes for Mode 1 use hash-and-forward coding at the helper BSs; while, in Mode 2, optimal codes use source codes from Wyner's helper source-coding problem at the helper BSs. We prove the optimality of both approaches by way of a new list-decoding generalisation used in Theorem 6 of Tuncel (2006), and in doing so, show an operational duality between Modes 1 and 2. [ABSTRACT FROM PUBLISHER]

This work is focused on the system-level performance of a broadcast network. Since all transmitters in a broadcast network transmit identical signals, received signals from multiple transmitters can be combined to improve system performance. We develop a stochastic geometry-based analytical framework to derive the coverage of a typical receiver. We show that there may exist an optimal connectivity radius that maximizes the rate coverage. Our analysis includes the fact that users may have their individual content/advertisement preferences. We assume that there are multiple classes of users with each user class preferring a particular type of content/advertisements and the users will pay the network only when they can see content aligned with their interest. The operator may choose to transmit multiple contents simultaneously to cater to more users’ interests to increase its revenue. We present revenue models to study the impact of the number of contents on the operator revenue. We consider two scenarios for users’ distribution- one where users’ interest depends on their geographical location and the other where it doesn’t. With the help of numerical results and analysis, we show the impact of various parameters including content granularity, connectivity radius, and rate threshold and present important design insights. [ABSTRACT FROM AUTHOR]

This paper proposes an adaptive multi-mode transmission strategy to improve the spectral efficiency achieved in the multiple-input multiple-output (MIMO) broadcast channel with delayed and quantized channel state information. The adaptive strategy adjusts the number of active users, denoted as the transmission mode, to balance transmit array gain, spatial division multiplexing gain, and residual inter-user interference. Accurate closed-form approximations are derived for the achievable rates for different modes, which help identify the active mode that maximizes the average sum throughput for given feedback delay and channel quantization error. The proposed transmission strategy can be easily combined with round-robin scheduling to serve a large number of users. As instantaneous channel information is not exploited, the proposed algorithm cannot provide multiuser diversity gain, but it is still able to provide throughput gain over single-user MIMO at moderate signal-to-noise ratio. In addition, it has a light feedback overhead and only requires feedback of instantaneous channel state information from a small number of users. In the system with a feedback load constraint, it is shown that the proposed algorithm provides performance close to that achieved by opportunistic scheduling with instantaneous feedback from a large number of users. [ABSTRACT FROM PUBLISHER]

Spectrum sensing is one of the enabling functionalities for cognitive radio systems to operate in the spectrum white space. To protect the primary incumbent users from interference, the cognitive radio is required to detect incumbent signals at very low signal-to-noise ratio (SNR). In this paper, we study a spectrum sensing technique based on spectral correlation for detection of television (TV) broadcasting signals. The basic strategy is to correlate the periodogram of the received signal with the a priori known spectral features of the primary signal. We show that this sensing technique is asymptotically equivalent to the likelihood ratio test (LRT) at very low SNR, but with less computational complexity. That is, the spectral correlation-based detector is asymptotically optimal according to the Neyman-Pearson criterion. From the system design perspective, we analyze the effect of the spectral features on the spectrum sensing performance. Through the optimization analysis, we obtain useful insights on how to choose effective spectral features to achieve reliable sensing. Simulation results show that the proposed sensing technique can reliably detect analog and digital TV signals at SNR levels as low as -20 dB. [ABSTRACT FROM AUTHOR]

A technique for interference suppression in multicarrier code-division multiple-access (MC-CDMA) systems is proposed which exploits the structural differences in signals that arrive at the receiver with Doppler shifts or carrier offsets. Oversampling the received signal in the frequency domain and properly combining the samples provides the interference sup- pression. Frequency-domain oversampling is accomplished by using a time extension of the conventional MC-CDMA signal or unconsumed portions of the cyclic prefix. Furthermore, a receiver structure is introduced that despreads and combines groups of samples so that a linear minimum mean-squared error solution for combining the groups is easily found. This combining scheme increases the signal-to-interference ratio experienced by the desired user in the MC-CDMA system. in addition, the receiver performs well in severe near-far scenarios when then is sufficient frequency separation between the signals of the desired user and an interferer. Numerical results show that the proposed receiver significantly outperforms the conventional MC-CDMA receiver in many channel realizations. [ABSTRACT FROM AUTHOR]

We propose a wireless optical-mesh network based on optical code-division multiple-access (OCDMA) -coded free-space optical links. The performance of the proposed network under intermediate and strong turbulence channel conditions is invest gated for synchronous and asynchronous OCDMA. We show that synchronous OCDMA using complementary Walsh-Jladamard codes operating at a raw bit rate of 622 Mb/s per user can achieve a bit-error rate of io-9. This is achievable in channels with strong turbulence and high temporal correlation, or in channels with intermediate turbulence conditions; reasonable conditions based on channel characteristics inferred from the refractive index spectrum. For asynchronous OCDMA using optical orthogonal codes (OOCs), using a lower bound, we show that asynchronous OCDMA using OOCs cannot achieve acceptable performance for the same channel conditions, due to interference limitations. [ABSTRACT FROM AUTHOR]

We derive optimal and suboptimal multiuser transmit-optimization methods for a multicarrier broadcast channel with intersymbol interference under the frequency-division multiple-access (FDMA) restriction. The general FDMA-based multicarrier broadcast problem is formulated as a maximum weighted rate-sum problem. Given each user's subchannel assignment, the optimal transmit strategy is achieved by multilevel waterfilling. Unfortunately, the problem of finding the optimal subchannel assignments is combinatorial. However, by relaxing the EDMA restriction, we obtain a convex reformulation that allows for efficient computation of the optimal solution, and therefore, a characterization of the FDMA capacity region for a broadcast channel. If all users share the same transmission medium, we prove that the optimal frequency partitioning among the users has an ordered structure that can be exploited to significantly reduce the computational complexity. To make multiuser transmit-optimization schemes practical for applications with relatively fast time-varying user data-rate requirements or priorities, further reduction in computational complexity is necessary. This is achieved by restricting the energy distribution to be constant across the used subchannels. Simulations indicate the low-complexity constant-energy methods presented are very robust, and suffer from negligible performance loss. [ABSTRACT FROM AUTHOR]

Deals with a study which proposed a novel broadcasting scheme based on the vertical segmentation model for video-on-demand services. Overview of the model; Analysis and comparison; Conclusion.

This work considers a layered coding approach for efficient transmission of data over a wireless block fading channel without transmitter channel state information (CSI), which is connected to a limited capacity reliable link, known as the bottleneck channel. Two main approaches are considered, the first is an oblivious approach, where the sampled noisy observations are compressed and transmitted over the bottleneck channel without having any knowledge of the original information codebook. The second approach is a non-oblivious decode-forward (DF) relay where the sampled noisy data is decoded, and whatever is successfully decoded is reliably transmitted over the bottleneck channel. The bottleneck channel from relay to destination has a fixed capacity $C$. We examine also the case where the channel capacity can dynamically change due to variable loads on the backhaul link. The broadcast approach is analyzed for cases that only the relay knows the available capacity for next block, and for the case that neither source nor relay know the capacity per block, only its capacity distribution. Fortunately, it is possible to analytically describe in closed form expressions, the optimal continuous layering power distribution which maximizes the average achievable rate. Numerical results demonstrate the achievable broadcast rates. [ABSTRACT FROM AUTHOR]

In this paper, we consider a wireless multicast network with multiple sources, relays, and destinations. We adopt a multi-hop decode-and-forward relay protocol such that two canonical subnetworks are relevant, namely broadcast channel with receiver side information (BC-RSI) and orthogonal multiple access channel with correlated sources and receiver side information (MAC-CS-RSI). A joint network and channel coding (JNCC) strategy is proposed by exploiting ARQ, RSI, and correlated sources. The proposed JNCC strategy does not require the knowledge of RSI nor any transmit channel state information, such that each transmitter simply performs retransmissions until the intended receivers have accumulated enough mutual information to successfully decode all desired messages. This successful decoding is then conveyed from the receivers to the respective transmitters via an acknowledgement message. To measure the performance of the proposed JNCC strategy with ARQ, we derive closed-form expressions of network throughput by applying the renewal-reward theorem. Analytical results show that the proposed JNCC strategy outperforms, in terms of network throughput, the conventional separate network and channel coding strategy with random linear network coding. [ABSTRACT FROM AUTHOR]

Transmission over fading broadcast and interference channels in the presence of quality of service (QoS) constraints is studied. Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical QoS constraints, is employed as the performance metric. In the broadcast scenario, the effective capacity region achieved with superposition coding and successive interference cancellation is identified and is shown to be convex. Subsequently, optimal power control policies that achieve the boundary points of the effective capacity region are investigated, and an algorithm for the numerical computation of the optimal power adaptation schemes for the two-user case is provided. In the interference channel model, achievable throughput regions are determined for three different strategies, namely treating interference as noise, time division with power control and simultaneous decoding. It is demonstrated that as in Gaussian interference channels, simultaneous decoding expectedly performs better (i.e., supports higher arrival rates) when interfering links are strong, and treating interference as noise leads to improved performance when the interfering cross links are weak while time-division strategy should be preferred in between. When the QoS constraints become more stringent, it is observed that the sum-rates achieved by different schemes all diminish and approach each other, and time division with power control interestingly starts outperforming others over a wider range of cross-link strengths. [ABSTRACT FROM AUTHOR]

We propose an efficient application layer coding scheme suitable for time-limited wireless broadcast framework of the MBMS standards. The scheme, referred to as doped broadcast, is based on Fountain codes, and uses feedback to implement and control the tradeoff between the reconstruction delay, broadcast overhead, and decoding time/complexity. As the standardized schemes, our doped broadcast operates in two phases consisting of the limited time broadcast followed by an individualized repair phase in order to ensure (possibly prioritized) quality of service (QoS) to most users. The goal of the scheme is not to improve on any particular performance metric where highly optimized standard recommendations already perform exceptionally well, but rather to enable flexible and transparent mechanisms to implement and control tradeoff between different performance metrics. Toward this goal, we develop an analytically tractable model for doped broadcast with Ideal Soliton based codes leading to a repair strategy parameter estimation. The impact that inactivation and doping mechanisms employed by the decoder have on the complexity and overhead metrics is quantified and discussed for the proposed model. Hence, our approach guides a practical design tradeoff, which is important in today's highly heterogeneous environments requiring individualized QoS. [ABSTRACT FROM AUTHOR]

In a dynamic wireless network where a source terminal communicates with a destination, in presence of other users in the network, it is worthwhile to consider oblivious relaying strategies of a relay in close proximity to the source transmitter. The source-relay channel is assumed to be a fixed gain additive white Gaussian noise (AWGN) channel due to source-relay colocation. The source-destination and the relay-destination transmissions are subject to block flat fading dynamics. A perfect channel state information (CSI) at the respective receivers only is assumed. With the expected throughput as a performance measure, we incorporate a two-layer broadcast approach into a cooperative strategy based on the decode-and-forward scheme - Sequential Decode-and Forward (SDF). The broadcast approach splits the transmitted rate into superimposed layers, corresponding to a "bad" and a "good" channel states, allowing better adaptation to the actual channel conditions. The achievable rate expressions for the SDF strategy are derived under the broadcast approach for multiple settings including single user, multiple-input single-output (MISO) and the general relay setting using successive decoding technique, both numerically and analytically. Continuous broadcasting lower bounds are derived for the MISO and for the oblivious cooperation scenarios. [ABSTRACT FROM AUTHOR]

Multimedia Broadcast/Multicast Service (MBMS) is a bandwidth efficient broadcast scheme for multimedia communications. To support prioritized transmissions, the unequal error protection (UEP) for multi-resolution multimedia sources can be realized through MBMS. Nevertheless, the enhancement on the transmission fidelity in base layer typically sacrifices the fidelity of enhancement layers. Herein, a novel dual diversity space-time coding (DDSTC) is proposed to exploit the intrinsic UEP capability of space-time codes by utilizing a constellation mapping duo for two consecutive transmission periods in multiple-input multiple-output (MIMO) systems. As compared with Alamouti coding, the DDSTC achieves coding gains on the transmission error rates of base layer without significant degradations on the enhancement layers. At the transmission rates of base and enhancement layers equal to 2 bits per transmission, the DDSTC obtains 1.3 dB and 3.0 dB coding gains for base layer in 2 x 2 and 2 x 3 MIMO systems respectively. Besides, analytical analysis on symbol error probabilities verifies that 6 dB asymptotic coding gain is reachable in rich transmit diversity scenarios. While attaining the considerable improvements on error rates, the DDSTC avoids the high decoding complexity by adopting our proposed decoding schemes. Simulation results show that DDSTC outperforms conventional UEP schemes based on hierarchical modulations or power allocations. [ABSTRACT FROM AUTHOR]

We consider the problem of sending a bivariate Gaussian source S=(S_{1},S_{2}) across a power-limited two-user Gaussian broadcast channel. User i (i=1,2) observes the transmitted signal corrupted by Gaussian noise with power σ_i^2 and desires to estimate S_i. We study hybrid digital-analog (HDA) joint source-channel coding schemes and analyze the region of (squared-error) distortion pairs that are simultaneously achievable. Two cases are considered: 1) broadcasting with bandwidth compression, and 2) broadcasting with bandwidth expansion. We modify and adapt HDA schemes of Wilson et al. and Prabhakaran et al. , originally proposed for broadcasting a single common Gaussian source, in order to provide achievable distortion regions for broadcasting correlated Gaussian sources. For comparison, we also extend the outer bound of Soundararajan et al. from the matched source-channel bandwidth case to the bandwidth mismatch case. [ABSTRACT FROM PUBLISHER]

We consider a MIMO fading broadcast channel where the fading channel coefficients are constant over time-frequency blocks that span a coherent time x a coherence bandwidth. In closed-loop systems, channel state information at transmitter (CSIT) is acquired by the downlink training sent by the base station and an explicit feedback from each user terminal. In open-loop systems, CSIT is obtained by exploiting uplink training and channel reciprocity. We use closed-form lower bounds and tight approximations of the ergodic achievable rate in the presence of CSIT errors in order to optimize the overall system throughput, by taking explicitly into account the overhead due to channel estimation and channel state feedback. Based on three time-frequency block models inspired by actual systems, we provide useful guidelines for the overall system optimization. In particular, digital (quantized) feedback is found to offer a substantial advantage over analog (unquantized) feedback. [ABSTRACT FROM PUBLISHER]

In this letter, we propose a novel transmission scheme based on lattice precoding and pre-distorted constellation for the two-user AWGN degraded broadcast channel. In the proposed scheme, the lattice precoding is used for the weaker user to cancel the interference from the stronger user. The predistorted constellation is also proposed for the stronger user to overcome the nonlinear distortion due to the lattice precoding. Numerical results show that the achievable rate of the proposed transmission scheme is beyond the achievable rate region of the superposition coding and successive interference cancelation with finite input alphabets. [ABSTRACT FROM AUTHOR]

In this work the transmit covariance matrix optimization problem for the discrete memoryless MIMO Gaussian bidirectional broadcast channel is studied. A half-duplex relay node establishes bidirectional communication between two nodes using a decode-and-forward protocol. In the initial multiple access phase both nodes transmit their messages to the relay node. In the succeeding phase the relay broadcasts an optimal re-encoded message so that both nodes can decode the other's message using their own message as side information. The capacity region of the bidirectional broadcast channel is completely characterized by a weighted rate sum maximization problem, which can be solved by a simple iterative fixed point algorithm. If an efficient transmit covariance matrix is invariant with respect to the joint subspace spanned by the channels, then different combinations of the part transmitted on the orthogonal subspaces result in equivalent transmit strategies with different ranks. A closed-form procedure to obtain the optimal transmit covariance is derived for the case where the rank of the channels is equal to the number of antennas at the relay node and a full-rank transmission is optimal. It shows the complicated structure of the optimal eigenspace, which depends on the weights and the mean transmit power constraint. For parallel channels the optimal solution is completely characterized and discussed, which also solves the optimal power allocation problem for a single-antenna OFDM system. [ABSTRACT FROM AUTHOR]

Motivated by the necessity of having a good clock synchronization amongst the nodes of wireless ad-hoc sensor networks, the joint maximum likelihood (JML) estimator for clock phase offset and skew under exponential noise model for reference broadcast synchronization (RBS) protocol is formulated and found via a direct algorithm. The Gibbs Sampler is also proposed for joint clock phase offset and skew estimation and shown to provide superior performance relative to JML-estimator. Lower and upper bounds for the mean-square errors (MSE) of JML-estimator and Gibbs Sampler are introduced in terms of the MSE of the Uniform Minimum Variance Unbiased (UMVU) estimator and the conventional Best Linear Unbiased Estimator (BLUE), respectively. [ABSTRACT FROM AUTHOR]

A novel low-complexity and provably convergent algorithm is proposed to find the sum capacity for vector Gaussian broadcast channels. Unlike the recently proposed sum-power constraint iterative waterfilling (SPC-IWF) algorithms, it has lower complexity and requires no additional precautions to ensure the convergence. We have proved analytically the convergence with probability one, and the computer simulations show that the proposed algorithm converges faster than the earlier variants of SPC-IWF algorithms. We formulate the problem in the context of a multiple-input multiple-output orthogonal frequency-division multiplexing system and discuss the simplifications provided by the block-diagonal channel structure. [ABSTRACT FROM AUTHOR]

We consider the use of block spreading in a multi carrier system to gain diversity advantage when employed over multipath fading channels. The main idea is to split the full set of subcarriers into smaller blocks and spread the data symbols across these blocks via unitary spreading matrices in order to gain multipath diversity across each block at the receiver. We pose the problem of designing the spreading matrix as a finite dimensional optimization problem in which the asymptotic error is minimized. This formulation allows us to find explicit solutions for the optimal spreading matrices. The performance is validated for the uncoded channel as well as for the coded channel employing turbo-iterative decoding. We further demonstrate that suboptimal linear complexity equalization strategies for spread orthogonal frequency division multiplexing (OFDM) do not gain any diversity advantage over traditional diagonal OFDM. [ABSTRACT FROM AUTHOR]

Bergmans and Cover identified the capacity region of the Gaussian degraded broadcast channel, where different receivers observe the transmitted signal with different signal-to-noise ratios. This letter presents a superposition turbo-coding scheme that performs within 1 dB of the capacity region boundary of the degraded broadcast channel at a bit-error rate of 10-5. [ABSTRACT FROM AUTHOR]