{"title":"Minimum probability of error demodulation for uplink MC-CDMA","authors":"P. Dayal, A. Mahanta, U. Desai","doi":"10.1109/SPCOM.2004.1458495","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458495","url":null,"abstract":"Multi-carrier code division multiple access (MC-CDMA) is an attractive choice for high speed wireless communication as it mitigates the problem of intersymbol interference (ISI) inherent in code division multiple access (CDMA) and also exploits frequency diversity unlike orthogonal frequency division multiplexing (OFDM). The data stream in MC-CDMA is spread using a user specific spreading sequence in the frequency domain and thus, every chip travels on a different sub-carrier. At the receiver, the different sub-carriers have to be combined properly to form the decision variable. minimum mean square error (MMSE) detector is a popular choice for this, but as it tries to minimize the mean square error (MSE) and not the bit error rate (BER), the BER it attains is not optimum. In this paper, we propose a minimum probability of error (MPOE) based linear multiuser detector for uplink MC-CDMA, which tries to minimize the probability of error, by exploiting the probability density function (pdf) of the filter's output. Theoretical and simulation results are presented for the MPOE detector and it can be seen that the MPOE detector outperforms the MMSE detector in terms of BER and near far resistance.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114846757","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":"Vector quantization techniques for multiple-antenna channel information feedback","authors":"J. Roh, B. Rao","doi":"10.1109/SPCOM.2004.1458490","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458490","url":null,"abstract":"This paper presents vector quantization (VQ) techniques in the context of multiple-antenna systems with finite-rate feedback. For MISO systems, we introduce a new design criterion and develop the corresponding iterative design algorithm for quantization of the beamforming vector. For complexity-limited systems, tree-structured VQ is also examined and compared with the full-search VQ method. The method is extended to MIMO channels by employing a parameterization method that exploits the orthonormality in the spatial information matrix and using the MISO approach in a sequential manner. The parameterization method can also be used to develop an effective low-complexity scheme to deal with quantization of time-varying channels. Also briefly discussed is a matrix quantization method for feeding back the beamforming matrix in MIMO spatial multiplexing systems.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130189019","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":"Adaptive multiscale image denoising using neural networks","authors":"M. Srinivasan, S. Annadurai","doi":"10.1109/SPCOM.2004.1458373","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458373","url":null,"abstract":"An image is often corrupted by additive Gaussian noise during its acquisition and transmission. Denoising has to be performed on these images to retain the signal and to suppress the noise. Denoising can be performed by various methods like thresholding, filtering etc. But these methods did not consider the local space scale information of the image. Here a new type of neural network is constructed for noise reduction, where the space scale information of the image is considered. This method gives a good numerical results and also better visual effects.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125384433","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":"Performance analysis of space-time coding over ultra wideband channels","authors":"C.A. Rjeily, N. Daniele","doi":"10.1109/SPCOM.2004.1458409","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458409","url":null,"abstract":"In this paper, we propose two transmit diversity schemes for ultra-wideband time-hopping (UWB-TH) communications. The performance of these schemes is evaluated for binary antipodal signalling over real UWB channels. The first proposed scheme assigns orthogonal codes to the M transmit antennas and is capable of achieving the maximum transmit diversity of M with no data rate loss compared to single antenna UWB systems. The second scheme is the extension of Alamouti's space-time (ST) code to UWB communications. Simulations and semi-analytical evaluations of the error probability show that giving rise to both spatial and multipath diversity by associating these schemes with partial or selective combining Rake receivers (PRake or SRake) can result in considerable performance gains.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124643364","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":"Iterative localisation in wireless ad hoc sensor networks: one-dimensional case","authors":"A. Karnik, A. Kumar","doi":"10.1109/SPCOM.2004.1458387","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458387","url":null,"abstract":"This paper discusses a simple method of localisation in sensor networks in which a sensor with unknown location is localised to a disk of radius equal to the transmission range centered at a beacon if the sensor under consideration can receive a transmission from the beacon. This is a reliable and extremely easy-to-implement technique since it assumes only the basic communication capability. The real advantage, however, is that once localised, a sensor can aid the other sensors to localise. This way by collaboration sensors can learn and improve their localisation regions iteralively. We analyse this iterative scheme and construct a distributed algorithm for utilising it in sensor networks.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126454964","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":"Analysis of increased correlation in blind audio watermark detection","authors":"S. Krishna Kumar, T. Sreenivas","doi":"10.1109/SPCOM.2004.1458431","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458431","url":null,"abstract":"Audio watermarks are often made signal-dependant to keep them inaudible in the host signals. Blind watermark detectors, which do not have access to the unwatermarked signal, may seem handicapped, because an approximate watermark has to be re-derived from the watermarked signal. Referring to the exact watermark scenario as a semi-blind detector, some reduction in performance is anticipated in blind detection over semi-blind detection. An earlier experimental work revealed that the statistical performance of the blind detector is better than that of the semi-blind detector. It is found that the re-derived watermark is better correlated to the host signal and hence, it leads to better detection performance. It is confirmed that this happens only if the embedded watermark is the same as the examined watermark. This paper focuses on an analytical treatment of the problem. The conclusions from this analysis justify the experimental observation. Clues obtained from this investigation will help in better designs of audio watermarking schemes.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"517 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131536863","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":"Robust timing and frequency synchronization algorithm for IEEE 802.16 OFDM systems","authors":"N. Balamurali, D. Jalihal","doi":"10.1109/SPCOM.2004.1458392","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458392","url":null,"abstract":"In this paper we have proposed a preamble based timing and frequency synchronization algorithm suitable for IEEE 802.16 orthogonal frequency division multiplexing (OFDM) systems. Timing synchronization algorithm assumes a rough knowledge of the maximum channel delay spread and uses a weighted correlation approach to reduce the bias and the error variance of the timing estimator. The joint frequency offset and channel estimation algorithm can acquire large frequency offsets experienced by the 802.16 OFDM systems by resolving the ambiguity resulting from the initial maximum likelihood fractional frequency offset estimation.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114492351","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":"Per antenna/stream union bound as a channel quality indicator for MIMO systems","authors":"N. Sharma","doi":"10.1109/SPCOM.2004.1458516","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458516","url":null,"abstract":"We address the issue of rate allocation for layered coded MIMO (multiple input multiple output) systems for a given flat fading channel with APP (a posteriori probability) decoding. Transmission parameters for a given MIMO channel are found using per antenna/stream union bound that enables one to find the SNR (signal to noise ratio) of an equivalent AWGN (additive white Gaussian noise) channel for each transmit antenna/stream. Comparison with the ergodic Shannon capacity is made for some example rate controlled systems.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124021972","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 simple approach to provide QoS and fairness in Internet","authors":"Vihang Kamble, V. Sharma","doi":"10.1109/SPCOM.2004.1458492","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458492","url":null,"abstract":"We propose an approach to provide QoS in Internet for real and non-real time applications. This is a modification of an approach suggested in V. Sharma et al., (2003), V. Venugopal Reddy et al., (2004) and simplifies the overall procedure. signaling requirements are also removed in this process. Using RED control and priority and WRR schedulers at core networks we obtain minimal delay and delay jitter for real time applications and specified minimum throughput for TCP connections. We also show that using admission control our scheme can provide QoS in dynamic traffic conditions and also fair and efficient use of resources. Its implementation in DiffServ architecture is specifically described.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121019438","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":"Speech systems classification based on frequency of binary word features","authors":"S. Maithani, M. Din","doi":"10.1109/SPCOM.2004.1458384","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458384","url":null,"abstract":"This paper presents a robust method to classify the speech communication systems on the basis of speech coding technique used in digitizing the speech. The method works for both clear and noisy speech conditions, when the level of noise may be unknown or known in terms of bit alterations level up to 30% and can identify coding in as short as 640 bit speech. The noise level is estimated using a technique based on higher order statistics (HOS) using digitized speech output and is independent of the coding used. The classification algorithms used are of two types: Minimum Distance Classifier (MDC) based on Linear Discriminant function (LDF) and Artificial Neural Net (ANN). The features used are based on frequency of binary words, characterizing the speech coding technique used in the speech systems. Three types of codings namely Pulse Code Modulation (PCM), Continuously Variable Slope Delta Modulation (CVSD) and Linear Predictive Coding (LPC) are considered. The classification score obtained for both known and unknown noise level arc compared. It is found that results are far better when level of noise is known in both types of classifiers.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126794741","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}