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

IEEE TRANSACTIONS ON NANOBIOSCIENCE 2023年第1期22卷 78-91页

作者： Yu, Jingxiang Li, Hui Univ Sci & Technol China CAS Key Lab Wireless Opt Commun Hefei 230026 Peoples R China

Molecular communication (MC), which transmits information through molecules, has emerged as a promising technique to enable communication links between nanomachines. To establish information transmission using molecules, synthetic biology through genetic circuits techniques can be utilized to construct biological components. Recent efforts on genetic circuits have produced many exciting MC systems and generated substantial insights. With basic gene regulatory modules and motifs, researchers are now constructing artificial networks with novel functions that will serve as building blocks in the MC system. In this paper, we investigate the design of genetic circuits to implement the convolutional codec in a diffusion-based MC channel with the concentration shift keying (CSK) transmission scheme. At the receiver, a majority-logic decoder is applied to decode the received symbols. These functions are completely realized in the field of biochemistry through the activation and inhibition of genes and biochemical reactions, rather than through classical electrical circuits. Biochemical simulations are used to verify the feasibility of the system and analyze the impairments caused by diffusion noise and chemical reaction noise of genetic circuits.

关键词： Genetics convolutional codes Decoding Nanobioscience Biological information theory Modulation Proteins Molecular communication genetic circuits convolutional coding majority-logic decoding

来源：评论

学校读者我要写书评

暂无评论

On the design and selection of convolutional codes for an uninterleaved, bursty Rician channel

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1995年第12期43卷 2914-2921页

作者： Kaplan, G Shamai, S Kofman, Y TECHNION ISRAEL INST TECHNOL DEPT ELECT ENGN IL-32000 HAIFA ISRAEL

This work focuses on code design and code selection rules under power and decoding delay constraints for an antipodal (BPSK) modulated and convolutionally encoded communication system. The system operates over a slowly fading AWGN channel, described here by the block-fading model. We specialize to perfect coherent detection with maximum likelihood decoding assuming ideal channel information (the instantaneous fading values). The dominant design criterion in this scenario is the code diversity level in terms of blocks while the standard Hamming distance plays a secondary role. A code design procedure, based on maximum distance separable (MDS) cyclic block codes is presented along with a code-search algorithm. The performance results of selected codes are assessed via simulation and compared to those achieved by Reed-Solomon codes with erasure and error decoding.

关键词： Block codes maximum likelihood decoding DEcoding Codes design and selection Rician channels code selection Hamming distance AWGN channels convolutional coding fading color coherence information channels

来源：评论

学校读者我要写书评

暂无评论

Bidirectional sequential decoding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1997年第4期43卷 1319-1326页

作者： Kallel, S Li, KP Department of Electrical Engineering University of British Columbia Vancouver BC Canada

The main drawback of sequential decoding is the variability of its decoding effort which could cause decoding erasures. We propose and analyze in this correspondence an efficient bidirectional sequential decoding (BSD) technique to alleviate this drawback. In the proposed BSD, two decoders are used;one is called a forward decoder (FD), and is used to search the tree from forward direction;while the other is called a backward decoder (ED), and is used for the backward search of the tree. Forward decoding and backward decoding are performed simultaneously, and stop whenever FD and ED merge at a common encoder state somewhere in the tree. The relationships between backward coding and forward coding are examined in detail. Good rate 1/2 convolutional codes, with memory m ranging from 2 to 25, suitable for bidirectional decoding found through extensive computer search, are provided. These codes possess the same distance properties from both forward and backward directions. It is found by means of extensive computer simulations as well as a heuristic argument that the advantage of BSD appears as a substantial decrease of the computational variability of sequential decoding. Our findings suggest that the Pareto exponent of unidirectional sequential decoding (USD) can be practically doubled by using BSD.

关键词： bidirectional decoding computational variability convolutional coding sequential decoding symmetric code

来源：评论

学校读者我要写书评

暂无评论

PERFORMANCE ENHANCEMENT USING FORWARD ERROR-CORRECTION ON POWER-LINE COMMUNICATION CHANNELS

引用

IEEE TRANSACTIONS ON POWER DELIVERY 1994年第2期9卷 645-653页

作者： CHAN, MHL FRIEDMAN, D DONALDSON, RW UNIV BRITISH COLUMBIA DEPT ELECT ENGNVANCOUVER V6T 1Z4BCCANADA

