Improved Serially Concatenated Convolution Turbo Code (SCCTC) using chicken swarm optimization
The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
Error-control coding pattern is used in modern communication system to uplift the immunity of noisy communication channel by adding the redundant bits. Suitable tuning of internal parameters of constituent codes leads to considerable enhancement in system performance of Turbo code under AWGN channel condition. In this paper, an optimized Serially Concatenated Convolution Turbo Code (SCCTC) has been suggested to improve BER performance especially at higher values of SNR using Chicken Swarm Optimization (CSO) algorithm. Serially Concatenated Recursive Systematic Convolutional (SCRSC) encoder with different poly2trellis has been used to establish the improvement in BER characteristics mainly in high SNR regions. Moreover, the variation of BER values with the block lengths of the code has also been witnessed. Finally, the BER performance of the proposed SCCTC has been compared with conventional as well as serially concatenated turbo BCH-RSC code.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Depending on the type of mission and distance from the Earth, these robots are expected to possess a varying autonomy level, ranging from teleoperation to fully autonomous operation [114].”
From Applications and Challenges of Artificial Intelligence in Space Missions (2024) · cites this paper as [114]
Citations
Cites
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
Benedetto, S., Divsalar, D., Montorsi, G., & Pollara, F. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.669119 · Cited by 1,261
A New Bio-inspired Algorithm: Chicken Swarm Optimization
Meng, X., Liu, Y., Gao, X., & Zhang, H. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-11857-4_10 · Cited by 590
Garello, R., Pierleoni, P., & Benedetto, S. (2001) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.924864 · Cited by 189
Stopping Rules for Turbo Decoders
Matache, A., Dolinar, S. J., & Pollara, F. (2000) · Cited by 82
Iterative Decoding of Concatenated Convolutional Codes: Implementation Issues
Boutillon, E., Douillard, C., & Montorsi, G. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2007.895202 · Cited by 76
Performance evaluation of turbo codes
Benedetto, S., & Montorsi, G. (1995) · Electronics Letters · doi:10.1049/el:19950122 · Cited by 52
Analysis and design of rate compatible serial concatenated convolutional codes
Amat, A. G. I., Montorsi, G., & Vatta, F. (2005) · doi:10.1109/isit.2005.1523407 · Cited by 20
Irregular turbo codes and unequal error protection
Huehner, A., Freudenberger, J., Jordan, R., et al. (2002) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2001.936005 · Cited by 12
Serial concatenation of interleaved codes: analytical performance bounds
Benedetto, S., & Montorsi, G. (2002) · IEEE Global Telecommunications Conference (GLOBECOM) · doi:10.1109/glocom.1996.594342 · Cited by 12
Evolutionary Algorithm Aided Interleaver Design for Serially Concatenated Codes
Maunder, R. G., & Hanzo, L. (2011) · IEEE Transactions on Communications · doi:10.1109/tcomm.2011.042111.090321 · Cited by 11
Research works printed but not linked: 1
- vafi, 2009, Serially Concatenated Turbo Codes 5th International Conference on Wireless Communications, Networking and Mobile Computing WiCOM, 1
Cited by
Bio-inspired computing: Algorithms review, deep analysis, and the scope of applications
Darwish, A. (2018) · Future Computing and Informatics Journal · doi:10.1016/j.fcij.2018.06.001 · Cited by 302
“[43].”
Applications and Challenges of Artificial Intelligence in Space Missions
Oche, P. A., Ewa, G. A., & Ibekwe, N. (2024) · IEEE Access · doi:10.1109/access.2021.3132500 · Cited by 68
“For example, by using the Autonomous Sciencecraft Experiment to automatically plan and adaptively [112, 113],[111] re-plan observations as required the EO-1 spacecraft was able to cut operational costs by $1 M per year, with a 50% increase in science return [118].”
Method
Metadata
- Authors
- Banerjee, S., & Chattopadhyay, S.
- Affiliations
- Jadavpur University (IN)
- Venue
- 2015 IEEE Power, Communication and Information Technology Conference (PCITC)
- Publisher
- IEEE
- Published
- 2015-10
- Volume
- 42?142
- Pages
- 268-273
- OpenAlex
- W2312164725
- Cited by
- 12
- References
- 13
- Citations by year
- 2022: 1 · 2021: 3 · 2020: 1 · 2019: 2 · 2018: 2 · 2017: 2 · 2016: 1
- FWCI
- 1.24
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE Power, Communication and Information Technology Conference (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Error Correcting Code Techniques
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Communication Techniques
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Keywords
- chicken swarm optimization, turbo codes, channel coding, bit error rate, AWGN channel, block length
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Improved Serially Concatenated Convolution Turbo Code (SCCTC) using chicken swarm optimization. https://app.cochat.ai/papers/10.1109/pcitc.2015.7438173
- The paper
- Banerjee, S., & Chattopadhyay, S. (2015). Improved Serially Concatenated Convolution Turbo Code (SCCTC) using chicken swarm optimization. 2015 IEEE Power, Communication and Information Technology Conference (PCITC). https://doi.org/10.1109/pcitc.2015.7438173
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.