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

Enabling Large Scale LoRa parallel decoding With High-Dimensional and High-Accuracy Features

IEEE TRANSACTIONS ON MOBILE COMPUTING 2025年第5期24卷 3520-3536页

作者： Chen, Weiwei Xia, Xianjin Wang, Shuai He, Tian Wang, Shuai Liu, Gang Huang, Caishi Shanghai Univ Sch Comp Engn & Sci Shanghai 200444 Peoples R China Hong Kong Polytech Univ Dept Comp Sci Hong Kong Peoples R China Southeast Univ Sch Comp Sci & Engn Nanjing 211102 Peoples R China Univ Elect Sci & Technol China Shenzhen Inst Adv Study Chengdu 610056 Sichuan Peoples R China Univ Macau Dept Biomed Sci Macau 999078 Peoples R China

LoRaWAN is a prominent technology for Low Power Wide Area Networks (LPWAN). However, the increasing network size has introduced a significant challenge: packet collisions resulting from concurrent transmissions in LoRaWAN. Previous studies either overlooked the issue by examining limited features or tackled it with intricate receivers employing up to eight antennas. To achieve a more favorable balance between implementation cost and system performance, we introduceHi(2)LoRa-a solution utilizing highly dimensional and accurate features for LoRa concurrent decoding, implemented with only two receiving antennas. The feature dimensions are expanded through an exploration of various hardware imperfections and inherent channel state information specific to each transceiver pair. To enhance feature accuracy, low pass filters and BiLSTM networks are applied to capture and learn their temporal patterns. Additionally, an efficient collision suppression strategy is introduced to mitigate feature corruption from concurrently transmitted packets. Extensive real-world testbed evaluations demonstrate that the achievable concurrency in Hi(2)LoRa approaches that of state-of-the-art approaches with significantly higher complexity (e.g., utilizing eight antennas) or exceeds prior work by a factor of 2.7 with comparable complexity (e.g., using two antennas).

关键词： LoraWAN parallel decoding multiple antennas multiple antennas interference suppression interference suppression interference suppression

来源：评论

学校读者我要写书评

暂无评论

parallel decoding for lattice reduction-aided MIMO Receiver

引用

TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES 2016年第6期24卷 5173-5182页

作者： Karthikeyan, Madurakavi Saraswady, Djagadeesan Pondicherry Engn Coll Dept Elect & Commun Pondicherry India

In this paper, we propose a modified lattice reduction (LR) for parallel decoding (PD) in multiple input and multiple output (MIMO) systems. Compared with the conventional methods, without any performance loss,the symbols can be estimated in parallel using this LR-PD algorithm. This parallel decoding is achieved through the proposed postrotation matrix. Among the various LR algorithms, LLL has been considered in the analysis of this postrotation matrix. However, this can be applied to any other LR algorithms without any modifications. In simulations, we show that with a minimal number of extra arithmetic operations and without any significant loss in orthogonal defect and bit error rate performance, the parallel decoding becomes possible in a real as well as complex-valued MIMO system mode.

关键词： MIMO decoding LR-PD LLL lattice reduction parallel decoding

来源：评论

学校读者我要写书评

暂无评论

parallel decoding cyclic burst error correcting codes

引用

IEEE TRANSACTIONS ON COMPUTERS 2005年第1期54卷 87-92页

作者： Umanesan, G Fujiwara, E Tokyo Inst Technol Grad Sch Informat Sci & Engn Meguro Ku Tokyo 1528552 Japan

Burst error correcting codes, such as Fire codes, have traditionally been decoded using Linear Feedback Shift Registers (LFSR). However, such sequential decoding schemes are not suitable for modern ultra high-speed channels that demand high-speed parallel decoding employing only combinational logic circuitry. This paper proposes a parallel decoding method for cyclic burst error correcting codes. Under this method, a binary companion matrix T defines the entire decoding process. Hence, the decoding method can be implemented using only combinational logic.

关键词： cyclic burst error correcting codes Fire codes parallel decoding companion matrix

来源：评论

学校读者我要写书评

暂无评论

parallel decoding OF THE [23, 12, 7] BINARY GOLAY CODE

引用

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES 1994年第2期141卷 119-122页

作者： DODUNEKOV, SM NILSSON, JEM GERMAN AEROSP RES ESTAB DLR INST COMMUN TECHNOLW-8031 OBERPFAFFENHOFENGERMANY

