Global Information Lookup Global Information

Convolutional code information


In telecommunication, a convolutional code is a type of error-correcting code that generates parity symbols via the sliding application of a boolean polynomial function to a data stream. The sliding application represents the 'convolution' of the encoder over the data, which gives rise to the term 'convolutional coding'. The sliding nature of the convolutional codes facilitates trellis decoding using a time-invariant trellis. Time invariant trellis decoding allows convolutional codes to be maximum-likelihood soft-decision decoded with reasonable complexity.

The ability to perform economical maximum likelihood soft decision decoding is one of the major benefits of convolutional codes. This is in contrast to classic block codes, which are generally represented by a time-variant trellis and therefore are typically hard-decision decoded. Convolutional codes are often characterized by the base code rate and the depth (or memory) of the encoder . The base code rate is typically given as , where n is the raw input data rate and k is the data rate of output channel encoded stream. n is less than k because channel coding inserts redundancy in the input bits. The memory is often called the "constraint length" K, where the output is a function of the current input as well as the previous inputs. The depth may also be given as the number of memory elements v in the polynomial or the maximum possible number of states of the encoder (typically: ).

Convolutional codes are often described as continuous. However, it may also be said that convolutional codes have arbitrary block length, rather than being continuous, since most real-world convolutional encoding is performed on blocks of data. Convolutionally encoded block codes typically employ termination. The arbitrary block length of convolutional codes can also be contrasted to classic block codes, which generally have fixed block lengths that are determined by algebraic properties.

The code rate of a convolutional code is commonly modified via symbol puncturing. For example, a convolutional code with a 'mother' code rate may be punctured to a higher rate of, for example, simply by not transmitting a portion of code symbols. The performance of a punctured convolutional code generally scales well with the amount of parity transmitted. The ability to perform economical soft decision decoding on convolutional codes, as well as the block length and code rate flexibility of convolutional codes, makes them very popular for digital communications.

and 25 Related for: Convolutional code information

Request time (Page generated in 0.8902 seconds.)

Convolutional code

Last Update:

the 'convolution' of the encoder over the data, which gives rise to the term 'convolutional coding'. The sliding nature of the convolutional codes facilitates...

Word Count : 2834

Quantum convolutional code

Last Update:

modern codes do have lower complexity. Quantum convolutional coding theory offers a different paradigm for coding quantum information. The convolutional structure...

Word Count : 1956

Error correction code

Last Update:

are not needed. The two main categories of ECC codes are block codes and convolutional codes. Block codes work on fixed-size blocks (packets) of bits or...

Word Count : 4678

Turbo code

Last Update:

BCJR algorithm Convolutional code Forward error correction Interleaver Low-density parity-check code Serial concatenated convolutional codes Soft-decision...

Word Count : 2690

Coding theory

Last Update:

codes:[citation needed] Linear block codes Convolutional codes It analyzes the following three properties of a code – mainly:[citation needed] Code word...

Word Count : 3546

Serial concatenated convolutional codes

Last Update:

Serial concatenated convolutional codes (SCCC) are a class of forward error correction (FEC) codes highly suitable for turbo (iterative) decoding. Data...

Word Count : 997

Viterbi decoder

Last Update:

that has been encoded using a convolutional code or trellis code. There are other algorithms for decoding a convolutionally encoded stream (for example...

Word Count : 1811

Concatenated error correction code

Last Update:

the inner code is not a block code but a soft-decision convolutional Viterbi-decoded code with a short constraint length. For the outer code, a longer...

Word Count : 2088

Convolutional neural network

Last Update:

processing, standard convolutional layers can be replaced by depthwise separable convolutional layers, which are based on a depthwise convolution followed by a...

Word Count : 15065

Enhanced Data rates for GSM Evolution

Last Update:

convolutional code. In GPRS Coding Schemes CS-1 through CS-3, the convolutional code is of rate 1/2, i.e. each input bit is converted into two coded bits...

Word Count : 1954

Code rate

Last Update:

k / n {\displaystyle \leq R\cdot k/n} . For example: The code rate of a convolutional code will typically be 1⁄2, 2⁄3, 3⁄4, 5⁄6, 7⁄8, etc., corresponding...

Word Count : 244

Hagelbarger code

Last Update:

In telecommunication, a Hagelbarger code is a convolutional code that enables error bursts to be corrected provided that there are relatively long error-free...

Word Count : 87

General Packet Radio Service

Last Update:

the output of the convolutional code is punctured to achieve the desired code rate. In Coding Scheme CS-4, no convolutional coding is applied. The following...

Word Count : 3502

Convolution

Last Update:

Hardware Cost of a Convolutional Neural Network". Neurocomputing. 407: 439–453. doi:10.1016/j.neucom.2020.04.018. S2CID 219470398. Convolutional neural networks...

Word Count : 8694

Trellis coded modulation

Last Update:

technique closely resembles a trellis lattice. The scheme is basically a convolutional code of rates (r, r+1). Ungerboeck's unique contribution is to apply the...

Word Count : 732

GPS signals

Last Update:

message: It uses forward error correction (FEC) provided by a rate 1/2 convolutional code, so while the navigation message is 25-bit/s, a 50-bit/s signal is...

Word Count : 10657

Systematic code

Last Update:

error-detecting codes. Linear codes are usually implemented as systematic error-correcting codes (e.g., Reed-Solomon codes in CDs). Convolutional codes are implemented...

Word Count : 541

Block code

Last Update:

coder is a memoryless device. Under this definition codes such as turbo codes, terminated convolutional codes and other iteratively decodable codes (turbo-like...

Word Count : 3322

Error detection and correction

Last Update:

and RAM. Error-correcting codes are usually distinguished between convolutional codes and block codes: Convolutional codes are processed on a bit-by-bit...

Word Count : 4200

Viterbi algorithm

Last Update:

(HMM). The algorithm has found universal application in decoding the convolutional codes used in both CDMA and GSM digital cellular, dial-up modems, satellite...

Word Count : 2612

Sequential decoding

Last Update:

decoding tree codes. Sequential decoding is mainly used as an approximate decoding algorithm for long constraint-length convolutional codes. This approach...

Word Count : 1270

Linear code

Last Update:

partitioned into block codes and convolutional codes, although turbo codes can be seen as a hybrid of these two types. Linear codes allow for more efficient...

Word Count : 2688

Sequential algorithm

Last Update:

algorithm" may also refer specifically to an algorithm for decoding a convolutional code. Online algorithm Streaming algorithm "A Dictionary of Computing at...

Word Count : 143

LeNet

Last Update:

is a convolutional neural network structure proposed by LeCun et al. in 1998. In general, LeNet refers to LeNet-5 and is a simple convolutional neural...

Word Count : 1449

RSC

Last Update:

Recursive Systematic Convolutional code, a type of convolutional code Reed–Solomon code, a non-binary cyclic error-correcting code Regular Slotted Container...

Word Count : 488

PDF Search Engine © AllGlobal.net