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

Cooperative multilevel dynamic space-time trellis coding scheme for improved system performance

IET COMMUNICATIONS 2016年第4期10卷 416-424页

作者： Aneja, Sakshi Sharma, Sanjay Thapar Univ Dept Elect & Commun Engn Patiala 147004 Punjab India

This study proposes a system that employs multilevel coding scheme with dynamic space-time trellis codes (DSTTCs) as component codes in order to cooperatively transmit the information of mobile nodes to a common destination node. Perfect channel state information is available at both transmitter and receiver. Every mobile node has a DSTTC encoder at each information level, which receives feedback information from destination node and adapts to the current channel conditions by modifying its code set of generator sequences. The feedback information is in the form of an index of predefined channel profile with power gain in close proximity to the power gain of current channel profile at destination node. The proposed cooperative multilevel dynamic space-time trellis coding (CMLDSTTC) system has the potential of improving spectral efficiency, system throughput, diversity gain, coding gain with low decoding complexity. The CMLDSTTC system outperforms cooperative multilevel space-time trellis coding (CMLSTTC) system with predefined space-time trellis codes and non-cooperative multilevel dynamic space-time trellis coding system by similar to 5 and similar to 2.5 dB, respectively, at frame error rate of 10(-2) using two transmit and two receive antennas. The performance of CMLDSTTC system improves further with an increase in the bits of feedback information.

关键词： cooperative communication mobile radio radio transmitters radio receivers transmitting antennas receiving antennas space-time codes trellis codes wireless channels cooperative multilevel dynamic space-time trellis coding scheme channel state information mobile transmitter node mobile receiver node destination node CMLDSTTC system low decoding complexity transmit antenna receive antenna

来源：评论

学校读者我要写书评

暂无评论

LDPC decoding with locally informed dynamic scheduling based on the law of large numbers

引用

IET COMMUNICATIONS 2022年第6期16卷 634-648页

作者： Liang, Shuo Xie, Suipeng Liu, Xingcheng Wang, Zhongfeng Sun Yat Sen Univ Sch Elect & Informat Technol SEIT Guangzhou Peoples R China Guangzhou Xinhuo Univ Sch Informat Sci Guangzhou Peoples R China Southern Marine Sci & Engn Guangdong Lab Zhuhai Innovat Team Estuary Coast & Isl Reef Engn Zhuhai Peoples R China Nanjing Univ Sch Elect Sci & Engn Nanjing Peoples R China

The informed dynamic scheduling (IDS) strategies, in which the edge message with the maximum message-residual is updated preferentially, achieve remarkable error-correction performance when applied to low-density parity-check (LDPC) codes. However, the IDS strategies incur inferior convergence in iterative decoding owing to the greedy problem, which is called the update-relayed trend here. In order to solve the greediness, two locally informed dynamic scheduling algorithms based on the law of large numbers are proposed. The proposed decoding algorithms use random select of check nodes over a predefined update range (RSPUR) which effectively suppresses the propagation of the update-relayed trend and accordingly restrains the forming of multi-update cycles. Moreover, the decoding algorithm is further improved based on random select of check nodes over an adjustable update range (RSCAR). The update ranges are selected based on the law of large numbers. Therefore, the computational resources can be allocated more equitably by increasing iterations. Simulation results show that both the proposed algorithms achieve excellent performance in terms of throughput and convergence with low decoding complexity over the Additive White Gaussian Noise (AWGN) and the fading channels compared to the previous IDS strategies. Hence, the proposed algorithms behave excellently over the wireless channels.

关键词： maximum message residual error correction performance multiupdate cycles fading channels LDPC inferior convergence wireless channels check nodes AWGN channels low density parity check codes edge message telecommunication scheduling low decoding complexity IDS strategies informed dynamic scheduling strategies adjustable update range parity check codes predefined update range iterative decoding channel coding greedy problem locally informed dynamic scheduling algorithms iterative decoding owing decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

A low complexity Decoder for Quasi-Orthogonal Space Time Block Codes

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2011年第3期10卷 988-994页

作者： Alabed, Samer J. Paredes, Javier M. Gershman, Alex B. Tech Univ Darmstadt Commun Syst Grp D-64283 Darmstadt Germany

In this paper, a low-complexity suboptimal decoder for coherent and non-coherent quasi-orthogonal space time block codes with three and four transmit antennas is proposed. Our decoder enjoys a nearly linear complexity and approximately the same performance as the optimal maximum-likelihood (ML) decoder. Simulations show the advantages of the proposed decoder with respect to several other popular approaches to the coherent and non-coherent decoding.

