Conventionally, the free distance is taken as the principle criterion for computing the error of convolutional and linear block codes. In other words, a larger free distance implies a better correction ability for the error correction codes. Distance spectrum is also an important factor for Maximum likelihood decoding. In this thesis, distance spectrum for different convolutional codes and CPM systems are investigated by us. Experiments results has demonstrate that a better correction ability of a shorter free distance does exist in some cases if they have a better distance spectrum.
We also improve the fast algorithm for computing the distance spectrum developed by M. Cedervall and R. Johannesson. Their success is based upon the strategy of a traveling along the coding tree to find the distance spectrum. However, they need a new traveling for ever new distance computation. In contrast, we compute all the distance spectrum just in one travel by taking the advantage of the storing nodes of previous distance computation.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0901103-021502 |
| Date | 01 September 2003 |
| Creators | Tsai, Ruei-Jhe |
| Contributors | Chih-Peng Li, Ben-Shung Chow, Ju-Ya Chen, Chin-Hsing Chen |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0901103-021502 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.0865 seconds