{"title":"Performance of combined free/demand assignment multi-access (CFDAMA) protocol with pre-assigned request slots in integrated voice/data satellite communications","authors":"T. Le-Ngoc, S. Krishnamurthy","doi":"10.1109/ICC.1995.524466","DOIUrl":"https://doi.org/10.1109/ICC.1995.524466","url":null,"abstract":"The combined free/demand assignment multi-access (CFDAMA) protocols have been introduced in Le Ngoc and Mohammed (1993) for dynamic resource allocation in wideband packet satellite communications. The present paper presents a performance analysis of CFDAMA with pre-assigned request slots for a wide range of population sizes and in an integrated voice/data environment. Numerical results of illustrative examples are presented. Simulation results are also provided and compared to analytical results.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131178021","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 study on channel offset schemes used in wireless communication networks","authors":"Y. Jun, Shixin Cheng","doi":"10.1109/ICC.1995.524517","DOIUrl":"https://doi.org/10.1109/ICC.1995.524517","url":null,"abstract":"Efficient utilization of the limited spectrum allocated for personal communication service is one of the major challenges in the wireless system design. Channel offset schemes and their applications are developed for three-dimensional frequency reuse environments. The relationships among channel reuse distance, interchannel usage distance and channel offset degree are computed. The spectral efficiency of the channel offset scheme is discussed and the result shows that compared to channel offsetless scheme, the channel offset scheme can more efficiently employ limited spectrum resource. The parameter calculation method can also be applied to the design of current two-dimensional mobile communication systems.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128288299","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":"ANN approach for congestion control in packet switch OBP satellite","authors":"H. Mehrvar, T. Le-Ngoc","doi":"10.1109/ICC.1995.524215","DOIUrl":"https://doi.org/10.1109/ICC.1995.524215","url":null,"abstract":"The paper investigates the application of neural networks in a packet switch OBP satellite system to estimate the traffic intensity in the downlink queue and to predict the traffic load status. Two neural networks are used. The first one estimates the traffic intensity from the number of packets that arrive in a frame and the other calculates the congestion probability in the next two round trip delay. We show that in this case the linear estimator trained by a special signal outperforms the nonlinear one. Also, due to the long term dependency in the traffic and the validity of the Poisson model for a very short interval, the congestion probability formula is approximated with a neural network.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128595940","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":"Self similar progressive image coding scheme for multimedia packet switching communications","authors":"P. Carlini, S. Giordano, M. Pagano, F. Russo","doi":"10.1109/ICC.1995.524503","DOIUrl":"https://doi.org/10.1109/ICC.1995.524503","url":null,"abstract":"Connectionless services provided by best effort networks, such as SMDS and CBDS, are emerging in support of multicast real time communication over a global environment. A major role in the development of these services will be played by voice and video coding. The paper presents a novel coding approach for still images that combines a fractal approach with wavelet transform and multiresolution decomposition. A progressive coding is achieved by finding self-similarities between different scale bands of the wavelet pyramid. This coding technique has been successfully adopted over a regional wide IP environment where some users were connected by dial-up lines, several by N-ISDN and others through a LAN to LAN interconnection service provided by a regional DQDB MAN.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132004261","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":"Modified constant modulus algorithm: blind equalization and carrier phase recovery algorithm","authors":"K. Oh, Yong-Ohk Chin","doi":"10.1109/ICC.1995.525219","DOIUrl":"https://doi.org/10.1109/ICC.1995.525219","url":null,"abstract":"The modified constant modulus algorithm (MCMA) that accomplishes blind equalization and carrier phase recovery simultaneously is proposed. Since the constant modulus algorithm (CMA) converges independently of carrier recovery, at convergence an output constellation has a phase error. With modification of the CMA, the proposed algorithm can solve this problem. Furthermore, the new algorithm results in the performance enhancement of convergence speed and residual ISI compared to the CMA. In addition, the proposed algorithm achieves a performance as good as that of a joint CMA and decision-directed (DD) phase recovery scheme with reduction in computational complexity. Simulation results confirm the effectiveness of the proposed algorithm in removing ISI and correcting carrier phase error at the same time.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133923657","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":"Efficient algorithms for erasure node placement on DQDB networks","authors":"B. Narahari, S. Shende, R. Simha","doi":"10.1109/ICC.1995.524239","DOIUrl":"https://doi.org/10.1109/ICC.1995.524239","url":null,"abstract":"We study the problem of placing erasure nodes among passive stations in a slotted dual bus network. Erasure nodes are known to improve throughput by allowing slot reuse, it is also known that choices made in locating erasure nodes significantly impact network congestion and overall throughput, especially when traffic patterns are non-uniform. We present algorithms to determine optimal placements of erasure nodes that improve upon prior work on this problem: we present simpler and faster polynomial-time algorithms and also consider various useful cost measures. These algorithms can be used to solve related placement problems in which limits on congestion and existing placements are given as input.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"401 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122857836","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 reservation-based multicasting protocol for WDM local lightwave networks","authors":"M. Borella, B. Muckherjee","doi":"10.1109/ICC.1995.524304","DOIUrl":"https://doi.org/10.1109/ICC.1995.524304","url":null,"abstract":"A wavelength-division multiplexing (WDM) based multicasting protocol for a single-hop broadcast-and-select local lightwave network is proposed. The approach employs a control-channel-based media-access protocol that schedules multicast packets while incorporating arbitrary transceiver tuning times and propagation delays. An arbitrary number of data channels (W) supply communication bandwidth to N nodes, where N/spl ges/W. An additional control channel is used for synchronization and scheduling. Each node is equipped with one fixed transmitter and one fixed receiver on the control channel, as well as one tunable (wavelength-agile) transmitter and one or more tunable receivers for data channel access. Results suggest the WDM single-hop multicasting experiences very good performance when multicast size is either small or very large, or when nodes are equipped with multiple receivers.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"552 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123921451","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":"Improved echo cancellation over telephony networks exploiting synthetic chaos","authors":"J. Elmirghani, S. Milner, R. Cryan","doi":"10.1109/ICC.1995.525230","DOIUrl":"https://doi.org/10.1109/ICC.1995.525230","url":null,"abstract":"An improved echo cancellation strategy is presented for telephony networks. The scheme exploits synthetic chaos to code the speech signal resulting in improved performance. The logistic map is utilised as the chaotic encoding mechanism where the bifurcation parameter is directly modulated by the speech signal. This is shown to result in whitening the speech PSD. Utilising the described strategy an echo attenuation of 50.3 dB was achieved after only 2000 iterations (250 ms) as opposed to the conventional 23.4 dB over the same interval. Furthermore, the model misadjustment was -17.8 dB and -82.6 dB after 250 ms of uncoded and chaotic coded speech.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124072042","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}
L. Chang, C. M. Hamilton, C.M. Liu, M. Rahman, D. Y. Sze
{"title":"ATM network signaling testing","authors":"L. Chang, C. M. Hamilton, C.M. Liu, M. Rahman, D. Y. Sze","doi":"10.1109/ICC.1995.525199","DOIUrl":"https://doi.org/10.1109/ICC.1995.525199","url":null,"abstract":"As the complexity of ATM networks and Broadband ISDN (B-ISDN) services increases, network interoperability and network service integrity become major implementation issues that can not be ignored. Past experiences have demonstrated the value of vigorous network interoperability testing for the common channel signaling networks to ensure product interoperability and service integrity. Similar needs exist for the ATM networks to ensure network reliability, network performance and meeting the quality objectives for B-ISDN services. The paper describes a Bellcore effort that examined the need for a distributed ATM network services test tool for signaling testing. The paper also presents several possible test scenarios to help illustrate different applications of B-ISDN network signaling testing.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127650268","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}
T. Minami, H. Sakamoto, A. Suzuki, O. Nakamura, K. Kamizawa
{"title":"Encoding of pictures using the singular value decomposition (SVD) and 1-D discrete cosine transform (DCT)","authors":"T. Minami, H. Sakamoto, A. Suzuki, O. Nakamura, K. Kamizawa","doi":"10.1109/ICC.1995.524437","DOIUrl":"https://doi.org/10.1109/ICC.1995.524437","url":null,"abstract":"We propose an efficient encoding algorithm which decomposes a picture matrix A to singular values and eigen vectors of AA/sup T/ and A/sup T/A, and then encodes the singular values and DCT coefficients of eigen vectors by PCM. We transform the eigen vectors of the first decomposed term, which are flat and do not have higher frequency components, to 1 dimensional DCT coefficients. The magnitude of the coefficients is small when the vector is flat, allowing us to encode the coefficients efficiently using this characteristic. For decomposed terms other than the first decomposed term, we are able to encode the singular values and eigen vectors by PCM with a small number of bits without increasing quantization noise, since the singular values are very small.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121060868","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}