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

Age of Information Analysis for Finite Blocklength Regime in Downlink Cellular Networks

IEEE WIRELESS COMMUNICATIONS LETTERS 2022年第4期11卷 683-687页

作者： Sung, Hyeonjun Kim, Minsu Lee, Sungjin Lee, Jemin Innonet Co Ltd Tech Res Ctr Seoul 05836 South Korea Daegu Gyeongbuk Inst Sci & Technol Dept Informat & Commun Engn Daegu 42988 South Korea Sungkyunkwan Univ Dept Elect & Comp Engn Suwon 16419 South Korea

With increase in real-time systems, users have come to demand information with low latency. However, as the blocklength becomes finite to reduce communication duration, the decoding error probability is newly considered. In this letter, we consider downlink cellular networks, where base stations (BSs) periodically transmit information with finite blocklength to a user. To analyze the freshness of information, we derive the average age of information (AoI) and the AoI violation probability in a closed-form using the upper bound of the average decoding error probability. Finally, we show that an optimal blocklength that minimizes the AoI exists.

关键词： decoding error probability Downlink Cellular networks Queueing analysis Indexes Upper bound Age of information AoI violation probability decoding error probability finite blocklength

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of short-packet communications with incremental relaying

引用

COMPUTER COMMUNICATIONS 2021年 177卷 51-56页

作者： Fang, Manlin Li, Dong Zhang, Han Fan, Lisheng Trigui, Imene Huizhou Univ Sch Comp Sci & Engn Huizhou Peoples R China Macau Univ Sci & Technol Fac Informat Technol Macau Peoples R China South China Normal Univ Dept Phys & Telecommun Engn Guangzhou Peoples R China Guangzhou Univ Sch Comp Sci & Educ Software Guangzhou Peoples R China Univ Quebec Montreal Dept Informat Montreal PQ Canada

In the fifth generation (5G) cellular system, short-packet communication is a key enabler to support critical applications, i.e., ultra-reliable low-latency communications (URLLCs), where finite block-length codewords are adopted. However, the short-packet communication suffers from a higher decoding error rate and has a lower transmission rate than the Shannon channel capacity. To improve both the reception reliability and the transmission efficiency, the incremental relaying (IR) is considered to improve the performance of the short-packet communication. Especially, we investigate an IR scheme for short-packet communications to reduce the transmission delay. To evaluate the system performance, closed-form expressions for the decoding error probability, the throughput and the delay are derived by considering the feedback overhead of IR. Finally, we provide simulation results to verify the accuracy of the theoretical analysis, and also compare the proposed IR scheme with the direct transmission (DT) and conventional relaying transmission (RT) schemes. Simulation results verify the effectiveness of the proposed IR scheme for the short-packet communication.

关键词： Ultra-reliable low-latency communications (URLLCs) Short-packet communications Incremental relaying (IR) decoding error probability Throughput

来源：评论

学校读者我要写书评

暂无评论

The "Nontriviality" of the Union Bound for decoding of Convolutional Codes

引用

IEEE COMMUNICATIONS LETTERS 2021年第2期25卷 446-449页

作者： Burnashev, Marat, V Russian Acad Sci Inst Informat Transmiss Problems Moscow 101447 Russia

Transmission of an infinite binary information sequence over a stationary memoryless channel is considered using a time-invariant non-catastrophic convolutional encoder and the Viterbi decoder. The conventional proofs of the "union upper bound" (and other upper bounds) for decoding performance of convolutional codes involve some mathematical inaccuracies. These proofs implicitly assume that all information symbols are necessarily decoded at some time and, moreover, that the decoded path on the trellis diagram "meets" the true path sooner or later. Although these facts look natural (at least, for a binary symmetric channel), they must be proved. The goal of this note is to substantiate these facts for a binary symmetric channel and a general stationary memoryless channel.

关键词： decoding Viterbi algorithm Convolutional codes Memoryless systems error probability Measurement Upper bound Convolutional code decoding error probability Viterbi decoder

来源：评论

学校读者我要写书评

暂无评论

On the performance of DF-based multi-hop system over α - κ - μ and α - κ - μ-extreme fading channels

引用

DIGITAL SIGNAL PROCESSING 2021年 109卷 102909-102909页

作者： Rasethuntsa, Tau Raphael Kaur, Manpreet Kumar, Sandeep Chauhan, Puspraj Singh Singh, Kuldeep Istanbul Tech Univ Math Engn Istanbul Turkey Delhi Technol Univ Dept Comp Sci & Engn Delhi India Bharat Elect Ltd Cent Res Lab Ghaziadbad Uttar Pradesh India MMM Univ Technol Dept Elect & Comm Engn Gorakhpur Uttar Pradesh India Malaviya Natl Inst Technol Dept Elect & Comm Engn Jaipur Rajasthan India

