检索结果-内蒙古大学图书馆

The MIMO ARQ channel: Diversity-multiplexing-delay tradeoff

IEEE TRANSACTIONS ON INFORMATION THEORY 2006年第8期52卷 3601-3621页

作者： El Gamal, Hesham Caire, Giuseppe Oussama Damen, Mohamed Ohio State Univ Dept Elect & Comp Engn Columbus OH 43210 USA Eurecom Inst Mobile Commun Grp Sophia Antipolis France Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

In this paper, the fundamental performance tradeoff of the delay-limited multiple-input multiple-output (MIMO) automatic retransmission request (ARQ) channel is explored. In particular, we extend the diversity-multiplexing tradeoff investigated by Zheng and Tse in standard delay-limited MIMO channels with coherent detection to the ARQ scenario. We establish the three-dimensional tradeoff between reliability (i.e., diversity), throughput (i.e., multiplexing gain), and delay (i.e., maximum number of retransmissions). This tradeoff quantifies the ARQ diversity gain obtained by leveraging the retransmission delay to enhance the reliability for a given multiplexing gain. Interestingly, ARQ diversity appears even in long-term static channels where all the retransmissions take place in the same channel state. Furthermore, by relaxing the input power constraint allowing variable power levels in different retransmissions, we show that power control can be used to dramatically increase the diversity advantage. Our analysis reveals some important insights on the benefits of ARQ in slowfading MIMO channels. In particular, we show that 1) allowing for a sufficiently large retransmission delay results in an almost flat diversity-multiplexing tradeoff, and hence, renders operating at high multiplexing gain more advantageous;2) MIMO ARQ channels quickly approach the ergodic limit when power control is employed. Finally, we complement our information-theoretic analysis with an incremental redundancy lattice space-time (IR-LAST) coding scheme which is shown, through a random coding argument, to achieve the optimal tradeoff(s). An integral component of the optimal IR-LAST coding scheme is a list decoder, based on the minimum mean-square, error (MMSE) lattice decoding principle, for joint error detection and correction. Throughout the paper, our theoretical claims are validated by numerical results.

关键词： automatic retransmission request (ARQ) protection diversity-multiplexing tradeoff incremental redundancy coding lattice coding multiple-input multiple-output (MIMO) channels space-time coding

来源：评论

学校读者我要写书评

暂无评论

The Multiway Relay Channel

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2013年第1期59卷 51-63页

作者： Guenduez, Deniz Yener, Aylin Goldsmith, Andrea Poor, H. Vincent Univ London Imperial Coll Sci Technol & Med Dept Elect & Elect Engn London SW7 2AZ England Ctr Tecnol Telecomunicac Catalunya Castelldefels 08860 Spain Penn State Univ Dept Elect Engn University Pk PA 16802 USA Stanford Univ Dept Elect Engn Stanford CA 94305 USA Princeton Univ Dept Elect Engn Princeton NJ 08544 USA

The multiuser communication channel, in which multiple users exchange information with the help of a relay terminal, termed the multiway relay channel (mRC), is introduced. In this model, multiple interfering clusters of users communicate simultaneously, such that the users within the same cluster wish to exchange messages among themselves, i.e., each user multicasts its message to all the other users in its own cluster. It is assumed that the users cannot receive each other's signals directly. Hence, the relay terminal in this model is the enabler of communication. In particular, restricted encoders are considered, such that the encoding function of each user depends only on its own message and the received signal is used only for decoding the messages of the other users in the cluster. Achievable rate regions and an outer bound are characterized for the Gaussian mRC, and their comparison is presented in terms of the exchange rate, the symmetric rate point in the capacity region in a symmetric Gaussian mRC scenario. It is shown that the compress-and-forward (CF) protocol achieves exchange rates within a constant bit offset of the optimal exchange rate, independent of the power constraints of the terminals in the network. A finite bit gap between the exchange rates achieved by the CF and the amplify-and-forward protocols is also shown. The two special cases of the mRC, the full data exchange model, in which every user wants to receive messages of all other users, and the pairwise data exchange model which consists of multiple two-way relay channels, are investigated in detail. In particular for the pairwise data exchange model, in addition to the proposed random coding-based achievable schemes, a nested lattice coding-based scheme is also presented and is shown to achieve exchange rates within a constant bit gap of the exchange capacity.

关键词： Compress and forward (CF) joint source-channel coding lattice coding relay channel two-way relaying

来源：评论

学校读者我要写书评

暂无评论

PERFORMANCE OF lattice CODES OVER THE GAUSSIAN-CHANNEL

引用

ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS 1992年第7-8期47卷 293-305页

作者： DEOLIVEIRA, HM BATTAIL, G TELECOM PARIS ECOLE NATL SUPER TELECOMMUNDEPT COMMUNF-75634 PARIS 13FRANCE

