20 research outputs found
A New Code Family for QS-CDMA Visible Light Communication Systems, Journal of Telecommunications and Information Technology, 2018, nr 3
No full textVisible light communication (VLC) is a promising technology for wireless communication networks. Optical code division multiple access (OCDMA) is a strong candidate for VLC-based applications. The predominant source of bit error in OCDMA is the multiple access interference (MAI). To eliminate MAI in synchronous OCDMA, zero cross correlation (ZCC) codes have been proposed. However, synchronization problems and multipath propagation introduce relative non-zero time delays. Therefore, the zero correlation zone (ZCZ) concept was introduced. In this paper, we propose a new method for generating ZCC codes. The proposed construction can accommodate any number of users with flexible Hamming weight. The numerical results obtained show that the proposed codes significantly reduce MAI, compared to ZCC, as well as ZCZ codes
Suitable Spreading Sequences for Asynchronous MC-CDMA Systems, Journal of Telecommunications and Information Technology, 2018, nr 3
No full textIn order to meet the demand of high data rate transmission with good quality maintained, the multi-carrier code division multiple access (MC-CDMA) technology is considered for the next generation wireless communication systems. However, their high crest factor (CF) is one of the major drawbacks of multi-carrier transmission systems. Thus, CF reduction is one of the most important research areas in MC-CDMA systems. In addition, asynchronous MC-CDMA suffers from the effect of multiple access interference (MAI), caused by all users active in the system. Degradation of the system’s bit error rate (BER) caused by MAI must be taken into consideration as well. The aim of this paper is to provide a comparative study on the enhancement of performance of an MC-CDMA system. The spreading sequences used in CDMA play an important role in CF and interference reduction. Hence, spreading sequences should be selected to simultaneously ensure low CF and low BER values. Therefore, the effect that correlation properties of sequences exert on CF values is investigated in this study. Furthermore, a numerical BER evaluation, as a function of the signal-to-noise ratio (SNR) and the number of users, is provided. The results obtained indicate that a trade-off between the two criteria is necessary to ensure good performance. It was concluded that zero correlation zone (ZCZ) sequences are the most suitable spreading sequences as far as the satisfaction of the above criteria is concerned
Suitable Spreading Sequences for Asynchronous MC-CDMA Systems
No full textIn order to meet the demand of high data rate transmission with good quality maintained, the multi-carrier code division multiple access (MC-CDMA) technology is considered for the next generation wireless communication systems. However, their high crest factor (CF) is one of the major drawbacks of multi-carrier transmission systems. Thus, CF reduction is one of the most important research areas in MC-CDMA systems. In addition, asynchronous MC-CDMA suffers from the effect of multiple access interference (MAI), caused by all users active in the system. Degradation of the system’s bit error rate (BER) caused by MAI must be taken into consideration as well. The aim of this paper is to provide a comparative study on the enhancement of performance of an MC-CDMA system. The spreading sequences used in CDMA play an important role in CF and interference reduction. Hence, spreading sequences should be selected to simultaneously ensure low CF and low BER values. Therefore, the effect that correlation properties of sequences exert on CF values is investigated in this study. Furthermore, a numerical BER evaluation, as a function of the signal-to-noise ratio (SNR) and the number of users, is provided. The results obtained indicate that a trade-off between the two criteria is necessary to ensure good performance. It was concluded that zero correlation zone (ZCZ) sequences are the most suitable spreading sequences as far as the satisfaction of the above criteria is concerned
A New Code Family for QS-CDMA Visible Light Communication Systems
No full textVisible light communication (VLC) is a promising technology for wireless communication networks. Optical code division multiple access (OCDMA) is a strong candidate for VLC-based applications. The predominant source of bit error in OCDMA is the multiple access interference (MAI). To eliminate MAI in synchronous OCDMA, zero cross correlation (ZCC) codes have been proposed. However, synchronization problems and multipath propagation introduce relative non-zero time delays. Therefore, the zero correlation zone (ZCZ) concept was introduced. In this paper, we propose a new method for generating ZCC codes. The proposed construction can accommodate any number of users with flexible Hamming weight. The numerical results obtained show that the proposed codes significantly reduce MAI, compared to ZCC, as well as ZCZ codes
Exact Analysis of MIMO Channel Estimation Based on Superimposed Training
No full textIn this paper, channel estimation capabilities of a multiple-input multiple-output (MIMO) system using superimposed training sequences are investigated. A new expression for estimation-error variance is derived. It is shown that the training sequences must be balanced and must have specific correlation properties. The latter are required only in a specific zone. Sequences that satisfy these criteria exist and are referred to as zero-correlation zone (ZCZ) solutions. Consequently, by using balanced ZCZ sequences, harmful direct current (DC) offset can be removed. Owing to their zero-cross correlation, interference from other transmitting antennas may be eliminated. Furthermore, a closed-form expression of the estimation-error variance can be obtained due to their impulse-like autocorrelation. To increase the number of antennas in the MIMO system, a new construction of ZCZ sequence set is proposed, in which all sequences are balanced
Accumulation of heavy metals from single and combined olive mill wastewater and pomace in soil and bioaccumulation in tissues of two earthworm species: Endogeic (Aporrectodea trapezoides) and Epigeic (Eisenia fetida)
No full textSoil and earthworms are threatened by anthropogenic contamination resulting from olive mill waste dumping on the soil due to their pollutant properties. While several studies have explored the effects of olive mill waste on soil properties and the accumulation of heavy metals in soil, there is currently a gap in the literature regarding the potential bioaccumulation of heavy metals from olive mill waste in earthworms. In this study, soil with earthworms from two ecological categories (endogeic: Aporrectodea trapezoides and epigeic: Eisenia fetida) was treated with increasing doses of olive mill wastewater (OMWW) and olive mill pomace (OMP), applied individually or combined, in an indoor experiment in plastic containers, under laboratory conditions. The results revealed the presence of significant concentrations of heavy metals in the two types of wastes ranging as follows: Fe˃ Zn˃ Cu˃ Cd˃ Cr for OMWW, and Fe˃ Zn˃ Cu˃ Cr for OMP (with Cd below the detection limit). The study demonstrated distinct effects of OMWW and OMP, both individually and in combination, on soil heavy metal content, ranging as follows: soil OMWW > soil Combination > soil OMP for Cd; soil Combination > soil OMWW > soil OMP for Cr and Fe; and soil Combination > soil OMP > soil OMWW for Cu and Zn. Additionally, our investigation showed that both earthworm species exhibited significant uptake of these metals into their tissues, particularly the endogeic species. Interestingly, the most significant difference between species was in the accumulation of Cu, with the epigeic species accumulating significantly lower amounts. Graphical Abstract: (Figure presented.). © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024
Accounting and control of payments with the budget from the value addad tax
No full textУ роботі розглядаються теоретичні аспекти сутності та класифікації фінансових результатів, теоретико – методичні аспекти їх обліку та відображення у звітності з урахуваннямвимог національних та міжнародних стандартів обліку, організаційні основи контролю формування фінансових результатів.
Проаналізовано динаміку фінансових результатів та рентабельності, кореляційно-регрисійний аналіз прибутку.
Запропоновано напрямки поліпшення облікового забезпечення формування фінансового результату на основі поглиблення аналітичності відображення облікової інформації, удосконалення внутрішнього контролю підприємстваThe work deals with the theoretical aspects of the nature and classification of financial results, theoretically - methodological aspects of their accounting and reporting in the account of the requirements of national and international accounting standards, organizational basis for controlling the formation of financial results.
Author analysis the dynamics of financial results and profitability, correlation-regression analysis of profit are analyzed.
We have recommended the directions of improvement of accounting support of formation of financial result on the basis of deepening of analytical display of the accounting information, improvement of internal control of the enterprise are offered
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs
No full textJournal version of ⟨hal-02136928⟩International audienceWe prove essentially tight lower bounds, conditionally to the Exponential Time Hypothesis, for two fundamental but seemingly very different cutting problems on surface-embedded graphs: the Shortest Cut Graph problem and the Multiway Cut problem. A cut graph of a graph G embedded on a surface S is a subgraph of G whose removal from S leaves a disk. We consider the problem of deciding whether an unweighted graph embedded on a surface of genus G has a cut graph of length at most a given value. We prove a time lower bound for this problem of n Ω( g log g ) conditionally to the ETH. In other words, the first n O(g) -time algorithm by Erickson and Har-Peled [SoCG 2002, Discr. Comput. Geom. 2004] is essentially optimal. We also prove that the problem is W[1]-hard when parameterized by the genus, answering a 17-year-old question of these authors. A multiway cut of an undirected graph G with t distinguished vertices, called terminals , is a set of edges whose removal disconnects all pairs of terminals. We consider the problem of deciding whether an unweighted graph G has a multiway cut of weight at most a given value. We prove a time lower bound for this problem of n Ω( gt + g 2 + t log ( g + t )) , conditionally to the ETH, for any choice of the genus g ≥ 0 of the graph and the number of terminals t ≥ 4. In other words, the algorithm by the second author [Algorithmica 2017] (for the more general multicut problem) is essentially optimal; this extends the lower bound by the third author [ICALP 2012] (for the planar case). Reductions to planar problems usually involve a gridlike structure. The main novel idea for our results is to understand what structures instead of grids are needed if we want to exploit optimally a certain value G of the genus