Several emerging application scenarios for the multi-hop wireless networking have been introduced in 5G and beyond networks, to provide ultra-low latency and much higher data rate to the end users. In this work, an integrated performance evaluation of a decode-and-forward (DF) multi-hop wireless communication system is undertaken over the non-linear generalized alpha - kappa - mu and alpha - kappa - mu-Extreme fading models. Novel closed-form expressions for the amount of fading (AoF), channel capacity under various adaptive transmission techniques are derived. Additionally, decoding error probability for short packet communication is derived and analyzed. The provided expressions are very useful in designing the channel/link quality for practical multi-hop communication networks. The effects of the fading parameters and the number of hops on the system performance are demonstrated. The correctness of the proposed solutions has been corroborated by comparing them with Monte Carlo simulation results. (C) 2020 Elsevier Inc. All rights reserved.

关键词： DF relaying Ergodic capacity Marcum Q-function Nuttall Q-function decoding error probability

来源：评论

学校读者我要写书评

暂无评论

Performance of ternary double circulant, double twistulant, and self-dual codes

引用

APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING 2017年第5期28卷 409-424页

作者： Gulliver, T. Aaron Harada, Masaaki Univ Victoria Dept Elect & Comp Engn STN CSC POB 1700 Victoria BC V8W 2Y2 Canada Tohoku Univ Grad Sch Informat Sci Res Ctr Pure & Appl Math Sendai Miyagi 9808579 Japan

We study the performance of ternary isodual codes which are not self-dual and ternary self-dual codes, as measured by the decoding error probability with bounded distance decoding. We compare the performance of ternary double circulant and double twistulant codes which are not self-dual with ternary extremal self-dual codes. We also investigate the performance of ternary self-dual codes having large minimum weights.

关键词： Double circulant code Double twistulant code Self-dual code decoding error probability

来源：评论

学校读者我要写书评

暂无评论

decoding error of Sudoku for Erasure Channels

Decoding Error of Sudoku for Erasure Channels

引用

39th Symposium on Information Theory and Its Applications (SITA)

作者： Nishiara, Mikihiko Hidai, Ryo Shinshu Univ Grad Sch Sci & Technol Nagano 3808553 Japan

Sudoku is a pencil puzzle. The aim of the solver is to complete the 9 x 9 grid by filling in a digit in every cell according to a certain rule. In this study, we regard the process of solving Sudoku as a process of decoding a codeword from a receivedword, and show the expected decoding error probability for erasure channels obtained by experiments.

关键词： Sudoku erasure channels decoding error probability

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of random angle based quantization modulation

引用

AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS 2014年第8期68卷 737-746页

作者： Zhu, Xinshan Gao, Xianwen Ding, Jie Peng, Xujun Dong, Honghui Tianjin Univ Sch Elect Engn & Automat Tianjin 300072 Peoples R China Yangzhou Univ Sch Informat Engn Yangzhou Peoples R China Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Peoples R China Raytheon BBN Technol Cambridge MA USA Beijing Jiaotong Univ State Key Lab Rail Traff Control & Safety Beijing 100044 Peoples R China

The random angle based quantization modulation (RAQM) is a new watermarking method invariant to valumetric scaling attack. In this paper, the performance of RAQM is theoretically evaluated in two aspects: the embedding distortion and the decoding performance against additive noise attack. The analyses are developed under the assumptions that the host and noise vectors are mutually independent and both of them have independently and identically distributed components. We establish the stochastic models for several concerned signals. Based on them, the expressions of the embedding distortion and the decoding bit-error probability are derived in closed form. We also present the simplified but effective approximations to these analytical results. The analyses allow us to get more insight into the impact of various factors on the performance of RAQM. Numerical simulations confirm the validity of our analyses and exhibit the performance advantage of RAQM over similar modulation techniques. (C) 2014 Elsevier GmbH. All rights reserved.

关键词： Quantization watermarking Spread transform Additive noise Valumetric scaling decoding error probability

来源：评论

学校读者我要写书评

暂无评论

Normalized Correlation-Based Quantization Modulation for Robust Watermarking

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2014年第7期16卷 1888-1904页

作者： Zhu, Xinshan Ding, Jie Dong, Honghui Hu, Kongfa Zhang, Xiaobin Tianjin Univ Sch Elect Engn & Automat Tianjin 300072 Peoples R China Yangzhou Univ Sch Informat Engn Yangzhou 225127 Peoples R China Beijing Jiaotong Univ State Key Lab Rail Traff Control & Safety Beijing 100044 Peoples R China Nanjing Univ Chinese Med Sch Informat Technol Nanjing 210023 Jiangsu Peoples R China

A novel quantization watermarking method is presented in this paper, which is developed following the established feature modulation watermarking model. In this method, a feature signal is obtained by computing the normalized correlation (NC) between the host signal and a random signal. Information modulation is carried out on the generated NC by selecting a codeword from the codebook associated with the embedded information. In a simple case, the structured codebooks are designed using uniform quantizers for modulation. The watermarked signal is produced to provide the modulated NC in the sense of minimizing the embedding distortion. The performance of the NC-based quantization modulation (NCQM) is analytically investigated, in terms of the embedding distortion and the decoding error probability in the presence of valumetric scaling and additive noise attacks. Numerical simulations on artificial signals confirm the validity of our analyses and exhibit the performance advantage of NCQM over other modulation techniques. The proposed method is also simulated on real images by using the wavelet-based implementations, where the host signal is constructed by the detail coefficients of wavelet decomposition at the third level and transformed into the NC feature signal for the information modulation. Experimental results show that the proposed NCQM not only achieves the improved watermark imperceptibility and a higher embedding capacity in high-noise regimes, but also is more robust to a wide range of attacks, e. g., valumetric scaling, Gaussian filtering, additive noise, Gamma correction, and Gray-level transformations, as compared with the state-of-the-art watermarking methods.

关键词： decoding error probability normalized correlation quantization watermarking spread transform valumetric scaling

来源：评论

学校读者我要写书评

暂无评论

Lattice Network Codes Based on Eisenstein Integers

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2013年第7期61卷 2713-2725页

作者： Sun, Qifu Tyler Yuan, Jinhong Huang, Tao Shum, Kenneth W. Chinese Univ Hong Kong Shenzhen Res Inst Inst Network Coding Shenzhen Hong Kong Hong Kong Peoples R China Univ New S Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia Chinese Univ Hong Kong Inst Network Coding Hong Kong Hong Kong Peoples R China

In this paper, we investigate lattice network codes (LNCs) constructed from Eisenstein integer based lattices. Quantization and encoding algorithms over Eisenstein integers are first introduced. Then, a union bound estimation (UBE) of the decoding error probability is derived when the shaping region of the LNC is a product of regular hexagons. Next, the Gaussian reduction algorithm is generalized to be applicable to complex lattices over Eisenstein integers such that an optimal coefficient vector can be found in the two-transmitter single-relay system. Based on the UBE, design criteria for optimal LNCs with minimum decoding error probability are formulated and applied to construct both Gaussian integer and Eisenstein integer based good LNCs from rate-1/2 feed-forward convolutional codes by Complex Construction A. The constructed codes provide up to 7.65 dB nominal coding gains over Rayleigh fading channels. Furthermore, we introduce the construction of LNCs from linear codes by Complex Construction B. The nominal coding gains and error performance of the LNCs thus constructed are explicitly analyzed. Examples show that the LNCs constructed by Complex Construction B provide a better tradeoff between code rate and nominal coding gain.

关键词： Compute-and-forward lattice network codes decoding error probability Gaussian reduction for complex lattices complex Construction B

来源：评论

学校读者我要写书评

暂无评论

Throughput analysis of buffer-constrained wireless systems in the finite blocklength regime

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2013年第1期2013卷 1页

作者： Gursoy, M. Cenk Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY 13244 USA

In this paper, a single point-to-point wireless link operating under queueing constraints in the form of limitations on the buffer violation probabilities is considered. The achievable throughput under such constraints is captured by the effective capacity formulation. It is assumed that finite blocklength codes are employed for transmission. Under this assumption, a recent result on the channel coding rate in the finite blocklength regime is incorporated into the analysis, and the throughput achieved with such codes in the presence of queueing constraints and decoding errors is identified. The performance of different transmission strategies (e. g., variable-rate, variable-power, and fixed-rate transmissions) is studied. Interactions and tradeoffs between the throughput, queueing constraints, coding blocklength, decoding error probabilities, and signal-to-noise ratio are investigated, and several conclusions with important practical implications are drawn.

关键词： Buffer violation probability Coding rate decoding error probability Effective capacity Fading channels Finite blocklength regime Quality of service constraints Variable-rate/variable-power/fixed-rate transmissions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：