Ändra sökning
Avgränsa sökresultatet
2345678 201 - 250 av 1402
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 201.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kommunikationssystem.
    Phan, Hoc
    Zepernick, Hans-Jürgen
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kommunikationssystem.
    Dynamic Spectrum Access for Cognitive Radio Networks with Prioritized Traffics2014Ingår i: IEEE Communications Letters, ISSN 1089-7798, E-ISSN 1558-2558, Vol. 18, nr 7, s. 1218-1221Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We develop a dynamic spectrum access (DSA) strategy for cognitive radio networks where prioritized traffic is considered. Assume that there are three classes of traffic, one traffic class of the primary user and two traffic classes of the secondary users, namely, Class 1 and Class 2. The traffic of the primary user has the highest priority, i.e., the primary users can access the spectrum at any time with the largest bandwidth demand. Furthermore, Class 1 has higher access and handoff priority as well as larger bandwidth demand as compared to Class 2. To evaluate the performance of the proposed DSA, we model the state transitions for DSA as a multi-dimensional Markov chain with three-state variables which present the number of packets in the system of the primary users, the secondary Class 1, and secondary Class 2. In particular, the blocking probability and dropping probability of the two secondary traffic classes are assessed.

  • 202.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kommunikationssystem.
    Phan, Hoc
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kommunikationssystem.
    Zepernick, Hans-Jürgen
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kommunikationssystem.
    Hybrid Interweave-Underlay Spectrum Access for Cognitive Cooperative Radio Networks2014Ingår i: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 62, nr 7, s. 2183-2197Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper, we study a hybrid interweave-underlay spectrum access system that integrates amplify-and-forward relaying. In hybrid spectrum access, the secondary users flexibly switch between interweave and underlay schemes based on the state of the primary users. A continuous-time Markov chain is proposed to model and analyze the spectrum access mechanism of this hybrid cognitive cooperative radio network (CCRN). Utilizing the proposed Markov model, steady-state probabilities of spectrum access for the hybrid CCRN are derived. Furthermore, we assess performance in terms of outage probability, symbol error rate (SER), and outage capacity of this CCRN for Nakagami-m fading with integer values of fading severity parameter m. Numerical results are provided showing the effect of network parameters on the secondary network performance such as the primary arrival rate, the distances from the secondary transmitters to the primary receiver, the interference power threshold of the primary receiver in underlay mode, and the average transmit signal-to-noise ratio of the secondary network in interweave mode. To show the performance improvement of the CCRN, comparisons for outage probability, SER, and capacity between the conventional underlay scheme and the hybrid scheme are presented. The numerical results show that the hybrid approach outperforms the conventional underlay spectrum access.

  • 203.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
    Phan, Hoc
    Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
    Zepernick, Hans-Jürgen
    Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
    MIMO Incremental AF Relay Networks with TAS/MRC and Adaptive Modulation2013Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we study the use of adaptive modulation (AM) for a dual-hop multiple-input multiple-output (MIMO) network with transmit antenna selection (TAS) at the transmitter and maximal ratio combining (MRC) at the receiver. Our system deploys incremental amplify-and-forward (AF) relaying with AM to forward the source signal. A switching policy for selecting between the relaying and the direct communications is utilized to maximize spectrum efficiency. In particular, we derive expressions for the outage probability, spectrum efficiency, and bit error rate (BER) for the considered system over Nakagamim fading. The considered network not only takes advantage of TAS transmission such as achieving full diversity order with low transmit complexity but also inherits the beneficial feature of AM such as spectrum efficiency improvement.

  • 204.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
    Phan, Hoc
    Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
    Zepernick, Hans-Jürgen
    Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
    On the Performance of Underlay Cognitive Radio Networks Using M/G/1/K Queuing Model2013Ingår i: IEEE Communications Letters, ISSN 1089-7798, E-ISSN 1558-2558, Vol. 17, nr 5, s. 876-879Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Motivated by a realistic scenario for cognitive radio systems, we model the underlay cognitive radio network (CRN) under interference power constraint imposed by the primary network as an M/G/1/K queueing system. The respective embedded Markov chain is provided to analyze several key queueing performance measures. In particular, the equilibrium probabilities of all states are derived and utilized to evaluate throughput, blocking probability, mean packet transmission time, mean number of packets in the system, and mean waiting time of an underlay CRN with Nakagami-m fading channels.

  • 205.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
    Phan, Hoc
    Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
    Zepernick, Hans-Jürgen
    Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
    Opportunistic Spectrum Access for Cognitive Amplify-and-Forward Relay Networks2013Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we study the performance of cognitive amplify-and-forward (AF) relay networks where the secondary users opportunistically access M licensed bands of the primary users over Nakagami-m fading channels. In order to enhance the accuracy of spectrum sensing and strongly protect the primary users from being interfered by the secondary transmission, collaborative spectrum sensing is deployed among the secondary transmitter, secondary relay, and secondary receiver. In particular, an analytical expression for the capacity of the considered network is derived. Numerical results are provided to show the influence of the arrival rate of the primary users on the channel utilization of licensed bands. Finally, the impact of the number of the licensed bands, channel utilization of the primary users, false alarm probability, and transmission distances on the capacity of the considered system are investigated.

  • 206.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kommunikationssystem.
    Phan, Hoc
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kommunikationssystem.
    Zepernick, Hans-Jürgen
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kommunikationssystem.
    Performance analysis of MIMO cognitive amplify-and-forward relay networks with orthogonal space–time block codes2015Ingår i: Wireless Communications & Mobile Computing, ISSN 1530-8669, E-ISSN 1530-8677, Vol. 15, s. 1659-1679Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper, we study the performance of multiple-input multiple-output cognitive amplify-and-forward relay networks using orthogonal space–time block coding over independent Nakagami-m fading. It is assumed that both the direct transmission and the relaying transmission from the secondary transmitter to the secondary receiver are applicable. In order to process the received signals from these links, selection combining is adopted at the secondary receiver. To evaluate the system performance, an expression for the outage probability valid for an arbitrary number of transceiver antennas is presented. We also derive a tight approximation for the symbol error rate to quantify the error probability. In addition, the asymptotic performance in the high signal-to-noise ratio regime is investigated to render insights into the diversity behavior of the considered networks. To reveal the effect of network parameters on the system performance in terms of outage probability and symbol error rate, selected numerical results are presented. In particular, these results show that the performance of the system is enhanced when increasing the number of antennas at the transceivers of the secondary network. However, increasing the number of antennas at the primary receiver leads to a degradation in the secondary system performance.

  • 207.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Zepernick, Hans-Juergen
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier. Blekinge Inst Technol, SE-37179 Karlskrona, Sweden..
    Capacity Analysis of Two-Tier Networks with MIMO Cognitive Small Cells in Nagakami-m Fading2017Ingår i: 2017 IEEE 13TH INTERNATIONAL CONFERENCE ON WIRELESS AND MOBILE COMPUTING, NETWORKING AND COMMUNICATIONS (WIMOB), IEEE , 2017, s. 457-463Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we consider a two-tier cellular network consisting of a primary macro cell base station (PMBS) which is overlaid by cognitive small cell base stations (CSBSs) to achieve efficient spectrum utilization. The deployment of two-tier cellular networks can provide higher capacity for the system but also causes cross-tier, intra-tier, and inter-tier interference within the cellular networks. Thus, we employ transmit and receive beamforming in the considered two-tier cellular network to mitigate interference. We first design the receive beamforming vector for a primary user (PU) such that it cancels all inter-tier interference from other PUs. Then, the transmit beamforming vectors at the secondary users (SUs) are designed to null out the cross-tier interference to the PUs. Further, the receive beamforming vectors at the SUs are designed to mitigate the crosstier interference from the PUs to the SUs. Finally, the transmit beamforming vector at the PMBS is designed to maximize the signal-to-interference-plus-noise ratio at the PUs. To quantify the performance of the system, we derive an expression for the channel capacity in the downlink from the CSBSs to the SUs. Numerical results are provided to reveal the effect of network parameters such as intra-tier interference distances, fading conditions, and number of antennas on the channel capacity of the SUs.

  • 208.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Zepernick, Hans-Juergen
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Downlink outage analysis for cognitive cooperative radio networks employing non-orthogonal multiple access2018Ingår i: 2018 IEEE 7th International Conference on Communications and Electronics, ICCE 2018, Institute of Electrical and Electronics Engineers Inc. , 2018, s. 27-32Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we employ power-domain non-orthogonal multiple access (NOMA) to simultaneously transmit signals to both a primary user (PU) and a secondary user (SU) of a cognitive cooperative radio network (CCRN). Higher priority is given to the PU over the SU by keeping the power allocation coefficients at the base station (BS) and relay (R) above a certain threshold. In this way, similar as the interference power limit imposed by the PU in a conventional underlay CCRN, the power allocation coefficients at the BS and R of the CCRN can be controlled to maintain a given outage performance. Analytical expressions of the cumulative distribution function of the end-to-end signal-to-interference-plus-noise ratios at the PU and SU are derived and then used to assess the outage probabilities of both users. Numerical results are presented to study the impact of system parameters on outage performance of the CCRN with power-domain NOMA. In addition, it is illustrated that increased downlink performance can be obtained by combining power-domain NOMA with CCRNs. © 2018 IEEE.

  • 209.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Zepernick, Hans-Juergen
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Non-orthogonal multiple access for DF cognitive cooperative radio networks2018Ingår i: IEEE International Conference on Communications Workshops, Institute of Electrical and Electronics Engineers Inc. , 2018, s. 1-6Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we study a power domain non-orthogonal multiple access (NOMA) scheme for cognitive cooperative radio networks (CCRNs). In the proposed scheme, a secondary transmitter communicates with two secondary users (SUs) by allocating transmit powers inversely proportional to the channel power gains on the links to the respective SUs. A decode-and-forward (DF) secondary relay is deployed which decodes the superimposed signals associated with the two SUs. Then, power domain NOMA is used to forward the signals from the relay to the two SUs based on the channel power gains on the corresponding two links. Mathematical expressions for the outage probability and ergodic capacity of each SU and the overall power domain NOMA CCRN are derived. Numerical results are provided to reveal the impact of the power allocation coefficients at the secondary transmitter and secondary relay, the interference power threshold at the primary receiver, and the normalized distances of the SUs on the outage probability and ergodic capacity of each SU and the whole NOMA system. © 2018 IEEE.

  • 210.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Zepernick, Hans-Juergen
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    On Secrecy Capacity of Full-Duplex Cognitive Cooperative Radio Networks2017Ingår i: 2017 IEEE GLOBECOM WORKSHOPS (GC WKSHPS), IEEE , 2017Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we analyze the secrecy capacity of a full-duplex underlay cognitive cooperative radio network (CCRN) in the presence of an eavesdropper and under the interference power constraint of a primary network. The full-duplex mode is used at the secondary relay to improve the spectrum efficiency which in turn leads to an improvement of the secrecy capacity of the full-duplex CCRN. We utilize an approximation-and-fitting method to convert the complicated expression of the signal-to-interference-plus-noise ratio into polynomial form which is then utilized to derive an expression for the secrecy capacity. Numerical results are provided to illustrate the effect of network parameters such as transmit power, interference power limit, self-interference parameters of the full-duplex mode, and distances among links on the secrecy capacity. To reveal the benefits of the full-duplex CCRN, we compare the secrecy capacity obtained when the secondary relay operates in full-duplex and half-duplex mode.

  • 211.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Zepernick, Hans-Juergen
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Optimal Power Allocation for Hybrid Cognitive Cooperative Radio Networks with Imperfect Spectrum Sensing2018Ingår i: IEEE Access, E-ISSN 2169-3536, Vol. 6, s. 10365-10380Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper, two optimal power allocation strategies for hybrid interweave-underlay cognitive cooperative radio networks (CCRNs) are proposed to maximize channel capacity and minimize outage probability. The proposed power allocation strategies are derived for the case of Rayleigh fading taking into account the impact of imperfect spectrum sensing on the performance of the hybrid CCRN. Based on the optimal power allocation strategies, the transmit powers of the secondary transmitter and secondary relay are adapted according to the fading conditions, the interference power constraint imposed by the primary network (PN), the interference from the PN to the hybrid CCRN, and the total transmit power limit of the hybrid CCRN. Numerical results are provided to illustrate the effect of the interference power constraint of the PN, arrival rate of the PN, imperfect spectrum sensing, and the transmit power constraint of the hybrid CCRN on channel capacity and outage probability. Finally, comparisons of the channel capacity and outage probability of underlay, overlay, and hybrid interweaveunderlay CCRNs are presented to show the advantages of the hybrid spectrum access. OAPA

  • 212.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Zepernick, Hans-Juergen
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier. Blekinge Inst Technol, SE-37179 Karlskrona, Sweden..
    Outage Probability and Secrecy Capacity of a Non-orthogonal Multiple Access System2017Ingår i: 11th International Conference on Signal Processing and Communication Systems, ICSPCS, 2017 / [ed] Wysocki, TA Wysocki, BJ, IEEE , 2017Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we analyze the outage probability and secrecy capacity of a non-orthogonal multiple access (NOMA) system in the presence of an eavesdropper. In order to enhance spectral efficiency, a base station communicates with two users simultaneously in the same frequency band by superpimposing the transmit signals to the users in the power domain. Specifically, the user with the worse channel conditions is allocated higher power such that it is able to directly decode its signal from the received superimposed signal. At the user with the better channel conditions, the interference due to NOMA is processed by successive interference cancelation. Given these system settings and accounting for decoding thresholds, we analyze the outage probability of the NOMA system over Rayleigh fading channels. Furthermore, based on the locations of the users and eavesdropper, the secrecy capacity is analyzed to assess the level of security provided to the legitimate users in the presence of an eavesdropper. Here, the decoding thresholds of legitimate users and eavesdropper are also included in the analysis of the secrecy capacity. Through numerical results, the effects of network parameters on system performance are assessed as well as the the superiority of NOMA in terms of secrecy capacity over traditional orthogonal multiple access.

  • 213.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Zepernick, Hans-Juergen
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier. Blekinge Inst Technol, SE-37179 Karlskrona, Sweden..
    Outage Probability of a Hybrid AF-DF Protocol for Two-Way Underlay Cognitive Cooperative Radio Networks2017Ingår i: 11th International Conference on Signal Processing and Communication Systems, ICSPCS 2017 / [ed] Wysocki, TA Wysocki, BJ, IEEE , 2017, s. 1-6Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we study a hybrid amplify-and-forward (AF) and decode-and-forward (DF) scheme for two-way cognitive cooperative radio networks (CCRNs). The proposed scheme applies the AF scheme when the signal-to-interferenceplus-noise ratio (SINR) at the relay is below a predefined threshold such that the relay cannot successfully decode the signal. On the other hand, when the SINR at the relay is greater than the predefined threshold, it decodes the signal and then forwards it to the destination, i.e. avoids noise and interference amplification at the relay. An analytical expression of the outage probability of the hybrid AF-DF two-way CCRN is derived based on the probability density function and cumulative distribution function of the SINR in AF and DF mode. Numerical results are provided to illustrate the influence of network parameters such as transmit power, interference power constraint of the primary network, fading conditions, and link distances on the outage probability. Finally, the numerical results show that the hybrid strategy is able to improve system performance significantly compared to conventional AF or DF relaying.

  • 214.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Zepernick, Hans-Juergen
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Performance of a Non-orthogonal Multiple Access System with Full-Duplex Relaying2018Ingår i: IEEE Communications Letters, ISSN 1089-7798, E-ISSN 1558-2558, Vol. 22, nr 10, s. 2084-2087Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper, we study a power-domain nonorthogonal multiple access (NOMA) system in which a base station (BS) superimposes the transmit signals to the users. To enhance spectral efficiency and link reliability for the far-distance user, a full-duplex (FD) relay assists the BS while the neardistance user is reached over the direct link. For this setting, we analyze outage probability and sum rate of the NOMA system over Nakagami-m fading with integer fading severity parameter m. Numerical results are provided for outage probability and sum rate to show the effect of system parameters on the performance of the FD NOMA system over Nakagami-m fading. IEEE

  • 215.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Zepernick, Hans-Juergen
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Performance Optimization for Hybrid Two-Way Cognitive Cooperative Radio Networks with Imperfect Spectrum Sensing2018Ingår i: IEEE Access, E-ISSN 2169-3536, Vol. 6, s. 70582-70596Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper, we consider a two-way cognitive cooperative radio network (TW-CCRN) with hybrid interweaveunderlay spectrum access in the presence of imperfect spectrum sensing. Power allocation strategies are proposed that maximize the sum-rate and minimize the outage probability of the hybrid TW-CCRN. Specifically, based on the state of the primary network (PN), fading conditions, and system parameters, suitable power allocation strategies subject to the interference power constraint of the PN are derived for each transmission scenario of the hybrid TW-CCRN. Given the proposed power allocation strategies, we analyze the sum-rate and outage probability of the hybrid TW-CCRN over Rayleigh fading taking imperfect spectrum sensing into account. Numerical results are presented to illustrate the effect of the arrival rate, interference power threshold, transmit power of the PN, imperfect spectrum sensing, and maximum total transmit power on the sum-rate and outage probability of the hybrid TW-CCRN. OAPA

  • 216.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Zepernick, Hans-Juergen
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Symbol error rate and achievable rate of cognitive cooperative radio networks utilizing non-orthogonal multiple access2018Ingår i: 2018 IEEE 7th International Conference on Communications and Electronics, ICCE 2018, Institute of Electrical and Electronics Engineers Inc. , 2018, Vol. Code 141951, s. 33-38Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we study the employment of power-domain non-orthogonal multiple access (NOMA) concepts for a cooperative cognitive relay network (CCRN) downlink system in order to allow a base station (BS) to simultaneously transmit signals to a primary user (PU) and a secondary user (SU). As such, the considered system falls into the field of cognitive radio inspired power-domain NOMA. In this scheme, the interference power constraint of the PU imposed to SUs in conventional underlay CCRNs is replaced by controlling the power allocation coefficients at the BS and relay. Specifically, expressions for the symbol error rates at the PU and SU for different modulation schemes as well as expressions for the achievable rates are derived. On this basis, the effect of system parameters such as total transmit power and power allocation coefficients on the performance of the CCRN with power-domain NOMA is numerically studied. These numerical results provide insights into selecting favorable operation modes of the CCRN employing power-domain NOMA. © 2018 IEEE.

  • 217.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Zepernick, Hans-Juergen
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Phan, H.
    Duy Tan University, VNM.
    MAC Protocol for Opportunistic Spectrum Access in Multi-Channel Cognitive Relay Networks2017Ingår i: IEEE Vehicular Technology Conference, Institute of Electrical and Electronics Engineers Inc. , 2017Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we propose a medium access control (MAC) protocol for multi-channel cognitive cooperative radio networks (CCRNs). In this protocol, each secondary user (SU) senses for spectrum opportunities within M licensed bands of the primary users (PUs). To enhance the accuracy of spectrum sensing, we employ cooperative sequential spectrum sensing where SUs mutually exchange their sensing results. Moreover, the information obtained from cooperative spectrum sensing at the physical layer is integrated into the channel negotiation process at the MAC layer to alleviate the hidden terminal problem. Finally, the performance of the proposed MAC protocol in terms of aggregate throughput of the CCRNs is analyzed. Numerical results are provided to assess the impact of channel utilization by PUs, number of contenting CCRNs, number of licensed bands, and false alarm probability of SUs on the aggregate throughput. © 2017 IEEE.

  • 218.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Zepernick, Hans-Juergen
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Sundstedt, Veronica
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kreativa teknologier.
    Analysis of Variance of Opinion Scores for MPEG-4 Scalable and Advanced Video Coding2018Ingår i: 2018 12TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATION SYSTEMS (ICSPCS) / [ed] Wysocki, TA Wysocki, BJ, IEEE , 2018Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we conduct an analysis of variance (ANOVA) on opinion scores for MPEG-4 scalable video coding (SVC) and advanced video coding (AVC) standards. This work resorts on a publicly available database providing opinion scores from subjective experiments for several scenarios such as different bit rates and resolutions. In particular, ANOVA is used for statistical hypothesis testing to compare two or more sets of opinion scores instead of being constrained to pairs of sets of opinion scores as would be the case for t-tests. As the ANOVA tests of the different scenarios are performed for mean opinion scores (MOS), box plots are also provided in order to assess the distribution of the opinion scores around the median. It is shown that the opinion scores given to the reference videos in SVC and AVC for different resolutions are statistically significantly similar regardless of the content. Further, for the opinion scores of the considered database, the ANOVA tests support the hypothesis that AVC generally outperforms SVC although the performance difference may be less pronounced for higher bit rates. This work also shows that additional insights on the results of subjective experiments can be obtained by extending the analysis of opinion scores beyond MOS to ANOVA tests and box plots.

  • 219.
    Chu, Thi My Chinh
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kommunikationssystem.
    Zepernick, Hans-Jürgen
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kommunikationssystem.
    Phan, Hoc
    Performance Evaluation of Cognitive Multi-Relay Networks with Multi-Receiver Scheduling2014Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we investigate the performance of cognitive multiple decode-and-forward relay networks under the interference power constraint of the primary receiver wherein the cognitive downlink channel is shared among multiple secondary relays and secondary receivers. In particular, only one relay and one secondary receiver which offers the highest instantaneous signal-to-noise ratio is scheduled to transmit signals. Accordingly, only one transmission route that offers the best end-to-end quality is selected for communication at a particular time instant. To quantify the system performance, we derive expressions for outage probability and symbol error rate over Nakagami-m fading with integer values of fading severity parameter m. Finally, numerical examples are provided to illustrate the effect of system parameters such as fading conditions, the number of secondary relays and secondary receivers on the secondary system performance.

  • 220.
    Chunduri, Krishna Chaitanya
    et al.
    Blekinge Tekniska Högskola, Sektionen för teknik, Avdelningen för signalbehandling.
    Gutti, Chalapathi
    Blekinge Tekniska Högskola, Sektionen för teknik, Avdelningen för signalbehandling.
    Implementation of Adaptive Filter Structures on a Fixed Point Signal Processor for Acoustical Noise Reduction2005Självständigt arbete på avancerad nivå (magisterexamen)Studentuppsats (Examensarbete)
    Abstract [en]

    The problem of controlling the noise level in the environment has been the focus of a tremendous amount of research over the years. Active Noise Cancellation (ANC) is one such approach that has been proposed for reduction of steady state noise. ANC refers to an electromechanical or electro acoustic technique of canceling an acoustic disturbance to yield a quieter environment. The basic principle of ANC is to introduce a canceling “anti-noise” signal that has the same amplitude but the exact opposite phase, thus resulting in an attenuated residual noise signal. Wideband ANC systems often involve adaptive filter lengths, with hundreds of taps. Using sub band processing can considerably reduce the length of the adaptive filter. This thesis presents Filtered-X Least Mean Squares (FXLMS) algorithm to implement it on a fixed point digital signal processor (DSP), ADUC7026 micro controller from Analog devices. Results show that the implementation in fixed point matches the performance of a floating point implementation.

  • 221. Ciszkowski, Tomasz
    et al.
    Eliasson, Charlott
    Fiedler, Markus
    Kotulski, Zbigniew
    Lupu, Radu
    Mazurczyk, Wojciech
    SecMon: end-to-end quality and security monitoring system2008Ingår i: Annales UMCS Informatica, ISSN 1732-1360, Vol. AI 8, nr 1, s. 185-201Artikel i tidskrift (Refereegranskat)
    Abstract [sv]

    Ett system som hjälper att förbättra kvaliten och säkerheten i röstkommunikation via Internet presenteras. Mekanismen bygger på P2P teknik och behöver förhållandevis små resurser. Informationsutbyte sker med hjälp av gömda kanaler. Mer detaljer finns i den engelska versionen.

  • 222. Ciszkowski, Tomasz
    et al.
    Mazurczyk, Wojciech
    Kotulski, Zbigniew
    Hossfeld, Tobias
    Fiedler, Markus
    Collange, Denis
    Towards Quality of Experience-based Reputation Models for Future Web Service Provisioning2009Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper concerns the applicability of reputations systems for assessing Quality of Experience (QoE) for web services in Future Internet. Reputation systems provide mechanisms to manage subjective opinions in societies and yield general scoring of a particular behavior. Thus, they are likely to become an important ingredient of Future Internet. Parameters being under evaluation by reputation system may vary greatly and, particularly, may be chosen to assess the users’ satisfaction with (composite) web services. Currently, this satisfaction is usually expressed with QoE, which represents subjective users’ opinions. The goal is to predict users’ satisfaction based on reputation values. This may be beneficial for service providers in terms of checking the fulfillment of SLAs, for retaining QoE on the satisfaction level for other users sharing the same network or service resources, and for providing the users with indications which resource to choose in order to maximize its experience.

  • 223. Ciszkowski, Tomasz
    et al.
    Mazurczyk, Wojciech
    Kotulski, Zbigniew
    Hossfeld, Tobias
    Fiedler, Markus
    Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
    Collange, Denis
    Towards Quality of Experience-based reputation models for future web service provisioning2012Ingår i: Telecommunications Systems, ISSN 1018-4864, E-ISSN 1572-9451, Vol. 51, nr 4, s. 283-295Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper concerns the applicability of reputations systems for assessing Quality of Experience (QoE) for web services in Future Internet. Reputation systems provide mechanisms to manage subjective opinions in societies and yield a general scoring of a particular behavior. Thus, they are likely to become an important ingredient of Future Internet. Parameters being under evaluation by a reputation system may vary greatly and, particularly, may be chosen to assess the users’ satisfaction with (composite) web services. Currently, this satisfaction is usually expressed by QoE, which represents subjective users’ opinions. The goal of this paper it to present a novel framework of web services where a reputation system is incorporated for users satisfaction tracking and prediction. This approach is a beneficial tool, which enables providers to facilitate service adaptation according to users’ expectations and maintain QoE on a satisfying level. Presented reputation system operates in an environment of composite services running on a client and server side. It makes this approach highly suitable for effective QoE differentiating and maximizing user experience for specific customer profiles even the service and network resources are shared.

  • 224. Collange, Denis
    et al.
    Mahdi, Hajji
    Shaikh, Junaid
    Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
    Fiedler, Markus
    Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
    Arlos, Patrik
    Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
    User Impatience and Network Performance2012Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this work, we analyze from passive measurements the correlations between the user-induced interruptions of TCP connections and different end-to-end performance metrics. The aim of this study is to assess the possibility for a network operator to take into account the customers' experience for network monitoring. We first observe that the usual connection-level performance metrics of the interrupted connections are not very different, and sometimes better than those of normal connections. However, the request-level performance metrics show stronger correlations between the interruption rates and the network quality-of-service. Furthermore, we show that the user impatience could also be used to characterize the relative sensitivity of data applications to various network performance metrics.

  • 225.
    Constantinescu, Doru
    Blekinge Tekniska Högskola, Sektionen för teknik, Avdelningen för telekommunikationssystem.
    Measurements and Models of One-Way Transit Time in IP Routers2005Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [sv]

    Mätningar och modeller för en-vägskorsningstid presenteras.

  • 226. Constantinescu, Doru
    Overlay Multicast Networks: Elements, Architectures and Performance2007Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Today, the telecommunication industry is undergoing two important developments with implications on future architectural solutions. These are the irreversible move towards Internet Protocol (IP)-based networking and the deployment of broadband access. Taken together, these developments offer the opportunity for more advanced and more bandwidth-demanding multimedia applications and services, e. g., IP television (IPTV), Voice over IP (VoIP) and online gaming. A plethora of Quality of Service (QoS) requirements and facilities are associated with these applications, e. g., multicast facilities, high bandwidth and low delay/jitter. Moreover, the architectural solution must be a unified one, and be independent of the access network and content management. An interesting solution to these challenges is given by overlay multicast networks. The goal of these networks is to create and to maintain efficient multicast topologies among the multicast participants as well as to minimize the performance penalty involved with application layer multicasting. Since they operate at the application layer, they suffer from two main drawbacks: higher delay and less efficient bandwidth utilization. It is therefore important to assess the performance of overlay multicast networks in “real- world”-like conditions. For this purpose, we first performed an in-depth measurement and modeling study of the packet delay at the network layer. The reported results are in the form of several important statistics regarding processing and queueing delays of a router. New results have been obtained that indicate that the delay in IP routers shows heavy-tailed characteristics, which can be well modeled with the help of several distributions, in the form of a single distribution or as a mixture of distributions. There are several components contributing to the delay in routers, i. e., processing delay, queueing delay and service time. It was observed that the component delay distribution that is most heavy-tailed has a decisive influence on delay. Furthermore, we selected three representative categories of overlay multicast networks for study, namely Application Level Multicast Infrastructure (ALMI), Narada and NICE is the Internet Cooperative Environment (NICE). The performance of these overlay multicast protocols was evaluated through a comprehensive simulation study with reference to a detailed set of performance metrics that captured application and network level performance. A particular interest was given to the issues of scalability, protocol dynamics and delay optimization as part of a larger problem of performance-aware optimization of the overlay networks. The simulations were configured to emulate “real-world”-like characteristics by implementing a heavy-tailed delay at the network level and churn behavior of the overlay nodes. A detailed analysis of every protocol is provided with regard to their performance. Based on our study, significant conclusions can be drawn regarding the scalability of the protocols with reference to overlay multicast group management, resource usage and robustness to churn. These results contribute to a deeper understanding of the requirements for such protocols targeted at, e. g., media streaming.

  • 227.
    Constantinescu, Doru
    et al.
    Blekinge Tekniska Högskola, Sektionen för teknik, Avdelningen för telekommunikationssystem.
    Carlsson, Patrik
    Popescu, Adrian
    Blekinge Tekniska Högskola, Sektionen för teknik, Avdelningen för telekommunikationssystem.
    One-Way Transit Time Measurements2004Rapport (Refereegranskat)
    Abstract [en]

    This report is a contribution towards a better understanding of traffic measurements associated with e2e delays occurring in best-effort networks. We describe problems and solutions associated with OWTT delay measurements, and give examples of such measurements. A dedicated measurement system is reported for delay measurements in IP routers, which follows specifications of the IETF RFC 2679. The system uses both passive measurements and active probing. Dedicated application-layer software is used to generate traffic. Pareto traffic models are used to generate self-similar traffic in the link. Both packet inter-arrival times and packet sizes are matching real traffic models. A passive measurement system is used for data collection that is based on using several so-called Measurement Points, each of them equipped with DAG monitoring cards. Hashing is used for the identification and matching of packets. The combination of passive and active measurements, together with using the DAG monitoring system, gives us an unique possibility to perform precise traffic measurements as well as the flexibility needed to compensate for the lack of analytic solutions. The real value of our study lies in the hop-by-hop instrumentation of the devices involved in the transfer of IP packets. The mixture of passive and active traffic measurements used, allows us to study changes in traffic patterns relative to specific reference points and to observe different contributing factors to the observed changes. This approach offers us the choice of better understanding diverse components that may impact on the performance of packet delay as well as to to measure queueing delays in operational routers.

  • 228. Constantinescu, Doru
    et al.
    Carlsson, Patrik
    Popescu, Adrian
    Nilsson, Arne A.
    Measurement of One-Way Internet Packet Delay2004Konferensbidrag (Refereegranskat)
    Abstract [en]

    The paper reports on a dedicated measurement system for delay measurements in IP routers, which follows specifications of the IETF RFC 2679. The system uses both passive and active measurements. Dedicated application-layer software is used to generate traffic. Pareto traffic models are used to generate self-similar traffic in the link. Both packet inter-arrival times and packet sizes are matching real traffic models. A passive measurement system is used for data collection that is based on using several so-called Measurement Points, each of them equipped with DAG monitoring cards. Hashing is used for the identification and matching of packets. The combination of passive measurements and active probing, together with using the DAG monitoring system, gives us an unique possibility to perform precise traffic measurements as well as the flexibility needed to compensate for the lack of analytic solutions.

  • 229. Constantinescu, Doru
    et al.
    Erman, David
    Ilie, Dragos
    Popescu, Adrian
    Congestion and Error Control in Overlay Networks2007Rapport (Övrigt vetenskapligt)
    Abstract [en]

    In recent years, Internet has known an unprecedented growth, which, in turn, has lead to an increased demand for real-time and multimedia applications that have high Quality-of-Service (QoS) demands. This evolution lead to difficult challenges for the Internet Service Providers (ISPs) to provide good QoS for their clients as well as for the ability to provide differentiated service subscriptions for those clients who are willing to pay more for value added services. Furthermore, a tremendous development of several types of overlay networks have recently emerged in the Internet. Overlay networks can be viewed as networks operating at an inter-domain level. The overlay hosts learn of each other and form loosely-coupled peer relationships. The major advantage of overlay networks is their ability to establish subsidiary topologies on top of the underlying network infrastructure acting as brokers between an application and the required network connectivity. Moreover, new services that cannot be implemented (or are not yet supported) in the existing network infrastructure are much easier to deploy in overlay networks. In this context, multicast overlay services have become a feasible solution for applications and services that need (or benefit from) multicast-based functionality. Nevertheless, multicast overlay networks need to address several issues related to efficient and scalable congestion control schemes to attain a widespread deployment and acceptance from both end-users and various service providers. This report aims at presenting an overview and taxonomy of current solutions proposed that provide congestion control in overlay multicast environments. The report describes several protocols and algorithms that are able to offer a reliable communication paradigm in unicast, multicast as well as multicast overlay environments. Further, several error control techniques and mechanisms operating in these environments are also presented. In addition, this report forms the basis for further research work on reliable and QoS-aware multicast overlay networks. The research work is part of a bigger research project, "Routing in Overlay Networks (ROVER)". The ROVER project was granted in 2006 by EuroNGI Network of Excellence (NoE) to the Dept. of Telecommunication Systems at Blekinge Institute of Technology (BTH).

  • 230. Constantinescu, Doru
    et al.
    Popescu, Adrian
    Implementation of Application Layer Multicast in OverSim2007Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents an overview of the implementation of Application Layer Multicast (ALM) in OverSim, a simulation framework designed specifically for simulating overlay networks. OverSim builds upon the OMNeT++ discrete event simulator. In addition, the paper presents guidelines for further research work based on reliable and Quality of Service (QoS)-aware multicast overlay networks. This research work is part of a bigger research project, called "Routing in Overlay Networks (ROVER)" which is focused on unicast and multicast routing in overlay networks with QoS guarantees and congestion control facilities on top of existing and future Peer-to-Peer (P2P) networks.

  • 231. Constantinescu, Doru
    et al.
    Popescu, Adrian
    On the Performance of Overlay Multicast Networks2008Konferensbidrag (Refereegranskat)
    Abstract [en]

    The paper reports on a performance study of several Application Layer Multicast (ALM) protocols. Three categories of overlay multicast networks are investigated, namely Application Level Multicast Infrastructure (ALMI), Narada and NICE is the Internet Cooperative Environment (NICE). The performance of the overlay multicast protocols is evaluated with reference to a set of performance metrics that capture both application and network level performance. The study focuses on the control overhead induced by the protocols under study. This further relates to the scalability of the protocol with increasing number of multicast participants. In order to get a better assessment of the operation of these protocols in "real-life"-like conditions, we implemented in our simulations a heavy-tailed delay at the network level and churn behavior of the overlay nodes. Our performance study contributes to a deeper understanding and better assessment of the requirements for such protocols targeted at, e.g., media streaming.

  • 232. Cousin, Philippe
    et al.
    Fricker, Samuel
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för programvaruteknik.
    Felmy, Dean
    Le Gall, Franck
    Fiedler, Markus
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kommunikationssystem.
    Validation and Quality in FI-PPP e-Health Use Case, FI-STAR Project2014Konferensbidrag (Refereegranskat)
  • 233. Cresp, Gregory
    et al.
    Dam, Hai Huyen
    Zepernick, Hans-Jürgen
    Design of Modified UCHT Sequences2006Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we consider the design of a class of unified complex Hadamard transform (UCHT) sequences. An effi- cient modification is imposed to those sequences to better suit applications in asynchronous code-division multiple- access (CDMA) systems. These modified UCHT sequences preserve the orthogonality of the original UCHT sequences and offer increased design options due to an increased number of parameters. The design of UCHT, modified UCHT, and Oppermann sequences is then formulated with reference to optimizing the maximum nontrivial aperiodic correlation value. These optimization problems can then be solved efficiently using a genetic algorithm with the maximum nontrivial aperiodic correlation value serving in the definition of a fitness function. Numerical examples illustrate the benefits of modified UCHT sequences over the original UCHT sequences.

  • 234. Cresp, Gregory
    et al.
    Dam, Hai Huyen
    Zepernick, Hans-Jürgen
    Design of Sequence Family Subsets Using a Branch and Bound Technique2009Ingår i: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 55, nr 8, s. 3847-3857Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The number of spreading sequences required for Direct Sequence Code Division Multiple Access (DS-CDMA) systems depends on the number of simultaneous users in the system. Often a sequence family provides more sequences than are required; in many cases the selection of the employed sequences is a computationally intensive task. This selection is a key consideration, as the properties of the sequences assigned affect the error performance in the system. In this paper, a branch and bound algorithm is presented to perform this selection based on two different cost functions. Numerical results are presented to demonstrate the improved performance of this algorithm over previous work.

  • 235. Cresp, Gregory
    et al.
    Dam, Hai Huyen
    Zepernick, Hans-Jürgen
    Subset Family Design Using a Branch and Bound Technique2006Konferensbidrag (Refereegranskat)
    Abstract [en]

    The number of spreading sequences required for Direct Sequence Code Division Multiple Access (DS-CDMA) systems depends on the number of simultaneous users on the channel. The correlation properties of the sequences used affect the bit error rate of the system. Often a sequence family provides more sequences than are required and in many cases the selection of the employed sequences is a computationally intensive task. In this paper, a branch and bound algorithm is presented to optimise the subset of available sequences given the required subset size. In contrast to previous approaches, the resulting subset is guaranteed to be optimal. Numerical results are presented to demonstrate the improved performance of this algorithm over previous work.

  • 236. Cresp, Gregory
    et al.
    Zepernick, Hans-Jürgen
    Dam, Hai Huyen
    Bit Error Rates of Large Area Synchronous Systems2008Konferensbidrag (Refereegranskat)
    Abstract [en]

    Large Area Synchronous (LAS) sequences are a class of ternary interference free window spreading sequences. One of their advantages is the ability to construct permutation LAS families in order to reduce adjacent cell interference (ACI) in cellular systems. There has been little previous numerical work to examine the effect of using permutation families compared to simply reusing the same LAS family across different cells. The bit error rates resulting from two cell systems employing both permutation families and sequence reuse are considered here by simulation.

  • 237. Cresp, Gregory
    et al.
    Zepernick, Hans-Jürgen
    Dam, Hai Huyen
    Combination Oppermann Sequences for Spread Spectrum Systems2005Konferensbidrag (Refereegranskat)
    Abstract [en]

    Numerous spread spectrum applications require families of long spreading sequences, often used at very high chip rates. In this paper, an algebraically simple way of generating long sequences by combining shorter polyphase sequences is presented, aimed at asynchronous spread spectrum systems. The approach is motivated by the fact that polyphase sequences offer increased design options, in terms of the supported range of correlation characteristics, while combination sequences allow for simpler generation of long sequences. It leads to the definition of combination Oppermann sequences, the properties of which are investigated in this paper. Numerical results indicate that the families of these proposed combination sequences provide favourable aperiodic correlations. The presented family of combination Oppermann sequences is therefore suitable for applications that rely on rapid synchronisation and are required to provide multiple access to the system.

  • 238. Cresp, Gregory
    et al.
    Zepernick, Hans-Jürgen
    Dam, Hai Huyen
    On the Classification of Large Area Sequences2007Konferensbidrag (Refereegranskat)
    Abstract [en]

    Large Area (LA) sequences form a class of ternary spreading sequences which exhibit an interference free window. In addition, these sequences have low correlation properties outside this window. Work to date has concentrated on examining the parameters and performance of LA sequences with reference to only a small number of example families. In this paper we develop general conditions which an LA family must satisfy. The development of these conditions allows for the production of computationally efficient tests to determine whether a given family is an LA family. In particular, these tests can form the basis for algorithms to construct LA families, allowing for a larger number of families with the potential for higher energy efficiency than those of previous work.

  • 239. Cresp, Gregory
    et al.
    Zepernick, Hans-Jürgen
    Dam, Hai Huyen
    Periodic Oppermann Sequences for Spread Spectrum Systems2005Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper we introduce periodic Oppermann sequences, which constitute a special class of polyphase sequences. The properties of these sequences are presented, and indicate that periodic Oppermann sequences are suitable for combination to generate families of longer sequences. Numerical examples show that periodic Oppermann sequences can be designed for ranging or synchronisation applications or for supporting multiple access spread spectrum communication systems.

  • 240.
    Dagala, Wadzani Jabani
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för datalogi och datorsystemteknik.
    Analysis of Total Cost of Ownership for Medium Scale Cloud Service Provider with emphasis on Technology and Security2017Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Total cost of ownership is a great factor to consider when deciding to deploy cloud computing. The cost to own a data centre or run a data centre outweighs the thought of IT manager or owner of the business organisation.The research work is concerned with specifying the factors that sum the TCO for medium scale service providers with respect to technology and security. A valid analysis was made with respect to the cloud service providers expenses and how to reduce the cost of ownership.In this research work, a review of related articles was used from a wide source, reading through the abstract and overview of the articles to find its relevance to the subject. A further interview was conducted with two medium scale cloud service providers and one cloud user.In this study, an average calculation of the TCO was made and we implemented a proposed cost reduction method. We made a proposal on which and how to decide as to which cloud services users should deploy in terms of cost and security.We conclude that many articles have focused their TCO calculation on the building without making emphasis on the security. The security accumulates huge amount under hidden cost and this research work identified the hidden cost, made an average calculation and proffer a method of reducing the TCO.

  • 241.
    Dahlberg, Anders
    Blekinge Tekniska Högskola, Institutionen för telekommunikation och signalbehandling.
    Traffic Engineering in a Bluetooth Piconet2002Självständigt arbete på avancerad nivå (magisterexamen)Studentuppsats (Examensarbete)
    Abstract [en]

    The Bluetooth technology is still in an early stage of development. Much more research can and will be done before the performance of Bluetooth reaches its peak. During the recent years, ideas to integrate Bluetooth units in larger networks have arose, with the Bluetooth unit in the role as access point to the network. This behavior opens up for new possibilities but also increases the requirements on performance. In this thesis the main topic is improvement of piconet performance. The piconet, with the Master unit as access point, is studied from a teletraffic engineering point of view. Different performance attributes and behaviors have been found and investigated. With the outcome of these investigations in mind, new and more efficient policies and algorithms are proposed for both data and voice. A policy increasing the utilization of available bandwidth in a piconet is presented. Furthermore, a proposal is presented where multiple Bluetooth units are used in an efficient manner to support voice calls. The proposed solution does also enable creation of simple teletraffic models to be used for dimensioning.

  • 242. Dahlberg, Anders
    et al.
    Zepernick, Hans-Jürgen
    Mercankosk, Guven
    Fiedler, Markus
    Multi AP concepts for SCO traffic in a Bluetooth based Radio Infrastructure Network2002Konferensbidrag (Refereegranskat)
    Abstract [sv]

    Bidraget diskuterar möjligheter hur man kan använda Bluetooth för att bygga mobiltelefonliknande nätverk för röstsamtal. Tjänstekvalitén och dimensionering av sådana system diskuteras. Nyckelorden: Bluetooth, accesspunkt, rösttrafik, spärrsannolikhet

  • 243. Dahlberg, Anders
    et al.
    Zepernick, Hans-Jürgen
    Mercankosk, Guven
    Fiedler, Markus
    Multi AP Strategies for SCO Traffic in a Bluetooth based Wireless LAN2003Konferensbidrag (Refereegranskat)
    Abstract [sv]

    Flera Bluetooth enheter i en accesspunkt ger mögligheten att köra flera samtal plus datatrafik samtidigt. Pappret diskuterar olika strategier hur man lägger ut samtal (dvs SCO trafik) på de olika Bluetooth enheter. Bluetooth, Blåtand, accesspunkt, SCO trafik, spärrsannolikhet, dimensionering, signalering, prestanda

  • 244. Dam, Hai Huyen
    et al.
    Nordberg, Jörgen
    Nordholm, Sven
    Non-Causal Delayless Subband Adaptive Equalizer2002Konferensbidrag (Refereegranskat)
    Abstract [en]

    In wireless communication, multiple versions of the transmitted signals arrive at the receiver with different attenuations and time delays. Thus, an equalizer with long filter is required at the receiver to reverse the multipath effects. In this paper, a new non-causal delayless subband equalizer structure is proposed to reduce the computational complexity of the equalizer and to improve the channel tracking capability. This structure avoids the additional delays usually associated with the subband schemes. A design method is formulated to minimize the aliasing effect of the filter bank in the subbands. The significance of employing a non-causal equalizer is also emphasized. Simulation results show that the performance of the new structure is significantly improved by using the design method. Moreover, the complexity of the new subband equalizer is a fraction of the equivalent fullband at the expense of small degradation in the performance.

  • 245. Dam, Hai Huyen
    et al.
    Nordberg, Jörgen
    Nordholm, Sven
    Zepernick, Hans-Jürgen
    Stacking Methods for Non-Causal Delayless Subband Addaptive Equalizer2002Konferensbidrag (Refereegranskat)
  • 246. Dam, Hai Huyen
    et al.
    Nordholm, Sven
    Zepernick, Hans-Jürgen
    Blind MIMO Equalization in the Frequency Domain2005Konferensbidrag (Refereegranskat)
    Abstract [en]

    Broadband wireless systems require low complexity equalizers which can cope with long channel impulse responses and severe intersymbol interference (ISI). In this paper, a frequency domain (FD) approach for adaptive blind equalization for multiple-input multiple-output (MIMO) communication systems is proposed. As an initial step, a time domain (TD) block based updated adaptation is first developed which updates the equalizer coefficients once per each block of data symbols. As such, this algorithm can be equivalently implemented in the FD to reduce computational complexity associated with the symbol by symbol TD update. Simulation results show that the proposed algorithms can successfully separate and equalize the received signals with a significantly lower computational complexity than a corresponding TD approach.

  • 247. Dam, Hai Huyen
    et al.
    Nordholm, Sven
    Zepernick, Hans-Jürgen
    Frequency Domain Blind Equalization for MIMO Systems2005Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents a new normalized frequency domain approach for adaptive blind equalization for multiple-input multiple-output (MIMO) communication systems. We first develop a time domain block based algorithm that updates the equalizer coefficients once per block of data symbols. As the time domain algorithm involves infinite summations in the separation cost function, an approximation is then proposed to reduce the cost function to finite summations. As a consequence, the block based time domain algorithm can be implemented in the frequency domain to reduce the computational complexity associated with the conventional symbol-by-symbol time domain update. Furthermore, by recognizing that the signals in the frequency domain are orthogonal, it is possible to significantly improve the convergence rate by normalizing the update equations with respect to the signal power in each frequency bin. Simulation results show that the proposed algorithm can successfully equalize the received signals while maintaining low computational complexity. Moreover, the presented normalized frequency domain blind equalization algorithm for MIMO systems significantly improves the convergence rate.

  • 248. Dam, Hai Huyen
    et al.
    Zepernick, Hans-Jürgen
    Nordberg, Jörgen
    Nordholm, Sven
    Application of a Global Optimization Method to the Design of Complex Spreading Sequences2002Konferensbidrag (Refereegranskat)
  • 249. Dam, Hai Huyen
    et al.
    Zepernick, Hans-Jürgen
    Nordberg, Jörgen
    Nordholm, Sven
    Complex Spreading Sequence Design2002Konferensbidrag (Refereegranskat)
    Abstract [en]

    The performance of code division multiple access system depends on the correlation of the employed spreading code. Low cross-correlation values between spreading sequences are desired to suppress multiple access interference. An auto-correlation function with with a distinct peak enables proper synchronization and suppresses intersymbol interference. However, these requirements contradict each other and a trade-off needs to be established. In this paper, a global two dimensional optimization method is proposed to minimize auto-correlation with cross-correlation being allowed to lie within a fixed region. This approach is applied to design a set of complex valued spreading sequences.

  • 250. Dam, Hai Huyen
    et al.
    Zepernick, Hans-Jürgen
    Nordberg, Jörgen
    Nordholm, Sven
    Design of Complex Spreading Sequences2002Konferensbidrag (Refereegranskat)
2345678 201 - 250 av 1402
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf