Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Brodzik, A.K. Tolimieri, R. |
| Copyright Year | 1963 |
| Abstract | Previously, a discretization of the linear FM chirp of length N=KL 2, L and KL isin Z, was given and the conditions for its minimal Zak space support were derived. Chirps satisfying these conditions are known as finite chirps. In this work, subsets of finite chirps of length N=L 2, L a prime, are examined. The investigation leads to a new, Zak space construction of general polyphase sequence sets of size L-1 with optimal auto and cross-correlation properties, known as perfect sequence sets. It is shown that perfect sequence sets are closely related to sets of finite chirps and, in particular, include the sets of Zadoff-Chu sequences (which are identical with subsets of finite chirps) and the sets of generalized Frank sequences (which are identical with sets of modulations of finite chirps), as special cases. The entire collection of perfect sequence sets is then given by a partition of the set of perfect auto correlation sequences, obtained by right coset decomposition of the group of all permutations with respect to a certain cyclic group. The construction suggests several further generalizations that can be obtained by operating exclusively on subgroups of the permutation group. |
| Sponsorship | IEEE Information Theory Society |
| Starting Page | 1804 |
| Ending Page | 1814 |
| Page Count | 11 |
| File Size | 832344 |
| File Format | |
| ISSN | 00189448 |
| Volume Number | 55 |
| Issue Number | 4 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2009-04-01 |
| Publisher Place | U.S.A. |
| Access Restriction | One Nation One Subscription (ONOS) |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | Autocorrelation Spread spectrum radar Chirp modulation Signal representations Radar applications Sonar applications Linear systems Parameter estimation Real time systems Frequency Zadoff-Chu sequences Bat chirp cross-correlation finite chirp finite Zak transform linear FM chirp perfect sequence sets permutations polyphase sequences sparse signal representations |
| Content Type | Text |
| Resource Type | Article |
| Subject | Library and Information Sciences Information Systems Computer Science Applications |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|