Hossein Afshari, Abdulkadir Akin, Vladan Popovic, A. Schmid, Y. Leblebici
{"title":"Real-Time FPGA Implementation of Linear Blending Vision Reconstruction Algorithm Using a Spherical Light Field Camera","authors":"Hossein Afshari, Abdulkadir Akin, Vladan Popovic, A. Schmid, Y. Leblebici","doi":"10.1109/SiPS.2012.49","DOIUrl":"https://doi.org/10.1109/SiPS.2012.49","url":null,"abstract":"A custom spherical light-field camera used as a polydioptricsystem where imagers are distributed over a spherical geometry, each having its own vision of the surrounding and distinct focal plane. The spherical light-field camera is also an omnidirectional camera which records light information fro many direction around its center. A novel linear blending technique is presented for vision reconstruction of a virtual observer located inside the spherical geometry of this camera. This blending technique improves the output quality of the reconstructed vision with respect to the ordinary stitching technique. A novel pixel gridding scheme is presented for rectangular displaying of the reconstructed vision induced from the spherical light field camera. This gridding technique preserve the correct size of objects when mapped on the spherical geometry of the Panoptic system. A hardware architecture based on FPGAs with the real-time implementation of the linear blending algorithm and the new pixel gridding scheme of the spherical light-field camera are presented along with imaging results.","PeriodicalId":286060,"journal":{"name":"2012 IEEE Workshop on Signal Processing Systems","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133613525","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Kolmogorov-Smirnov Test for Spectrum Sensing: From the Statistical Test to Energy Detection","authors":"R. Maršálek, K. Povalac","doi":"10.1109/SiPS.2012.58","DOIUrl":"https://doi.org/10.1109/SiPS.2012.58","url":null,"abstract":"Spectrum sensing belongs to important parts of Cognitive Radio (CR) chain. Many different spectrum sensing methods are known. One of the recently proposed approaches to spectrum sensing in cognitive radio systems is based on the Kolmogorov-Smirnov statistical (K-S) test. Statistical K-S test is classified as a non-parametric method to measure the goodness of fit between two distribution functions - the one of the received communication signal and the second of the channel noise. We assume the cumulative distribution function of the noise corresponds to the Additive White Gaussian Noise (AWGN) and is known in advance. The paper discusses two modifications of the Kolmogorov-Smirnov test - the first with the removed information about the signal energy and the second taking it into account for decision. The experimental results prove the robustness of the algorithm for different kinds of received signals.","PeriodicalId":286060,"journal":{"name":"2012 IEEE Workshop on Signal Processing Systems","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130019300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Noise-Resistant Mobile Positioning System Based on Code-Aided RSS Estimation","authors":"Kai-Ting Shr, Li-Hong Huang, Yuan-Hao Huang","doi":"10.1109/SiPS.2012.25","DOIUrl":"https://doi.org/10.1109/SiPS.2012.25","url":null,"abstract":"In recent years, research on mobile positioning techniques in wireless communications systems attracts a lot of interest due to the growing use of location-based applications for smart phones. This research proposes a code-aided received signal strength (RSS) estimator for a network-based positioning system. The proposed RSS estimator derives the channel noise by accumulating the minimum path metrics of the Viterbi decoder and then refines the RSS value as the input to the particle filter at each base station. Afterwards, the calculated distances at base stations are processed by convex optimization to locate the mobile device. This work develops a system to verify the positioning performance in the urban area. The simulation results show that the proposed system with the code-aided RSS estimation has 20 to 60-meter better performance than the same system with raw RSS information when SNR is smaller than 4dB. Compared to other corresponding SNR estimation methods, the proposed RSS estimation technique also has better performance especially in the lower SNR conditions.","PeriodicalId":286060,"journal":{"name":"2012 IEEE Workshop on Signal Processing Systems","volume":"552 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115614619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Novel Fast High Resolution Music Algorithm","authors":"M. Bouri","doi":"10.1109/SiPS.2012.37","DOIUrl":"https://doi.org/10.1109/SiPS.2012.37","url":null,"abstract":"The paper describes new techniques to determine the number of sources for a signal based on LU and QR decomposition. We propose novel methods to calculate the threshold for noise subspace estimation used in high resolution array processing methods without eigenvalue decomposition. The paper states that previous techniques primarily use eigenvectors and eigenvalues. We propose an approximation of MUSIC algorithm. This approximation decreases the computational complexity. A full mathematical evaluation of the technique is provided and simulations show that the approach is effective.","PeriodicalId":286060,"journal":{"name":"2012 IEEE Workshop on Signal Processing Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121056672","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
K. Gettings, Andrew K. Bolstad, Show-Yah Stuart Chen, M. Ericson, B. Miller, M. Vai
{"title":"Low Power Sparse Polynomial Equalizer (SPEQ) for Nonlinear Digital Compensation of an Active Anti-Alias Filter","authors":"K. Gettings, Andrew K. Bolstad, Show-Yah Stuart Chen, M. Ericson, B. Miller, M. Vai","doi":"10.1109/SiPS.2012.45","DOIUrl":"https://doi.org/10.1109/SiPS.2012.45","url":null,"abstract":"We present an efficient architecture to perform on-chip non-linear equalization of an anti-alias RF filter. The sparse polynomial equalizer (SPEq) achieves substantial power savings through co-design of the equalizer and the filter, which allows including the right number of processing elements, filter taps, and bits to maximize performance and minimize power consumption. The architecture was implemented in VHDL and fabricated in CMOS 65 nm technology. Testing results show that undesired spurs are suppressed to near the noise floor, improving the system's spur-free dynamic range by 25 dB in the median case, and consuming less than 12 mW of core power when operating at 200 MHz.","PeriodicalId":286060,"journal":{"name":"2012 IEEE Workshop on Signal Processing Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130530432","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Chen Mei, Min Li, Peng Cao, Amir Amin, Chunshu Li, S. Pollin, Jun Yang
{"title":"Exploration of Full HD Media Decoding on SDR Baseband Processor","authors":"Chen Mei, Min Li, Peng Cao, Amir Amin, Chunshu Li, S. Pollin, Jun Yang","doi":"10.1109/SiPS.2012.48","DOIUrl":"https://doi.org/10.1109/SiPS.2012.48","url":null,"abstract":"In recent years, many SDR base band processors have been proposed to meet the high performance and programmability requirement for emerging wireless communications. To be able to support hundreds of Mbps or even Gbps wireless communications, such SDR base band processors often have massive parallel computation capability. This promising processing capability may also be exploited for other types of signal processing tasks. Our work explores the feasibility of performing challenging media processing on SDR base band processors. In this paper, we will show exploratory experiments for supporting full HD H.264/AVC media decoding on a recent version of ADRES based SDR base band processor. Two computational dominant tasks, motion compensation and deblocking filter, have been selected to experiment on the processor. These two blocks account about 80% of the total execution time. Since the processor is designed to be wireless domain specific, algorithm and architecture co-optimizations are crucial to make the goal feasible. Results show that, with limited architecture extension, the ADRES based base band processor achieves very competitive performance and efficiency even when compared with several architectures that are specifically optimized for the media decoding.","PeriodicalId":286060,"journal":{"name":"2012 IEEE Workshop on Signal Processing Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128418451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Chun-Fu Chen, G. Lee, Jui-Che Wu, Ching-Jui Hsiao, Jun-Yuan Ke
{"title":"Variable Block Size Motion Estimator Design for Scan Rate Up-convertor","authors":"Chun-Fu Chen, G. Lee, Jui-Che Wu, Ching-Jui Hsiao, Jun-Yuan Ke","doi":"10.1109/SiPS.2012.30","DOIUrl":"https://doi.org/10.1109/SiPS.2012.30","url":null,"abstract":"Variable block size motion estimator (VBSME) for scan rate up-convertor (SRUC) based on the algorithm/architecture co-exploration (AAC) design methodology is presented in this paper. Due to the concurrent exploration of both algorithm and architecture, the designed system requires comparatively less computations and hardware cost but is capable of enhancing the accuracy of motion vector (MV) by refining MV from coarse-grained to fine-grained. The proposed algorithm generates the fine-grained MVs to produce the high quality results especially for the videos with high motion. Benefiting from AAC, we back-annotate the architectural information to algorithm to revise the proposed algorithm and then make the proposed algorithm be mapped onto the targeted platform smoothly. Hence, the SRUC system is able to convert the frame rate from 60 fps up to 120 fps at full HD (1920¡Ñ1080) resolution was successfully implemented and verified on field-programmable array gate (FPGA). This SRUC system's performance has been shown to surpass those state-of-arts and its hardware cost is less than the related works as stated in the literature.","PeriodicalId":286060,"journal":{"name":"2012 IEEE Workshop on Signal Processing Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130842804","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kosuke Mizuno, Yosuke Terachi, Kenta Takagi, S. Izumi, H. Kawaguchi, M. Yoshimoto
{"title":"Architectural Study of HOG Feature Extraction Processor for Real-Time Object Detection","authors":"Kosuke Mizuno, Yosuke Terachi, Kenta Takagi, S. Izumi, H. Kawaguchi, M. Yoshimoto","doi":"10.1109/SiPS.2012.57","DOIUrl":"https://doi.org/10.1109/SiPS.2012.57","url":null,"abstract":"This paper describes a Histogram of Oriented Gradients (HOG) feature extraction processor for HDTV resolution video (1920 × 1080 pixels). It features a simplified HOG algorithm with cell-based scanning and simultaneous Support Vector Machine (SVM) calculation, cell-based pipeline architecture, and parallelized modules. To evaluate the effectiveness of our approach, the proposed architecture is implemented onto a FPGA prototyping board. Results show that the proposed architecture can generate HOG features and detect objects with 40 MHz for SVGA resolution video (800 ~ 600 pixels) at 72 frames per second (fps). The proposed schemes are easily expandable to HDTV resolution video at 30 fps with 76.2 MHz if a high-resolution camera and higher operating frequency are available.","PeriodicalId":286060,"journal":{"name":"2012 IEEE Workshop on Signal Processing Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128371128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Effects of Varying Message Precision in Digit-Online LDPC Decoders","authors":"P. Marshall, V. Gaudet, D. Elliott","doi":"10.1109/SiPS.2012.32","DOIUrl":"https://doi.org/10.1109/SiPS.2012.32","url":null,"abstract":"Increasing the pipeline depth of bit-parallel message-passing low-density parity-check (LDPC) decoders can be done by increasing the number of simultaneously decoded frames, or by decreasing the amount of parallelism in the decoder. In digit-serial decoders, the pipeline depth can also be increased by increasing message precision. Digit-online decoders are a class of digit-serial decoders that use redundant notation to allow for most-significant-digit-first processing of LLR messages. This paper examines the effect of changing the precision of LLRs on the throughput, area and energy efficiency of digit-online decoders for the irregular WiMAX rate 3/4A length 1056 block code. Both single-frame and frame-interlaced decoding are considered. Digit-online decoders have a throughput that is largely independent of message precision. Frame-interlaced decoding has a higher throughput than single-frame, but has an increased energy/bit cost.","PeriodicalId":286060,"journal":{"name":"2012 IEEE Workshop on Signal Processing Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127529839","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Simplified Multi-Level Quasi-Cyclic LDPC Codes for Low-Complexity Encoders","authors":"A. Mahdi, Vassilis Paliouras","doi":"10.1109/SiPS.2012.21","DOIUrl":"https://doi.org/10.1109/SiPS.2012.21","url":null,"abstract":"In this paper we propose a parity check matrix construction technique that simplifies the hardware encoders for Multi-Level-Quasi-Cyclic (ML-QC) LDPC codes. The proposed construction method is based on semi-random - ML-QC extension and appropriately selects shifting factors to reduce the density of the inverted matrix used in several encoding algorithms. The construction method derives low-complexity encoders with minimal degradation of error-correction performance, observable at low BER only. Furthermore a VLSI encoding architecture based on the suggested parity-check matrix (PCM) is also introduced. Experimental results show that the complexity of the proposed encoders depends on the density of the binary base matrix. A comparison with random QC codes reveals substantial complexity reduction without performance degradation for cases of practical interest. In fact a hardware complexity reduction by a factor of 7.5 is achieved, combined with the acceleration of the encoder, for certain cases.","PeriodicalId":286060,"journal":{"name":"2012 IEEE Workshop on Signal Processing Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121558093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}