The use of forward error correction (FEC) coding is investigated, to enhance communication throughput and reliability on noisy power line networks. Rate one-half self-orthogonal convolutional codes are considered. These codes are known to be effective in other environments, and can be decoded inexpensively in real-time using majority logic decoders. Extensive bit and packet error rate tests were conducted on actual, noisy in-building power line links. coding gains of 15 dB were observed at 10(-3) decoded bit error rates. A self-orthogonal (2, 1, 6) convolutional code with interleaving to degree 7 was particularly effective, and was implemented as a VLSI microelectronic chip. Its use improved data throughput and packet error rates substantially, at data transmission rates of 9,600 bits/s.

关键词： POWERLINE COMMUNICATIONS FORWARD ERROR CORRECTION (FEC) coding convolutional coding DISTRIBUTION AUTOMATION VLSI CODEC IMPLEMENTATION BIT ERROR RATE MEASUREMENT PACKET ERROR RATE MEASUREMENT DATA THROUGHPUT MEASUREMENT

来源：评论

学校读者我要写书评

暂无评论

A modified Viterbi decoding algorithm for high-rate convolutional codes

引用

EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS 2005年第6期16卷 527-536页

作者： Amat, AGI Benedetto, S Siegel, PH Politecn Torino Dipartimento Elettron I-10129 Turin Italy Univ Pompeu Fabra Dept Tecnol Barcelona 08003 Spain Univ Calif San Diego ECE Dept La Jolla CA 92093 USA

It is well-known that the computational complexity of the Viterbi decoding algorithm for an (n, k, V) convolutional code grows exponentially with k and the code memory v, and thus it becomes quickly impractical as the code rate increases. A solution, so far, has been to use punctured convolutional codes, which strongly reduces the decoding complexity but leads to a slightly worse performance. Recently, it has been pointed out that every non-punctured high-rate convolutional code (with 2(k) > 2(v)) can be viewed as the concatenation of a block code and a simpler convolutional code. In this paper, we exploit this property of high-rate codes to facilitate the implementation of the Viterbi algorithm. We propose a modification of the Viterbi decoding algorithm for non-punctured high-rate convolutional codes which results in very significant computational savings. Copyright (c) 2005 AEIT.

关键词： Block codes complexity classes code rate algorithms Viterbi algorithm Viterbi decoding decoding algorithm code memory convolutional coding punctured convolutional code

来源：评论

学校读者我要写书评

暂无评论

Some analytical tools for the design of space-time convolutional codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2002年第10期50卷 1593-1599页

作者： Blum, RS Lehigh Univ Dept Comp Sci & Elect Engn Bethlehem PA 18015 USA

Space-time convolutional codes have shown considerable promise for providing improved performance for wireless communication through combined diversity and coding gain. An efficient design procedure is presented here for optimizing the coding and diversity gain measures proposed in the first papers on space-time codes. The procedure is based on some simple lower and upper bounds on coding gain. The same calculations needed to compute these bounds can be used to check either necessary or sufficient conditions on space-time codes which achieve maximum diversity gain. A new simple, but useful, measure of code performance is also suggested which augments existing measures. The use of the design procedure is illustrated and new codes are provided. These codes are shown to outperform the space-time convolutional codes provided in the initial papers introducing space-time codes.

关键词： convolutional coding space-time coding space-time modulation transmit diversity

来源：评论

学校读者我要写书评

暂无评论

FURTHER-STUDIES ON EFFICIENT AFEC SCHEMES FOR KA-BAND SATELLITE SYSTEMS

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 1989年第1期25卷 9-20页

作者： KHAN, MH LENGOC, T BHARGAVA, VK CONCORDIA UNIV DEPT ELECT & COMP ENGNMONTREAL H3G 1M8QUEBECCANADA UNIV VICTORIA DEPT ELECT ENGNVICTORIA V8W 2Y2BCCANADA

Adaptive fade margin is required to counter the severe but varying rain attenuation in Ka satellite communications. In searching for a suitable rain countermeasure, the effectiveness of the adaptive forward error control (AFEC) scheme is studied. Two AFEC schemes using convolutional codes and concatenated codes are proposed and their performance analyzed. The schemes can provide a progressively adaptive fade margin of 10.1 and 10.4 dB, respectively, in excess of the systems fixed fade margin. To improve the efficient use of shared resources of the system, an AFEC scheme using double coding is introduced, and its performance is analyzed. In this scheme a single codec is used repeatedly, and as a result the hardware cost is reduced and the utilization increased. The effective usable capacity of a conceptual AFEC resource sharing scheme using Golay double coding is also analyzed.

