View License

Download apps, toolboxes, and other File Exchange content using Add-On Explorer in MATLAB.

» Watch video

Highlights from
Convolutional Encoder/Decoder of Rate 1/N Codes

Join the 15-year community celebration.

Play games and win prizes!

» Learn more

5.0 | 1 rating Rate this file 17 Downloads (last 30 days) File Size: 481 KB File ID: #25859 Version: 1.6
image thumbnail

Convolutional Encoder/Decoder of Rate 1/N Codes



16 Nov 2009 (Updated )

MATLAB code that tests a rate 1/N Convolution Encoder and Decoder schemes via a Trellis map.

| Watch this File

File Information

In this project, we seek to minimize the gap-to-capacity (given by Shannon’s theoretical limit) of a rate 1/3 code (also can be modified for 1/N). This is done via a convolutional encoder/decoder for varying memory elements as well for both soft and hard decoding scheme. We show that the gap-to-capacity can be minimized with respect to the suboptimal un-coded code word or a (3,1) repetition code. Although better schemes are available such as LDPC and turbo codes, we have chosen the convolutional code for its simplicity and generality. Our model of transmission is binary-input AWGN channel. Also, I attached my paper to demonstrate how the code can be easily modified for other rates and different varying element sizes. Provides detail overview of Convolution Coding scheme. If you decide to use this code, please cite the paper and this code in the proper manner.
For More Information:

MATLAB release MATLAB 7.6 (R2008a)
MATLAB Search Path
Tags for This File   Please login to tag files.
Please login to add a comment or rating.
Comments and Ratings (3)
09 Aug 2016 GUANG LIU

it does not work for K = 6 and K = 8

Comment only
12 Nov 2011 edwin prabhakaran

i didnt get output in matlab 2008a

Comment only
16 Nov 2009 Shawn Lankton

Shawn Lankton (view profile)

The codes worked great. They helped me complete my coding theory project. The generality of the functions was particularly helpful. Thanks for the awesome work.

16 Nov 2009 1.1

Update description.

16 Nov 2009 1.2

Update description

16 Nov 2009 1.3

Update Description

13 Apr 2015 1.4

Updated a plagiarized note for other authors.

13 Apr 2015 1.5

Updated note on plagiarism work

05 May 2015 1.6

Remove link to plagiarized article

Contact us