Abstract:
A method to convert binary to pseudo-ternary sequences is proposed. The method keeps run-length constraints imposed on finite-length binary sequence and also provides a u...Show MoreMetadata
Abstract:
A method to convert binary to pseudo-ternary sequences is proposed. The method keeps run-length constraints imposed on finite-length binary sequence and also provides a unit value of a channel transition. The resulting finite-length pseudo-ternary sequence has exponential sums falling within specified regions. This allows spectrum shaping. The average power spectral density of infinite sequences obtained by concatenating spectrally-constrained sequences is examined. Thus we obtain the pseudo-ternary spectrum shaped code, which generally yields higher capacity than the binary one.
Published in: 2013 IEEE International Symposium on Information Theory
Date of Conference: 07-12 July 2013
Date Added to IEEE Xplore: 07 October 2013
Electronic ISBN:978-1-4799-0446-4