We derive an upper bound on the error probability of lattice codes combined with Quadrature Amplitude Modulation (QAM) Over the additive white Gaussian noise channel. This bound depends on a lattice figure of merit and is readily put in exponential form by using Chernoff bound. An interesting lower bound is derived by a similar reasoning. We also examine the estimation of the average information rate based upon the continuous approximation of the average power normalized to two dimensions, and suggest to improve it by using the sphere packing idea. Examples of performance evaluation are given for a few lattices. Finally, we present upper and lower bounds on the best fundamental coding gains per dimension (due to both density and thickness) for an arbitrarily large number of dimensions. It is shown in the Appendix that, as the Ungerboeck codes, the lattice codes do not shape the signal power spectrum.

关键词： lattice coding GAUSSIAN CHANNEL ERROR PROBABILITY SIGNAL SET MULTIDIMENSIONAL SPACE QUADRATURE MODULATION

来源：评论

学校读者我要写书评

暂无评论

Optimized trellis coded vector quantization of speech coder LSF parameters

引用

ANNALS OF TELECOMMUNICATIONS 2005年第5-6期60卷 744-769页

作者： Bouzid, M Djeradi, A USTHB Fac Elect & Informat Lab Commun Parlee & Traitement Signal Algiers 16111 Algeria

Speech coders operating at low bit rates necessitate efficient encoding of the linear predictive coding (LPC) coefficients. Line spectral Frequencies (LSF) parameters are currently one of the most efficient choices of transmission parameters for the LPC coefficients. In this paper an optimized trellis coded vector quantization (TCVQ) scheme for encoding the LSF parameters is presented. When the selection of a proper distortion measure is the most important issue in the design and operation of the encoder an appropriate weighted distance measure has been used during the TCVQ construction process. We further applied the optimized TCVQ system for encoding the LSF parameters of the us Federal Standard (FS1016) 4.8 kbps speech coder. At lower bit rates, objective and subjective evaluation results show that the incorporated LSF TCVQ encoder performs better than the 34 bits/frame LSF scalar quantizer used originally in the FS1016 coder. The subjective tests reveal also that the 27 bit/frame scheme produces equivalent perceptual quality to that when the LSF parameters are unquantized.

关键词： speech coding signal quantization block quantization lattice coding optimization linear prediction spectrum line

来源：评论

学校读者我要写书评

暂无评论

On the Geometric Ergodicity of Metropolis-Hastings Algorithms for lattice Gaussian Sampling

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2018年第2期64卷 738-751页

作者： Wang, Zheng Ling, Cong Nanjing Univ Aeronaut & Astronaut Coll Elect & Informat Engn Nanjing 210000 Jiangsu Peoples R China Imperial Coll London Dept Elect & Elect Engn London SW7 2AZ England

Sampling from the lattice Gaussian distribution has emerged as an important problem in coding, decoding, and cryptography. In this paper, the classic Metropolis-Hastings (MH) algorithm in Markov chain Monte Carlo methods is adopted for lattice Gaussian sampling. Two MH-based algorithms are proposed, which overcome the limitation of Klein's algorithm. The first one, referred to as the independent Metropolis-Hastings-Klein (MHK) algorithm, establishes a Markov chain via an independent proposal distribution. We show that the Markov chain arising from this independent MHK algorithm is uniformly ergodic, namely, it converges to the stationary distribution exponentially fast regardless of the initial state. Moreover, the rate of convergence is analyzed in terms of the theta series, leading to predictable mixing time. A symmetric Metropolis-Klein algorithm is also proposed, which is proven to be geometrically ergodic.

关键词： lattice Gaussian distribution lattice coding lattice decoding MCMC methods integer least-squares problems

来源：评论

学校读者我要写书评

暂无评论

The Approximate Capacity Region of the Symmetric K-User Gaussian Interference Channel With Strong Interference

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2016年第5期62卷 2592-2621页

作者： Chaaban, Anas Sezgin, Aydin King Abdullah Univ Sci & Technol Comp Elect & Math Sci & Engn Div Thuwal 239556900 Saudi Arabia Ruhr Univ Bochum Inst Digital Commun Syst D-44780 Bochum Germany

The symmetric K-user interference channel (IC) is studied with the goal of characterizing its capacity region in the strong interference regime within a constant gap. The achievable rate region of a scheme combining rate splitting at the transmitters and interference alignment and successive decoding/computation at the receivers is derived. Next, it is shown that this scheme achieves the so-called greedy-max corner points of the capacity region within a constant gap. By combining this result with previous results by Ordentlich et al. on the sum-capacity of the symmetric IC, a constant gap characterization of the capacity region for the strong interference regime is obtained. This leads to the first approximate characterization of the capacity region of the symmetric K-user IC. Furthermore, a new scheme that achieves the sum-capacity of the channel in the strong interference regime within a constant gap is also proposed, and the corresponding gap is calculated. The advantage of the new scheme is that it leads to a characterization within a constant gap without leaving an outage set contrary to the scheme by Ordentlich et al.

关键词： Interference channel capacity region approximation strong interference interference alignment lattice coding

来源：评论

学校读者我要写书评

暂无评论

Finite Blocklength Approach and Its Security Analysis for the Dirty-Tape Channel With Noiseless/Noisy Feedback

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2024年第4期72卷 1949-1966页

