| EPSRC Reference: |
GR/J11935/01 |
| Title: |
INVESTIGATION OF SEQUENCE SEGMENT KEYING (SSK) AND ITS APPLICATION IN CDMA SYSTEMS |
| Principal Investigator: |
Honary, Professor B |
| Other Investigators: |
|
| Researcher Co-Investigators: |
|
| Project Partners: |
|
| Department: |
Engineering |
| Organisation: |
Lancaster University |
| Scheme: |
Standard Research (Pre-FEC) |
| Starts: |
01 January 1994 |
Ends: |
31 December 1996 |
Value (£): |
82,501
|
| EPSRC Research Topic Classifications: |
| RF & Microwave Technology |
|
|
| EPSRC Industrial Sector Classifications: |
|
| Related Grants: |
|
| Panel History: |
|
|
Summary on Grant Application Form |
|
The principal research areas of this project (for Lancaster University) are:(I) investigation of optimum decoder synthesis for Sequence-Segment Keying (SSK), taking into account diversity;(ii) investigation of optimum error control schemes for use in SSK-type systems;(iii) investigation of variable-significance SSK, adaptive in response to nature of source information.Progress:To date (Lancaster):The optimum decoder synthesis is a balance against performance and complexity (both time and space complexity). This balance has been investigated by comparing the relative decoder complexities of hard-decision decoders; Euclidean, Berlekamp-Massey and High-Speed Step-by-Step decoders have been implemented in C++. The complexity evaluation was based upon the number of Galois field operations performed, with each operation weighted according to the projected execution time on a DSP. The decoders were also compared against a minimum-weight decoder under the same criteria. It was found that while High-Speed Step-by-step is an improvement over conventional step-by-step decoding Euclidean and Berlekamp are less complex (and still retain (hard-decision) maximum likelihood decoding). Minimum-weight decoding is the least complex but is not maximum-likelihood. A soft-maximum-likelihood trellis decoder has been implemented in C++. Currently work is progressing to extend this to the decoding of Reed-Solomon codes, allowing a comparison of decoder complexity against the decoders already discussed.
|
|
Key Findings |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Potential use in non-academic contexts |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Impacts |
|
| Description |
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk |
| Summary |
|
| Date Materialised |
|
|
|
|
Sectors submitted by the Researcher |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
| Project URL: |
|
| Further Information: |
|
| Organisation Website: |
http://www.lancs.ac.uk |