{"title":"带宽高效CPFSK/CPM调制的简化相干检测","authors":"S. Simmons","doi":"10.1109/PACRIM.1991.160709","DOIUrl":null,"url":null,"abstract":"A new unified approach is taken in which simple low-pass filters are used after quadrature demodulation, and are followed by a sampler and reduced-computation sequence estimation algorithm. As the number of samples per baud increases, optimal performance is closely approached. The computational complexity can be minimized by choosing a narrow filter that actually modifies the received signal shapes; the sequence estimation algorithm accounts for introduced ISI. It is shown for representative modulations that near-optimal performance can be achieved with simple low-pass filtering, just two samples per baud, and trellis search with only a few survivor paths.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Simplified coherent detection of bandwidth-efficient CPFSK/CPM modulations\",\"authors\":\"S. Simmons\",\"doi\":\"10.1109/PACRIM.1991.160709\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new unified approach is taken in which simple low-pass filters are used after quadrature demodulation, and are followed by a sampler and reduced-computation sequence estimation algorithm. As the number of samples per baud increases, optimal performance is closely approached. The computational complexity can be minimized by choosing a narrow filter that actually modifies the received signal shapes; the sequence estimation algorithm accounts for introduced ISI. It is shown for representative modulations that near-optimal performance can be achieved with simple low-pass filtering, just two samples per baud, and trellis search with only a few survivor paths.<<ETX>>\",\"PeriodicalId\":289986,\"journal\":{\"name\":\"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-05-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.1991.160709\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.1991.160709","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Simplified coherent detection of bandwidth-efficient CPFSK/CPM modulations
A new unified approach is taken in which simple low-pass filters are used after quadrature demodulation, and are followed by a sampler and reduced-computation sequence estimation algorithm. As the number of samples per baud increases, optimal performance is closely approached. The computational complexity can be minimized by choosing a narrow filter that actually modifies the received signal shapes; the sequence estimation algorithm accounts for introduced ISI. It is shown for representative modulations that near-optimal performance can be achieved with simple low-pass filtering, just two samples per baud, and trellis search with only a few survivor paths.<>