A Turbo Coding Scheme for the 2-User Gaussian Adder Channe

Abstract

Number portability (NP) is an important requirement present in most telephony networks. Typically, NP is regulated by local legislation and is inherently against the very nature of routing in circuit-switched networks, which can complicate its deployment. The technological move towards IP-based networks demands treatment of legacy numbers portability, so as to enable interoperability among technologies and allowing progressive substitution of old networks. This paper aims at presenting an application serverbased approach for NP aimed at NGN networks, especially IMS. A test implementation is presented, along with a discussion of currently used approaches, as well as of the one here proposed. Test results validate the approach and show good overall performance.

Image transmission using unequal error protected multi‐fold turbo codes over a two‐user power‐line binary adder channel

“…First, both of the images were decomposed into the corresponding H , S and L components, and information frames were constituted, as described in Section 2. The image of ‘Fish’ was encoded by the modified MFT encoder employing the polynomial generator matrix G 1 ( D ) = [1,(1 + D 2 )/(1 + D + D 2 )] [18, 19] for the three constituent RSC codes; whereas the second encoder used the polynomial generator matrix G 2 ( D ) = [1,(1 + D 2 )/(1 + D + D 2 )] [18, 19] to encode the image ‘Lena’. Two pseudo‐random interleavers with block length of 512 were used, and all of the results were obtained after six decoding iterations.…”

“…The main responsibility of the outer code was to restrict the paths in 2‐BAC trellis [17] that could result in ambiguity at the decoder and it was one of a pair of the uniquely decodable (UD) binary block code [14]. In [18], the performance of two non‐identical turbo convolutional codes for two users was studied over the same 2‐BAC. However, in such a case, the turbo codes were not concatenated with any other code and there was no condition of forming the UD code pairs.…”

“…The MFT codes for a 2‐BAC employing distinct codes for each of the users were introduced in [19]. By using these distinct codes, errors because of noise and interference between the two users can be corrected [18]. The scope of the work in [19] was limited to the transmission of information of equal significance; consequently, each bit was equally protected.…”

Mitigating cyclostationary noise using multi‐fold turbo codes on a two‐user narrowband power‐line binary adder channel

“…Let ( S 1 , S 2 ) denote a pair of users that employ non‐identical two‐fold turbo codes at the transmitting sides. Suppose user S 1 uses the four‐state g (7,5) RSC code 23,26 for all of the three parallel components: , and . User S 2 uses the two‐fold code depicted in Figure 1.…”

“…The distinct codes not only corrected the errors because of noise but also due to the interference between the users. Initial results indicated that the performance of the proposed scheme outperformed the scheme presented in 26 where two non‐identical turbo convolutional codes for each user were configured. To mitigate the aforementioned issues, in this contribution, we propose the MFT codes for a two‐user NB power‐line adder channel.…”