Archive for the ‘Resources’ Category

Matlab UMTS Turbo Code

Tuesday, June 8th, 2010

This Matlab code plots the BER, EXIT chart and iterative decoding trajectories of the UMTS turbo code.

Matlab code for generating Huffman codebooks

Wednesday, February 24th, 2010

I’ve added some Matlab code that I wrote to generate a Huffman codebook for a specified set of symbol probabilities. You can get it from here.

Matlab code for repeat accumulate codes

Wednesday, August 26th, 2009

I’ve uploaded some Matlab code for drawing EXIT chart, iterative decoding trajectories and BER plots for half-rate repeat accumulate codes. You can download it here.

C fixed-point BCJR

Wednesday, June 17th, 2009

I’ve added some C code for the BCJR used in fixed-point UMTS turbo codes.

Teaching Resources

Friday, November 14th, 2008

I’ve put a bunch of my teaching resources on the website.

C++ classes for simulating block-based precoders

Monday, September 1st, 2008

Hi. I’ve uploaded some C++ classes for simulating block-based precoders. Take a look at the page in the resources section of this site.

Source code for calculating the DCMC capacity in Matlab

Friday, August 8th, 2008

I’ve uploaded some Matlab source code I wrote that lets you calculate the Discrete-input Continuous-output Memoryless Channel (DCMC) capacity of AWGN and uncorrelated Rayleigh fading channels for BPSK, QPSK, 8PSK and 16QAM. Check it out here

Source code for drawing EXIT charts in Matlab

Friday, August 1st, 2008

I’ve uploaded some source code I wrote that lets you draw EXtrinsic Information Transfer (EXIT) charts in Matlab. These help you characterise the iterative decoding convergence of turbo-like codes. Check it out here

RobProb uploaded

Monday, November 26th, 2007

I’ve uploaded the source code and documentation of my RobProb C++ data types. These are really handy for implementing Soft-In Soft-Out (SISO) decoders.

First piece of content

Friday, November 9th, 2007

I’ve uploaded a report we wrote to intuitively explain why a free distance of two is a necessary condition for supporting iterative decoding convergence to an infinitesimally low probability of error. This is relevant to Variable Length Error Correction (VLEC) codes, Variable Length Codes (VLCs), Reversible Variable Length Codes (RVLCs) and Fixed Length Codes (FLCs). This relates to the EXtrinsic Information Transfer (EXIT) chart analysis of iterative decoding convergence in concatenated codes.