CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Design and Implementation of the Ternary Sequences with Good Merit Factor Values

by Naga Jyothi Aggala, Raja Rajeswari K
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 92 - Number 9
Year of Publication: 2014
Authors: Naga Jyothi Aggala, Raja Rajeswari K
10.5120/16035-4721

Naga Jyothi Aggala, Raja Rajeswari K . Design and Implementation of the Ternary Sequences with Good Merit Factor Values. International Journal of Computer Applications. 92, 9 ( April 2014), 5-7. DOI=10.5120/16035-4721

@article{ 10.5120/16035-4721,
author = { Naga Jyothi Aggala, Raja Rajeswari K },
title = { Design and Implementation of the Ternary Sequences with Good Merit Factor Values },
journal = { International Journal of Computer Applications },
issue_date = { April 2014 },
volume = { 92 },
number = { 9 },
month = { April },
year = { 2014 },
issn = { 0975-8887 },
pages = { 5-7 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume92/number9/16035-4721/ },
doi = { 10.5120/16035-4721 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:13:49.531663+05:30
%A Naga Jyothi Aggala
%A Raja Rajeswari K
%T Design and Implementation of the Ternary Sequences with Good Merit Factor Values
%J International Journal of Computer Applications
%@ 0975-8887
%V 92
%N 9
%P 5-7
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The pulse compression codes with low autocorrelation sidelobe levels and high Merit Factor (MF) are useful in radar, channel estimation and spread spectrum communication applications. One of the main criteria of good pulse compression is MF. A sequence with high MF can be considered as best sequence. In this paper an efficient VLSI architecture is proposed for generation and implementation of the ternary sequences using Finite State Machines [FSM]. This VLSI architecture is implemented on the FPGA as it provides the flexibility of reconfigurability and reprogramability The ternary pulse compression sequence elements are +1,0,-1. Ternary sequences have superior MF compared to binary sequences but cannot be transmitted with existing technology. For transmission of ternary sequences, they must be coded into binary sequences. The binary sequence is chosen such that each of these bi-alphabetic interpretations leads to high MF. At the received section again the received sequence has to be decoded from binary to ternary. The VLSI architecture for implementing ternary codes has been authored in VHDL and the synthesis was done with Xilinx XST, ISE Foundation 12. 1i has been used for performing mapping, placing and routing.

References
  1. Levanon. N, Eli Mozeson, "Radar Signals", Wiley, New York, 2004
  2. R. H. Barker, "Group synchronizing of binary digital systems, in Communication theory", Butterworth, London, 1953, pp. 273-287.
  3. Balaji, N. , K. Subba Rao, and M. Srinivasa Rao. "FPGA implementation of ternary pulse compression sequences with superior merit factors. " NAUN international Journal of Circuits, systems and signal processing 2. 3 (2009): 47-54.
  4. Griep, Karl R. , James A. Ritcey, and John J. Burlingame. "Poly-phase codes and optimal filters for multiple user ranging. " Aerospace and Electronic Systems, IEEE Transactions on 31. 2 (1995): 752-767
  5. Ipatov, V. P. "Ternary sequences with ideal periodic autocorrelation properties. "Radio Engineering and Electronic Physics 24 (1979): 75-79.
  6. Ipatov, V. P. , V. D. Platonov, and I. M. Samilov. "A new class of ternary sequences with ideal periodic autocorrelation properties. " Soviet Math. (Izvestiya Vuz) English Translation 27 (1983): 57-61.
  7. Moharir, P. "Generalized PN sequences (Corresp. ). " Information Theory, IEEE Transactions on 23. 6 (1977): 782-784
  8. Shedd, D. , and D. Sarwate. "Construction of sequences with good correlation properties (Corresp. ). " Information Theory, IEEE Transactions on 25. 1 (1979): 94-97.
  9. Helleseth, Tor. "Some results about the cross-correlation function between two maximal linear sequences. " Discrete Mathematics 16. 3 (1976): 209-232.
  10. Hoholdt, Tom, and Jørn Justesen. "Ternary sequences with perfect periodic autocorrelation (Corresp. ). " Information Theory, IEEE Transactions on 29. 4 (1983): 597-600.
  11. Krokhin, Andrei, Andrei Bulatov, and Peter Jeavons. "Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey. "Multiple-Valued Logic, 2003. Proceedings. 33rd International Symposium on. IEEE, 2003
  12. Blakley, J. J. "Architecture for hardware implementation of programmable ternary de Bruijn sequence generators. " Electronics Letters 34. 25 (1998): 2389-2390
  13. Pasha, I. A. , P. S. Moharir, and N. Sudarshan Rao. "Bi-alphabetic pulse compression radar signal design. " Sadhana 25. 5 (2000): 481-488.
  14. Lei, Zhongding, Francois Chin, and Yuen-Sam Kwok. "UWB ranging with energy detectors using ternary preamble sequences. " Wireless Communications and Networking Conference, 2006. WCNC 2006. IEEE. Vol. 2. IEEE, 2006.
  15. J. von Neumann, "Various techniques used in connection with randomdigits", Appl. Math. Ser. , Notes by G. E. Forstyle, Nat. Bur. Stand. , vol. 12, pp. 36-38, 1951
  16. P. Elias, "The efficient construction of an unbiased random sequence",Ann. Math. Statist. , vol. 43, pp. 865-870, 1972.
  17. S. Pae and M. C. Loui, "Optimal random number generation from a biased coin", in Proc. Sixteenth Annu. ACM-SIAM Symp. Discrete Algorithms, pp. 1079C1088, 2005.
  18. D. Knuth and A. Yao, "The complexity of nonuniform random numbergeneration", Algorithms and Complexity: New Directions and RecentResults, pp. 357-428, 1976.
  19. Zhao, Hongchao, and Jehoshua Bruck. "Efficiently Generating Random Bits from Finite State Markov Chains. " (2010).
  20. M. Blum, "Independent unbiased coin flips from a correlated biased source: a finite state Markov chain", Combinatorica, vol. 6, pp. 97-108,1986
  21. Y. Peres, "Iterating von Neumann's procedure for extracting random bits",Ann. Statist. , vol 20, pp. 590-597, 1992
  22. S. Pae and M. C. Loui, "Optimal random number generation from a biased coin", in Proc. Sixteenth Annu. ACM-SIAM Symp. Discrete Algorithms, pp. 1079C1088, 2005.
  23. B. Y. Ryabko and E. Matchikina, "Fast and efficient construction of an unbiased random sequence", IEEE Trans. on Information Theory, vol. 46, pp. 1090-1093, 2000.
  24. Moharir, P. S. , "Signal Design" Journal of IETE, Vol. 41, Oct. 1976, pp. 381-398
  25. Moharir, P. S. , R. Singh, and V. M. Maru. "SKH algorithm for signal design. "Electronics letters 32. 18 (1996): 1648.
  26. Wayne Tomasi "Electronic Communications System Fundamentals through Advanced . 5th edition, Pearson Education, 2008.
  27. Rajski J, Tyszer J, "On the diagnostic properties of linear feedback shift registers", ISSN : 0278-0070, IEEE @ 06 August 2002
  28. Naga Jyothi. A. , and K. Raja Rajeswari. , "Implementation and Generation of Barker and nested Barker codes" ARCNET-2013, NSTL Visakhapatnam
Index Terms

Computer Science
Information Sciences

Keywords

Ternary sequences Pulse Compression Merit Factor (MF) Finite State Machines (FSM) Auto Correlation Function(ACF) Algorithmic State Machines(ASM).

Powered by PhDFocusTM