The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we utilize the knowledge of frame type and structure combined with multimode precoded MIMO transmission scheme for video stream, in order to achieve a better tradeoff of physicl layer performance (eg., SER) and the transmission delay via a proposed two-stage selection algorithms. The algorithm adaptively selects the optimal transmission mode (DIV or MUX) and the corresponding precoder...
This paper considers the problem of communication in the context of strategic information transfer (SIT) concept of Crawford and Sobel in economics. SIT is different from the conventional communication paradigms since it involves different objectives for the encoder and the decoder, which are aware of this mismatch and act accordingly. This leads to a game whose equilibrium solutions are studied here...
In this paper, we present a zero-forcing (ZF) attack on the physical layer cryptography scheme based on massive multiple-input multiple-output (MIMO). The scheme uses singular value decomposition (SVD) precoder. We show that the eavesdropper can decrypt/decode the information data under the same condition as the legitimate receiver. We then study the advantage for decoding by the legitimate user over...
We propose two coding schemes for discrete memoryless multicast networks with rate-limited feedback from receivers and relays to the transmitter. The coding schemes are based on block Markov coding, joint backward decoding and hybrid relaying strategy. In each block, the receivers and relays compress their outputs and send the compression indices to the transmitter through the feedback links. In the...
In this work, we consider a K-user Gaussian wiretap multiple-access channel (GW-MAC) in which each transmitter has an independent confidential message for the receiver. There is also an external eavesdropper who intercepts the communications. The goal is to transmit the messages reliably while keeping them confidential from the eavesdropper. To accomplish this goal, two different approaches have been...
Most coding schemes, proposed for the interference channel, take advantage of joint decoding to achieve a larger rate region. However, joint decoding significantly increases decoding complexity. This paper investigates the achievable sum-rate of the two-user Gaussian interference channel when successive decoding is employed instead of joint decoding. First, this study proves that when interference...
Coding scheme for discrete memoryless multicast networks with rate-limited feedback from the receivers and relays to the transmitter is proposed. The coding scheme is based on block-Markov coding, joint backward decoding and hybrid relaying strategy. In each block, the relays use partial decode-forward strategy to decode part of the source message. Meanwhile, the receivers and relays use compress-forward...
In this paper, we show that for the two-user Gaussian broadcast channel with correlated noises and perfect feedback the largest region that can be achieved by linear-feedback schemes equals the largest region that can be achieved over a dual multi-access channel when in this latter the channel inputs are subject to a “non-standard” sum-power constraint that depends on the BC-noise correlation. Combining...
This paper presents a simple but effective scheduling scheme for sphere decoding (SD) with runtime constraints in multiple-input multiple-output communication systems. The proposed scheme imposes runtime constraints on SD to distribute the errors due to the early termination of SD. Because the distributed errors may be corrected effectively by forward error correction, the error-rate performance can...
The multiple-access relay channel (MARC) and its Gaussian version are important models in cellular, ad hoc communication systems, and sensor networks and also, this channel is a comprehensive model which consist of two important channels: Relay Channel (RC) and Multiple Access Channel (MAC). In this paper, we study and analyse the two-user state-dependent discrete and memoryless MARC in which the...
This paper presents an implementation technique for the 40Gbps Ethernet Physical Coding Sublayer (PCS). The functionality of the 40Gbps Ethernet PCS is specified in the IEEE 802.3ba standard's clause 82. The paper also presents a scheme of verification of this implementation using an FPGA setup.
We introduce an interlaced space-time transmission scheme for multiple antenna links, that can compensate the spectral efficiency loss due to the radio channel variations and the associated channel estimation errors. The solution is constructed using multi-coding such that the transmitter interlaces space-time encoded blocks of different codewords belonging to potentially variable-rate codebooks in...
The broadcast channel with independent secret keys is studied. In this scenario, a common message has to be securely broadcast to two legitimate receivers in the presence of an eavesdropper. The transmitter shares with each legitimate receiver an independent secret key of arbitrary rate. These keys can either be used as one-time pads to encrypt the common message or can be interpreted as fictitious...
Optimal signaling is studied over a power-limited Gaussian channel with intermittent feedback, where a random mechanism—whose outcome is unknown to the receiver—determines whether or not the output symbol is fed back to the encoder. If the output symbols are fed back with probability smaller than one half, then even the two-messages error probability cannot decay faster than exponentially in the blocklength...
In this work, we consider an interference channel model in which K receivers cooperatively attempt to decode their intended messages locally by processing and sharing information through limited capacity backhaul links. In contrast to distributed antenna architectures that have been proposed in the literature, where data processing is utterly performed in a centralized fashion, the model considered...
In a recently proposed asynchronous communication setup, the receiver observes mostly pure background noise except for a brief and a priori unknown period of time when data is transmitted. Capacity per unit cost and minimum communication delay were characterized and shown to be unaffected by a sparse sampling at the receiver as long as the number of samples represents a constant fraction of the total...
This paper investigates the minimum energy required to transmit, with a given reliability, k information bits over a stationary memoryless Rayleigh-fading channel, under the assumption that neither the transmitter nor the receiver have a priori channel state information (CSI). It is well known that the ratio between the minimum energy per bit and the noise level converges to −1.59 dB as k goes to...
We consider the compute-and-forward relay network with limited feedback. A novel scheme called adaptive compute-and-forward is proposed to exploit the channel knowledge by working with the best ring of imaginary quadratic integers. This is enabled by generalizing Construction A lattices to other rings of imaginary quadratic integers which may not form principal ideal domains and by showing such construction...
The sum-rate capacity and partial capacity boundary of the parallel Gaussian Z interference channels are shown to be achieved by decoding part of the interference and treating the remaining interference as noise if a certain condition is satisfied.
The coherence time of a wireless channel is often smaller than the delay with which channel state information is available at transmitters. In this paper, we aim to find the most important subset of the channel state information that transmitters need to learn with delay. We characterize the capacity region of the two-user interference channel with local delayed channel state information at transmitters...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.