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

Fiber-Optic Current Sensing Based on Reflective Polarization-Bias-Added Structure

IEEE SENSORS JOURNAL 2024年第1期24卷 292-302页

作者： Jiang, Run Zheng, Yuesheng Fuzhou Univ Coll Elect Engn & Automat Fuzhou 350108 Peoples R China Fujian Key Lab New Energy Generat & Power Convers Fuzhou 350108 Peoples R China

Polarimetric fiber-optic current-sensing technology is typically employed for measuring high current, as the low Verdet constant of optical fiber makes Faraday rotation not noticeable in low-current measurements and subsequently leads to low current sensitivity. To enhance current sensitivity, a polarimetric method based on a reflective polarization-bias-added (RPBA) structure is presented in this article. First, it is proved by the Jones matrix that current sensitivity would be compromised due to the constant term in the traditional sensing output. Then, the single-axis measurement method is employed to eliminate the constant term using the single-axis working (SAW) circulator. In consideration of the accuracy of subsequent signal decoding, the bias is generated by the RPBA structure to process optical signals between the circulator and the mirror. Next, a decoding algorithm based on parameter optimization is presented to restore the measured current from the photodetector output. Finally, the experimental results show that the current sensitivity of the presented method can be larger than 0.005 V/A under the premise of small measurement error in the vibration-and-temperature test. Compared with the existing polarimetric methods whose current sensitivity tends to be 0.002 V/A, the presented method has better current sensitivity without incurring additional sensor-head turns or optical devices.

关键词： Current sensitivity decoding algorithm measurement polarimetric fiber-optic current-sensing technology reflective polarization-bias-added (RPBA) structure

来源：评论

学校读者我要写书评

暂无评论

BINARY CYCLIC [N,K] CODES USED FOR SIMULTANEOUS TEC AND SBD

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1989年第3期35卷 657-659页

作者： HARBOUR, TG ROYAL MIL COLL CANADA DEPT ELECT ENGNKINGSTON K7L 2W3ONTARIOCANADA

In a hybrid forward-error-correction-automatic-repeat-request system one may wish to use an (n,k) cyclic code because its decoding algorithm is well known. An analytic formula is given for determining the fraction of undetectable single bursts of different lengths when a cyclic code is used for simultaneous single-burst-error detection and t-random error correction.

关键词： Schottky diodes error correction Concurrency Binary decoding algorithm cyclic Codes cyclic codes Error detection

来源：评论

学校读者我要写书评

暂无评论

algorithm to decode 'identifiable parent property' codes

引用

ELECTRONICS LETTERS 2002年第12期38卷 552-553页

作者： Fernandez, M Soriano, M Univ Politecn Catalunya Dept Telemat Engn ES-08034 Barcelona Spain

In a fingerprinting scheme, marks are embedded in a digital object to protect intellectual property. Dishonest users can collude, change some of the marks and create a new copy. In this case codes with the 'identifiable parent property' or IPP codes [4], provide means of traceability. Here, both a new decoding algorithm for IPP codes and an improvement of earlier algorithms are presented.

关键词： codes decoding industrial property Reed-Solomon codes fingerprintingscheme digital object intellectual property identifiable parent property codes IPP codes traceability decoding algorithm Reed-Solomon code

来源：评论

学校读者我要写书评

暂无评论

237 Gbit/s unrolled hardware polar decoder

引用

ELECTRONICS LETTERS 2015年第10期51卷 762-U30页

作者： Giard, P. Sarkis, G. Thibeault, C. Gross, W. J. McGill Univ Dept Elect & Comp Engn Montreal PQ Canada Ecole Technol Super Dept Elect Engn Montreal PQ Canada

A new architecture for a polar decoder using a reduced complexity successive-cancellation (SC) decoding algorithm is presented. This novel fully unrolled, deeply pipelined architecture is capable of achieving a coded throughput of over 237 Gbit/s for a (1024, 512) polar code implemented using a field-programmable gate array. This decoder is two orders of magnitude faster than state-of-the-art polar decoders.

关键词： decoding field programmable gate arrays FPGA complexity successive cancellation decoding algorithm field programmable gate array pipelined architecture polar code unrolled hardware polar decoder

来源：评论

学校读者我要写书评

暂无评论

Increasing throughput of iterative decoders

引用

ELECTRONICS LETTERS 2001年第12期37卷 770-771页

作者： Vogt, J Finger, A Tech Univ Dresden Dept Elect Engn D-01062 Dresden Germany

decoding concatenated codes with an iterative decoder including a stopping criterion saves power compared to decoding with a tired number of iterations. In this work the throughput of the decoder is also increased. This is achieved by using additional buffers at the decoder input and a modified stepping criterion. Simulations demonstrate that this method can double the throughput compared to the conventional decoding algorithm.

关键词： Concatenated codes decoders decoding algorithm decoding Iterative Throughput iterative methods

来源：评论

学校读者我要写书评

暂无评论

Construction and Encoding algorithm for Maximum Run-Length Limited Single Insertion/Deletion Correcting Code

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2022年第1期E105A卷 35-43页

作者： Takemoto, Reona Nozaki, Takayuki Yamaguchi Univ Div Fundamental Sci Grad Sch Sci & Technol Innovat Dept Informat Yamaguchi 7538512 Japan Yamaguchi Univ Res Inst Time Studies Yamaguchi 7538511 Japan