作者： Xia, Dengfeng Xie, Guangfen Yang, Chuanchuan Dai, Bin Southwest Jiaotong Univ Sch Informat Sci & Technol Chengdu 610031 Peoples R China Chongqing Key Lab Mobile Commun Technol Chongqing 400065 Peoples R China Peng Cheng Lab Shenzhen 518055 Peoples R China Peking Univ Dept Elect Beijing 100871 Peoples R China Southwest Jiaotong Univ Prov Key Lab Informat Coding & Transmiss Chengdu 610031 Peoples R China

The classical Schalkwijk-Kailath (SK) scheme, which achieves the capacity of the additive white Gaussian noise (AWGN) channel with noiseless feedback, is also shown to be an excellent secure finite blocklength (FBL) coding scheme for the AWGN wiretap channel with noiseless feedback. In this paper, the dirty tape channel (AWGN channel with Gaussian state interference causally known by the transmitter) with noiseless/noisy feedback is investigated. First, SK-type feedback schemes are proposed for this model by introducing a lattice-based strategy into the classical SK scheme, and it is shown that this strategy helps to eliminate the impact of the state interference and the feedback channel noise on the performance of the SK scheme. Then, we analyze the security performance of the proposed schemes, in particular, for the dirty tape channel with noisy feedback and eavesdropper, we give a lower bound on the normalized eavesdropper's equivocation by establishing a novel inequality about the differential entropy of the Gaussian modulo-lattice function. Finally, performances of our proposed schemes are further explained by numerical examples.

关键词： Dirty tape channel feedback finite blocklength lattice coding Schalkwijk-Kailath scheme wiretap channel

来源：评论

学校读者我要写书评

暂无评论

Expanded Constellation Mapping for Enhanced Far-End-Cross-Talk Cancellation in ***

引用

IEEE COMMUNICATIONS LETTERS 2017年第1期21卷 56-59页

作者： Zhang, Rong Al Rawi, Anas F. Humphrey, Leslie Derek Hanzo, Lajos Univ Southampton Southampton SO17 1BJ Hants England BT Res & Design Adastral Pk Ipswich IP5 3RE Suffolk England

We propose the novel concept of expanded constellation mapping (ECM) for maximising the received signal power, while cancelling the far-end-cross-talk in copper-based wireline communications. The goal of ECM is to beneficially map the transmitted symbol vector to its expanded constellation set by carefully exploiting the copper channels' specific characteristics. To elaborate, ECM is comprised of the control entity and of the match entity, where the former determines how the ECM would be applied, while the latter searches for the best mapping of the transmitted symbol vector to the expanded constellation set. Our numerical results demonstrate that with the aid of the ECM, more than 25-dB power efficiency gain may be achieved over linear vectoring. Similarly, about 20-dB gain may be achieved over non-linear vectoring. From an implementation point of view, the ECM imposes minimal structural changes on ***, whilst exhibiting beneficial reconfigurability and compatibility.

关键词： DSL MIMO pre-coding lattice coding interference cancellation

来源：评论

学校读者我要写书评

暂无评论

On Distributed Compression of Linear Functions

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第1期57卷 79-94页

作者： Wagner, Aaron B. Cornell Univ Sch Elect & Comp Engn Ithaca NY 14853 USA

Distributed compression of a pair of Gaussian sources in which the goal is to reproduce a linear function of the sources at the decoder is considered. It has recently been noted that lattice codes can provide improved compression rates for this problem compared to conventional, unstructured codes. It is first shown that the state-of-the-art lattice scheme can be improved by including an additional linear binning stage. An outer bound on the rate-distortion region and a separate lower bound on the optimal sum rate are then established. The outer bound implies that for the special case of communicating the difference of two positively correlated Gaussian sources, the unimproved lattice scheme achieves within one bit of the rate region at any distortion level. The sum rate lower bound implies that unstructured codes achieve within one bit of the optimal sum rate whenever the weights of the two sources in the linear combination differ by more than a factor of two.

关键词： Distributed compression Gaussian source lattice coding lossy compression rate-distortion rate region vector quantization

来源：评论

学校读者我要写书评

暂无评论

On lattice Sequential Decoding for the Unconstrained AWGN Channel

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2013年第6期61卷 2446-2456页

作者： Abediseid, Walid Alouini, Mohamed-Slim King Abdullah Univ Sci & Technol Comp Elect & Math Sci & Engn CEMSE Div Elect Engn Program Thuwal Makkah Province Saudi Arabia

In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such a channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the lattice decoder. lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement, and the search for low complexity receivers for the detection of lattice codes is considered a challenging problem. However, the low computational complexity advantage that sequential decoding promises, makes it an alternative solution to the lattice decoder. In this work, we characterize the performance and complexity tradeoff via the error exponent and the decoding complexity, respectively, of such a decoder as a function of the decoding parameter - the bias term. For the above channel, we derive the cut-off volume-to-noise ratio that is required to achieve a good error performance with low decoding complexity.

关键词： lattice coding lattice decoding sequential decoding error exponent decoding complexity

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：