{"title":"A class of time-frequency product optimized biorthogonal wavelet filter banks","authors":"R. Kolte, P. Patwardhan, V. Gadre","doi":"10.1109/NCC.2010.5430198","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430198","url":null,"abstract":"The time-frequency product of any function in L2 (R) is bounded by the uncertainty principle. This paper presents a method to design linear phase biorthogonal filter banks with the time-frequency localization as the optimality criterion. The design philosophy is to optimize the time-frequency product of the iterated wavelet, after fixing the number of vanishing moments of the analysis and synthesis lowpass filters, by adjusting a single parameter.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"24 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131179778","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":"Opportunistic splitting for scheduling via stochastic approximation","authors":"V. Joseph, V. Sharma, U. Mukherji","doi":"10.1109/NCC.2010.5430174","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430174","url":null,"abstract":"We consider the problem of scheduling a wireless channel among multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128793089","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":"Common architecture for decoding turbo and LDPC codes","authors":"T. S. Gautham, A. Thangaraj, D. Jalihal","doi":"10.1109/NCC.2010.5430239","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430239","url":null,"abstract":"Turbo codes and Low Density Parity Check (LDPC) codes have been shown to be practical codes that can approach Shannon capacity in several communication systems. In terms of performance and implementation complexity, LDPC codes and turbo codes are highly comparable, especially at coding rates around 1/2. In many recent wireless standards such as 3GPP LTE and WiMax, both turbo and LDPC codes have been recommended at the encoder. However, the decoder for turbo codes involves trellises and the BCJR algorithm, while the decoder for LDPC codes uses sparse graphs and the message passing algorithm. Therefore, in several implementations, a designer is forced to implement either the turbo decoder or the LDPC decoder. The main idea behind this work is to enable the implementation of both decoders using a common architecture. We view the constituent convolutional code in a turbo code as a block code, and construct a sparse parity check matrix for it. Then, the sparse matrix and the associated bipartite graph are used for decoding the convolutional code by soft message passing algorithms. Simulation results show a manageable degradation in performance with a reduction in complexity.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"28 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123274198","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":"An algorithm for distributed cooperative precoder selection in a cellular network","authors":"J. Vinosh, Babu James, B. Ramamurthi, V. Ganesh","doi":"10.1109/NCC.2010.5430220","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430220","url":null,"abstract":"The performance in the downlink of a reuse 1:1 cellular wireless system is severely degraded due to the interference originating from adjacent cell sites. Even the spectral efficiency gains due to MIMO vanish for cell-edge users who are interference limited. Cooperative MIMO, which involves coordination amongst base stations serving adjacent cell-sites, is a promising technique to address the co-channel interference problem. In this paper, we study cooperation in the downlink of an interference channel. The basestations cooperate amongst themselves to arrive separately at precoding strategies which improve the signal-to-interference-and-noise ratio of the cell-edge users and hence the throughput. We propose a distributed algorithm that independently determines the precoder which mitigates the interference to the neighboring cell edge users without compromising on the in-cell performance. This algorithm requires only modest levels of on-air-feedback and information exchange among the basestations on the backhaul networks.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128106297","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":"Null-space Exploiting channel shortening prefilter (NE-CSP) for MIMO-OFDM","authors":"Istdeo Singh, K. Giridhar","doi":"10.1109/NCC.2010.5430184","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430184","url":null,"abstract":"In OFDM system, with fixed cyclic prefix (CP) length, inter block interference (IBI) and inter carrier interference will be present if the channel impulse response (CIR) is larger than the CP length. This problem can be mitigated by design a time domain filter at the receiver, which can shorten or shape the effective CIR to become less than the CP length. This paper proposes a novel method to design a channel shortening prefilter (CSP) for MIMO-OFDM systems, by defining a measurement model which has an underdetermined set of equations. This model is always applicable when the number of transmit antennas (actually transmit streams) is less than the number of receive antennas. The proposed Null-space Exploiting CSP (NE-CSP) removes the IBI and ICI nearly completely, but in the simplest form, has a loss in diversity. It is possible to reclaim this diversity by using the multiple layers (or filters) within the NE-CSP structure. Simulation results indicate that, compared to existing channel truncation methods, the NE-CSP is not only computationally attractive, but can also gives a gain of 3dB to 5dB in bit error rate performance (BER) performance at high SNRs.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134370868","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":"On the use of perceptual Line Spectral Pairs Frequencies for speaker identification","authors":"Md. Sahidullah, G. Saha","doi":"10.1109/NCC.2010.5430208","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430208","url":null,"abstract":"Line Spectral Pairs Frequencies (LSFs) provide an alternative representation of the linear prediction coefficients. In this paper an investigation is carried out for extracting feature for speaker identification task which is based on perceptual analysis of speech signal and LSF. A modified version of the standard perceptual analysis is applied to obtain better performance. We have extracted the conventional LSF from the perceptually modified speech signal. State-of-the art Gaussian Mixture Model (GMM) based classifier is employed to design the closed set speaker identification system. The proposed method shows significant performance improvement over existing techniques in three different speech corpuses.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"20 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129088779","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}
Abhijit Pradhan, Sadhana Chevireddy, Kamakoti Veezhinathan, H. Murthy
{"title":"A low-bit rate segment vocoder using minimum residual energy criteria","authors":"Abhijit Pradhan, Sadhana Chevireddy, Kamakoti Veezhinathan, H. Murthy","doi":"10.1109/NCC.2010.5430195","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430195","url":null,"abstract":"In speech coding, segment vocoders offer good intelligibility at low bit rates. A segment vocoder has four basic components 1)Segmentation of input speech 2)Segment quantization 3)Residual quantization 4)Synthesis of speech. Most segment vocoders use a recognition approach to segment quantization. In this paper, we assume a different approach to segment quantization. The segmental unit is a syllable and the segment codebook stores the sequence of LPC vectors. During the encoding process the speech segment is quantized using the sequence of LPC vectors that result in the smallest residual energy. PESQ scores indicate that this vocoder achieves better quality compared to that of a corresponding vocoder that uses a speech recognition framework.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126928369","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":"Impact of UWB interference on IEEE 802.11a WLAN system","authors":"Santosh Reddy Mallipeddy, R. S. Kshetrimayum","doi":"10.1109/NCC.2010.5430217","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430217","url":null,"abstract":"The objective of this paper is to assess the effects of multiple UWB devices emission on the IEEE 802.11a WLAN receiver. The data rates and SINR of WLAN is evaluated with and without the UWB interference. Approximate path loss model is used to calculate the UWB signal power that interferes with the WLAN system. The three dimensional hemispherical distribution of UWB tramsmitters around the victim WLAN receiver is considered. Based on this model, the analytical analysis to assess the effect of the multiple UWB devices emission on the IEEE 802.11a system is presented.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127095736","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":"EG-LDPC codes for the erasure wiretap channel","authors":"V. Rajaraman, A. Thangaraj","doi":"10.1109/NCC.2010.5430240","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430240","url":null,"abstract":"The wiretap channel model, proposed by Wyner, has been studied by various authors from the perspectives of security, reliability and cryptographic protocols. A basic theme of these discussions has been information theoretically secure communication whose degree of secrecy can be theoretically proved. This paper explains a practical implementation of Euclidean Geometry (EG) — Low Density Parity Check (LDPC) codes for wiretap channels of type I and II. The focus has been on efficient encoding and decoding by taking advantage of the cyclic nature of EG codes. The generalized Hamming weights of EG codes can be bounded using those of primitive BCH codes. This provides security guarantees for EG codes in wiretap channels. The asymptotic threshold analysis from the LDPC viewpoint provides added guarantees at long blocklengths. Overall, EG-LDPC codes are promising candidates for low-complexity coding over wiretap channels.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126613798","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 approach to generate up-sampled tomographic images using combination of rotated hexagonal lattices","authors":"N. Dixit, J. Sivaswamy","doi":"10.1109/NCC.2010.5430202","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430202","url":null,"abstract":"Generation of upsampled tomographic images via combination of rotated lattices has been explored in [1]. In this paper, we evaluate the existing method using real phantom data. Up-sampled tomographic images are generated via combination of rotated hexagonal lattices. Sinogram data is filtered and back-projected on two hexagonal lattices which are rotated versions of each other. Samples from these lattices are interpolated to generate an up-sampled image defined on a square lattice. These results are compared with direct up-sampling method and image ISR-2 algorithm described in [10]. Two PET phantoms — NEMA and Hoffman brain phantom are used for purpose of evaluation. The results of the proposed method show considerable improvement over direct up-sampled image in terms of contrast, sharpness and imaging artifact; but when compared with ISR-2 generated image, the difference in image quality is not significant. A key advantage of the proposed method is that only two images are required for generating a high resolution image whereas ISR-2 requires k low resolution images for an up-sampling factor of k.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125526874","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}