Maximum run-length limited codes are constraint codes used in communication and data storage systems. Insertion/deletion correcting codes correct insertion or deletion errors caused in transmitted sequences and are used for combating synchronization errors. This paper investigates the maximum run-length limited single insertion/deletion correcting (RLL-SIDC) codes. More precisely, we construct efficiently encodable and decodable RLL-SIDC codes. Moreover, we present its encoding and decoding algorithms and show the redundancy of the code.

关键词： single insertion/deletion correcting codes maximum run-length limited codes encoding algorithm decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on flexible job-shop scheduling problem based on a modified genetic algorithm

引用

JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY 2010年第10期24卷 2119-2125页

作者： Sun, Wei Pan, Ying Lu, Xiaohong Ma, Qinyi Dalian Univ Technol Sch Mech Engn Dalian 116024 Peoples R China Dalian Fisheries Univ Inst Engn Mech Dalian 116023 Peoples R China

Aiming at the existing problems with GA (genetic algorithm) for solving a flexible job-shop scheduling problem (FJSP), such as description model disunity, complicated coding and decoding methods, a FJSP solution method based on GA is proposed in this paper, and job-shop scheduling problem (JSP) with partial flexibility and JIT Oust-in-time) request is transformed into a general FJSP. Moreover, a unified mathematical model is given. Through the improvement of coding rules, decoding algorithm, crossover and mutation operators, the modified GA's convergence and search efficiency have been enhanced. The example analysis proves the proposed methods can make FJSP converge to the optimal solution steadily, exactly, and efficiently.

关键词： FJSP GA Coding rules decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Generalized concatenation of encoded tamed frequency modulation

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1998年第10期46卷 1337-1345页

作者： Bossert, M Shavgulidze, S Hautle, A Dieterich, H Univ Ulm Dept Informat Technol D-89081 Ulm Germany Georgian Techn Univ Dept Digital Commun Theory GE-380075 Tbilisi Georgia

A novel construction for encoded tamed frequency modulation (TFM) is introduced which is based on the principles of generalized concatenation. The inner TFM is partitioned into nested subsystems which increases the free Euclidean distances. In order to obtain a large distance among the nested TFM subsystems, the scrambler matrices ha ce to be computed which transfer the original TFM into equivalent TFM with better partitioning properties. Then outer convolutional codes with different error-correcting capabilities are used to protect the partitioning. The new concatenated and generalized concatenated constructions were simulated in an additive white Gaussian noise channel, A multistep decoding algorithm based on soft-output demodulation was used. We present various simulation results which show a significant coding gain in comparison with the best known trellis codes having the same trellis state complexity.

关键词： Simulation results Scrambler Device Component decoding algorithm partitions Trellis codes SUB-SYSTEM AWGN channels coding gain AWGN error correction capability

来源：评论

学校读者我要写书评

暂无评论

Mitigation of Impulsive Noise Effect on the PLC Channel With QC-LDPC Codes as the Outer Coding Scheme

引用

IEEE TRANSACTIONS ON POWER DELIVERY 2010年第3期25卷 1440-1449页

作者： Andreadou, Nikoleta Pavlidou, Fotini-Niovi Aristotle Univ Thessaloniki Dept Elect & Comp Engn Thessaloniki 54124 Greece

In this paper, the characteristics of irregular quasi-cyclic-low-density parity check (QC-LDPC) codes are examined when they are applied on a highly impulsive noise channel, such as the power-line-communications (PLC) channel. We study two decoding algorithms: 1) the sum product and 2) the bit-flipping algorithm, and how they affect the system's performance. LDPC codes are introduced in combination with other coding schemes, such as Reed-Solomon and convolutional codes. We propose irregular QC-LDPC codes as outer codes for the PLC channel in combination with Reed-Solomon codes, due to their decoding characteristics. In addition, various code rates are used for each different coding scenario. We also test how common Reed-Solomon codes affect the system's performance, such as the RS(63, 53), RS(511, 431), RS(127, 107), and RS(255, 239) codes. Furthermore, we propose an altered version of the sum-product decoding algorithm to enable its operation when QC-LDPC codes are used as the outer coding scheme in combination with Reed-Solomon codes. Regarding the system's design, the orthogonal frequency-division multiplexing transmission technique is utilized. We also take Zimmermann's model into consideration for the PLC channel and Middleton's noise model.

关键词： decoding algorithm inner codes low-density parity check codes (LDPC) outer codes power-line communications (PLC)

来源：评论

学校读者我要写书评

暂无评论

Burst-error-correcting algorithm for Reed-Solomon codes

引用

ELECTRONICS LETTERS 2001年第11期37卷 695-697页

作者： Yin, LG Lu, JH Ben Letaief, K Wu, YS Tsing Hua Univ Dept Elect Engn Beijing 100084 Peoples R China HKUST Dept EEE Kowloon Hong Kong Peoples R China

A new decoding algorithm for burst-error-correction is proposed. The proposed algorithm can effectively correct burst errors of length approaching n - k symbols for (n, k) Reed-Solomon (RS) codes. Compared with existi... 详细信息

关键词： Signs and symbols Reed-Solomon codes decoding algorithm algorithms complexity classes decoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：