关键词： Multiple-input multiple-output (MIMO) systems quasi-orthogonal space time block codes differential space-time coding (DSTC) low decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Constructions of Irregular Nonbinary QC-LDPC Codes:Cyclotomic Coset Approach

Constructions of Irregular Nonbinary QC-LDPC Codes:Cyclotomi...

引用

2012 IEEE 11th International Conference on Signal Processing(ICSP 2012)

作者： Meng Lu Lijun Zhang School of Electronic and Information Engineering Beijing Jiaotong University

ISBN: (纸本)9781467321969

A cyclotomic coset approach for constructions of irregular nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes of short length is proposed. QC-LDPC codes obtained by this method perform reasonably well over the additive white Gaussian noise (AWGN) channel with iterative decoding in terms of bit-error performance, error-floor, and decoding convergence with low decoding complexity.

关键词： cyclotomic coset nonbinary LDPC codes quasi-cyclic low decoding complexity

来源：评论

学校读者我要写书评

暂无评论

low complexity Phase-based Interpolation for side information generation for Wyner-Ziv coding at DVC decoder 12

Low complexity Phase-based Interpolation for side informatio...

引用

12th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)

作者： Khursheed, Shahzad Jeoti, Varun Badruddin, Nasreen Hashmani, Manzoor Ahmed Univ Teknol PETRONAS Dept Elect & Elect Engn Seri Iskandar Perak Malaysia Univ Teknol PETRONAS Dept Comp & Informat Sci Seri Iskandar Perak Malaysia

ISBN: (纸本)9781728167435

In distributed video coding (DVC), the decoder has considerably high computational complexity as compared to the encoder. The side information plays a crucial role in the successful reconstruction of the Wyner-Ziv frame. However, the side information generation process puts a substantial decoding delay due to its high computational complexity. Phase-Based Interpolation (PBI) is introduced in this work for side information generation. The simulated results on different test videos show that the PBI computational complexity remains low for all kinds of videos. It performs 2.5 to 2.7 times faster than motion-compensated temporal Interpolation (MCTI) with an average acceptable loss of 4.5-5.1 dB in PSNR and 0.09-0.11 dB in SSIM while preserving the structure and sharpness in interpolated frames.

关键词： low complex side information generation algorithm low decoding complexity side information generation DVC Wyner-Ziv Coding real-time side information generation

来源：评论

学校读者我要写书评

暂无评论

Multi-Level Rate-Splitting for Synchronous and Asynchronous Interference Channels

Multi-Level Rate-Splitting for Synchronous and Asynchronous ...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Yagi, Hideki Poor, H. Vincent Univ Electrocommun Ctr Frontier Sci Chofu Tokyo 1828585 Japan

ISBN: (纸本)9781457705953

Rate-splitting, in which rates are split into smaller rates and successive decoding is used, has been developed for memoryless multiple access channels (MACs). This scheme realizes any rate in the capacity region of a MAC with decoding complexity proportional to that for single-user codes, even when time-sharing cannot be used. This paper proposes rate-splitting schemes for multiple-receiver channels, such as compound MACs and interference channels. For interference channels, rate-splitting can achieve any rate in the celebrated Han-Kobayashi rate region with low decoding complexity. Rate-splitting is particularly effective in the frame-asynchronous case, and an achievable rate region for the asynchronous IC is given.

关键词： complexity theory decoding Encoding Han-Kobayashi rate region Integrated circuits Interference channels Joints Receivers asynchronous interference channel capacity region decoding low decoding complexity memoryless multiple access channel multilevel rate-splitting multiple-receiver channels radio receivers radiofrequency interference single-user code successive decoding wireless channels

来源：评论

学校读者我要写书评

暂无评论

PARTITION-LEVEL ADAPTIVE INTERPOLATION FILTER FOR VIDEO CODING

PARTITION-LEVEL ADAPTIVE INTERPOLATION FILTER FOR VIDEO CODI...

引用

IEEE International Conference on Multimedia and Expo

作者： Wang, Ronggang Zhang, Yongbing Dong, Yuan Wang, Haila France Telecom R&D Beijing Co Ltd Beijing 100080 Peoples R China Harbin Inst Technol Dept Comp Sci & Technol Harbin 150001 Heilongjiang Peoples R China

ISBN: (纸本)9781424442904

A partition-level adaptive sub-pixel interpolation filter method for video coding is proposed in this paper. Various type of interpolation filters are exploited to compensate the limited motion accuracy represented by motion vector or improve interpolation performance of directional textures inconsistent with motion direction, an optimal filter is selected as sub-pixel interpolation filter for each macroblock partition by the principle of Rate Distortion Optimization. The method is implemented in AVS reference software, experimental results show that by utilizing this method, the compression performance is improved up to 0.5dB, and the decoding complexity of motion compensation is decreased up to 20%.

