Novel Protocol for Transmitting Linear Predictive Codes of Speech on Computer Networks

This paper described the Novel Protocol for transmitting the packets of linear predictive codes of speech on computer networks. The segmentation is based on the location of the start and end points of the speech. The exact speech Boundaries can be located and evaluated for linear predictive codes. The linear Predictive Codes of the phonetics related to numerical in Indian regional languages such as Marathi & Hindi forms the codebook. The LPCs of speech are transferred over the computer networks in a packet mode. The optimum distance between the test and the codebook linear predictive codes can be determined by the Dynamic Time Warping technique. Depending on the distance, the word is recognized by Nearest Neighbour rule. The memory required is 1.1K

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-07-30
DOI
https://doi.org/10.5281/zenodo.16598190
Primary Topic
Algorithms and Data Compression
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Novel Protocol for Transmitting Linear Predictive Codes of Speech on Computer Networks

Zenodo (CERN European Organization for Nuclear Research)
Algorithms and Data Compression
article

Novel Protocol for Transmitting Linear Predictive Codes of Speech on Computer Networks

article en

Abstract

This paper described the Novel Protocol for transmitting the packets of linear predictive codes of speech on computer networks. The segmentation is based on the location of the start and end points of the speech. The exact speech Boundaries can be located and evaluated for linear predictive codes. The linear Predictive Codes of the phonetics related to numerical in Indian regional languages such as Marathi & Hindi forms the codebook. The LPCs of speech are transferred over the computer networks in a packet mode. The optimum distance between the test and the codebook linear predictive codes can be determined by the Dynamic Time Warping technique. Depending on the distance, the word is recognized by Nearest Neighbour rule. The memory required is 1.1K

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
Openalex Percentile: Top 77%
Algorithms and Data Compression
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.