Research
Current research interests
|
My current Research interests include low-density parity-check codes, repeat-accumulate codes, iterative decoding algorithms and combinatorics.
ARC funded research projects
|
I'm currently a Chief Investigator on the following grants funded by the Australian Research Council
(ARC).
DP0877258 Iterative coding for next generation networks
|
2008 - 2010
|
$335,000 |
Chief Investigators: Sarah Johnson and Chris Kellett
|
| Summary: Packet-based networks, from the Internet to mobile phones, are carrying increasing amounts of delay critical and multicast network traffic such as Voice Over IP and downloaded movies. This project aims to significantly enhance the reliability and performance of this traffic by designing new iterative forward error correction codes, and implementable joint network/channel codes, targeted directly to these applications. Project outcomes will be new technologies to underpin next generation packet-based networks. |
DP0665742 Construction Methods and Analysis Tools for
Repeat-Accumulate Error Correction Codes
|
2006 - 2008
|
$112,000 |
Chief Investigator: Sarah Johnson
|
| Summary: Error correction codes play a crucial role in digital communications technologies delivering essentially error free information transmission over noisy channels. Exciting breakthroughs in the mid 1990's saw a fundamental shift in error correction technologies with the advent of turbo codes, and rediscovery of low-density parity-check (LDPC) codes. Repeat-accumulate (RA) codes are new, promising "turbo-like" codes, offering the transmitter-side simplicity of turbo codes and the decoding power and efficiency of LDPC codes. This project will develop construction methods and analysis tools for RA codes, and in so doing deliver technologies for future digital communications applications from data storage to wireless networks. |
| DP0449627 Design and decoding of low-density parity-check codes |
2004 - 2006
|
$257,466
|
Chief Investigators: Steven Weller and Sarah Johnson
|
|
Summary: The promise of essentially error-free information transmission is a cornerstone of digital communications. Next-generation applications demand increasingly effective error correction, yet traditional systems fall well short of fundamental capacity limits established some fifty years ago. Exciting breakthroughs in the mid-1990s delivered capacity-approaching codes on graphs employing iterative decoding algorithms, including low-density parity-check (LDPC) codes. This project applies techniques from discrete mathematics to design structured LDPC coding schemes for widespread implementation. Outcomes of this research will be new LDPC codes, encoding algorithms and analysis techniques for applications including wireless networks, data storage and Internet communications. |
Australian Communications
Research Network
(ACoRN)
|
2004 - 2009
|
$1,500,000 |
|