This paper deals with the decoding of the [23,12,7] binary Golay code. Recently, S.W. Wei and C.H. Wei suggested a step-by-step decoding algorithm. We present an improvement in the comparison circuit of their algorith... 详细信息

关键词： GOLAY BINARY CODE parallel decoding decoding COMPLEXITY

来源：评论

学校读者我要写书评

暂无评论

parallel decoding Scheme Based on OSD and KNIH Algorithms

Parallel Decoding Scheme Based on OSD and KNIH Algorithms

引用

International Conference on Materials Science and Information Technology (MSIT 2011)

作者： Qiao Guolei Huaihai Inst Technol Sch Elect Engn Lianyungang 222005 Peoples R China

ISBN: (纸本)9783037853191

In this contribution, KNIH algorithm and Ordered Statistic decoding (OSD) algorithm are investigated, based on which, a novel KNIH-OSD parallel decoding scheme for LDPC codes is proposed. KNIH decoding algorithm processes certain LRPs of a received sequence, while OSD algorithm processes certain MRIPs of a received sequence. If there are too many errors in MRIPs, the OSD algorithm will fail, on the contrary, if there are too many errors in LRPs, the KNIH algorithm will fail. This contribution proposes a parallel decoding scheme based on the complementary characteristic of these two algorithms. Simulation results show that the proposed scheme is feasible and effective. Compared with OSD and KNIH algorithm, the decoding performance is improved.

关键词： Ordered Statistic decoding (OSD) KNIH algorithm Least Reliable Positions (LRPs) Most Reliable Independent Positions (MRIPs) parallel decoding

来源：评论

学校读者我要写书评

暂无评论

parallel decoding of IRSA with Noise 33

Parallel Decoding of IRSA with Noise

引用

33rd IEEE Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Chiang, Yun-Hsin Lin, Yi-Jheng Chang, Cheng-Shang Hong, Y. -W. Peter Natl Tsing Hua Univ Inst Communicat Engn Hsinchu 300044 Taiwan

ISBN: (数字)9781665480536

ISBN: (纸本)9781665480536

Due to its simplicity and scalability, the Irregular Repetition Slotted ALOHA (IRSA) system that uses the successive interference cancellation (SIC) technique is a promising solution for uncoordinated multiple access of a massive number of Internet-of-Things (IoT) devices. However, the peeling (iterative) decoder for IRSA is sequential in nature, and it might lead to cascading errors due to imperfect SIC. In this paper, we propose a parallel decoding algorithm for IRSA in an Additive White Gaussian Noise (AWGN) channel. Inspired by a recent advance in collision resolution for random access, our approach is to find a SIC-decoupling matrix so that the receiver can perform interference cancellation based on the received signals only. We propose a message-passing algorithm to find the optimal SIC-decoupling matrix when the induced user-slot bipartite graph of an IRSA system is acyclic. This includes the Contention Resolution Diversity Slotted ALOHA (CRDSA) system that sends exactly two copies for each packet. Using a random graph analysis, we derive the throughput for parallel decoding of CRDSA in a threshold-based decoding model. We also conduct various numerical experiments to illustrate the tradeoffs between sequential decoding with a limited number of iterations and parallel decoding with a predefined signal-to-noise ratio (SNR) threshold. Our numerical results show that one can significantly reduce the decoding time and achieve comparable throughput by parallel decoding when the SNR is substantially larger than the decoding threshold.

关键词： Internet-of-Things multiple access successive interference cancellation parallel decoding message-passing algorithm

来源：评论

学校读者我要写书评

暂无评论

High Throughput parallel decoding Method for H.264/AVC CAVLC

引用

ETRI JOURNAL 2009年第5期31卷 510-517页

作者： Yeo, Donghoon Shin, Hyunchul Hanyang Univ Sch Elect & Comp Engn Ansan South Korea

A high throughput parallel decoding method is developed for context-based adaptive variable length codes. In this paper, several new design ideas are devised and implemented for scalable parallel processing, a reduction in area, and a reduction in power requirements. First, simplified logical operations instead of memory lookups are used for parallel processing. Second, the codes are grouped based on their lengths for efficient logical operation. Third, up to M bits of the input stream can be analyzed simultaneously. For comparison, we designed a logical-operation-based parallel decoder for M=8 and a conventional parallel decoder. High-speed parallel decoding becomes possible with our method. In addition, for similar decoding rates (1.57 codes/cycle for M=8), our new approach uses 46% less chip area than the conventional method.