关键词： Tumor margin status Effective Capacity coding Concatenated codes Scheme Self tuning Satellite systems Resource sharing convolutional coding rain attenuation Satellite communication

来源：评论

学校读者我要写书评

暂无评论

THE USE OF INTERLEAVING FOR REDUCING NOISY REFERENCE LOSS IN TRELLIS-CODED MODULATION SYSTEMS

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1990年第8期38卷 1190-1198页

作者： DIVSALAR, D SIMON, MK Jet Propulsion Laboratory California Institute of Technology Pasadena CA USA

The use of interleaving/deinterleaving in trellis-coded modulation systems to reduce the SNR loss due to imperfect carrier demodulation references is demonstrated. Both the discrete carrier (phase-locked loop) and the suppressed carrier (Costas loop) cases are considered, and the differences between the two are clearly demonstrated by numerical results. The special case of convolutional codes is also treated and illustrated with an example of practical interest.

关键词： trellis coded modulation carrier suppression Costas loop convolutional coding

来源：评论

学校读者我要写书评

暂无评论

Fast and upper bounded Fano decoding algorithm: queuing analysis

引用

TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES 2017年第1期28卷 1-12页

作者： Darabkh, Khalid A. Univ Jordan Dept Comp Engn Amman 11942 Jordan

In computer networking, having limited buffer size is one of the vital causes of splitting the messages into smaller frames to be then transmitted over the network. Increasing the buffer size will not improve the case much but rather it is likely to degrade the performance of the system if it is not investigated properly. On the other hand, frames' retransmissions, as a result of frames being corrupted or dropped, need to be avoided as much as possible because of possible network congestion. To investigate the problem of undesired retransmissions, this paper addresses the use of convolutional codes utilising variable complexity decoding algorithms, such as the Fano algorithm, which mainly aim to mitigate frames' retransmissions caused by frames' corruption. It is noteworthy to mention that the rapid growth of wireless technologies has attracted everybody's attention. As wireless technology evolves, new decoding algorithms are emerging to demonstrate designs with variable power consumptions. Hence, in this paper, we propose a novel queuing model that describes not only frame arriving and departing processes after getting decoded according to how worse the channel condition is or what is the remaining system power but also a decoder with a double speed compared with what is best scrutinised in the literature. Moreover, in our buffering model, we can reduce the number of frames being dropped because of insufficient buffer size, and unwanted retransmissions owing to long frame waiting time, by virtue of bestowing larger buffer size, through our derived closed-form expression that represents the expected number of awaiting frames in the buffers of Fano decoders parameterised by channel status, decoding threshold and frame arriving probability. As far as the system occupancy is concerned and over what have been previously proposed, our analytical results show impressive improvements. As such, through our proposed queuing model, the required decoder's buffer is substantial

关键词： buffers channel status Queuing models queueing theory decoders Network Congestion Wireless Technology convolutional coding Fasting RETRANSMISSION

来源：评论

学校读者我要写书评

暂无评论

Turbo equalization

引用

IEEE SIGNAL PROCESSING MAGAZINE 2004年第1期21卷 67-80页

作者： Koetter, R Singer, AC Tüchler, M Univ Illinois Coordinated Sci Lab Urbana IL 61801 USA Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA Tech Univ Munich Inst Commun Engn D-8000 Munich Germany

Turbo equalization is an iterative equalization and decoding technique that can achieve equally impressive performance gains for communication systems that send digital data over channels that require equalization, i.e., those that suffer from intersymbol interference (ISI). In this article, we discuss the turbo equalization approach to coded data transmission over ISI channels, with emphasis on the basic ideas and some of the practical details. The original system introduced by Douillard et al. can be viewed as an extension of the turbo decoding algorithm by considering the effect of the ISI channel as another form of error protection, i.e., as a rate-1 convolutional code.

关键词： turbo codes equalisers telecommunication channels iterative decoding data communication intersymbol interference convolutional codes channel coding turbo equalization iterative equalization iterative decoding technique digital data coded data transmission ISI channels turbo decoding algorithm convolutional code digital data data communication decoding algorithm data transmission Communication channels convolutional coding intersymbolic interference Equalizers Iterative decoding turbo codes Channel coding Equalization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：