### Abstract

It is well known that the sphere decoder has polynomial complexity at high signal to noise ratio (SNR). However, the worst case complexity is exponential leading to severe decoding time delay. In this paper, we present a scheme to overcome the worst case complexity of the sphere decoder. If the number of visited lattice points reaches the threshold, the detected symbol vector is determined between two candidate symbol vectors. One candidate symbol vector is obtained from the demodulated output of ZF receiver which is initial stage of the sphere decoder. The other candidate symbol vector consists of two sub-symbol vectors. The first sub-symbol vector consists of lately visited lattice points running from the most upper layer. The second one contains corresponding demodulated outputs of zero-forcing (ZF) receiver. Between these two candidate symbol vectors, the one with smaller Euclidean distance to the received symbol vector is chosen as detected symbol vector. In addition, we show the upper bound of symbol error rate (SER) performance for the sphere decoder using the proposed scheme. In the simulation, the proposed scheme shows the significant reduction of the worst case complexity while having negligible SER performance degradation.

Original language | English |
---|---|

Title of host publication | Proceedings - CIS Workshops 2007, 2007 International Conference on Computational Intelligence and Security Workshops, CISW 2007 |

Pages | 85-89 |

Number of pages | 5 |

Volume | 1 |

Publication status | Published - 2007 Dec 1 |

Event | 2007 International Conference on Future Generation Communication and Networking, FGCN 2007 - Jeju Island, Korea, Republic of Duration: 2007 Dec 6 → 2007 Dec 8 |

### Other

Other | 2007 International Conference on Future Generation Communication and Networking, FGCN 2007 |
---|---|

Country | Korea, Republic of |

City | Jeju Island |

Period | 07/12/6 → 07/12/8 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computer Science Applications
- Software
- Electrical and Electronic Engineering

### Cite this

*Proceedings - CIS Workshops 2007, 2007 International Conference on Computational Intelligence and Security Workshops, CISW 2007*(Vol. 1, pp. 85-89). [4426099]

}

*Proceedings - CIS Workshops 2007, 2007 International Conference on Computational Intelligence and Security Workshops, CISW 2007.*vol. 1, 4426099, pp. 85-89, 2007 International Conference on Future Generation Communication and Networking, FGCN 2007, Jeju Island, Korea, Republic of, 07/12/6.

**Complexity limited sphere decoder and its ser performance analysis.** / Eun, Sung Jeon; Jang, Hoon Yang; Dong, Ku Kim.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Complexity limited sphere decoder and its ser performance analysis

AU - Eun, Sung Jeon

AU - Jang, Hoon Yang

AU - Dong, Ku Kim

PY - 2007/12/1

Y1 - 2007/12/1

N2 - It is well known that the sphere decoder has polynomial complexity at high signal to noise ratio (SNR). However, the worst case complexity is exponential leading to severe decoding time delay. In this paper, we present a scheme to overcome the worst case complexity of the sphere decoder. If the number of visited lattice points reaches the threshold, the detected symbol vector is determined between two candidate symbol vectors. One candidate symbol vector is obtained from the demodulated output of ZF receiver which is initial stage of the sphere decoder. The other candidate symbol vector consists of two sub-symbol vectors. The first sub-symbol vector consists of lately visited lattice points running from the most upper layer. The second one contains corresponding demodulated outputs of zero-forcing (ZF) receiver. Between these two candidate symbol vectors, the one with smaller Euclidean distance to the received symbol vector is chosen as detected symbol vector. In addition, we show the upper bound of symbol error rate (SER) performance for the sphere decoder using the proposed scheme. In the simulation, the proposed scheme shows the significant reduction of the worst case complexity while having negligible SER performance degradation.

AB - It is well known that the sphere decoder has polynomial complexity at high signal to noise ratio (SNR). However, the worst case complexity is exponential leading to severe decoding time delay. In this paper, we present a scheme to overcome the worst case complexity of the sphere decoder. If the number of visited lattice points reaches the threshold, the detected symbol vector is determined between two candidate symbol vectors. One candidate symbol vector is obtained from the demodulated output of ZF receiver which is initial stage of the sphere decoder. The other candidate symbol vector consists of two sub-symbol vectors. The first sub-symbol vector consists of lately visited lattice points running from the most upper layer. The second one contains corresponding demodulated outputs of zero-forcing (ZF) receiver. Between these two candidate symbol vectors, the one with smaller Euclidean distance to the received symbol vector is chosen as detected symbol vector. In addition, we show the upper bound of symbol error rate (SER) performance for the sphere decoder using the proposed scheme. In the simulation, the proposed scheme shows the significant reduction of the worst case complexity while having negligible SER performance degradation.

UR - http://www.scopus.com/inward/record.url?scp=52249089237&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=52249089237&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:52249089237

SN - 0769530486

SN - 9780769530482

VL - 1

SP - 85

EP - 89

BT - Proceedings - CIS Workshops 2007, 2007 International Conference on Computational Intelligence and Security Workshops, CISW 2007

ER -