关键词： parallel decoding context-based adaptive variable length coding (CAVLC) CAVLD H.264/AVC

来源：评论

学校读者我要写书评

暂无评论

An Improved Majority-Logic Decoder Offering Massively parallel decoding for Real-Time Control in Embedded Systems

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2013年第12期61卷 4808-4815页

作者： Bertram, Juliane Hauck, Peter Huber, Michael Univ Tubingen Dept Comp Sci D-72076 Tubingen Germany

We propose an easy-to-implement hard-decision majority-logic decoding algorithm for Reed-Muller codes RM(r, m) with m >= 3, m/2 >= r >= 1. The presented algorithm outperforms the best known majority-logic decoding algorithms and offers highly parallel decoding. The result is of special importance for safety-and time-critical applications in embedded systems. A simple combinational circuit can perform the proposed decoding. In particular, we show how our decoder for the three-error-correcting code RM(2, 5) of dimension 16 and length 32 can be realized on hardware level.

关键词： Majority-logic decoding Reed-Muller codes combinational circuits parallel decoding real-time and embedded systems

来源：评论

学校读者我要写书评

暂无评论

FTrack: parallel decoding for LoRa Transmissions

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2020年第6期28卷 2573-2586页

作者： Xia, Xianjin Zheng, Yuanqing Gu, Tao Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China RMIT Univ Sch Comp & IT Melbourne Vic 3000 Australia RMIT Univ Sch Comp Sci & Software Engn Melbourne Vic 3000 Australia

LoRa has emerged as a promising Low-Power Wide Area Network (LP-WAN) technology to connect a huge number of Internet-of-Things (IoT) devices. The dense deployment and an increasing number of IoT devices lead to intense collisions due to uncoordinated transmissions. However, the current MAC/PHY design of LoRaWAN fails to recover collisions, resulting in degraded performance as the system scales. This article presents FTrack, a novel communication paradigm that enables demodulation of collided LoRa transmissions. FTrack resolves LoRa collisions at the physical layer and thereby supports parallel decoding for LoRa transmissions. We propose a novel technique to separate collided transmissions by jointly considering both the time domain and the frequency domain features. The proposed technique is motivated from two key observations: (1) the symbol edges of the same frame exhibit periodic patterns, while the symbol edges of different frames are usually misaligned in time;(2) the frequency of LoRa signal increases continuously in between the edges of symbol, yet exhibits sudden changes at the symbol edges. We detect the continuity of signal frequency to remove interference and further exploit the time-domain information of symbol edges to recover symbols of all collided frames. We substantially optimize computation-intensive tasks and meet the real-time requirements of parallel LoRa decoding. We implement FTrack on a low-cost software defined radio. Our testbed evaluations show that FTrack demodulates collided LoRa frames with low symbol error rates in diverse SNR conditions. It increases the throughput of LoRaWAN in real usage scenarios by up to 3 times.

关键词： Chirp Image edge detection Frequency modulation decoding Time-domain analysis Time-frequency analysis Internet of Things LoRaWAN collision resolving parallel decoding

来源：评论

学校读者我要写书评

暂无评论

On task mapping optimization for parallel decoding of low-density parity-check codes on message-passing architectures

引用

parallel COMPUTING 2005年第5期31卷 462-490页

作者： Al-Rawi, G Cioffi, J Horowitz, M King Abdulaziz Univ Dept Elect & Comp Engn Jeddah 21589 Saudi Arabia Stanford Univ Dept Elect Engn Stanford CA 94305 USA

In this paper, we investigate the implementation of iterative probabilistic decoding of low-density parity-check codes on programmable message-passing parallel architectures. We present techniques for optimizing the mapping of tasks to processing units so as to minimize the communication cost by localizing communication. Specifically, we present a simplified clustering technique based on a modified mincut algorithm that reduces the search complexity from quadratic to linear. Cluster allocation is optimized with two different approaches for comparison: using a mincut algorithm and using a genetic algorithm. Results show that the majority of communication locality is exploited by within-cluster communication and is achieved by the clustering operation. The proposed mapping techniques result in a reduction of up to 45% in communication cost compared to random mappings. (c) 2005 Elsevier B.V. All rights reserved.

关键词： low-density parity-check codes parallel decoding mapping optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：