关键词： adaptive interpolation filter motion compensation video coding low decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Lattice Sequential decoding: Achievable Rates and Diversity-Multiplexing Tradeoff

Lattice Sequential Decoding: Achievable Rates and Diversity-...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Abediseid, Walid Damen, Mohamed Oussama Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9781424456383

In this paper, the performance limit of lattice sequential decoder for coded M x N MIMO channel is analysed. We determine the rates achievable by lattice coding and sequential decoding applied to such channel. The diversity-multiplexing trade-off under lattice sequential decoding is derived as a function of its parameter-the bias term. Such parameter is critical for controlling the amount of computations required at the decoding stage. Achieving low decoding complexity requires increasing the value of the bias term. However, this is done at the expense of losing the optimal trade-off of the channel. We show how such decoder can bridge the gap between lattice decoder and low complexity decoders [e. g., minimum mean-square error successive interference cancellation (MMSE-SIC)]. We argue that, MMSE-SIC may achieve close to the maximum diversity gain of the channel MN at very low multiplexing gain.

关键词： MIMO communication coded MIMO channel computational complexity decoding diversity-multiplexing tradeoff interference suppression lattice sequential decoding least mean squares methods low decoding complexity minimum mean-square error successive interferen

来源：评论

学校读者我要写书评

暂无评论

On the decoding and optimizing performance of four-group decodable space-time block codes

On the decoding and optimizing performance of four-group dec...

引用

1st International Conference on Communications and Electronics (ICCE 2006)

作者： Dao, Dung Ngoc Tellambura, Chintha Yuen, Chau Tjhung, Tjeng Thiang Guan, Yong Liang Univ Alberta ECE Dept Edmonton AB Canada Wireless Comms Inst Infocomm Res Singapore Singapore Nanyang Technol Univ Sch EEE Singapore 639798 Singapore

ISBN: (纸本)9781424405688

A class of rate-one space-time block codes (STBC) allowing the decoding of transmitted symbols into four groups is recently proposed by Yuen, Guan and Tjhung. This code is called four-group decodable STBC (4Gp-STBC). In this paper, the equivalent channel of 4Gp-STBC is derived and a new method to decode 4Gp-STBC based on sphere decoders is presented. Furthermore, the performance of 4Gp-STBC is analyzed. A New signal rotation method is proposed, which performs better than the existing one.

关键词： space-time block codes quasi-orthogonal performance analysis low decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Spatial domain entertainment audio decompression/compression

Spatial domain entertainment audio decompression/compression

引用

Conference on Mobile Devices and Multimedia - Enabling Technologies, Algorithms, and Applications

作者： Chan, Y. K. Him, Kevin Tam Ka City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China Univ Hong Kong Dept Mech Engn Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9780819499479

The ARM7 NEON processor with 128bit SIMD hardware accelerator requires a peak performance of 13.99 Mega Cycles per Second for MP3 stereo entertainment quality decoding. For similar compression bit rate, OGG and AAC is preferred over MP3. The Patent Cooperation Treaty Application dated 28/August/2012 describes an audio decompression scheme producing a sequence of interleaving "min to Max" and "Max to min" rising and falling segments. The number of interior audio samples bound by "min to Max" or "Max to min" can be {0|1| ... |N} audio samples. The magnitudes of samples, including the bounding min and Max, are distributed as normalized constants within the 0 and 1 of the bounding magnitudes. The decompressed audio is then a "sequence of static segments" on a frame by frame basis. Some of these frames needed to be post processed to elevate high frequency. The post processing is compression efficiency neutral and the additional decoding complexity is only a small fraction of the overall decoding complexity without the need of extra hardware. Compression efficiency can be speculated as very high as source audio had been decimated and converted to a set of data with only "segment length and corresponding segment magnitude" attributes. The PCT describes how these two attributes are efficiently coded by the PCT innovative coding scheme. The PCT decoding efficiency is obviously very high and decoding latency is basically zero. Both hardware requirement and run time is at least an order of magnitude better than MP3 variants. The side benefit is ultra low power consumption on mobile device. The acid test on how such a simplistic waveform representation can indeed reproduce authentic decompressed quality is benchmarked versus OGG(aoTuv Beta 6.03) by three pair of stereo audio frames and one broadcast like voice audio frame with each frame consisting 2,028 samples at 44,100KHz sampling frequency.

关键词： audio decompression high audio quality high compression efficiency low decoding complexity low hardware complexity ultra low power consumption zero decoding latency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：